Cod sursa(job #1834333)
Utilizator | Data | 24 decembrie 2016 13:39:01 | |
---|---|---|---|
Problema | Sum | Scor | 65 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#define nmax 100001
using namespace std;
int n,t,i,j;
long long v[100005];
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
for(i=1; i<=100000; i++)
v[i]=i-1;
for(i=2; i<=100000; i++)
{
for(j=2*i; j<=10000; j+=i)
{
v[j]=v[j]-v[i];
}
}
f>>t;
for(i=1; i<=t; i++)
{
f>>n;
g<<1LL*2*n*v[n]<<'\n';
}
f.close(); g.close();
return 0;
}