摘要: Problem A Sudoku Checker总结: 简单模拟题. 时间复杂度 o(n^4)#include #include #include #include #include #include #include #include #include #define MIN(x,y) (x) &set_it, int n) {for(int i = 1; i tmp;... 阅读全文
posted @ 2014-04-12 18:31 周卓 阅读(185) 评论(0) 推荐(0) 编辑
摘要: Dashboard - Practice Round China New Grad Test 2014 - Google Code JamSourceURL:https://code.google.com/codejam/contest/2933486/dashboard#s=p2 Practice Round China New Grad Test 2014 A. Bad Hor... 阅读全文
posted @ 2014-04-12 17:05 周卓 阅读(822) 评论(0) 推荐(0) 编辑
摘要: Problem A Read Phone Number Do you know how to read the phone numbers in English? Now let me tell you. For example, In China, the phone numbers are 11 digits, like: 15012233444. Someone divides the numbers into 3-4-4 format, i.e. 150 1223 3444. While someone divides the numbers into 3-3-5 format, i. 阅读全文
posted @ 2014-04-12 11:11 周卓 阅读(520) 评论(0) 推荐(0) 编辑
摘要: 题目1 : Arithmetic Expression 描述Given N arithmetic expressions, can you tell whose result is closest to 9? 输入Line 1: N (1 c/d a*d > b*c.因此我们将所有的数都表示成 abs(divided/divisor -9) 的形式. 比如 901 / 100 -> 1/100; 3*3 -> 0/1; 2+6 -> 1/1; 8 - -1 = 0/1;这样就不会有小数的问题了.#include #include #include #include #i 阅读全文
posted @ 2014-04-12 10:11 周卓 阅读(251) 评论(0) 推荐(0) 编辑