746 D. Green and Black Tea codeforces
来源:互联网 发布:autodesk软件卸载工具 编辑:程序博客网 时间:2024/06/03 04:45
思路:先放多的,多的都是以k个连成一块,然后少的往里插。
#include<bits/stdc++.h>using namespace std;char str[100005];int main(){ int n,k,a,b,flag; cin>>n>>k>>a>>b; char aa,bb; aa='G';bb='B'; if(a>b) { swap(a,b); aa='B'; bb='G'; } for(int i=1;i<=n;i++) { str[i]=bb; } flag=1; for(int i=k+1;i<=n;i+=k+1) { if(a<=0) { flag=0; break; } str[i]=aa; a--; } if(flag) { for(int i=1;i<=n;i++) { if(!a) break; if(str[i]==aa||str[i-1]==aa||str[i+1]==aa) continue; str[i]=aa; a--; } for(int i=1;i<=n;i++) cout<<str[i]; cout<<endl; } else cout<<"NO"<<endl; return 0;}
0 0
- CodeForces 746D Green and Black Tea
- 746 D. Green and Black Tea codeforces
- 【21.58%】【codeforces 746D】Green and Black Tea
- 【Codeforces 746D Green and Black Tea】+ 构造
- Codeforces 746D Green and Black Tea(构造)
- codeforces 746 D. Green and Black Tea (构造)
- Codeforces 746D Green And Black Tea 构造
- codefroces 746D Green and Black Tea
- 746D Green and Black Tea
- Codeforces Round #386 (Div. 2)D. Green and Black Tea
- codeforces #386 div2 D. Green and Black Tea
- Codeforces Round #386 (Div. 2) D. Green and Black Tea
- Codeforces Round #386 (Div. 2) 746D Green and Black Tea
- Codeforces Round #386(Div. 2)D. Green and Black Tea【思维+构造】
- Codeforces Round #386 (Div. 2) D. Green and Black Tea 数论+贪心
- codeforce 386(div2) D. Green and Black Tea
- Codeforces 260D - Black and White Tree
- codeforces D - Red-Green Towers
- 路漫漫其修远兮
- AOP 之 6.4 基于@AspectJ的AOP ——跟我学spring3
- VelocityTracker计算速率
- 运维之下 笔记 三(运维平台)
- LPC1778/1788的初步开发问题
- 746 D. Green and Black Tea codeforces
- CAD的一些命令,希望对大家有帮助哦!!!
- 如何查看知道某一个网站是由哪种编程语言写的?绝对准确全面!(精)
- sql server分页查询
- 短信验证模板
- androidstudio导入so简单的方法
- 骑士旅行pascal解题程序
- # Android 极光推送服务器端和移动端
- 可变长度参数列表讲解