Cod sursa(job #1820562)
Utilizator | Data | 1 decembrie 2016 21:17:17 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <fstream>
using namespace std;
unsigned s,n,i,j,aux1,aux2;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
s=n*2-1;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
{
if(i%j&&j%i)
{
aux1=i;
aux2=j;
while(aux1!=aux2)
{
if(aux1>aux2)
aux1=aux1-aux2;
else
aux2=aux2-aux1;
}
if(aux1==1)
s++;
}
}
g<<s;
return 0;
}