Cod sursa(job #1870163)
Utilizator | Data | 6 februarie 2017 14:09:04 | |
---|---|---|---|
Problema | Sum | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int v[100010],q[100010];
int n,i,j,Max;
int main()
{
f>>n;
for (i=1;i<=n;++i)
{
f>>v[i];
if(Max<v[i])
Max=v[i];
}
for(i=2;i<=Max;++i)
q[i]=i-1;
for (i=2;i<=Max;++i)
{
for (j=2*i;j<=Max;j+=i)
{
q[j]-=q[i];
}
}
for (i=1;i<=n;++i)
g<<2*q[v[i]]*v[i]<<"\n";
return 0;
}