codeforces CF475 ABC 题解

A. Bayan Bus
题意：输入人数k，输出一辆公交车！优先坐最后，同一排优先坐左边。
题解：暴力找地方坐啊！
 1 //#pragma comment(linker, "/STACK:102400000,102400000")
 2 #include<cstdio>
 3 #include<cmath>
 4 #include<iostream>
 5 #include<cstring>
 6 #include<algorithm>
 7 #include<cmath>
 8 #include<map>
 9 #include<set>
10 #include<stack>
11 #include<queue>
12 using namespace std;
13 #define ll long long
14 #define usll unsigned ll
15 #define mz(array) memset(array, 0, sizeof(array))
16 #define mf1(array) memset(array, -1, sizeof(array))
17 #define minf(array) memset(array, 0x3f, sizeof(array))
18 #define REP(i,n) for(i=0;i<(n);i++)
19 #define FOR(i,x,n) for(i=(x);i<=(n);i++)
20 #define RD(x) scanf("%d",&x)
21 #define RD2(x,y) scanf("%d%d",&x,&y)
22 #define RD3(x,y,z) scanf("%d%d%d",&x,&y,&z)
23 #define WN(x) printf("%d\n",x);
24 #define RE  freopen("D.in","r",stdin)
25 #define WE  freopen("huzhi.txt","w",stdout)
26 #define mp make_pair
27 #define pb push_back
28 #define pf push_front
29 #define ppf pop_front
30 #define ppb pop_back
31 const double pi=acos(-1.0);
32 const double eps=1e-10;
33 
34 string s[10];
35 int k;
36 
37 int main(){
38     int i,j;
39     s[0]="+------------------------+";
40     s[1]="|#.#.#.#.#.#.#.#.#.#.#.|D|)";
41     s[2]="|#.#.#.#.#.#.#.#.#.#.#.|.|";
42     s[3]="|#.......................|";
43     s[4]="|#.#.#.#.#.#.#.#.#.#.#.|.|)";
44     s[5]="+------------------------+";
45     int len=s[0].length();
46     RD(k);
47     while(k--){
48         bool flag=0;
49         FOR(i,0,len-1){
50             FOR(j,0,5){
51                 if(s[j][i]=='#'){
52                     flag=1;
53                     s[j][i]='O';
54                     break;
55                 }
56             }
57             if(flag)break;
58         }
59     }
60     FOR(i,0,5){
61         cout<<s[i]<<endl;
62     }
63     return 0;
64 }
View Code