Pagini recente » Cod sursa (job #942378) | Cod sursa (job #2962588) | Cod sursa (job #562243) | Cod sursa (job #2528465) | Cod sursa (job #1850682)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("indep.in");
ofstream out("indep.out");
long long v[501],nr[501][501];
int cmmdc(int a,int b)
{
if(a>b)
return cmmdc(a-b,b);
if(a<b)
return cmmdc(b-a,a);
if(a==b)
return a;
}
int main()
{
int i,j,n,k,div=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
if(v[i]>k)
k=v[i];
}
nr[1][v[1]]=1;
for(i=2;i<=n;i++)
{
for(j=1;j<=k;j++)
{
nr[i][j]=nr[i-1][j];
}
for(j=1;j<=k;j++)
{
div=cmmdc(j,v[i]);
nr[i][div]+=nr[i-1][j];
}
nr[i][v[i]]++;
}
/*for(i=1;i<=n;i++)
{
for(j=1;j<=k;j++)
{
out<<nr[i][j]<<" ";
}
out<<'\n';
}*/
out<<nr[n][1];
return 0;
}