Cod sursa(job #717294)
| Utilizator | Data | 19 martie 2012 20:06:20 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <cstdio>
#define mod 9973
using namespace std;
int s;
int nr;
int n;
void rez(int x)
{
s = 0;
nr = 0;
int i = 1;
for (; i * i < x; ++ i){
if (x % i == 0){
s += i + x / i;
s %= mod;
nr += 2;
}
}
if (i * i == x){
s += i;
nr ++;
}
printf ("%d %d\n", nr, s % mod);
}
int main()
{
freopen ("ssnd.in", "r", stdin);
freopen ("ssnd.out", "w", stdout);
scanf ("%d", &n);
while (n --){
int x;
scanf ("%d", &x);
rez(x);
}
return 0;
}
