Codeforces Round #473 (Div. 2), problem: (F) Mahmoud and Ehab and yet another xor task Solution In C/C++

By | 2018-04-18T13:41:56+00:00 April 18th, 2018|Categories: C/C++, Programming|Tags: , , , , , , , , |

#include<bits/stdc++.h> #define LL long long using namespace std; const int maxn = 1e5+5; const int mod =1e9+7; typedef pair<int,int>pii; int a[maxn]; int b[25]; int ans[maxn]; int p[maxn]; vector<pii>q[maxn]; int main() { int n,m; cin>>n>>m; memset(b,-1,sizeof(b)); p[0]=1; for(int i=1;i<=n;i++)scanf("%d",&a[i]),p[i]=p[i-1]*2%mod; for(int i=1;i<=m;i++) { int l,x; scanf("%d%d",&l,&x); [...]