Light OJ
文章平均质量分 74
Jack983901073
这个作者很懒,什么都没留下…
展开
-
Light OJ 1008
1008 - Fibsieve`s Fantabulous Birthday . Input Input starts with an integer T (≤ 200),denoting the number of test cases. Each case will contain an integer S (1 ≤原创 2012-01-30 20:23:09 · 1199 阅读 · 0 评论 -
Light OJ 1001
1001 This problem gives you a flavor the concept of specialjudge. That means the judge is smart enough to verify your code even though itmay print different results. In this problem you are asked t原创 2012-01-29 14:42:21 · 1278 阅读 · 1 评论 -
Light OJ 1000
刚开始做light oj,就记录下自己做的,比较下其它大侠的代码 1000求和 我的代码: #include intmain() { int n,i,sum[200]; scanf("%d",&n); for(i=1;i { int a,b; scanf("%d%d",&a,&b); s原创 2012-01-29 13:29:30 · 580 阅读 · 0 评论 -
Light OJ 1015
Sometimes I feel angry to arrange contests, because I am toolazy. Today I am arranging a contest for AIUB students. So, I made a plan.While they will be busy with the contest, as a punishment I will c原创 2012-01-31 21:02:18 · 933 阅读 · 0 评论 -
Light OJ 1022
A circle is placed perfectly into a square. The termperfectly placed means that each side of the square is touched by the circle,but the circle doesn't have any overlapping part with the square. See t原创 2012-01-31 13:21:53 · 714 阅读 · 0 评论 -
Light OJ 1042
This is the tale of Zephyr, the greatest time traveler theworld will never know. Even those who are aware of Zephyr's existence know verylittle about her. For example, no one has any clue as to which原创 2012-02-02 20:56:22 · 969 阅读 · 0 评论