Codeforces Round #473 (Div. 2), problem: (F) Mahmoud and Ehab and yet another xor task Solution In C/C++
#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; int b; int ans; int p; vector<pii>q; int main() { int n,m; cin>>n>>m; memset(b,-1,sizeof(b)); …