Cod sursa(job #2330598)
Utilizator | Data | 28 ianuarie 2019 17:15:37 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
#define MAX 1000001
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,ciur[MAX];
long long s=1;
int euler(int n);
int main()
{
f>>n;
for(int i=2; i<=n; ++i)
ciur[i]=i-1;
for(int i=2; i<=n; ++i)
for(int j=2*i; j<=n; j+=i)
ciur[j]-=ciur[i];
for(int i=2; i<=n; ++i)
s+=ciur[i];
g<<2*s-1;
return 0;
}