Submission #345934


Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
#define rep(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
map<int ,int> l;
int main(void){

	int N,a;
	cin >> N;
	rep(i, 0, N){
		cin >> a;
		while ((a & 1) == 0)
			a >>= 1;
		l[a]++;
	}
	cout << l.size()<<endl;

	return(0);
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User btk15049
Language C++11 (GCC 4.8.1)
Score 100
Code Size 386 Byte
Status AC
Exec Time 192 ms
Memory 5520 KB

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 20 / 20 30 / 30 50 / 50
Status
AC × 3
AC × 23
AC × 13
AC × 43
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 28 ms 876 KB
subtask0_1.txt AC 27 ms 792 KB
subtask0_2.txt AC 28 ms 872 KB
subtask1_0.txt AC 28 ms 1052 KB
subtask1_1.txt AC 30 ms 1004 KB
subtask1_10.txt AC 29 ms 1052 KB
subtask1_11.txt AC 27 ms 1000 KB
subtask1_12.txt AC 30 ms 940 KB
subtask1_13.txt AC 27 ms 1008 KB
subtask1_14.txt AC 27 ms 984 KB
subtask1_15.txt AC 29 ms 1056 KB
subtask1_16.txt AC 29 ms 1008 KB
subtask1_17.txt AC 29 ms 1056 KB
subtask1_18.txt AC 30 ms 1004 KB
subtask1_19.txt AC 27 ms 1052 KB
subtask1_2.txt AC 28 ms 1052 KB
subtask1_3.txt AC 29 ms 1004 KB
subtask1_4.txt AC 27 ms 1008 KB
subtask1_5.txt AC 30 ms 1100 KB
subtask1_6.txt AC 28 ms 940 KB
subtask1_7.txt AC 30 ms 980 KB
subtask1_8.txt AC 28 ms 1040 KB
subtask1_9.txt AC 29 ms 992 KB
subtask2_0.txt AC 113 ms 5480 KB
subtask2_1.txt AC 166 ms 4708 KB
subtask2_2.txt AC 168 ms 4724 KB
subtask2_3.txt AC 156 ms 4716 KB
subtask2_4.txt AC 153 ms 4696 KB
subtask2_5.txt AC 159 ms 4716 KB
subtask2_6.txt AC 152 ms 4704 KB
subtask2_7.txt AC 159 ms 4724 KB
subtask2_8.txt AC 153 ms 4684 KB
subtask2_9.txt AC 145 ms 4712 KB
subtask3_0.txt AC 116 ms 5472 KB
subtask3_1.txt AC 179 ms 5484 KB
subtask3_2.txt AC 181 ms 5476 KB
subtask3_3.txt AC 192 ms 5488 KB
subtask3_4.txt AC 191 ms 5488 KB
subtask3_5.txt AC 182 ms 5520 KB
subtask3_6.txt AC 184 ms 5480 KB
subtask3_7.txt AC 177 ms 5488 KB
subtask3_8.txt AC 184 ms 5484 KB
subtask3_9.txt AC 172 ms 5476 KB