Submission #347158
Source Code Expand
using System; using System.Collections; using System.Collections.Generic; using System.Linq; using System.IO; class Myon { public Myon() { } public static int Main() { new Myon().calc(); return 0; } void calc() { Scanner cin = new Scanner(); int N = cin.nextInt(); int[] a = new int[N]; SortedSet<int> ss = new SortedSet<int>(); for (int i = 0; i < N; i++) { a[i] = cin.nextInt(); while (a[i] % 2 == 0) a[i] /= 2; ss.Add(a[i]); } Console.WriteLine(ss.Count); } } class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string next() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); i = 0; return s[i++]; } public int nextInt() { return int.Parse(next()); } public long nextLong() { return long.Parse(next()); } public double nextDouble() { return double.Parse(next()); } } class XRand { uint x, y, z, w; public XRand() { init(); } public XRand(uint s) { init(); init_xor128(s); } void init() { x = 314159265; y = 358979323; z = 846264338; w = 327950288; } public void init_xor128(uint s) { z ^= s; z ^= z >> 21; z ^= z << 35; z ^= z >> 4; z *= 736338717; } uint next() { uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8; } public long nextLong(long m) { return (long)((((ulong)next() << 32) + next()) % (ulong)m); } public int nextInt(int m) { return (int)(next() % m); } public long nextLong(long min, long max) { return min + nextLong(max - min + 1); } public int nextInt(int min, int max) { return min + nextInt(max - min + 1); } public int nextIntP(int a) { return (int)Math.Pow(a, nextDouble()); } public int nextIntP(int min, int max) { int diff = max - min; return min + nextIntP(diff + 2) - 1; } public long nextLongP(long a) { return (long)Math.Pow(a, nextDouble()); } public long nextLongP(long min, long max) { long diff = max - min; return min + nextLongP(diff + 2) - 1; } public double nextDouble() { return (double)next() / uint.MaxValue; } public double nextDoubleP(double a) { return Math.Pow(a, nextDouble()); } }
Submission Info
Submission Time | |
---|---|
Task | C - 高橋くんと魔法の箱 |
User | chokudai |
Language | C# (Mono 2.10.8.1) |
Score | 100 |
Code Size | 2990 Byte |
Status | AC |
Exec Time | 566 ms |
Memory | 20932 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 20 / 20 | 30 / 30 | 50 / 50 | ||||||||
Status |
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask1 | subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask2 | subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_0.txt | AC | 175 ms | 9508 KB |
subtask0_1.txt | AC | 172 ms | 9584 KB |
subtask0_2.txt | AC | 172 ms | 9616 KB |
subtask1_0.txt | AC | 183 ms | 9760 KB |
subtask1_1.txt | AC | 188 ms | 9888 KB |
subtask1_10.txt | AC | 187 ms | 9776 KB |
subtask1_11.txt | AC | 186 ms | 10036 KB |
subtask1_12.txt | AC | 435 ms | 9848 KB |
subtask1_13.txt | AC | 190 ms | 9856 KB |
subtask1_14.txt | AC | 183 ms | 9928 KB |
subtask1_15.txt | AC | 188 ms | 9896 KB |
subtask1_16.txt | AC | 188 ms | 9980 KB |
subtask1_17.txt | AC | 185 ms | 9892 KB |
subtask1_18.txt | AC | 184 ms | 10000 KB |
subtask1_19.txt | AC | 185 ms | 9996 KB |
subtask1_2.txt | AC | 186 ms | 9992 KB |
subtask1_3.txt | AC | 180 ms | 9964 KB |
subtask1_4.txt | AC | 181 ms | 9988 KB |
subtask1_5.txt | AC | 182 ms | 9888 KB |
subtask1_6.txt | AC | 183 ms | 9924 KB |
subtask1_7.txt | AC | 182 ms | 9984 KB |
subtask1_8.txt | AC | 182 ms | 9888 KB |
subtask1_9.txt | AC | 184 ms | 9988 KB |
subtask2_0.txt | AC | 552 ms | 20868 KB |
subtask2_1.txt | AC | 483 ms | 20880 KB |
subtask2_2.txt | AC | 473 ms | 20908 KB |
subtask2_3.txt | AC | 472 ms | 20764 KB |
subtask2_4.txt | AC | 479 ms | 20712 KB |
subtask2_5.txt | AC | 529 ms | 20768 KB |
subtask2_6.txt | AC | 566 ms | 20768 KB |
subtask2_7.txt | AC | 475 ms | 20768 KB |
subtask2_8.txt | AC | 490 ms | 20772 KB |
subtask2_9.txt | AC | 470 ms | 20868 KB |
subtask3_0.txt | AC | 555 ms | 20868 KB |
subtask3_1.txt | AC | 486 ms | 20932 KB |
subtask3_2.txt | AC | 506 ms | 20768 KB |
subtask3_3.txt | AC | 505 ms | 20872 KB |
subtask3_4.txt | AC | 496 ms | 20892 KB |
subtask3_5.txt | AC | 490 ms | 20848 KB |
subtask3_6.txt | AC | 520 ms | 20764 KB |
subtask3_7.txt | AC | 520 ms | 20764 KB |
subtask3_8.txt | AC | 516 ms | 20872 KB |
subtask3_9.txt | AC | 505 ms | 20868 KB |