Cod sursa(job #1093531)
| Utilizator | Data | 28 ianuarie 2014 10:11:50 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <cstdio>
#define Mod 9973
using namespace std;
int t, n, i, j, nr, s;
int main()
{
freopen("ssnd.in","r",stdin);
freopen("ssnd.out","w",stdout);
scanf("%d",&t);
for (i=1; i<=t; i++)
{
scanf("%d",&n); nr=1; s=n%Mod;
for (j=1; j<=n/2; j++)
{
if (n%j==0) {nr++; s+=j; s%=Mod;}
}
printf("%d %d\n",nr,s);
}
fclose(stdin);
fclose(stdout);
return 0;
}
