Cod sursa(job #970549)

Utilizator miu_mik93FMI - Paduraru Miruna miu_mik93 Data 7 iulie 2013 11:23:58
Problema Suma si numarul divizorilor Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.17 kb
#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
using namespace std;
#define NMax 100000
void SumaSiNrDiv(long long int n, long int &s, long int &nrDiv)
{
	int v[NMax]; memset(v, 0, sizeof(int) * NMax);
	int prim = 1;
	long long int copie_n = n;
	for (int i=2; i<=n; i++)
		v[i] = true;
	for (int i=2; i<=n; i++)
	{
		if (v[i] == true)
		{
			for (int j=i+i; j<=n; j+=i)
				v[j] = false;
		}
	}
	for (int i=2; i<=sqrt(n); i++)
	{
		int p = 1;
		if (v[i] == true && n % i == 0)
		{
			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);
	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;
}