Admin

1138 animes navigated

Stop scrolling! This Portable Door Lock Travel Home Security is insane!

Found the best Portable Door Lock Travel Home Security on Amazon today. ...

STOP staying in hotels without doing THIS! 🏨⚠️

I used to think my hotel room was safe until I realized literally anyone...

Trending Today: Portable Door Lock Travel Home Security

Check out the amazing Portable Door Lock Travel Home Security on Amazon right now! ...

STOP Scrubbing Your Life Away: Why This Gadget is Going Viral for All the Right Reasons! 🧼✨

Category: Home GadgetsLet’s be real for a second—is there anything more soul-crushing than getting...

Codeforces Round #411 (Div....

#include <stdio.h> int n; int main() { scanf("%d",&n); if(n%4>1)return printf("NOn"),0; printf("YESn"); for(int i=1;i<n;i+=4) { if(n%4)printf("%d %dn%d %dn%d %dn",i+2,n,i+2,i+3,i+3,n); else...

Codeforces Round #411 (Div....

#include <set> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int...

Codeforces Round #411 (Div....

#include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<set> using namespace std; const int MX=600111; int n,m; int pool,*c,s; int hed,nxt,t,ec,vis,vism,no; set<int>cur; inline void...

Codeforces Round #411 (Div....

#include<bits/stdc++.h> using namespace std; int c,d,i,n,m,k,x,j=1000000007; string s; main(){ cin>>s; for(i=s.size()-1;i>=0;i--){ if(s=='b')c++;else{ k+=c;c*=2;k%=j;c%=j; } } cout<<k; }

Codeforces Round #411 (Div....

#include<iostream> main(){int n;std::cin>>n;std::cout<<(n-1)/2;}

Codeforces Round #411 (Div....

#include <cstdio> int n; int main (){ scanf("%d", &n); for (int i =...

Codeforces Round #411 (Div....

#include <iostream> int l,r; int main() { std::cin>>l>>r; std::cout<<(l==r ? l:2); return 0; }

Codeforces Round #410 (Div....

#pragma warning(disable:4996) #include <stdio.h> #include <iostream> #include <iomanip> #include <vector> #include <algorithm> #include <string.h> #include <stdlib.h> #include...

Codeforces Round #410 (Div....

#include<bits/stdc++.h> using namespace std; const int maxn=100000+10; int b,n,flag=1,dp; struct node { int id,x; }a; int cmp(node...

Codeforces Round #410 (Div....

#include <bits/stdc++.h> using namespace std; int main(){ int n, num = 0,...

Codeforces Round #410 (Div....

#include <bits/stdc++.h> using namespace std; string s; int main() { int n, t, ans; ans...

Codeforces Round #410 (Div....

#include<iostream> using namespace std; main() { string s;cin>>s; int n=s.size(),cnt=0; for(int i=0;i<n/2;i++) { if(s!=s)cnt++; } cout<<(cnt==1||cnt==0&&n%2==1?"YES":"NO")<<endl; }