Pagini recente » Cod sursa (job #2202968) | Cod sursa (job #1875807) | Cod sursa (job #3213473) | Cod sursa (job #988655) | Cod sursa (job #1014854)
#include<stdio.h>
#define NMAX 507
int n, a[NMAX], D[NMAX][NMAX * 2][150];
inline int cmmdc(int a, int b){
if(!b)
return a;
return cmmdc(b, a % b);
}
void Adun(int a[], int b[]){
if(a[0] < b[0])
a[0] = b[0];
int t = 0;
for(int i = 1; i <= a[0]; ++ i){
a[i] += t + b[i];
t = a[i] / 10;
a[i] %= 10;
}
while(t != 0){
a[++ a[0]] = t % 10;
t /= 10;
}
}
int main(){
freopen("indep.in", "r", stdin);
freopen("indep.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; ++ i)
scanf("%d", &a[i]);
for(int i = 1; i <= n; ++ i)
D[i][a[i]][0] = D[i][a[i]][1] = 1;
for(int i = 1; i <= n; ++ i)
for(int j = 1; j <= 1000; ++ j){
Adun(D[i + 1][j], D[i][j]);
Adun(D[i + 1][cmmdc(j, a[i])], D[i][j]);
///D[i + 1][j] += D[i][j];
///D[i + 1][cmmdc(j, a[i])] += D[i][j];
}
for(int i = D[n][1][0]; i >= 1; -- i)
printf("%d", D[n][1][i]);
return 0;
}