Cod sursa(job #1205919)
Utilizator | Data | 8 iulie 2014 14:09:31 | |
---|---|---|---|
Problema | Sum | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<iostream>
#include<fstream>
#define maxn 100005
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int i,j,m,n;
long long t[maxn];
int main()
{
f>>n;
for(i=2;i<=maxn;i++)t[i]=i-1;
for(i=2;i<=maxn;i++)
for(j=i+i;j<=maxn;j+=i)
t[j]-=t[i];
while(n>0)
{
f>>i;
g<<(long long)2*t[i]*i<<'\n';
n--;
}
g.close();
return 0;
}