Cod sursa(job #405487)
Utilizator | Data | 28 februarie 2010 09:05:00 | |
---|---|---|---|
Problema | Suma si numarul divizorilor | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <cstdlib>
#define Modulo 9973
/*
*
*/
using namespace std;
int main( void )
{
unsigned long long int t, n, s, i, j;
ifstream in( "ssnd.in" );
ofstream out( "ssnd.out" );
in>>t;
for( ; t; --t )
{
in>>n;
for( s=(1+n)%Modulo, j=i=2; i*i <= n; ++i )
if( 0 == n%i )
{
j+=2;
s=(s+i)%Modulo;
if( i*i == n )
--j;
else s=(s+n/i)%Modulo;
}
out<<j<<' '<<s<<'\n';
}
return EXIT_SUCCESS;
}