Cod sursa(job #2200810)
Utilizator | Data | 2 mai 2018 18:12:00 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define NMAX 101
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int N;
int ciur[NMAX];
int nr;
int main()
{
fin>>N;
for(int i =1 ; i <= N; i++)
{
ciur[i]=i;
}
for(int i =1 ; i <= N; i ++)
{
nr+=ciur[i];
for(int j = (i<<1); j <= N; j+=i)
ciur[j]-=ciur[i];
}
fout<<2*nr-1;
return 0;
}