Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #include <math.h>
- int gcd(int a, int b)
- {
- if (b == 0)
- return abs(a);
- else return abs(gcd(b, a % b));
- }
- void ComputeLogarithms(int m, int *lg)
- {
- int i=1, j=0;
- for(; i <= m; i++)
- for(; j< pow(2,i); j++)
- lg[j]= i - 1;
- }
- int ST_Query(int **ST, int l, int r, int *lg)
- {
- int j=lg[r-l+1];
- return gcd(ST[l][j], ST[r-(1 << j)+1][j]);
- }
- void ST_Build(int *v, int **ST, int *lg, int n, int m)
- {
- int i=0, j=1;
- for (; i < n; i++)
- ST[i][0]=v[i];
- for (; j < m; j++)
- for (i = 0; i <= n -(1 << j); i++)
- ST[i][j] = gcd(ST[i][j - 1], ST[i + (1 << (j-1))][j - 1]);
- }
- int main()
- {
- int i, n, k;
- scanf("%d", &n);
- int *a=(int*)malloc((n+1)*sizeof(int));
- for (i = 0; i < n; i++)
- scanf("%d", &a[i]);
- int **ST=(int**)malloc((n+1)*sizeof(int*));
- int m= log2(n)+1;
- for (i = 0; i < n; i++)
- ST[i] = calloc(m, sizeof(int));
- int *lg =(int*)malloc(pow(2,((int) m+1))*sizeof(int));
- ComputeLogarithms(m,lg);
- scanf("%d", &k);
- ST_Build(a, ST, lg, n, m);
- int l, r;
- while(k>0){
- scanf("%d %d", &l, &r);
- printf("%d\n", ST_Query(ST, l, r, lg));
- k--;
- }
- for (i = 0; i < n; ++i)
- free(ST[i]);
- free(ST);
- free(a);
- free(lg);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement