2017年05月_free-dancer

原创数学1（n^n）Leftmost Digit

Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3677 Accepted Submission(s): 1631 Problem DescriptionGi

2017-05-29 19:04:46 341

原创搜索 B - 跳马问题(dfs)

DescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a knight moves, it is

2017-05-29 13:03:14 1399

原创搜索-O - 切绳子问题(二分)

//题意：有n条绳子，分成k段相等的，问能使得最长为多长思路：经典二分输入n 段绳子的完了之后，计算 k段平均长度，在0-sum/k, 之间二分，如果分的绳子多余k 段的话，说明绳子太短了，需要调整二分区间。还有这个题的输入输出要用c 的方法。（keng) #if 0#include#include#include#define exp 1e-8 using

2017-05-25 08:50:09 2803

原创 HDU Quicksum

题意：ACM: 1*1 + 2*3 + 3*13 = 46MID CENTRAL: 1*13 + 2*9 + 3*4 + 4*0 + 5*3 + 6*5 + 7*14 + 8*20 + 9*18 + 10*1 + 11*12 = 650ACMMID CENTRALREGIONAL PROGRAMMING CONTESTACNA C MABCBBC#

2017-05-22 19:39:32 397

原创 HDU Text Reverse/1.2

1.12字符反转：Sample Input3olleh !dlrowm’I morf .udhI ekil .mcaSample Outputhello world!I’m from hdu.I like acm.好久没有用 STL ，于是想到了string 数组的使用，还有reverse（s.begin(),s.end()）,发现不行，在这个题里

2017-05-22 19:31:52 346

原创搜索 D - 棋盘问题(dfs)

Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子

2017-05-20 09:44:27 581

原创搜索 P - 入门地图题(dfs)

DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid

2017-05-18 17:31:05 607

原创搜索 Q - 素数环(dfs)

DescriptionA ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime.N

2017-05-18 09:35:22 344

原创搜索 H - n的 0/1倍数(bfs)(dfs)

DescriptionGiven 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 tha

2017-05-18 09:21:53 532

原创搜索 G - 农民追牛问题(bfs)

DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN (0 ≤ N ≤ 100,000) on a number line and the cow is at a point

2017-05-18 09:04:55 871