UVa OJ 10929-You can say 11

    技术2024-07-13  63

     

    水题:

    { Author:wzx961008 Problem:UVa 10929-You can say 11 Verdict:Accepted Language:PASCAL Run Time:0.032s Submission Date:2011-01-30 15:54:17 } var n:ansistring; sum,i:longint; begin while true do begin readln(n); sum:=0; if n='0' then break; for i:=1 to length(n) do if i and 1=1 then inc(sum,ord(n[i])-48) else dec(sum,ord(n[i])-48); if abs(sum) mod 11=0 then writeln(n,' is a multiple of 11.') else writeln(n,' is not a multiple of 11.'); end; end.

    最新回复(0)