Pagini recente » Cod sursa (job #198539) | Cod sursa (job #88444) | Cod sursa (job #1732326) | Cod sursa (job #1128702) | Cod sursa (job #1016283)
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <stdlib.h>
#include <assert.h>
#define MMax 800000
#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)
{
eratostene[k++] = i;
for (int j = i + i; j < NMax; j += i)
v[j] = 1;
}
}
}
void SumaSiNrDiv(long long int n, long long int &s, long long int &nrDiv)
{
int prim = 1;
long long int copie_n = n;
if (n == 1)
{
return;
}
for (int i=0; i<k && (long long int) (eratostene[i] * eratostene[i]) <= copie_n; i++)
{
int p = 1;
if (n % eratostene[i] == 0)
{
long long int actsum = 1;
while (copie_n % eratostene[i] == 0)
{
actsum = (actsum * eratostene[i]);
copie_n = copie_n / eratostene[i];
p++;
}
nrDiv *= p;
actsum = (actsum * eratostene[i]);
s = (s *((actsum - 1) / (eratostene[i]-1))); s = s % 9973;
prim = 0;
}
}
if (copie_n > 1)
{
nrDiv *= 2;
s = (s * (copie_n + 1)) % 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 long int s = 1, nrDiv = 1;
fscanf(f, "%lld", &n);
SumaSiNrDiv(n, s, nrDiv);
fprintf(g, "%lld %lld \n", nrDiv, s%9973);
}
fclose(f);
fclose(g);
return 0;
}