Cod sursa(job #1014868)

Utilizator paunmatei7FMI Paun Matei paunmatei7 Data 23 octombrie 2013 16:20:46
Problema Indep Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.2 kb
#include<stdio.h>
#include<string.h>

#define NMAX 1007
#define Baza 10000000

int n, D[2][NMAX][150], h[10];

inline int cmmdc(int a, int b){
    if(!b)
        return a;
    return cmmdc(b, a % b);
}

void Adun(int a[], int b[]){
    if(a[0] < b[0])
        a[0] = b[0];
    int t = 0;
    for(int i = 1; i <= a[0]; ++ i){
        a[i] += t + b[i];
        t = a[i] / Baza;
        a[i] %= Baza;
    }
    while(t != 0){
        a[++ a[0]] = t % 10;
        t /= 10;
    }
}

int main(){
    freopen("indep.in", "r", stdin);
    freopen("indep.out", "w", stdout);
    scanf("%d", &n);
    h[0] = h[1] = 1;
    int a, HH = 1;
    for(int i = 1; i <= n; ++ i, HH = 1 - HH){
        scanf("%d", &a);
        Adun(D[HH][a], h);
        for(int j = 1; j <= 1000; ++ j){
            Adun(D[HH][j], D[1 - HH][j]);
            Adun(D[HH][cmmdc(j, a)], D[1 - HH][j]);
            ///D[i + 1][j] += D[i][j];
            ///D[i + 1][cmmdc(j, a[i])] += D[i][j];
        }
        memset(D[1 - HH], 0, sizeof(D[1 - HH]));
    }
    HH = n & 1;
    printf("%d", D[HH][1][D[HH][1][0]]);
    for(int i = D[HH][1][0] - 1; i >= 1; -- i)
        printf("%07d", D[HH][1][i]);
    return 0;
}