Educational Codeforces Round 24 E

Vova again tries to play some computer card game.

The rules of deck creation in this game are simple. Vova is given an existing deck of n cards and a magic number k. The order of the cards in the deck is fixed. Each card has a number written on it; number ai is written on the i-th card in the deck.

After receiving the deck and the magic number, Vova removes x (possibly x = 0) cards from the top of the deck, y (possibly y = 0) cards from the bottom of the deck, and the rest of the deck is his new deck (Vova has to leave at least one card in the deck after removing cards). So Vova's new deck actually contains cards x + 1, x + 2, ... n - y - 1, n - y from the original deck.

Vova's new deck is considered valid iff the product of all numbers written on the cards in his new deck is divisible by k. So Vova received a deck (possibly not a valid one) and a number k, and now he wonders, how many ways are there to choose x and y so the deck he will get after removing x cards from the top and y cards from the bottom is valid?

Input

The first line contains two integers n and k (1 ≤ n ≤ 100 000, 1 ≤ k ≤ 10⁹).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 10⁹) — the numbers written on the cards.

Output

Print the number of ways to choose x and y so the resulting deck is valid.

Examples

input

3 4
6 2 8

output

4

input

3 6
9 1 14

output

1

Note

In the first example the possible values of x and y are:

1. x = 0, y = 0;
2. x = 1, y = 0;
3. x = 2, y = 0;
4. x = 0, y = 1;

题意：选取一段区间，使得乘积形式%k==0，选法有多少种

解法：

1 确定是否被k整除，可以分解质因数或者选择A1*%k*A2*%k....是不是等于0

2 选择第二种方法，求区间乘积，利用线段树维护（当然如果时间给的短就是另一回事了QUQ 第二个代码给出双指针做法，时间更短）

3 寻找符合条件的区间 

    3.1 如果i~(l+r)/2区间符合，则r=mid，不符合l=mid+1

 　3.2 最后得出来的区间也必须符合

4 我们避免计算重复，只计算 n-pos+1次数

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int n,m;
const int Max=1e6;
long long Arr[Max];
long long Pos[Max*2];
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
void Build(int rt,int l,int r){
    if(l==r){
        Pos[rt]=Arr[l]%m;
        return;
    }
    int mid=(l+r)/2;
    Build(rt*2,l,mid);
    Build(rt*2+1,mid+1,r);
    Pos[rt]=(Pos[rt*2]*Pos[rt*2+1])%m;
}
long long query(int L,int R,int l,int r,int rt){
    if(L<=l&&r<=R){
        return Pos[rt];
    }
    long long ans=1;
    int mid=(l+r)/2;
    if(mid>=L){
        ans*=query(L,R,l,mid,rt*2)%m;
    }
    if(mid<R){
        ans*=query(L,R,mid+1,r,rt*2+1)%m;
    }
    return ans%m;
}
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%lld",&Arr[i]);
    }
    Build(1,1,n);
    long long Sum=0;
    for(int i=1;i<=n;i++){
        int l=i;
        int r=n;
        int pos=n;
        while(l<r){
            int mid=(l+r)/2;
            if(query(i,mid,1,n,1)%m==0){
                pos=mid;
                r=mid;
            }else{
                l=mid+1;
            }
        }
        if(query(i,pos,1,n,1)%m==0){
            Sum+=(n-pos+1);
        }
    }
    printf("%lld
",Sum);
    return 0;
}

 http://codeforces.com/contest/818/submission/28156236

#include <bits/stdc++.h>
#include <ext/hash_map>
#include <ext/numeric>

using namespace std;
using namespace __gnu_cxx;

#define REP(i,n) for( (i)=0 ; (i)<(n) ; (i)++ )
#define rep(i,x,n) for( (i)=(x) ; (i)<(n) ; (i)++ )
#define REV(i,n) for( (i)=(n) ; (i)>=0 ; (i)-- )
#define FORIT(it,x) for( (it)=(x).begin() ; (it)!=(x).end() ; (it)++ )
#define foreach(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define rforeach(it,c) for(__typeof((c).rbegin()) it=(c).rbegin();it!=(c).rend();++it)
#define foreach2d(i, j, v) foreach(i,v) foreach(j,*i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define SZ(x) ((int)(x).size())
#define MMS(x,n) memset(x,n,sizeof(x))
#define mms(x,n,s) memset(x,n,sizeof(x)*s)
#define pb push_back
#define mp make_pair
#define NX next_permutation
#define UN(x) sort(all(x)),x.erase(unique(all(x)),x.end())
#define CV(x,n) count(all(x),(n))
#define FIND(x,n) find(all(x),(n))-(x).begin()
#define ACC(x) accumulate(all(x),0)
#define PPC(x) __builtin_popcountll(x)
#define LZ(x) __builtin_clz(x)
#define TZ(x) __builtin_ctz(x)
#define mxe(x) *max_element(all(x))
#define mne(x) *min_element(all(x))
#define low(x,i) lower_bound(all(x),i)
#define upp(x,i) upper_bound(all(x),i)
#define NXPOW2(x) (1ll << ((int)log2(x)+1))
#define PR(x) cout << #x << " = " << (x) << endl ;

typedef unsigned long long ull;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef pair<int, int> pii;

const int OO = (int) 2e9;
const double eps = 1e-9;

const int N = 100005;

int n, k;
int a[N];

int main() {
    std::ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
#ifndef ONLINE_JUDGE
//    freopen("in.txt", "rt", stdin);
//    freopen("out.txt", "wt", stdout);
#endif
    cin >> n >> k;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int st = 0, en = 0;
    ll res = 0;
    int prv = -1;
    while (en < n) {
        ll cur = 1;
        for (int i = st; i < n; i++) {
            cur *= a[i];
            cur %= k;
            if (cur == 0) {
                en = i;
                break;
            }
        }
        if (cur != 0) {
            break;
        }
        cur = 1;
        for (int i = en; i >= 0; i--) {
            cur *= a[i];
            cur %= k;
            if (cur == 0) {
                st = i;
                break;
            }
        }
        if (cur == 0) {
            //cout << st << " " << en << endl;
            res += (st - prv) * 1LL * (n - en);
            prv = st;
        }
        st++;
        en++;
    }
    cout << res << endl;
    return 0;
}