Codeforces Round #411 (Div. 2) Archive

#include <set> #include <vector> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int N=200050; vector<int>vec,dis,sum; struct Node{int x,y;double ans;}JY; bool operator<(Node a,Node b){if(a.x!=b.x)return a.x<b.x;return a.y<b.y;} set<Node>s;set<Node>::iterator it; int n,m,q,first,nxt,v,w,tot,root,xx,yy,vis; int maxx,rec,f,Root,vv,fi,flag,size; void add(int …

#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 ade(int u,int v){ ec++;nxt=hed;t=v;hed=ec; } void dfs(int k){ vis=1; for(int *i=c;i!=c;i++)if(vism)cur.erase(no); for(int *i=c;i!=c;i++)if(!vism){ no=*(cur.lower_bound(1)); cur.erase(no); …

#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; }

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

#include <cstdio> int n; int main (){ scanf(“%d”, &n); for (int i = 0; i < n; i++) printf(“%c”, i % 4 < 2 ? ‘a’ : ‘b’); printf(“\n”); return 0; }

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