Cod sursa(job #1572735)
Utilizator | Data | 19 ianuarie 2016 08:35:35 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int prim(int i,int j)
{
while(i!=j)
if(i>j)
i-=j;
else
j-=i;
return i;
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,k=0,i,j;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(prim(i,j)==1)
k++;
g<<k;
return 0;
}