Pagini recente » Cod sursa (job #66158) | Cod sursa (job #844600) | Cod sursa (job #417446) | Cod sursa (job #37199) | Cod sursa (job #953144)
Cod sursa(job #953144)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
void erst(vector<long long>&);
void fctrz(vector<long long>&,vector<long long>&);
int main()
{
int t;
vector<long long> p,phi(2,0);
f>>t;
erst(p);
fctrz(phi,p);
while(t--){
long long n;
f>>n;
long long s=2*phi[n]*n;
g<<s<<'\n';
}
return 0;
}
void erst(vector<long long>& v)
{
vector<bool> ok(500,0);
for(int i=2;i<500;i++){
if(!ok[i]){
v.push_back(i);
for(int j=2;j*i<500;j++)
ok[i*j]=1;
}
}
}
void fctrz(vector<long long>& phi,vector<long long>& p)
{
for(int i=2;i<100001;i++){
size_t j;
for(j=0;j<p.size();j++){
if(i%p[j]==0)
break;
}
if(i==p[j]||j==p.size())
phi.push_back(i-1);
else
phi.push_back(phi[i/p[j]]);
}
}