# POJ 2531 Network Saboteur (DFS)

Description A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully...

# POJ 3258 River Hopscotch (二分)

Description Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a rive...

# POJ 3414 Pots (BFS)

Description You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) ...

# POJ 1426 Find The Multiple （BFS）

Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits...

# POJ 2115 C Looooops （扩展欧几里得）

Description A Compiler Mystery: We are given a C-language style for loop of type for (variable = A; variable != B; variable += C) statement; ...

# POJ 1905 Expanding Rods （二分）

Description When a thin rod of length L is heated n degrees, it expands to a new length L’=(1+n*C)*L, where C is the coefficient of heat expansion....

# POJ 2251 Dungeon Master （BFS）

Description You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be fi...

# POJ 2488 A Knight's Journey (dfs)

Description Background The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journ...

# POJ 3278 Catch That Cow (BFS)

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...

# POJ 3273 Monthly Expense (二分)

Description Farmer John is an astounding accounting wizard and has realized he might run out of money to run the farm. He has already calculated an...

# POJ 1845 Sumdiv （数论，约数和）

DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division o...

# POJ 1942 Paths on a Grid (组合数学)

Description Imagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mast...

# POJ 1850 Code (组合数学)

Description Transmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A wel...

# POJ 3292 Semi-prime H-numbers (筛法统计)

Description This problem is based on an exercise of David Hilbert, who pedagogically suggested that one study the theory of 4n+1 numbers. Here, we ...

# POJ 2635 The Embarrassed Cryptographer (同余问题)

Description The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, whic...

# POJ 3122 Pie （二分）

Description My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of v...

# 2016，还是到了最后

个人资料
等级：
访问量： 36万+
积分： 1万+
排名： 2019
欢迎关注 <千与梦随> 哦！
博客专栏
 那些年,我们一起追过的算法 文章：6篇 阅读：23920
最新评论