Cod sursa(job #2635292)
| Utilizator | Data | 13 iulie 2020 22:02:46 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.88 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssnd.in");
ofstream g("ssnd.out");
int n,m,v[1000001],nrd,s,nr,vd[78499];
int main()
{
for (int i=2; i<=1000000; i++)
{
if (v[i]==0)
{
nr++;
vd[nr]=i;
v[i]=1;
for (int j=i*2; j<=1000000; j+=i)
{
v[j]=1;
}
}
}
f>>m;
for (int i=0; i<m; i++)
{
f>>n;
s=n+1;
nrd=2;
for (int j=1; j<=78498 && vd[j]*vd[j]<=n; j++)
{
if (n%vd[j]==0)
{
nrd++;
s+=vd[j];
if (n/vd[j]!=vd[j])
{
nrd++;
s+=n/vd[j];
}
}
}
g<<nrd<<' '<<s<<'\n';
}
return 0;
}
