Cod sursa(job #1534289)
| Utilizator | Data | 23 noiembrie 2015 17:12:01 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
long int i,j,n;
long long t[1000002],k;
int main()
{
f.open("fractii.in");
g.open("fractii.out");
f>>n;
k=0;
for(i=2;i<=n;i++)
{
t+=i-1;
for(j=i+i;j<=n;j+=i)t[j]-=t;
k+=t;
}
g<<k*2+1;
g.close();
}
