Submission #3606048


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int main()
{
	long long n,ans=0;
	scanf("%lld",&n);
	if(n==1)
	{
		printf("Deficient\n");
		return 0;
	}
	for(long long i=1;i<=sqrt(n);i++)
	{
		if(n%i==0)
		{
			ans+=i;
			ans+=n/i;
		}
		if(i==sqrt(n)&&n%i==0)
            ans=ans-i;
	}
	if(ans==n) printf("Perfect\n");
	if(ans<n) printf("Deficient\n");
	if(ans>n) printf("Abundant\n");
	return 0;
}

Submission Info

Submission Time
Task B - 完全数
User luogu_bot4
Language C++ (GCC 5.4.1)
Score 0
Code Size 421 Byte
Status WA
Exec Time 3 ms
Memory 256 KB

Compile Error

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

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 0 / 50 0 / 50
Status
AC × 2
WA × 2
AC × 8
WA × 20
AC × 11
WA × 38
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 WA 1 ms 256 KB
sample_2.txt AC 1 ms 256 KB
sample_3.txt WA 1 ms 256 KB
sample_4.txt AC 1 ms 256 KB
subtask1_01.txt WA 1 ms 256 KB
subtask1_02.txt WA 1 ms 256 KB
subtask1_03.txt WA 1 ms 256 KB
subtask1_04.txt WA 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt WA 1 ms 256 KB
subtask1_07.txt WA 1 ms 256 KB
subtask1_08.txt WA 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt WA 1 ms 256 KB
subtask1_11.txt WA 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt WA 1 ms 256 KB
subtask1_15.txt WA 1 ms 256 KB
subtask1_16.txt WA 1 ms 256 KB
subtask1_17.txt WA 1 ms 256 KB
subtask1_18.txt AC 1 ms 256 KB
subtask1_19.txt WA 1 ms 256 KB
subtask1_20.txt WA 1 ms 256 KB
subtask1_21.txt WA 1 ms 256 KB
subtask1_22.txt WA 1 ms 256 KB
subtask1_23.txt WA 1 ms 256 KB
subtask1_24.txt AC 1 ms 256 KB
subtask2_01.txt WA 1 ms 256 KB
subtask2_02.txt WA 2 ms 256 KB
subtask2_03.txt AC 2 ms 256 KB
subtask2_04.txt WA 1 ms 256 KB
subtask2_05.txt WA 2 ms 256 KB
subtask2_06.txt WA 1 ms 256 KB
subtask2_07.txt AC 2 ms 256 KB
subtask2_08.txt WA 3 ms 256 KB
subtask2_09.txt WA 2 ms 256 KB
subtask2_10.txt WA 2 ms 256 KB
subtask2_11.txt WA 1 ms 256 KB
subtask2_12.txt WA 2 ms 256 KB
subtask2_13.txt WA 2 ms 256 KB
subtask2_14.txt WA 1 ms 256 KB
subtask2_15.txt WA 2 ms 256 KB
subtask2_16.txt WA 2 ms 256 KB
subtask2_17.txt AC 2 ms 256 KB
subtask2_18.txt WA 2 ms 256 KB
subtask2_19.txt WA 2 ms 256 KB
subtask2_20.txt WA 2 ms 256 KB
subtask2_21.txt WA 1 ms 256 KB