Cod sursa(job #2154660)
Utilizator | Data | 7 martie 2018 10:21:47 | |
---|---|---|---|
Problema | Sum | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int n,i,euler[1000001],maxim,j,a;
int main()
{
f>>n;
for (int i=2;i<=100002;i++)
euler[i]=i-1;
for (int i=2;i<=100002;i++){
//sol+=euler[i];
for (int j=i<<1;j<=100002;j+=i)
euler[j]-=euler[i];
}
for(i=1;i<=n;i++)
{
f>>a;
g<<2*a*euler[a]<<'\n';
}
return 0;
}