- 博客(14)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 POJ 2501 Average Speed --from lanshui_Yang
DescriptionYou have bought a car in order to drive from Waterloo to a big city. The odometer on their car is broken, so you cannot measure distance. But the speedometer and cruise control both wor
2012-08-25 22:33:14
1073
原创 POJ 3104 Drying （神题 啊 ~） -- from lanshui_Yang
DescriptionIt is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has decided to use a radiator to make dryi
2012-08-24 15:28:54
1992
3
原创 POJ 3083 Children of the Candy Corn (BFS ,DFS) -- from lanshui_Yang
DescriptionThe cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terro
2012-08-20 16:24:30
816
原创 ZOJ 1649 Rescue (BFS) -- from lanshui_Yang
Angel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Their task is: approach Angel. We assume that "approach
2012-08-19 14:26:48
634
原创 POJ 1915 Knight Moves (经典的BFS) --from lanshui_Yang
DescriptionBackground Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him? The Problem Your ta
2012-08-18 15:25:53
2187
原创 ZOJ 2110 ( HDU 1010 ) Tempter of the Bone（ 比较经典的DFS） --from lanshui_Yang
Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He re
2012-08-17 17:17:14
633
原创 POJ 2389 Bull Math --from lanshui_Yang
题目大意 就不 多说 啦 ，就是大数乘法 ，直接模拟 。。。 具体讲解请看代码：#include#include#include#include#includeusing namespace std;char a[1000],b[1000];int sum[1000600];int main(){ cin>> a >> b;
2012-08-17 10:28:31
641
原创 POJ 3006 Dirichlet's Theorem on Arithmetic Progressions(素数筛选法) --from lanshui_Yang
DescriptionIf a and d are relatively prime positive integers, the arithmetic sequence beginning with a and increasing by d, i.e., a, a + d, a + 2d, a + 3d,a + 4d, ..., contains infinitely many p
2012-08-16 21:52:11
1284
原创 POJ 1828 Monkeys' Pride (易 TLE 题目) -- from lanshui_Yang
DescriptionBackground There are a lot of monkeys in a mountain. Every one wants to be the monkey king. They keep arguing with each other about that for many years. It is your task to help them s
2012-08-13 19:47:11
1122
原创 POJ 3117 World Cup (简单数学题) --from lanshui_Yang
DescriptionA World Cup of association football is being held with teams from around the world. The standing is based on the number of points won by the teams, and the distribution of points is d
2012-08-12 14:03:59
1585
原创 POJ 3749 破译密码 --from lanshui_Yang
Description据说最早的密码来自于罗马的凯撒大帝。消息加密的办法是：对消息原文中的每个字母，分别用该字母之后的第5个字母替换（例如：消息原文中的每个字母A都分别替换成字母F）。而你要获得消息原文，也就是要将这个过程反过来。 密码字母：A B C D E F G H I J K L M N O P Q R S T U V W X Y Z M 原文字母：V W X Y Z
2012-08-11 19:54:56
2284
原创 POJ 1519 Digital Roots -- from lanshui_Yang
DescriptionThe digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting valu
2012-08-10 19:47:15
591
原创 POJ 2081 Recaman's Sequence -- from lanshui_Yang
DescriptionThe Recaman's sequence is defined by a0 = 0 ; for m > 0, am = am−1 − m if the rsulting am is positive and not already in the sequence, otherwise am = am−1 + m. The first few numbers i
2012-08-10 17:17:08
971
原创 POJ 2080 Calender -- from lanshui_Yang
题目大意： 输入一个天数d，计算从2000年1月1日起，“经过”d天后 的日期 和 这一天是星期几。（题目中并未给出2000年1月1日 是星期几，但从样例可以推算出 ~）样例如下：Input:1730174017501751-1Sample Output2004-09-26 Sunday2004-10-06 Wednesday2004
2012-08-10 16:14:33
720
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人