08 2018 档案

Find a way HDU - 2612
摘要:Pass a year learning in Hangzhou, yifenfei arrival hometown Ningbo at finally. Leave Ningbo one year, yifenfei have many people to meet. Especially a 阅读全文

posted @ 2018-08-17 11:06 Cute_Abacus 阅读(127) 评论(0) 推荐(0)

非常可乐 HDU - 1495
摘要:大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N 毫升和M 毫升 可乐的体积为S (S<101)毫升 ( 阅读全文

posted @ 2018-08-17 11:05 Cute_Abacus 阅读(161) 评论(0) 推荐(0)

Oil Deposits HDU - 1241
摘要:The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of 阅读全文

posted @ 2018-08-17 11:04 Cute_Abacus 阅读(114) 评论(0) 推荐(0)

迷宫问题 POJ - 3984
摘要:定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, }; 它表示一个迷宫,其中的1表示墙壁,0表示可以走的路,只能横着走或竖着走,不能斜着走,要 阅读全文

posted @ 2018-08-17 11:03 Cute_Abacus 阅读(194) 评论(0) 推荐(0)

Fire!
摘要:Fire! UVA - 11624 Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire e 阅读全文

posted @ 2018-08-17 11:01 Cute_Abacus 阅读(172) 评论(0) 推荐(0)

Fire Game FZU - 2150
摘要: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 con 阅读全文

posted @ 2018-08-17 11:00 Cute_Abacus 阅读(270) 评论(0) 推荐(0)

Pots POJ - 3414
摘要:You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: Write a program to find the short 阅读全文

posted @ 2018-08-17 10:57 Cute_Abacus 阅读(425) 评论(0) 推荐(0)

Prime Path POJ - 3126
摘要: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 阅读全文

posted @ 2018-08-17 10:56 Cute_Abacus 阅读(362) 评论(0) 推荐(0)

Find The Multiple POJ - 1426
摘要: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 m 阅读全文

posted @ 2018-08-17 10:55 Cute_Abacus 阅读(94) 评论(0) 推荐(0)

Fliptile POJ - 3279
摘要: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 the 阅读全文

posted @ 2018-08-17 10:54 Cute_Abacus 阅读(120) 评论(0) 推荐(0)

Catch That Cow POJ - 3278
摘要: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,000) on a numb 阅读全文

posted @ 2018-08-17 10:53 Cute_Abacus 阅读(181) 评论(0) 推荐(0)

Dungeon Master POJ - 2251
摘要: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 filled with rock. 阅读全文

posted @ 2018-08-17 10:51 Cute_Abacus 阅读(147) 评论(0) 推荐(0)

棋盘问题 POJ - 1321
摘要:题目 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。 Input 输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表 阅读全文

posted @ 2018-08-17 10:50 Cute_Abacus 阅读(101) 评论(0) 推荐(0)

Monkey and Banana HDU - 1069
摘要:题目 A group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean t 阅读全文

posted @ 2018-08-16 16:10 Cute_Abacus 阅读(124) 评论(0) 推荐(0)

Ignatius and the Princess IV HDU - 1029
摘要:题目 "OK, you are not too bad, em... But you can never pass the next test." feng5166 says. "I will tell you an odd number N, and then N integers. There 阅读全文

posted @ 2018-08-16 16:09 Cute_Abacus 阅读(153) 评论(0) 推荐(0)

Max Sum Plus Plus HDU - 1024
摘要:题目: Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. N 阅读全文

posted @ 2018-08-16 16:06 Cute_Abacus 阅读(174) 评论(0) 推荐(0)

基本算法_位运算_lowbit
摘要:lowbit运算 lowbit(n)定义为非负整数n在二进制表示下“最低位的1及后面的所有0”构成的数值。比如二进制10011111010的lowbit就是最后两位10。 那么我们如何得到lowbit的值呢? 首先:取反。 ~ 10011111010 = 01100000101 然后:+1 0110 阅读全文

posted @ 2018-08-12 20:36 Cute_Abacus 阅读(534) 评论(0) 推荐(0)

导航