Cod sursa(job #2668108)
Utilizator | Data | 4 noiembrie 2020 15:02:45 | |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int T,n;
vector <int> Ciur(100005);
int main()
{
ifstream f("sum.in");
ofstream g("sum.out");
for(int i=2;i<=100000;i++)
Ciur[i]=i-1;
for(int i=1;i<=100000;i++)
for(int j=2*i;j<=100000;j+=i)
Ciur[j]-=Ciur[i];
f>>T;
while(T--)
{
f>>n;
g<<1LL*2*Ciur[n]*n<<'\n';
}
return 0;
}