Pagini recente » Cod sursa (job #1576844) | Monitorul de evaluare | Grigore Moisil 2017 Clasa a 9-a | Cod sursa (job #1565914) | Cod sursa (job #3166784)
#include <fstream>
#include <iostream>
#include <cstring>
#define N 501
std::ifstream fin("indep.in");
std::ofstream fout("indep.out");
int n, arr[N]; int dp[2][N][1000];
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;
}
void copy(int a[], int b[]){
for(int i = 0; i <= b[0]; i++)
a[i] = b[i];
}
int cmmdc2(int a, int b){
if(b == 0)
return a;
return cmmdc2(b, a % b);
}
void print(int a[]){
if (a[0]==0)
fout<<'0';
for(int i = a[0]; i >=1; i--)
fout << a[i];
fout << "\n";
}
int main(){
fin >> n;
//std::cout << "verf";
int mx = -1;
for(int i = 1; i <= n; i++){
fin >> arr[i];
mx = std::max(arr[i], mx);
}
dp[0][arr[1]][0] = dp[0][arr[1]][1] = 1;
for(int i = 2; i <= n; i++){
for(int g = 1; g <= mx; g++)
for(int k = 0; k < 1000; k++)
dp[1][g][k] = 0;
dp[1][arr[i]][0] = dp[1][arr[i]][1] = 1;
for(int g = 1; g <= mx; g++){
add(dp[1][g], dp[0][g]);
add(dp[1][cmmdc2(arr[i], g)], dp[0][g]);
}
for(int g = 1; g <= mx; g++){
copy(dp[0][g], dp[1][g]);
}
}
print( dp[0][1]);
}