Pagini recente » Cod sursa (job #1192677) | Cod sursa (job #2346499) | Cod sursa (job #2982761) | Cod sursa (job #190268) | Cod sursa (job #3224608)
#include <fstream>
#include <algorithm>
#define int long long
using namespace std;
ifstream in("indep.in");
ofstream out("indep.out");
int n;
int v[505];
int dp[1005];
signed main()
{
in>>n;
for(int i = 1; i<=n; i++)
{
in>>v[i];
}
dp[0] = 1;
for(int i = 1; i<=n; i++)
{
for(int j = 1; j<=1000; j++)
{
int gcd = __gcd(j, v[i]);
dp[gcd] += dp[j];
//out<<j<<" -> "<<gcd<<" = "<<dp[j]<<'\n';
}
dp[v[i]] += dp[0];
/*for(int j = 0; j<=10; j++)
{
out<<dp[j]<<" ";
}
out<<'\n';*/
}
out<<dp[1];
return 0;
}