【CSU-2163】解题报告（水题）

原始题目

2163: 字符画

  • Time Limit: 1 Sec
  • Memory Limit: 128 Mb
  • Submitted: 221
  • Solved: 139

Description

读入 \(w\)，请输出 2018 的字符画，两个数字之间有 \(w\) 个空格。具体格式请参考样例输出。\((1 ≤ w ≤ 2018)\)

Input

输入文件只包含 1 个整数 \(w\).

Output

输出 5 行，每行 \(12 + 3w\) 个字符（只包含 o 和 . 两种，字符画的部分用 o，空格的部分用 .），以换行符结尾。

Sample Input

2

Sample Output

ooo..ooo..ooo..ooo
..o..o.o...o...o.o
ooo..o.o...o...ooo
o....o.o...o...o.o
ooo..ooo..ooo..ooo

Hint

Source

2018湖南省第14届大学生计算机程序设计竞赛

Author

ftiasch

题目大意

如题

解题思路

打输出

解题代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <set>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
using namespace std;
const int maxn=1e5+5;
const int maxm=1e5+5;

#define rep(i,a,n) for(int i=a;i<n;++i)
#define per(i,a,n) for(int i=n-1;i>=a;--i)
#define fi first
#define se second
#define pb push_back
#define np next_permutation
#define mp make_pair
#define INF 0x3f3f3f3f
#define EPS 1e-8

int n;

int main(){
    ios::sync_with_stdio(false);
    while(cin>>n){
        {
            cout<<"ooo";
            rep(i,0,n) cout<<".";
            cout<<"ooo";
            rep(i,0,n) cout<<".";
            cout<<"ooo";
            rep(i,0,n) cout<<".";
            cout<<"ooo"<<endl;
        }


        {
            cout<<"..o";
            rep(i,0,n) cout<<".";
            cout<<"o.o";
            rep(i,0,n) cout<<".";
            cout<<".o.";
            rep(i,0,n) cout<<".";
            cout<<"o.o"<<endl;
        }
        {
            cout<<"ooo";
            rep(i,0,n) cout<<".";
            cout<<"o.o";
            rep(i,0,n) cout<<".";
            cout<<".o.";
            rep(i,0,n) cout<<".";
            cout<<"ooo"<<endl;
        }

        {
            cout<<"o..";
            rep(i,0,n) cout<<".";
            cout<<"o.o";
            rep(i,0,n) cout<<".";
            cout<<".o.";
            rep(i,0,n) cout<<".";
            cout<<"o.o"<<endl;
        }
        {
            cout<<"ooo";
            rep(i,0,n) cout<<".";
            cout<<"ooo";
            rep(i,0,n) cout<<".";
            cout<<"ooo";
            rep(i,0,n) cout<<".";
            cout<<"ooo"<<endl;
        }
    }
}

收获与反思

无