Can't we solve withouth using Trie? I saw an implementation, but didn't understand the need of last 2nd loop. #include
using namespace std; const int c=200005; int n, t[c], ans[c], db[20], xo; int main() { cin >> n; for (int i=1; i> t[i]; ans[i]=(ans[i-1]^t[i]); for (int j=0; j
Please fill the Feedback form for PCD: docs.google.com/forms/d/e/1FAIpQLScOxc9i-IwX9QguOqrjVmattcxlUfn2EZeFq_-JXZtTSZKDgA/viewform?usp=sf_link
Awesome Ankit Bhaiya
nice idea for D
in question 3 why 2*a-tot and 2*b-tot is giving wrong answer?
In array A you said every element should be unique then (16 1 4 1) is second testcase of this problem
Please anyone resolve this querry
Hello bhaiya
Upcoming tle batch date?
November last week or December first week
@@TLE_Eliminators😭😭 why so late, waiting for this batch since 2 months 😢
nov last week plis@@TLE_Eliminators
Can't we solve withouth using Trie? I saw an implementation, but didn't understand the need of last 2nd loop.
#include
using namespace std;
const int c=200005;
int n, t[c], ans[c], db[20], xo;
int main()
{
cin >> n;
for (int i=1; i> t[i];
ans[i]=(ans[i-1]^t[i]);
for (int j=0; j