Cod sursa(job #1254788)
Utilizator | Data | 3 noiembrie 2014 15:02:52 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define mod 9973
using namespace std;
ifstream is("ssnd.in");
ofstream os("ssnd.out");
void Solve(int n);
int main()
{
int t, n;
is >> t;
for ( int i = 0; i < t; ++i )
{
is >> n;
Solve(n);
}
is.close();
os.close();
return 0;
}
void Solve(int n)
{
int sum = n;
int cnt = 1;
for ( int i = 1; i <= n / 2; ++i )
{
if ( n % i == 0 )
{
cnt++;
sum += i;
}
}
os << cnt << ' ' << sum % mod << '\n';
}