# Codeforces 475d cgcdssq: Calculate the logarithm of the continuous number GCD = K in the sequence

Source: Internet
Author: User

Question link: Click the open link

`#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <iostream>#include <cmath>using namespace std;typedef long long ll;template <class T>inline bool rd(T &ret) {    char c; int sgn;    if(c=getchar(),c==EOF) return 0;    while(c!='-'&&(c<'0'||c>'9')) c=getchar();    sgn=(c=='-')?-1:1;    ret=(c=='-')?0:(c-'0');    while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');    ret*=sgn;    return 1;}template <class T>inline void pt(T x) {    if(x>9) pt(x/10);    putchar(x%10+'0');}/////////////////////////const int N = 100000 + 2;struct Node {    int pos,l,r;    ll gval;    Node(int pos = 0,int l = 0,int r = 0,ll gval = 0):pos(pos),l(l),r(r),gval(gval){}    bool operator < (const Node & a) const {        if(gval != a.gval) return gval < a.gval;        if(pos != a.pos) return pos < a.pos;        return r < a.r;    }};int n, a[N], tot;vector<Node> vt[N];Node node[N * 50];ll sum[N * 50];void prepare() {    for(int i = 0;i <= n;++i) vt[i].clear();    vt[n].push_back(Node(n,n,n,a[n]));    Node ntmp;    int cnt, Size;    ll x;    for(int i = n - 1;i >= 1;--i) {        Size = vt[i + 1].size();        cnt = 1;        vt[i].push_back(Node(i,i,i,a[i]));        for(int j = 0;j < Size;++j) {            ntmp = vt[i+1][j];            x = __gcd((ll)a[i],ntmp.gval);            if(cnt && vt[i][cnt-1].gval == x)                vt[i][cnt - 1].r = ntmp.r;            else                vt[i].push_back(Node(i,ntmp.l,ntmp.r,x)),cnt++;        }    }    tot = 0;    for(int i = 1;i <= n;++i)        for(int j = 0;j < (int)vt[i].size();++j)            node[++tot] = Node(vt[i][j]);    sort(node + 1,node + tot + 1);    sum[0] = 0;    for(int i = 1;i <= tot;++i)        sum[i] = sum[i-1] + node[i].r - node[i].l + 1;}int hehe;void work(int x) {    int L, R, l = 0, r = tot + 1, mid;    while (r - l > 1) {        mid = (l + r) >> 1;        if (node[mid].gval > x)            r = mid;        else            l = mid;    }    -- r;    if (r == 0 || node[r].gval != x) {        putchar('0');        putchar('\n');        return ;    }    R = r;    l = 0; r = tot + 1;    while (r - l > 1) {        mid = (l + r) >> 1;        if (node[mid].gval >= x)            r = mid;        else            l = mid;    }    L = r;    pt(sum[R] - sum[L - 1]);    putchar('\n');}int main() {    rd(n);    for (int i = 1; i <= n; ++i)        rd(a[i]);    prepare();    int Q, x;    rd(Q);    while (Q -- > 0) {        rd(x);        work(x);    }    return 0;}`

Codeforces 475d cgcdssq: Calculate the logarithm of the continuous number GCD = K in the sequence

Related Keywords:

### Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

## A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

• #### Sales Support

1 on 1 presale consultation

• #### After-Sales Support

24/7 Technical Support 6 Free Tickets per Quarter Faster Response

• Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.