Cod sursa(job #501259)

Utilizator ooctavTuchila Octavian ooctav Data 14 noiembrie 2010 17:28:17
Problema Indep Scor 80
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.29 kb
#include<cstdio>
#include<iostream>
using namespace std;

const int NMAX = 505;
const int DIMMAX = 1005;
const int CIFMAX = 200;
const int MOD = 1000000;

int N, A[NMAX], D[2][DIMMAX][CIFMAX];
int unit[CIFMAX];

void curata()
{
	for(int k = 0 ; k < 2 ; k++)
		for(int i = 0 ; i < DIMMAX ; i++)
			for(int j = 0 ; j < CIFMAX ; j++)
				D[k][i][j] = 0;
}

void citi()
{
	cin >> N;
	for(int i = 1 ; i <= N ; i++)
		scanf("%d", &A[i]);
}

int cmmdc(int a, int b)
{
	int r;
	while(b)
	{
		r = a % b;
		a = b;
		b = r;
	}
	return a;
}

void aduna(int A[], int B[])
{
	int i = 1, t = 0;
	for(; i <= A[0] || i <= B[0] || t ; i++, t /= 10)
		A[i] = (t += A[i] + B[i]) % 10;
	A[0] = i - 1;
}

void dinamic()
{
	unit[0] = unit[1] = 1;
	for(int i = 1 ; i <= N ; i++)
	{
		for(int j = 1 ; j < DIMMAX ; j++)
			copy(D[(i - 1)%2][j], D[(i - 1)%2][j] + CIFMAX, D[i%2][j]);
		for(int j = 1 ; j < DIMMAX ; j++)
			aduna(D[i%2][cmmdc(j, A[i])], D[i%2][j]);
		aduna(D[i%2][A[i]], unit);
	}
}

void scrie()
{
	if(D[N % 2][1][0] == 0)
		printf("0\n");
	for(int k = D[N % 2][1][0] ; k ; k--)
		printf("%d", D[N % 2][1][k]);
}

int main()
{
	freopen("indep.in", "r", stdin);
	freopen("indep.out", "w", stdout);
	//curata();
	citi();
	dinamic();
	scrie();
	return 0;
}