Cod sursa(job #763495)
Utilizator | Data | 2 iulie 2012 14:24:18 | |
---|---|---|---|
Problema | Sum | Scor | 45 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
var a:array[1..100000]of boolean;
n,x,i,j,s,p,q:longint;
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);
for j:=1 to 2*x-1 do
a[j]:=true;
for j:=2 to 2*x-1 do
if a[j]= true then
if x mod j=0 then
for p:=1 to (2*x-1)div j do
a[p*j]:=false;
for p:=1 to 2*x-1 do
if a[p]=true then s:=s+p;
writeln(g,s,' '); s:=0;
end;
close(f);close(g);end.