2018年10月8日
P3355 骑士共存问题
摘要： P3355 骑士共存问题 题目描述 在一个 n n (n include include include include define LL long long define REP(i, x, y) for(int i = (x);i '9'){if(c == ' ')flag = 1;c = g 阅读全文
posted @ 2018-10-08 18:46 Tony_Double_Sky 阅读(432) 评论(8) 推荐(0)
CODEVS 2171 棋盘覆盖
摘要： 2171 棋盘覆盖 给出一张n n(n include include include include define LL long long define REP(i, x, y) for(int i = (x);i '9'){if(c == ' ')flag = 1;c = getchar(); 阅读全文
posted @ 2018-10-08 16:49 Tony_Double_Sky 阅读(193) 评论(0) 推荐(0)