Moth EradicationEntomologists in the Northeast have set out traps to determine the influx of Jolliet moths int...
(詳全文)
發表時間：2012-03-16 11:39:27 | 回應：0
Problem C - 2 the 9sTime Limit: 1 second
Introduction to the problem
A well-known trick to know if a...
(詳全文)
發表時間：2012-03-16 07:41:06 | 回應：0
Problem C - You can say 11Time Limite: 1 second
Introduction to the problem
Your job is, given a pos...
(詳全文)
發表時間：2012-03-16 07:00:00 | 回應：1
Problem E - Ones
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple
of n is a ...
(詳全文)
發表時間：2012-03-15 22:08:31 | 回應：0
500!
In these days you can more and more often happen to see programs which perform
some useful calc...
(詳全文)
發表時間：2012-03-15 21:49:54 | 回應：0
Worm World
The WormWold puzzle was initially proposed by Cliff Pickover in
the Discover Magazine, is...
(詳全文)
發表時間：2012-03-09 22:33:53 | 回應：0
Problem F
Ordering Tasks
Input: standard
input
Output: standard
output
Time Limit: 1 second
...
(詳全文)
發表時間：2012-03-08 23:39:03 | 回應：0
Longest Paths
It is a well known fact that some people do not have their social abilities completely ...
(詳全文)
發表時間：2012-03-08 22:35:49 | 回應：0
public class Main { public static void main(String[] args) { int L, H, i, tmp; while(true) { L = parseInt(...
(詳全文)
發表時間：2012-03-05 19:13:45 | 回應：0
Ackermann Functions
An Ackermann function has the characteristic that the length of the
sequence of n...
(詳全文)
發表時間：2012-03-05 18:59:37 | 回應：0
Numerically Speaking
A developer of crossword puzzles (and other similar word games) has decided
to ...
(詳全文)
發表時間：2012-03-05 14:11:12 | 回應：0
Problem D: Division
Given t, a, b positive integers not bigger than 2147483647,
establish whether (t^a - ...
(詳全文)
發表時間：2012-03-05 07:43:41 | 回應：0
I - Interesting Sequences
For a sequence of integer numbers <x1,x2,…,xn>,
a contiguous subsequence ...
(詳全文)
發表時間：2012-03-03 08:10:21 | 回應：0
Chocolate in its many forms is enjoyed by millions of people around the world every day. It
is a truly uni...
(詳全文)
發表時間：2012-03-02 21:50:04 | 回應：0
Graph Coloring
You are to write a program that tries to find an optimal coloring for a
given graph. Colors...
(詳全文)
發表時間：2012-02-29 12:15:51 | 回應：1
