暴力
July_ing
这个作者很懒,什么都没留下…
展开
-
3.27 三二 A CodeForces 635A 中提琴 暴力
#include #include using namespace std; char a[15][15]; int main() { int r,c,n,k,x,y,N=0,step=0; memset(a,'*',sizeof(a)); cin>>r>>c>>n>>k; while(n--) { cin>>x>>y;原创 2016-04-06 21:30:16 · 281 阅读 · 0 评论 -
3.26 三一 F CodeForces 271A 新年 暴力 签到T
#include #include using namespace std; bool b[10]; /// 判断十个数是否出现过 int main() { int a,i; int c[5]; cin>>a; for(i=a+1; i { // cout int temp=i; me原创 2016-04-06 19:59:45 · 444 阅读 · 0 评论 -
多校2.1012La Vie en rose
点击打开链接 Problem Description Professor Zhang would like to solve the multiple pattern matching problem, but he only has only one pattern string p=p1p2...pm. So, he wants to generate as many as原创 2016-07-22 15:34:30 · 347 阅读 · 0 评论 -
Codeforces #363(Div.2) B.One Bomb
You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (".") or it can be occupied by a wall ("*"). You have one bomb. If you原创 2016-07-29 20:22:22 · 250 阅读 · 0 评论