Pagini recente » Cod sursa (job #1622117) | Cod sursa (job #2238056) | Cod sursa (job #972980) | Cod sursa (job #1951263) | Cod sursa (job #854244)
Cod sursa(job #854244)
#include<cstdio>
using namespace std;
const int NMAX = 505;
const int BASE = 1000000000;
int n,i,j,a[2*NMAX][NMAX],v[NMAX],max,unu[3];
int cmmdc(int a,int b)
{
int r;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
void sum(int A[],int B[])
{
int i,T=0;
if(B[0]>A[0]) A[0]=B[0];
for(i=1;i<=A[0];i++)
{
T+=A[i]+B[i];
A[i]=T%BASE;
T/=BASE;
}
while(T)
{
A[++A[0]]=T%BASE;
T/=BASE;
}
}
int main()
{
freopen("indep.in","r",stdin);
freopen("indep.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&v[i]);
if(v[i]>max) max=v[i];
}
unu[0]=unu[1]=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=max;j++)
if(a[j][0]) sum(a[cmmdc(v[i],j)],a[j]);
sum(a[v[i]],unu);
}
printf("%d",a[1][a[1][0]]);
for(i=a[1][0]-1;i>=1;i--) printf("%.9d",a[1][i]);
return 0;
}