Codeforces 1208A. XORinacci Solution
Solve in C++: #include<bits/stdc++.h> using namespace std; int main() { int a,b,n,i,t,r=0; while(cin>>t) { ...
Solve in C++: #include<bits/stdc++.h> using namespace std; int main() { int a,b,n,i,t,r=0; while(cin>>t) { ...
Solve in C++: #include<bits/stdc++.h> using namespace std; main() { int a=0,i,l,r,ex=0,c=0; char s[101]; while(c...
Solve in C++: #include<bits/stdc++.h> using namespace std; int main() { int i,n,j,m,ar[201]={0},br[201]={0},vis[1000]={0},s=...
Solve in C++: #include<bits/stdc++.h> using namespace std; void pf(int n) { int f=0,c=0,cn=0; cout<<n<<...
Solve in C++: #include<bits/stdc++.h> using namespace std; main() { long long int k2,k3,k5,k6,i,n,m1,m2,m3,d,r1,r2; wh...
Solve in C: #include<stdio.h> #include<string.h> int main() { int i,j,n=0,l; char s[101]; while(scanf(...
Solve in C++: #include<iostream> using namespace std; main() { int n,a; cin>>n; a=n%4; if(a==1) cout<<"0 ...
Problem Link https://codeforces.com/contest/2009/problem/C S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. h ...