Cod sursa(job #221118)
Utilizator | Data | 14 noiembrie 2008 18:08:29 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream.h>
int main()
{
int n,p,q,i,j,fr=0;
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>n;
p=1;
q=1;
i=0;
j=2;
while(p<=n && q<=n)
{
fr=p/q;
while(p%j!=q%j)
{
if(p%j==0 && q%j==0)
//gasim dak exista un divizor pt cele e nr
j++;
}
i++;
++p;
++q;
}
out<<i;
return 0;
}