Pagini recente » Cod sursa (job #246378) | Cod sursa (job #2708293) | Cod sursa (job #1250999) | Cod sursa (job #164605) | Cod sursa (job #1018473)
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
long long t, s;
int verificare(long long k, int d)
{
int aux;
aux=d-1;
while(aux!=1)
{
if(k%aux==0)
return 0;
aux--;
}
return 1;
}
void descompunere(long long k)
{
int m, d=2;
while(k>1)
{
m=0;
while(k%d==0)
{
k=k/d;
m++;
}
if(m)
for(int i=d; i<=t; i=i+d)
if(verificare(i, d))
s=s-i;
d++;
}
}
int main()
{
long long n, x, i, j;
f>>n;
for(i=1; i<=n; i++)
{
f>>x; t=2*x; s=x*(t+1);
descompunere(x);
g<<s<<'\n';
}
f.close(); g.close();
return 0;
}