Submission #347165


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;

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

	for(long i=0; i<n; ++i){	
		long a;
		scanf(" %ld", &a);
		while(a%2==0) a/=2;
		
		if(se.find(a) == se.end()){
			se.insert(a);
			++ans;	
		}
	}
	
	printf("%ld\n", ans);
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User imulan
Language C++ (G++ 4.6.4)
Score 100
Code Size 380 Byte
Status AC
Exec Time 142 ms
Memory 5476 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:16: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 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 22 ms 796 KB
subtask0_1.txt AC 23 ms 792 KB
subtask0_2.txt AC 23 ms 676 KB
subtask1_0.txt AC 23 ms 924 KB
subtask1_1.txt AC 24 ms 932 KB
subtask1_10.txt AC 25 ms 1048 KB
subtask1_11.txt AC 25 ms 1056 KB
subtask1_12.txt AC 23 ms 1052 KB
subtask1_13.txt AC 26 ms 928 KB
subtask1_14.txt AC 26 ms 1060 KB
subtask1_15.txt AC 24 ms 928 KB
subtask1_16.txt AC 24 ms 928 KB
subtask1_17.txt AC 25 ms 940 KB
subtask1_18.txt AC 26 ms 1056 KB
subtask1_19.txt AC 25 ms 924 KB
subtask1_2.txt AC 26 ms 932 KB
subtask1_3.txt AC 24 ms 932 KB
subtask1_4.txt AC 24 ms 928 KB
subtask1_5.txt AC 26 ms 1060 KB
subtask1_6.txt AC 24 ms 936 KB
subtask1_7.txt AC 26 ms 928 KB
subtask1_8.txt AC 26 ms 936 KB
subtask1_9.txt AC 26 ms 1056 KB
subtask2_0.txt AC 104 ms 5412 KB
subtask2_1.txt AC 116 ms 4644 KB
subtask2_2.txt AC 108 ms 4696 KB
subtask2_3.txt AC 113 ms 4640 KB
subtask2_4.txt AC 115 ms 4644 KB
subtask2_5.txt AC 108 ms 4636 KB
subtask2_6.txt AC 109 ms 4636 KB
subtask2_7.txt AC 115 ms 4712 KB
subtask2_8.txt AC 117 ms 4640 KB
subtask2_9.txt AC 108 ms 4644 KB
subtask3_0.txt AC 105 ms 5408 KB
subtask3_1.txt AC 133 ms 5404 KB
subtask3_2.txt AC 142 ms 5412 KB
subtask3_3.txt AC 140 ms 5408 KB
subtask3_4.txt AC 124 ms 5408 KB
subtask3_5.txt AC 123 ms 5476 KB
subtask3_6.txt AC 129 ms 5416 KB
subtask3_7.txt AC 124 ms 5408 KB
subtask3_8.txt AC 120 ms 5420 KB
subtask3_9.txt AC 131 ms 5420 KB