Pagini recente » Borderou de evaluare (job #1539543) | Cod sursa (job #2493397) | Cod sursa (job #2501892) | Monitorul de evaluare | Cod sursa (job #970569)
Cod sursa(job #970569)
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
#define NMax 1000000
long int v[NMax/10];
void ciur()
{
for (long long int i=2; i<=NMax/10; i++)
{
if (v[i] == 0)
{
for (long long int j=i+i; j<=NMax/10; j+=i)
v[j] = 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=2; i<=sqrt(n); i++)
{
int p = 1;
if (!v[i] && !(n % i))
{
int actsum = 1;
while (copie_n % i == 0)
{
actsum = (actsum * i) % 9973;
copie_n = copie_n / i;
p++;
}
actsum = (actsum * i) % 9973;
s = (s *((actsum - 1) / (i-1))) % 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;
fscanf(f, "%lld", &n);
SumaSiNrDiv(n, s, nrDiv);
fprintf(g, "%ld %ld \n", nrDiv, s);
}
fclose(f);
fclose(g);
return 0;
}