Cod sursa(job #3315069)
| Utilizator | Data | 12 octombrie 2025 11:06:02 | |
|---|---|---|---|
| Problema | Indep | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
#define int long long
#define mod 1000000007
using namespace std;
ifstream cin("indep.in");
ofstream cout("indep.out");
int f[1005];
int v[505];
int cmmdc(int a, int b)
{
int r;
while(b>0)
{
r=(a%b)%mod;
a=b;
b=r;
}
return a;
}
signed main()
{
int n, cnt=0;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>v[i];
for(int j=1; j<=1000; j++)
{
cnt=cmmdc(j, v[i])%mod;
f[cnt]=(f[cnt]+f[j])%mod;
}
f[v[i]]++;
f[v[i]]%=mod;
}
cout<<f[1];
return 0;
}