摘要: 第一题 题目 https://ac.nowcoder.com/acm/contest/334/A 永恒的经典 #include <stdio.h> int main(int argc, char *argv[]) { printf("Helle World!\n"); return 0; } 第二题 阅读全文
posted @ 2018-12-24 15:10 Nicholas-Rain 阅读(221) 评论(0) 推荐(0) 编辑
摘要: 模板一: 时间复杂度O(n2) 模板二: 时间复杂度 O(mlogn)m为边数,n为顶点数。 对于稀疏图的效果显著,对稠密图慎用。 放一道模板题 http://acm.hdu.edu.cn/showproblem.php?pid=2544 AC代码 1 #include <iostream> 2 # 阅读全文
posted @ 2019-05-29 00:23 Nicholas-Rain 阅读(1001) 评论(0) 推荐(0) 编辑
摘要: The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room 阅读全文
posted @ 2018-12-24 18:11 Nicholas-Rain 阅读(166) 评论(0) 推荐(0) 编辑
摘要: Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a 阅读全文
posted @ 2018-12-14 20:11 Nicholas-Rain 阅读(172) 评论(0) 推荐(0) 编辑
摘要: 1 //骑士问题 2 #include <iostream> 3 #include <stdio.h> 4 #include <string.h> 5 #include <queue> 6 using namespace std; 7 int c[9][9];//棋盘 8 int dir[8][2] 阅读全文
posted @ 2018-12-14 16:09 Nicholas-Rain 阅读(151) 评论(0) 推荐(0) 编辑