Cod sursa(job #202007)
| Utilizator | Data | 5 august 2008 15:55:45 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
var n,nf,i,j:longint;
f,g:text;
function divizor(i,j:longint):boolean;
var r:longint;
begin
repeat
r:=i mod j;
i:=j;
j:=r;
until r=0;
if i=1 then divizor:=true
else divizor:=false;
end;
begin
assign(f,'fractii.in');
assign(g,'fractii.out');
reset(f);
rewrite(g);
read(f,n);
nf:=2*n-1;
for i:=2 to n do
for j:=2 to n do
if divizor(i,j) then nf:=nf+1;
write(g,nf);
close(f);
close(g);
end.
