Pagini recente » Cod sursa (job #863332) | Cod sursa (job #501291)
Cod sursa(job #501291)
#include<cstdio>
#include<iostream>
using namespace std;
const int NMAX = 505;
const int DIMMAX = 1005;
const int CIFMAX = 200;
const int MOD = 10;
int N, A[NMAX];
short int D[2][DIMMAX][CIFMAX], unit[CIFMAX];
void citi()
{
scanf("%d", &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(short int A[], short int B[])
{
int i = 1, t = 0;
for(; i <= A[0] || i <= B[0] || t ; i++, t /= MOD)
A[i] = (t += A[i] + B[i]) % MOD;
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++)
for(int k = D[(i - 1)%2][j][0] ; k > -1 ; k--)
D[i%2][j][k] = D[(i - 1)%2][j][k];
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);
}
}
int nr_cifre(int x)
{
int nr = 0;
while(x)
x /= 10, nr++;
return nr;
}
void scrie()
{
if(D[N % 2][1][0] == 0)
printf("0\n");
else
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;
}