Submission #3617596


Source Code Expand

var n,x:int64;   i:longint;
begin
readln(n);x:=1;
if n=1 then
  begin
  write('Deficient');halt;
  end;
for i:=2 to trunc(sqrt(n)) do
  if n mod i=0 then
    begin
    x:=x+i;
    if i*i<>n then x:=x+n div i;
    end;
if x=n then write('Perfect')
else if x<n then write('Deficient')
else write('Abundant');
end.

Submission Info

Submission Time
Task B - 完全数
User luogu_bot4
Language Pascal (FPC 2.6.2)
Score 0
Code Size 311 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Compile Error

/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?

Judge Result

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