摘要：
有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。 （一）巴什博奕（Bash Game）：只有一堆n个物品，两个人轮 阅读全文
摘要：
Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,00 阅读全文
摘要：
Description Due to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 10 阅读全文
摘要：
1 #include<graphics.h> 2 #include<math.h> 3 #include<stdio.h> 4 int main() 5 { 6 int gmode,gdriver=DETECT; 7 int b[100][100],m,k=30,l,kk; 8 double x1, 阅读全文
摘要：
1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #define S 16 9 #define bgi "c:\\bgi" 10 #define ppqq 30000 11 #define PI acos(-1.0) 12 ... 阅读全文
摘要：
#include<graphics.h>#include<math.h>int main(){ int gmode,gdriver=DETECT; double x1,y1,x2,y2; initgraph(&gdriver,&gmode,""); cleardevice(); setbkcolor 阅读全文
摘要：
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of 阅读全文
摘要：
Description Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A 阅读全文
摘要：
Description Misha and Vanya have played several table tennis sets. Each set consists of several serves, each serve is won by one of the players, he re 阅读全文
摘要：
Description 三个农民每天清晨5点起床，然后去牛棚给3头牛挤奶。第一个农民在300时刻(从5点开始计时，秒为单位)给他的牛挤奶，一直到1000时刻。第二个农民在700时刻开始，在 1200时刻结束。第三个农民在1500时刻开始2100时刻结束。期间最长的至少有一个农民在挤奶的连续时间为90 阅读全文