Sponsors

Admin

875 animes navigated

Celebrating Black History Month: Past, Future

As February unfolds, so does the annual celebration of Black History Month, a time...

The Path to Self-Mastery: Lessons from Book ‘The Mountain Is You’

Embarking on a journey of self-mastery and breaking free from self-sabotage is a transformative...

Wizards of Waverly Place Cast Reunites for Enchanting Revival

In a spellbinding announcement, Disney has officially revealed that the beloved fantasy series "Wizards...

Jim Irsay’s Reported ‘Suspected Overdose’: A Closer Look

In a shocking turn of events last month, Jim Irsay, the owner of the...

Codeforces Round #411 (Div....

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.StringTokenizer; public class...

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...