Cod sursa(job #894406)
Utilizator | Data | 26 februarie 2013 21:08:31 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long N, i, k, j, nr;
int prim(int x, int y){
for (k=2;k<=x;k++)
if (x%k==0 && y%k==0)
return 0;
return 1;
}
int main(){
f>>N;
for (i=1;i<=N;i++)
for (j=i+1;j<=N;j++)
{ if (prim(i,j))
nr++;
}
nr=nr*2+1;
g<<nr;
f.close();
g.close();
return 0;
}