Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
Codeforces Round #386 (Div. 2), problem: (D) Green and Black Tea Solution in C/C++
#include<stdio.h> int main() { long long n,k,a,b,i; char x='G',y='B'; int num=0; scanf("%I64d%I64d%I64d%I64d",&n,&k,&a,&b); if(a>b) { int t=a;a=b;b=t; char z=x;x=y;y=z; } if(b>(a+1)*(k)) { printf("NO\n"); return 0; } for(i=0;i<n;i++){ if(b>a&&num<k){printf("%c",y);b--;num++;} else {printf("%c",x);a--;num=0;} } return 0; }
📦 Looking for Codeforces Round 386 Div Problem Green? Check the best deals on Amazon.
🛒 Shop Codeforces Round 386 Div Problem Green on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
, problem: (D) Green and Black Tea Solution in C/C++. Codeforces Round #386 (Div. 2), problem: (D) Green and Black Tea){kind=link}