Pagini recente » Cod sursa (job #2265278) | Cod sursa (job #2779112) | Cod sursa (job #130756) | Cod sursa (job #864666) | Cod sursa (job #595174)
Cod sursa(job #595174)
#include <fstream>
using namespace std;
inline int cmmdc(int a, int b)
{
if (b == 0) return a;
return cmmdc(b, a % b);
}
int N, V[502];
int num[1002][102];
void add(int pos1, int pos2)
{
num[pos1][0] = max(num[pos1][0], num[pos2][0]);
for (int i = 1; i <= num[pos1][0]; ++i)
{
num[pos1][i] += num[pos2][i];
if (num[pos1][i] >= 10)
{
num[pos1][i + 1] += num[pos1][i] / 10;
num[pos1][i] %= 10;
num[pos1][0] += (i == num[pos1][0]);
}
}
}
int main()
{
ifstream fin("indep.in");
ofstream fout("indep.out");
num[0][0] = num[0][1] = 1;
fin >> N;
for (int i = 1; i <= N; ++i)
fin >> V[i];
for (int i = 1; i <= N; ++i)
{
for (int j = 1; j <= 1000; ++j)
add(cmmdc(V[i], j), j);
add(V[i], 0);
}
for (int i = num[1][0]; i >= 1; --i)
fout << num[1][i];
fin.close();
fout.close();
}