Cod sursa(job #17336)

Utilizator h_istvanHevele Istvan h_istvan Data 15 februarie 2007 18:17:37
Problema Fractii Scor 0
Compilator fpc Status done
Runda Arhiva de probleme Marime 2.29 kb
program fractii;
const prim:array[1..168] of word=
      (2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,
      163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,
      337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,
      521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,
      719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,
      929,937,941,947,953,967,971,977,983,991,997);
      nprim=168;

var f:text;
    n,i,j,e:longint;

function rprim(a,b:longint):boolean;
var i:longint;
begin
     if(b mod a=0) and (a<>1) then rprim:=false
     else
     begin
          rprim:=true;
          i:=1;
          while(prim[i]<=trunc(sqrt(b))) and (i<=nprim) do
          begin
               if (a mod prim[i] = 0) and (b mod prim[i] = 0) then
               begin
                    rprim:=false;
                    break;
               end;
               if(a mod prim[i] = 0) then a:=a div prim[i];
               if(b mod prim[i] = 0) then b:=b div prim[i];
               inc(i);
          end;
          if(a=b) and (a<>1) then rprim:=false;
     end;
end;

{function prim(x:word):boolean;
var i:word;
begin
     prim:=true;
     for i:=2 to trunc(sqrt(x)) do
         if(x mod i = 0) then
         begin
              prim:=false;
              break;
         end;
end;

procedure primkeres(n:word);
var i,sz:word;
    f:text;
begin
     sz:=0;
     assign(f,'prim.txt');rewrite(f);
     for i:=2 to n do
     begin
          if(prim(i)) then
          begin
               write(f,i,',');
               inc(sz);
          end;
     end;
     writeln(f);write(f,sz);
     close(f);
end;}

begin
     {assign(f,'fractii.in');
     reset(f);}
     readln(n);
     {close(f);}

     e:=0;
     for i:=1 to n do
          for j:=i to n do
               if(rprim(i,j)) then inc(e,2);
     dec(e);
     {assign(f,'fractii.out');
     rewrite(f);}
     writeln(e);
     readln;
     {close(f);}
end.