# Codeforces Round #426 (Div. 2) Archive

## Codeforces Round #426 (Div. 2), problem: (E) Ever-Hungry Krakozyabra Solution In C/C++

#include <stdio.h> #include <stdlib.h> #include <string.h> #define N 19 char strL, strR; int l, r, i, n, j, sum, k; int bufL = {0}, bufR = {0}; int *L, *R; int num = {0}, has …

## Codeforces Round #426 (Div. 2), problem: (D) The Bakery Solution In C/C++

#include <bits/stdc++.h> #define For(i,a,b) for(long long i=a;i<=b;i++) #define Ford(i,a,b) for(int i=a;i>=b;i–) #define dream_hyojooslh using namespace std; const int N=200000+1067,T=67; int f,it,lz,trai,phai,a; void build(int x,int l,int r) { trai=l; phai=r; if (l==r) return; int mid =(l+r)/2; …

## Codeforces Round #426 (Div. 2), problem: (C) The Meaningless Game Solution In C/C++

#include <bits/stdc++.h> using namespace std; int main() { ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); int n; long long int a,b,g; cin >> n; while (n–) { cin >> a >> b; g = round(pow(a * b, …

## Codeforces Round #426 (Div. 2), problem: (B) The Festive Evening Solution In C/C++

#include<cstdio> bool pd; char s; int n,k,size,last; int main(){ scanf(“%d%d%s”,&n,&k,&s); for (int i=0;i<n;++i) last-‘A’]=i; for (int i=0;i<n;++i){ if (!pd-‘A’]) pd-‘A’]=true,++size; if (size>k){ printf(“YES”); return 0; } if (i==last-‘A’]) –size; } printf(“NO”); }

## Codeforces Round #426 (Div. 2), problem: (A) The Useless Toy Solution In C/C++

#include<bits/stdc++.h> using namespace std; int t; int main(){ char a,b; int n; scanf(” %c %c”,&a,&b); scanf(“%d”,&n); n%=4; t=0,t=1,t=2,t=3; int c=(t-t+4)%4; if(n==0||n==2)puts(“undefined”); else puts(n!=c?”cw”:”ccw”); }