2018-2019 ICPC, NEERC, Northern Eurasia Finals 一些题解

limn2o4

于 2018-12-04 22:23:34 发布

阅读量695

点赞数 1

分类专栏： ACM Contest

本文链接：https://blog.csdn.net/lingzidong/article/details/84800025

版权

Easy Chess
队友牛逼构造了一下，好像还有更简单的代码

#include <bits/stdc++.h>
#include <cstring>
using namespace std;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
string ans[70]= {
   "b1","c1","d1","e1","f1","g1","h1",
                 "h2","g2","f2","e2","d2","c2","b2","a2",
                 "a3","b3","c3","d3","e3","f3","g3","h3",
                 "h4","g4","f4","e4","d4","c4","b4","a4",
                 "a5","b5","c5","d5","e5","f5","g5","h5",
                 "h6","h7","g7","g6","f6","f7","e7","e6",
                 "d6","d7","c7","c6","b6","b7","a7","a6",
                 "a8","b8","c8","d8","e8","f8","g8","h8"
                };

int main()
{
   
    int n;
    scanf("%d",&n);
    n--;
    cout<<"a1"<<' ';
    if(n==1)
        cout<<"a8"<<' '<<"h8"<<endl;
    else if(n==56||n==57||n==58||n==59||n==60||n==61||n==62||n==7||n==8||n==23||n==24||n==39||n==40||n==41)
    {
   
        for(int i=0; i<n; i++)
        {
   
            cout<<ans[i]<<' ';
        }
        cout<<"h8"<<endl;
    }
    else if(n-1==41)
    {
   
        for(int i=0; i<n-2; i++)
            cout<<ans[i]<<' ';
        cout<<"g6"<<' '<<"g8"<<' '<<"h8"<<endl;
    }

    else if(n-1==8||n-1==23||n-1==24||n-1==39