Cod sursa(job #1132159)
| Utilizator | Data | 2 martie 2014 19:37:09 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
type vector=array [1..2000] of real;
function caut(x:real;a:vector;n:integer):boolean;
var i:integer;
begin
caut:=false;
for i:=1 to n do
if a[i]=x then begin caut:=true;break end;
end;
function euclid(x,y:integer):integer;
begin
if y=0 then euclid:=x
else euclid:=euclid(y,x mod y);
end;
var i,j,n,d,c:integer;
a:vector;
begin
readln(n);
for i:=1 to n do
for j:=1 to n do
if caut(i/j,a,c)=false then begin
inc(d);
inc(c);a[c]:=i/j;
end;
write(d);
readln;
end.
