Cod sursa(job #2147853)
Utilizator | Data | 1 martie 2018 03:12:45 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream in("flip.in");
ofstream out("flip.out");
int i,j,n,rest,max=0,a,b;
in>>n;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
if(j==1)
max=max+1;
else
{
a=i;
b=j;
while (b != 0)
{
rest = b;
b = a % b;
a = rest;
}
if (a == 1)
max=max+1;
}
}
}
out<<max;
}