Cod sursa(job #764115)
| Utilizator | Data | 4 iulie 2012 08:56:14 | |
|---|---|---|---|
| Problema | Sum | Scor | 50 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
var a:array[1..200000]of boolean;
n,x,i,j,p:longint;
s:int64;
f,g:text;
begin
assign(f,'sum.in');reset(f);
assign(g,'sum.out');rewrite(g);
readln(f,n);
for i:=1 to n do begin
readln(f,x); s:=1;
for j:=1 to 2*x-1 do
a[j]:=true;
for j:=2 to 2*x-1 do
if a[j]=true then begin
if x mod j=0 then
for p:=1 to (2*x-1)div j do
a[p*j]:=false else s:=s+j;end;
writeln(g,s);
end;
close(f);close(g);end.
