Cod sursa(job #3215330)
Utilizator | Floroiu Marius Cristian Floroiu_Marius | Data | 14 martie 2024 20:23:06 |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
int n,x,nr[1000003],s[1000003];
int main()
{
for (int i=1;i<=1000000;i++)
{
for (int j=i;j<=1000000;j=j+i)
{
nr[j]++;
s[j]+=i;
}
}
fin>>n;
for (int i=1;i<=n;i++)
{
fin>>x;
fout<<nr[x]<<" "<<s[x]<<'\n';
}
return 0;
}