Mai intai trebuie sa te autentifici.
Cod sursa(job #195399)
| Utilizator | Data | 18 iunie 2008 12:24:06 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
var s:int64;
f,g:text;
x,i,n:longint;
a,b:array[1..1000000] of word;
begin
assign(f,'fractii.in');reset(f);
assign(g,'fractii.out');rewrite(g);
read(f,n);
s:=n;
for i:=1 to n do begin
a[i]:=0;
b[i]:=0;
end;
for i:=2 to n do begin
x:=i;
while x<=n do begin
inc(a[x]);
inc(x,i);
inc(b[i]);
end;
end;
for i:=2 to n do
if i mod 2=1 then inc(s,n-a[i]-b[i])
else inc(s,n-a[2]-b[2]);
writeln(g,s);
close(f);
close(g);
end.