Cod sursa(job #284764)
Utilizator | Temian Vlad monk | Data | 21 martie 2009 22:45:41 |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | petru_toti | Marime | 0.63 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
unsigned long int q,i,n,c=0,j,a;
fin>>n;
for(i=1;i<=n;i++)
{
for(q=1;q<=n;q++)
{
a=0;
for(j=2;j<=i;j++)
if(i%j==0&&q%j==0){a=1;break;}
if(a==0)c++;
}
}
fout<<c;
return 0;
}