Maximum-Cup 2013

Submission #3631882

Source codeソースコード

var
 n,i:longint;
begin
 readln(n);
 while n<>0 do
  begin
   for i:=2 to n-1 do
    if n mod i=0 then
     begin
      writeln(n div 2);
      break;
     end;
   readln(n);
  end;
end.

Submission

Task問題 B - Working for the World
User nameユーザ名 luogu_bot2
Created time投稿日時
Language言語 Pascal (FPC 2.6.2)
Status状態 WA
Score得点 0
Source lengthソースコード長 186 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Compiler messageコンパイルメッセージ

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

Test case

Set

Set name Score得点 / Max score Cases
All 0 / 100 00-sample,10-minimum,11-maximum,12-little,13-large,14-middle,15-zero,50-random00,50-random01,50-random02,50-random03,50-random04,50-random05,50-random06,50-random07,50-random08,50-random09,50-random10,50-random11,50-random12,50-random13,50-random14,50-random15,50-random16,50-random17,50-random18,50-random19

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00-sample WA
10-minimum WA
11-maximum WA
12-little WA
13-large WA
14-middle WA
15-zero AC
50-random00 WA
50-random01 WA
50-random02 WA
50-random03 WA
50-random04 WA
50-random05 WA
50-random06 WA
50-random07 WA
50-random08 WA
50-random09 WA
50-random10 WA
50-random11 WA
50-random12 WA
50-random13 WA
50-random14 WA
50-random15 WA
50-random16 WA
50-random17 WA
50-random18 WA
50-random19 WA