Submission #8064200


Source Code Expand

#include <cstdio>
using namespace std;
int main(){
	long long n,s;scanf("%lld",&n);
	if(n==1) printf("Deficient\n");
	else{
		s=1;
		for(int i=2;i<=n/2;i++) if(n%i==0) s+=i;
		if(s>n) printf("Abundant\n");
		else if(s<n) printf("Deficient\n");
		else printf("Perfect\n"); 
	}
	return 0;
}

Submission Info

Submission Time
Task B - 完全数
User Chouquet
Language C++ (GCC 5.4.1)
Score 50
Code Size 301 Byte
Status TLE
Exec Time 2103 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:4:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  long long n,s;scanf("%lld",&n);
                                ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 50 / 50 0 / 50
Status
AC × 4
AC × 28
AC × 34
TLE × 15
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt
Subtask1 sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.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_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt
Subtask2 sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.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_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt
Case Name Status Exec Time Memory
sample_1.txt AC 1 ms 128 KB
sample_2.txt AC 1 ms 128 KB
sample_3.txt AC 1 ms 128 KB
sample_4.txt AC 1 ms 128 KB
subtask1_01.txt AC 1 ms 128 KB
subtask1_02.txt AC 1 ms 128 KB
subtask1_03.txt AC 1 ms 128 KB
subtask1_04.txt AC 1 ms 128 KB
subtask1_05.txt AC 1 ms 128 KB
subtask1_06.txt AC 1 ms 128 KB
subtask1_07.txt AC 1 ms 128 KB
subtask1_08.txt AC 1 ms 128 KB
subtask1_09.txt AC 1 ms 128 KB
subtask1_10.txt AC 1 ms 128 KB
subtask1_11.txt AC 1 ms 128 KB
subtask1_12.txt AC 1 ms 128 KB
subtask1_13.txt AC 1 ms 128 KB
subtask1_14.txt AC 1 ms 128 KB
subtask1_15.txt AC 1 ms 128 KB
subtask1_16.txt AC 1 ms 128 KB
subtask1_17.txt AC 1 ms 128 KB
subtask1_18.txt AC 1 ms 128 KB
subtask1_19.txt AC 1 ms 128 KB
subtask1_20.txt AC 1 ms 128 KB
subtask1_21.txt AC 1 ms 128 KB
subtask1_22.txt AC 1 ms 128 KB
subtask1_23.txt AC 1 ms 128 KB
subtask1_24.txt AC 1 ms 128 KB
subtask2_01.txt AC 1483 ms 128 KB
subtask2_02.txt TLE 2103 ms 128 KB
subtask2_03.txt TLE 2103 ms 128 KB
subtask2_04.txt AC 1541 ms 128 KB
subtask2_05.txt TLE 2103 ms 128 KB
subtask2_06.txt AC 55 ms 128 KB
subtask2_07.txt TLE 2103 ms 128 KB
subtask2_08.txt TLE 2103 ms 128 KB
subtask2_09.txt TLE 2103 ms 128 KB
subtask2_10.txt TLE 2103 ms 128 KB
subtask2_11.txt AC 353 ms 128 KB
subtask2_12.txt TLE 2103 ms 128 KB
subtask2_13.txt TLE 2103 ms 128 KB
subtask2_14.txt AC 1107 ms 128 KB
subtask2_15.txt TLE 2103 ms 128 KB
subtask2_16.txt TLE 2103 ms 128 KB
subtask2_17.txt TLE 2103 ms 128 KB
subtask2_18.txt TLE 2103 ms 128 KB
subtask2_19.txt TLE 2103 ms 128 KB
subtask2_20.txt TLE 2103 ms 128 KB
subtask2_21.txt AC 351 ms 128 KB