Cod sursa(job #1309089)
| Utilizator | Data | 5 ianuarie 2015 11:30:09 | |
|---|---|---|---|
| Problema | Suma si numarul divizorilor | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
int main()
{
long long n, sum;
int t, i, j, cnt;
ifstream fin("ssnd.in");
fin >> t;
ofstream fout("ssnd.out");
for(i = 1; i <= t; i++)
{
cnt = sum = 0;
fin >> n;
for(j = 1; j * j <= n; j++)
{
if(n % j == 0)
{
cnt += 2;
sum += j + (n / j);
}
}
if(n == 1) cnt = sum = 1;
fout << cnt << " " << sum % 9973 << "\n";
}
fin.close();
fout.close();
return 0;
}
