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