Cod sursa(job #820970)
| Utilizator |  Igna Darius ignadarius |
Data | 21 noiembrie 2012 14:52:38 |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.23 kb |
var i,n,j,k:longint;
function prim(i,j:longint):longint;
begin
while i<>j do
if i>j then i:=i-j else j:=j-i;
prim:=i;
end;
begin
readln(n);
for i:=1 to n do
for j:=1 to n do
if prim(i,j)=1 then k:=k+1;
write(k);
readln;
end.