Cod sursa(job #1788368)
Utilizator | Data | 25 octombrie 2016 22:20:48 | |
---|---|---|---|
Problema | Fractii | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
long long sol;
int rez[1000003], n;
int main ()
{
f>>n;
for(int i=1;i<=n;i++) rez[i]=i-1;
for(int i=2;i<=n;i++)
{
for(int j=2*i;j<=n;j+=i)
rez[j]-=rez[i];
sol=(long long)sol+rez[i];
}
g<<2*sol+1;
return 0;
}