Pagini recente » Cod sursa (job #1432599) | tema | Cod sursa (job #2653942) | Cod sursa (job #3135649) | Cod sursa (job #1016020)
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#define MMax 80000
#include <time.h>
using namespace std;
#define NMax 1000000
int v[NMax+1]; int eratostene[MMax], k;
void ciur()
{
for (int i=2; i<=NMax; i++)
{
if (v[i] == 0)
{
for (int j=i+i; j<=NMax; j+=i)
v[j] = 1;
}
}
for (int i = 2; i <= NMax; i++)
{
if (v[i] == 0)
eratostene[k++] = i;
}
}
int isPrim(long long int n)
{
for (int i=2; i<=sqrt(n); i++)
if( n % i == 0)
return 0;
return 1;
}
void SumaSiNrDiv(long long int n, long int &s, long int &nrDiv)
{
int prim = 1;
long long int copie_n = n;
for (int i=0; i<k && copie_n != 1; i++)
{
int p = 1;
if (n % eratostene[i] == 0)
{
int actsum = 1;
while (copie_n % eratostene[i] == 0)
{
actsum = (actsum * eratostene[i]);
copie_n = copie_n / eratostene[i];
p++;
}
if (copie_n >= NMax && isPrim(copie_n) && copie_n * copie_n > n)
{
nrDiv *= 2;
s = (s *( (pow(copie_n, 2)-1)/ (copie_n-1)));
s = s % 9973;
}
else if (copie_n < NMax && v[copie_n] == 0 && copie_n * copie_n > n)
{
nrDiv *= 2;
s = (s *( (pow(copie_n, 2)-1)/ (copie_n-1)));
s = s % 9973;
}
actsum = (actsum * eratostene[i]);
s = (s *((actsum - 1) / (eratostene[i]-1))); s = s % 9973;
prim = 0;
}
nrDiv *= p;
}
if (prim)
{
nrDiv = 2;
s = (1 + n) % 9973;
}
}
int main()
{
FILE *f = fopen("ssnd.in", "r");
FILE *g = fopen("ssnd.out", "w");
int t; long long int n;
fscanf(f, "%d", &t);
ciur();
for (int i=0; i<t; i++)
{
long int s = 1, nrDiv = 1, s1 = 1, nrDiv1 = 1;
fscanf(f, "%lld", &n);
SumaSiNrDiv(n, s, nrDiv);
fprintf(g, "%ld %ld \n", nrDiv, s%9973);
}
fclose(f);
fclose(g);
return 0;
}