Thursday, May 15, 2025
Sponsors

Tag: Codeforces Round #411 (Div. 2)

Codeforces Round #411 (Div....

C/C++
#include <set> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int...
Read more

Codeforces Round #411 (Div....

C/C++
#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...
Read more

Codeforces Round #411 (Div....

C/C++
#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; }
Read more

Codeforces Round #411 (Div....

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

Codeforces Round #411 (Div....

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

Codeforces Round #411 (Div....

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

Advertisement

spot_img

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

© E-Blogarithm 2016