Submission #346575


Source Code Expand

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

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

	for(long i=0; i<n; ++i){	
		long a;
		scanf(" %ld", &a);
		bool flag=true;
		
		if(a%2==0){
			while(a%2==0) a/=2;
			
			for(long j=0; j<ans; ++j){
				if(num[j]==a){
					flag=false;	
					break;
				}
			}
		}
		if(flag){
			num[ans]=a;
			++ans;	
		}
	}
	
	printf("%ld\n", ans);
}

Submission Info

Submission Time
Task C - 高橋くんと魔法の箱
User imulan
Language C++ (G++ 4.6.4)
Score 0
Code Size 508 Byte
Status WA
Exec Time 2035 ms
Memory 1580 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 0 / 20 0 / 30 0 / 50
Status
AC × 3
AC × 14
WA × 9
AC × 4
TLE × 9
AC × 16
WA × 9
TLE × 18
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 796 KB
subtask0_1.txt AC 26 ms 728 KB
subtask0_2.txt AC 24 ms 672 KB
subtask1_0.txt AC 24 ms 800 KB
subtask1_1.txt WA 28 ms 920 KB
subtask1_10.txt AC 26 ms 920 KB
subtask1_11.txt AC 27 ms 796 KB
subtask1_12.txt AC 29 ms 924 KB
subtask1_13.txt AC 26 ms 800 KB
subtask1_14.txt AC 27 ms 920 KB
subtask1_15.txt AC 27 ms 800 KB
subtask1_16.txt AC 26 ms 792 KB
subtask1_17.txt AC 27 ms 920 KB
subtask1_18.txt AC 28 ms 916 KB
subtask1_19.txt AC 26 ms 800 KB
subtask1_2.txt WA 27 ms 800 KB
subtask1_3.txt WA 28 ms 792 KB
subtask1_4.txt WA 28 ms 916 KB
subtask1_5.txt WA 26 ms 800 KB
subtask1_6.txt WA 27 ms 920 KB
subtask1_7.txt WA 28 ms 796 KB
subtask1_8.txt WA 28 ms 920 KB
subtask1_9.txt WA 28 ms 920 KB
subtask2_0.txt AC 42 ms 1564 KB
subtask2_1.txt TLE 2031 ms 1580 KB
subtask2_2.txt TLE 2032 ms 1568 KB
subtask2_3.txt TLE 2031 ms 1568 KB
subtask2_4.txt TLE 2035 ms 1524 KB
subtask2_5.txt TLE 2033 ms 1564 KB
subtask2_6.txt TLE 2033 ms 1572 KB
subtask2_7.txt TLE 2032 ms 1572 KB
subtask2_8.txt TLE 2033 ms 1572 KB
subtask2_9.txt TLE 2032 ms 1572 KB
subtask3_0.txt AC 43 ms 1568 KB
subtask3_1.txt TLE 2032 ms 1568 KB
subtask3_2.txt TLE 2034 ms 1572 KB
subtask3_3.txt TLE 2033 ms 1568 KB
subtask3_4.txt TLE 2033 ms 1576 KB
subtask3_5.txt TLE 2032 ms 1572 KB
subtask3_6.txt TLE 2032 ms 1572 KB
subtask3_7.txt TLE 2033 ms 1568 KB
subtask3_8.txt TLE 2032 ms 1572 KB
subtask3_9.txt TLE 2032 ms 1564 KB