Pagini recente » Cod sursa (job #2678808) | Cod sursa (job #2543063) | Cod sursa (job #1019381) | Cod sursa (job #1391241) | Cod sursa (job #944000)
Cod sursa(job #944000)
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;
const string file = "sum";
const string infile = file + ".in";
const string outfile = file + ".out";
#define MAXN 100010
vector<int> PHI;
void preproc()
{
PHI.reserve(MAXN+1);
PHI[1] = 1;
for(int i = 2; i <= MAXN; i++)
{
PHI[i] = i - 1;
}
for(int i = 2; i < MAXN; i++)
{
for(int j = 2 * i; j < MAXN; j+= i)
{
PHI[j] -= PHI[i];
}
}
}
long long query(int x)
{
return 1LL * PHI[x] * x * 2;
}
void citire()
{
preproc();
ifstream fin(infile.c_str());
ofstream fout(outfile.c_str());
int N;
fin >> N;
for (int i = 0; i < N; ++i)
{
int x;
fin >> x;
fout << query(x) << "\n";
}
fout.close();
fin.close();
}
int main()
{
citire();
}