Pagini recente » Cod sursa (job #3156092) | Cod sursa (job #2642557) | Cod sursa (job #3257433) | Cod sursa (job #1838074) | Cod sursa (job #122742)
Cod sursa(job #122742)
#include <stdio.h>
#include <string.h>
const int N_MAX = 512;
const int V_MAX = 1024;
int v[N_MAX];
int a[N_MAX][V_MAX];
inline int cmmdc(int a, int b)
{
if (b == 0) return a;
else return (cmmdc(b, a % b));
}
void ADD(int A[], int B[])
{
int i, t = 0;
for (i = 1; i <= A[0] || i <= B[0] || t; i ++, t /= 10) {
A[i] = (t += (A[i] + B[i]) % 10);
}
A[0] = i - 1;
}
int unu[N_MAX];
int main()
{
freopen("indep.in", "r", stdin);
#ifndef _SCREEN_
freopen("indep.out", "w", stdout);
#endif
int N, i, MAX = 0;
scanf("%d\n", &N);
for (i = 1; i <= N; i ++) {
scanf("%d\n", &v[i]);
if (v[i] > MAX) MAX = v[i];
}
int j;
unu[0] = 1, unu[1] = 1;
a[1][v[1]] = 1;
for (i = 2; i <= N; i ++) {
for (j = 1; j <= MAX; j ++) {
a[i][j] += a[i - 1][j];
a[i][cmmdc(j, v[i])] += a[i - 1][j];
}
a[i][v[i]] ++;
}
printf("%d\n", a[N][1]);
return 0;
}