Pagini recente » Cod sursa (job #2652822) | Cod sursa (job #3004342) | Cod sursa (job #2510594) | Cod sursa (job #916108) | Cod sursa (job #3233230)
#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
void calculateDivisors(long long n, int& count, long long& sum) {
count = 0;
sum = 0;
const long long mod = 9973;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) {
count++;
sum = (sum + i) % mod;
if (i != n / i) {
count++;
sum = (sum + n / i) % mod;
}
}
}
}
int main() {
ifstream infile("ssnd.in");
ofstream outfile("ssnd.out");
if (!infile || !outfile) {
cerr << "Error opening file" << endl;
return 1;
}
int t;
infile >> t;
while (t--) {
long long n;
infile >> n;
int count;
long long sum;
calculateDivisors(n, count, sum);
outfile << count << " " << sum << endl;
}
infile.close();
outfile.close();
return 0;
}