Cod sursa(job #1823361)
Utilizator | Data | 6 decembrie 2016 11:30:47 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
#define N 1000010
using namespace std;
int a[N];
long long x=0;
int main()
{
int n;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(int i=1;i<=n;i++)
{
a[i]=i-1;
}
for(int i=2;i<=n;i++)
{
for(int j=2*i;j<=n;j+=i)
{
a[j]=a[j]-a[i];
}
x+=a[i];
}
g<<2*x+1;
return 0;
}