找规律 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 + ;
 const int INF = 0x3f3f3f3f;

 int main(void)
 {
     //freopen ("A.in", "r", stdin);

     string s[];
     int n, m;

     while (cin >> n >> m)
     {
         for (int i=; i<=; ++i)
         {
             s[i] = "";
         }
         for (int i=; i<=m-; ++i)
         {
             s[] += '#';
             if (i != m - ) s[] += '.';
             else    s[] += '#';
             if (i == ) s[] += '#';
             else    s[] += '.';
         }

         int x = n / ;

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

         int y = n % ;

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

     return ;
 }