Cod sursa(job #949848)
| Utilizator | Data | 15 mai 2013 09:44:15 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int prim(int a, int b)
{
int auxa, auxb;
auxa=a; auxb=b;
while(auxa!=auxb)
{
if(auxa>auxb)
auxa=auxa-auxb;
else
auxb=auxb-auxa;
}
return auxa;
}
int main()
{
int n,i,j,contor=0;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
cin>>n;
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
{
if(prim(i,j)==1)
contor++;
}
}
cout<<contor;
}
