Cod sursa(job #2610432)
| Utilizator | Data | 4 mai 2020 21:10:31 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssnd.in");
ofstream fout("ssnd.out");
void rezolvare(unsigned long long n)
{
unsigned long long sd = 0;
int i,cnt = 0;
for (i = 1; i * i < n; ++i)
{
if (n % i == 0)
sd += i, sd += (n / i);
if (n % i == 0)
cnt += 2;
}
if (i * i == n)
{sd += i; cnt++;}
fout<<cnt<<" "<<sd %9973;
}
int main()
{
int t;
unsigned long long n;
unsigned long long S = 0;
fin >> t;
for (int i = 1; i <= t; ++i)
{
fin >> n;
rezolvare(n);
}
}
