CodeJam
文章平均质量分 77
lllcfr1
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
Google CodeJam Round 2 2013
Official Analysis: https://code.google.com/codejam/contest/2442487/dashboard#s=a C++ code Problem A (small data) #include #include #include #include #include using namespace std; int main原创 2013-06-03 16:10:26 · 860 阅读 · 0 评论 -
Google CodeJam Qualification Round 2013
Official Analysis: https://code.google.com/codejam/contest/2270488/dashboard#s=a Problem A. Tic-Tac-Toe-Tomek Problem Tic-Tac-Toe-Tomek is a game played on a 4 x 4 square board. The board s原创 2013-04-13 19:32:06 · 1888 阅读 · 1 评论 -
Google CodeJam Round 1A 2013
Official Analysis: https://code.google.com/codejam/contest/2418487/dashboard#s=a C++ code for Problem A: #include #include using namespace std; const int MAXLEN = 10000; class BigInteger原创 2013-04-27 11:59:15 · 866 阅读 · 0 评论 -
Google CodeJam Round 1C 2013
Official analysis: https://code.google.com/codejam/contest/2437488/dashboard#s=a C++ codes Problem A (small) #include #include #include using namespace std; inline bool is_constant(cha原创 2013-05-12 19:44:08 · 862 阅读 · 0 评论 -
判断是否为二分图
Google CodeJam China Campus Test 2014 Practice Round Problem A: https://code.google.com/codejam/contest/2933486/dashboard#s=p0 Solution: References: http://blog.163.com/kevinlee_2010/b转载 2013-09-16 23:54:18 · 879 阅读 · 0 评论 -
Practice Round China New Grad Test 2014
https://code.google.com/codejam/contest/2933486/dashboard A #include #include #include #include #include #include using namespace std; inline int getNode(const string &name, int &n, ma原创 2013-09-20 17:36:06 · 846 阅读 · 0 评论 -
China New Grad Test 2014 Online Round A
https://code.google.com/codejam/contest/2924486/dashboard原创 2013-10-27 21:35:43 · 1196 阅读 · 0 评论 -
Google CodeJam Qualification Round 2014
Problems: https://code.google.com/codejam/contest/2974486/dashboard原创 2014-04-13 10:53:25 · 927 阅读 · 0 评论 -
Google CodeJam 2014 Round 1C
Problem: https://code.google.com/codejam/contest/3004486/dashboard Problem A. Part Elf This contest is open for practice. You can try every problem as many times as you like, though we原创 2014-05-11 20:09:39 · 1240 阅读 · 0 评论
分享