Cod sursa(job #2385339)
| Utilizator | Data | 21 martie 2019 20:15:20 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.1 kb |
#include <fstream>
using namespace std;
int v[1000002],ciur[1000002];
int main()
{
int n,c,s,nr,x;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
for(int i=2;i<=1000000;i++)
{
if(v[i]==0)
{
for(int j=2*i;j<=1000000;j+=i)
{
v[j]=1;
}
}
}
c=0;
for(int i=2;i<=1000000;i++)
{
if(v[i]==0)
ciur[++c]=i;
}
in>>n;
for(int i=1;i<=n;i++)
{
in>>x;
nr=s=0;
for(int j=1;j<=c;j++)
{
if(ciur[j]*ciur[j]<=x)
{
if(ciur[j]*ciur[j]==x)
{
nr++;
s+=ciur[j];
}
else
{
if(x%ciur[j]==0)
{
nr+=2;
s=s+ciur[j]+x/ciur[j];
}
}
}
else
break;
}
out<<nr+2<<" "<<s+1+x<<"\n";
}
return 0;
}
