Submission #346767


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
using namespace std;

bool p[1000000000];

int main(){
	long n, ans=0;
	long num[100000];
	
	scanf(" %ld", &n);

	for(long i=0; i<n; ++i){	
		long a;
		scanf(" %ld", &a);
		while(a%2==0) a/=2;
			
		if(!p[a]){
			p[a]=true;
			++ans;	
		}
	}
	
	printf("%ld\n", ans);
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User imulan
Language C++ (G++ 4.6.4)
Score 50
Code Size 391 Byte
Status MLE
Exec Time 945 ms
Memory 299816 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:18:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

Judge Result

Set Name Sample Subtask1 Subtask2 All
Score / Max Score 0 / 0 20 / 20 30 / 30 0 / 50
Status
AC × 3
AC × 23
AC × 13
AC × 34
MLE × 9
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 23 ms 800 KB
subtask0_1.txt AC 23 ms 920 KB
subtask0_2.txt AC 25 ms 796 KB
subtask1_0.txt AC 24 ms 928 KB
subtask1_1.txt AC 25 ms 1312 KB
subtask1_10.txt AC 24 ms 788 KB
subtask1_11.txt AC 65 ms 12584 KB
subtask1_12.txt AC 67 ms 12580 KB
subtask1_13.txt AC 67 ms 12576 KB
subtask1_14.txt AC 66 ms 12576 KB
subtask1_15.txt AC 67 ms 12580 KB
subtask1_16.txt AC 66 ms 12696 KB
subtask1_17.txt AC 64 ms 12592 KB
subtask1_18.txt AC 67 ms 12584 KB
subtask1_19.txt AC 66 ms 12576 KB
subtask1_2.txt AC 25 ms 1184 KB
subtask1_3.txt AC 25 ms 1188 KB
subtask1_4.txt AC 25 ms 1192 KB
subtask1_5.txt AC 24 ms 1316 KB
subtask1_6.txt AC 25 ms 1192 KB
subtask1_7.txt AC 26 ms 1312 KB
subtask1_8.txt AC 26 ms 1312 KB
subtask1_9.txt AC 25 ms 1200 KB
subtask2_0.txt AC 40 ms 912 KB
subtask2_1.txt AC 46 ms 1312 KB
subtask2_2.txt AC 46 ms 1260 KB
subtask2_3.txt AC 43 ms 1312 KB
subtask2_4.txt AC 44 ms 1300 KB
subtask2_5.txt AC 44 ms 1192 KB
subtask2_6.txt AC 44 ms 1304 KB
subtask2_7.txt AC 45 ms 1312 KB
subtask2_8.txt AC 48 ms 1192 KB
subtask2_9.txt AC 45 ms 1304 KB
subtask3_0.txt AC 39 ms 920 KB
subtask3_1.txt MLE 945 ms 299816 KB
subtask3_2.txt MLE 925 ms 298788 KB
subtask3_3.txt MLE 938 ms 298916 KB
subtask3_4.txt MLE 942 ms 298740 KB
subtask3_5.txt MLE 927 ms 298912 KB
subtask3_6.txt MLE 935 ms 298784 KB
subtask3_7.txt MLE 934 ms 298396 KB
subtask3_8.txt MLE 939 ms 298284 KB
subtask3_9.txt MLE 934 ms 298016 KB