Cod sursa(job #1643302)
| Utilizator | Data | 9 martie 2016 18:25:34 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#define InFile "ssnd.in"
#define OutFile "ssnd.out"
#define MOD 9973
using namespace std;
ifstream fin (InFile);
ofstream fout (OutFile);
unsigned int t;
unsigned int n;
unsigned int i, j;
unsigned int sum;
unsigned int sol1, sol2;
int main ()
{
fin >> t;
for (i=0; i<t; i++)
{
fin >> n;
sol1 = 0;
sum = 0;
for (j=1; j<=n; j++)
if (n%j == 0)
{
sol1++;
sum = sum+j;
sol2 = sum%MOD;
}
fout << sol1 << ' ' << sol2;
fout << '\n';
}
return 0;
}
