Cod sursa(job #2737426)
| Utilizator | Data | 4 aprilie 2021 18:55:59 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
#define MOD 9973
using namespace std;
int main()
{
freopen("ssnd.in", "r", stdin);
freopen("ssnd.out", "w", stdout);
int t;
cin >> t;
for (; t; t--)
{
int n, nr = 0, s = 0;
cin >> n;
for (int d = 1; d * d <= n; d++)
if (n % d == 0)
{
if (d != n / d)
{
nr += 2;
s = (s + d + n / d) % MOD;
}
else
{
nr++;
s = (s + d) % MOD;
}
}
cout<<nr<<' '<<s<<'\n';
}
return 0;
}