Cod sursa(job #2407813)
Utilizator | Data | 17 aprilie 2019 11:44:28 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int ciur[1000005],i,j,t,n,v[1000005];
int main()
{
ciur[1]=1;
for(i=1;i<=1000000;i++)
for(j=i;j<=1000000;j=j+i)
{
ciur[j]=ciur[j]+i;
v[j]++;
}
fin>>t;
for(i=1;i<=t;i++)
{
fin>>n;
fout<<v[n]<<" ";
fout<<ciur[n]<<"\n";
}
fin.close();
fout.close();
return 0;
}