Cod sursa(job #1277782)
Utilizator | Data | 28 noiembrie 2014 08:47:54 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <fstream>
#define ll long long
using namespace std;
ifstream f("fractii.in"); ofstream g("fractii.out");
int n, v[1000001];
int main()
{ f>>n;
for(int i=1;i<=n;i++) v[i]=i-1;
ll k=0;
for(int i=2;i<=n;i++)
{ k+=v[i];
for(int j=i+i;j<=n;j+=i) v[j]=v[j]-v[i];
}
g<<1+2*k; g.close(); return 0;
}