Pagini recente » Cod sursa (job #546997) | Cod sursa (job #1311499) | Cod sursa (job #400026) | Cod sursa (job #350317) | Cod sursa (job #1614597)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("indep.in");
ofstream g("indep.out");
int n,v[1005];
int dp[1005][1005];
void Add(int a[1005],int b[1005])
{ int i,t=0;
if (a[0]<b[0]) {for(i=a[0]+1;i<=b[0];i++) a[i]=0; a[0]=b[0];}
else {for(i=b[0]+1;i<=a[0];i++) b[i]=0; b[0]=a[0];}
for(i=1;i<=a[0];i++)
{ a[i]+=b[i]+t;
t=a[i]/10; a[i]%=10;
}
while(t)
{ a[0]++; a[a[0]]=t%10;
t/=10;
}
}
int Cmmdc(int a,int b)
{ int c;
while(b)
{ c=a%b;
a=b; b=c;
}
return a;
}
void Afis(int a[1005])
{ int i;
for(i=a[0];i>=1;i--)
g<<a[i];
g<<"\n";
}
int main()
{ int i,j,mx=0;
f>>n;
for(i=1;i<=n;i++)
{f>>v[i];
mx=max(mx,v[i]);
}
dp[v[1]][0]=1; dp[v[1]][1]=1;
for(i=2;i<=n;i++)
{
for(j=1;j<=mx;j++)
Add(dp[Cmmdc(j,v[i])],dp[j]);
}
Afis(dp[1]);
return 0;
}