Pagini recente » Cod sursa (job #314511) | Cod sursa (job #2111005) | Cod sursa (job #2535878) | Cod sursa (job #2445209) | Cod sursa (job #2257281)
#include <fstream>
#include <cmath>
#define modulo(a) a % 9973
using namespace std;
ifstream in("ssnd.in");
ofstream out("ssnd.out");
unsigned short t;
int main()
{
in >> t;
for(unsigned short i = 0; i != t; ++i)
{
unsigned long long n, cont, sum;
in >> n;
long double rad = sqrt(n);
pow(rad, 2) == n ? (sum = 1 + n + rad, cont = 3) : (sum = 1 + n, cont = 2);
for(unsigned long long j = 2; j < rad; ++j)
if(!(n % j))
{
sum += j + n / j;
cont += 2;
}
out << cont << ' ' << modulo(sum) << '\n';
}
return 0;
}