Cod sursa(job #874209)
| Utilizator | Data | 7 februarie 2013 23:29:20 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int prim(int x)
{ int i,k,m;
for(i=2;i<=x/2;i++)
if (x%i==0) k++;
if (k==0) return 1;
return 0;
}
int main()
{ long long N,i,j,k;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>N;
k=0;
for(i=1;i<=N;i++)
for(j=1;j<=N;j++)
{
if (i==j && j==1 && i==1)
k++;
else if (i==1 && j!=1)
k++;
else if (i!=1 && j==1)
k++;
else
if(i%j!=0 && j%i!=0) k++;
}
g<<k;
return 0;
}
