05 2017 档案

摘要:Success Rate You are an experienced Codeforces user. Today you found out that during your activity on Codeforces you have made y submissions, out of w 阅读全文
posted @ 2017-05-28 20:18 starry_sky 阅读(291) 评论(0) 推荐(0)
摘要:花样式过DFS题 Problem Statement Nuske has a grid with N rows and M columns of squares. The rows are numbered 1 through N from top to bottom, and the column 阅读全文
posted @ 2017-05-28 11:06 starry_sky 阅读(219) 评论(0) 推荐(0)
摘要:Problem Statement Skenu constructed a building that has N floors. The building has an elevator that stops at every floor. There are buttons to control 阅读全文
posted @ 2017-05-28 09:58 starry_sky 阅读(172) 评论(0) 推荐(0)
摘要:Problem Statement Snuke has N integers. Among them, the smallest is A, and the largest is B. We are interested in the sum of those N integers. How man 阅读全文
posted @ 2017-05-28 09:56 starry_sky 阅读(296) 评论(0) 推荐(0)
摘要:Ball 可以用dfs,不过发现用一个循环就可以搞定。 阅读全文
posted @ 2017-05-26 20:28 starry_sky 阅读(131) 评论(0) 推荐(0)
摘要:Property Distribution 题目看不懂,不过看输入输出结果猜出来了,查看所以块得到数量,DFS搜索下就可以了。 阅读全文
posted @ 2017-05-26 15:59 starry_sky 阅读(129) 评论(0) 推荐(0)
摘要:Red and Black 好久没敲代码了,试了个简单的DFS题目练练手,这题就是一个DFS模板,一直写下去就行了。 阅读全文
posted @ 2017-05-25 23:26 starry_sky 阅读(139) 评论(0) 推荐(0)
摘要:A strange lift Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on 阅读全文
posted @ 2017-05-06 16:50 starry_sky 阅读(167) 评论(0) 推荐(0)
摘要:dijistra模板 优化的dijistra模板: Floyd模板,由于复杂度太大,很少用: 阅读全文
posted @ 2017-05-06 16:45 starry_sky 阅读(237) 评论(0) 推荐(0)
摘要:1 #include 2 using namespace std; 3 const int N = 1e4; 4 void factorial(int n){ 5 int a[N]; 6 a[0] = 1; 7 int res = 0; 8 for(int i = 1; i 0){ 16 a[++res] = flag;... 阅读全文
posted @ 2017-05-03 22:23 starry_sky 阅读(146) 评论(0) 推荐(0)
摘要:L1-1 这是一道简单题 Problem Description 大豪哥觉得自己特别的菜,就是个弱鸡,但是大家不承认,所以大豪哥想了一个办法,在学校大屏幕上输出三行“DaHaoGeJiuShiYiGeRuoJi”,这样就可以说明自己是个弱鸡了。可是大豪哥太渣了不会写,你能帮他输出一下吗? Input 阅读全文
posted @ 2017-05-03 22:14 starry_sky 阅读(480) 评论(4) 推荐(0)
摘要:1 #include 2 #include 3 using namespace std; 4 #define MAX 10005 5 6 struct bigint 7 { 8 char num[MAX]; 9 int flag; // 1:positive -1:negative 10 int dgts; 11 b... 阅读全文
posted @ 2017-05-01 12:12 starry_sky 阅读(592) 评论(0) 推荐(0)