匡斌专题一简单搜索
三粉咩
这个作者很懒,什么都没留下…
展开
-
Fliptile
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate an M× N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 15)...原创 2018-07-23 10:37:02 · 264 阅读 · 0 评论 -
Fire Game
Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisting of grass or just empty and then they start...原创 2018-07-24 14:53:10 · 2113 阅读 · 0 评论 -
Find The Multiple
Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater than 200 and there...原创 2018-07-25 20:01:27 · 104 阅读 · 0 评论 -
Prime Path
The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matter of se...原创 2018-07-26 19:12:02 · 120 阅读 · 0 评论 -
Pots
You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:FILL(i) fill the pot i (1 ≤ i ≤ 2) from the tap; DROP(i) empty the po...原创 2018-07-26 21:32:58 · 789 阅读 · 0 评论 -
Fire!
题目链接:https://cn.vjudge.net/contest/219479#problem/J题目大意:一个人要从火场里出来,不知道多少火的起始点,或可以蔓延,人不能走墙,不能走火,问人是否能出来,最少多久解题思路:bfs,多个同时bfs,用两个数组分别标记已走过路程,人和火分别讨论,因为人不能走人已经走过的,也不能走火已经走过的,但是火可以走人已经走过的,但火不能走火走过的。...原创 2018-07-27 09:36:53 · 1093 阅读 · 0 评论 -
Shuffle'm Up
A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Ea...原创 2018-07-27 15:34:05 · 122 阅读 · 0 评论 -
Subway
You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day, you now get to walk and take the subway. Because you don't want ...原创 2018-08-14 21:18:30 · 260 阅读 · 0 评论