Cod sursa(job #1130924)
| Utilizator | Data | 28 februarie 2014 16:33:49 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, d[1000001]={0};
int ireductibil(int a, int b)
{
while(a!=b)
{
if(a>b) a-=b;
else b-=a;
}
if(a==1) return 1;
else return 0;
}
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
fin.close();
d[1]=1;
d[2]=3;
for(int i=3; i<=n; i++)
{
d[i]=d[i-1];
d[i]+=2;
for(int j=2; j<i; j++)
{
if(ireductibil(i,j)) d[i]+=2;
}
}
fout<<d[n];
fout.close();
return 0;
}
