Mai intai trebuie sa te autentifici.
Cod sursa(job #308009)
Utilizator | Data | 25 aprilie 2009 20:15:44 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
var f,g:text;
suma:qword;
i,j,n:longint;
v:array[0..1000001] of longint;
begin
assign(f,'fractii.in');reset(f);
assign(g,'fractii.out');rewrite(g);
read(f,n);
//construiesc v[i]=v[i]-v[j],j=1..i-1 | i mod j=0
v[1]:=1;
v[2]:=1;
suma:=0;
for i:=3 to n do begin
v[i]:=i;
for j:=1 to i-1 do
if i mod j=0 then dec(v[i],v[j]);
suma:=suma+v[i];
end;
suma:=2*suma+1;
writeln(g,suma);
close(f);
close(g);
end.