找规律 Codeforces Round #290 (Div. 2) A. Fox And Snake

题目传送门

/*
    水题
    找规律输出
*/
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <map>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
using namespace std;

const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;

int main(void)
{
    //freopen ("A.in", "r", stdin);
    
    string s[4];
    int n, m;
    
    while (cin >> n >> m)
    {
        for (int i=1; i<=3; ++i)
        {
            s[i] = "";
        }
        for (int i=0; i<=m-1; ++i)
        {
            s[1] += '#';
            if (i != m - 1) s[2] += '.';
            else    s[2] += '#';
            if (i == 0) s[3] += '#';
            else    s[3] += '.';
        }

        int x = n / 4;

        for (int i=1; i<=x; ++i)
        {
            cout << s[1] << endl;
            cout << s[2] << endl;
            cout << s[1] << endl;
            cout << s[3] << endl;
        }

        int y = n % 4;

        for (int i=1; i<=y; ++i)
        {
            if (i == 3) cout << s[1] << endl;
            else    cout << s[i] << endl;
        }
    }
    
    return 0;
}