Cod sursa(job #2245735)
Utilizator | Lixandru Andrei lixi | Data | 25 septembrie 2018 19:26:56 |
---|---|---|---|
Problema | Sum | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include<fstream>
#define Nmax 100000
#define Mmax 50000
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
int sol[100001];
int main()
{
for(int i = 2; i <= Nmax; i++)
sol[i] = i - 1;
for(int i = 2; i <= Mmax; i++)
for(int j = 2 * i; j <= Nmax; j += i)
sol[j] -= sol[i];
int N, X;
f >> N;
for(int i = 1; i <= N; i++)
{
f >> X;
g << (long long)2 * X*sol[X] << '\n';
}
return 0;
}