Cod sursa(job #490189)
Utilizator | Data | 5 octombrie 2010 14:13:53 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 1.08 kb |
program fractii;
var f,g:text;
s,a,b,j,n:longint;
m,k:boolean;
begin
assign(f,'fractii.in'); reset(f);
assign(g,'fractii.out'); rewrite(g);
readln(f,n);
s:=(2*n-1)+2*(n-2);
for a:=2 to n-2 do
for b:=a+2 to n do
if b mod a<>0 then
begin
k:=false; m:=false;
j:=1;
while (k=false)and(m=false) do
begin
inc(j);
if (b mod j=0)and(a mod j=0) then
k:=true;
if j>=a div 2 then
m:=true;
end;
if k=false then
s:=s+2;
end;
writeln(g,s);
close(f); close(g);
end.