 Spring mvc 3.2下Ajax获取406 (Not Acceptable)

Spring mvc 3.2下Ajax获取406 (Not Acceptable) 求助 大神来帮帮忙
@ResponseBody
@RequestMapping(value = "/resultMap.do", method = RequestMethod.GET, produces = MediaType.APPLICATION_JSON_VALUE)
public Result getResultJsone(HttpServletRequest request, ModelMap modelMap）
<?xml version="1.0" encoding="UTF8"?>
xmlns:xsi="http://www.w3.org/2001/XMLSchemainstance"
xmlns:aop="http://www.springframework.org/schema/aop"
xmlns:tx="http://www.springframework.org/schema/tx"
xmlns:context="http://www.springframework.org/schema/context"
xsi:schemaLocation="
http://www.springframework.org/schema/beans
http://www.springframework.org/schema/beans/springbeans.xsd
http://www.springframework.org/schema/tx
http://www.springframework.org/schema/tx/springtx.xsd
http://www.springframework.org/schema/aop
http://www.springframework.org/schema/aop/springaop.xsd
http://www.springframework.org/schema/context
http://www.springframework.org/schema/context/springcontext.xsd">
/context:componentscan
<! hibernate >
destroymethod="close">
class="org.springframework.orm.hibernate3.annotation.AnnotationSessionFactoryBean">
com.map.domain.Location
com.map.domain.img.Maptile
com.map.domain.img.Room
com.map.domain.point.Pp
com.map.domain.nav.Nav
com.map.domain.LocationVo
org.hibernate.dialect.MySQLDialect
true
true
update
<bean id="transactionManager"
class="org.springframework.jdbc.datasource.DataSourceTransactionManager">
<property name="dataSource" ref="dataSource" />
</bean>
<bean id="hibernateTemplate" class="org.springframework.orm.hibernate3.HibernateTemplate">
<property name="sessionFactory" ref="sessionFactory" />
</bean>
<tx:annotationdriven transactionmanager="transactionManager" />
 其他相关推荐
 Easier Done Than Said?
 Problem Description Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computergenerated passwords (like xvtpzyo), but users have a hard time remembering them and sometimes leave them written on notes stuck to their computer. One potential solution is to generate "pronounceable" passwords that are relatively secure but still easy to remember. FnordCom is developing such a password generator. You work in the quality control department, and it's your job to test the generator and make sure that the passwords are acceptable. To be acceptable, a password must satisfy these three rules: It must contain at least one vowel. It cannot contain three consecutive vowels or three consecutive consonants. It cannot contain two consecutive occurrences of the same letter, except for 'ee' or 'oo'. (For the purposes of this problem, the vowels are 'a', 'e', 'i', 'o', and 'u'; all other letters are consonants.) Note that these rules are not perfect; there are many common/pronounceable words that are not acceptable. Input The input consists of one or more potential passwords, one per line, followed by a line containing only the word 'end' that signals the end of the file. Each password is at least one and at most twenty letters long and consists only of lowercase letters. Output For each password, output whether or not it is acceptable, using the precise format shown in the example. Sample Input a tv ptoui bontres zoggax wiinq eep houctuh end Sample Output <a> is acceptable. <tv> is not acceptable. <ptoui> is not acceptable. <bontres> is not acceptable. <zoggax> is not acceptable. <wiinq> is not acceptable. <eep> is acceptable. <houctuh> is acceptable.
 No place to hide 隐藏的问题
 Problem Description It was in a dark daybreak. Dr. Gneh, who was a crazy scientist once trying to dominate the whole humankind by deploying a powerful AI network, had been discovered in a mansion on the grand field outside city of ACM. This time, he got no place to hide. To help specify the capture operation, let's assume the grand field had nothing else but the mansion on coordinate (Xm, Ym). N interpol elites had been assigned to N different positions around the mansion. The ith interpol on initial position (Xi, Yi) could move at a maximum speed rate Vi m/s. It was said that Dr. Gneh had invent a rocket motorbike to escape this operation. According to our information, his ride could not change any direction, and ran at a maximum speed rate Vm m/s. For the human future, any failure in this operation was not acceptable. We had to make sure that Dr. Gneh would be captured no matter which way (a particular speed and direction) to flee. It was assumed that our interpols would take action from their positions immediately after Dr. Gneh left his hideout, and be informed of his flee direction at the same time. Apparently, this was an interesting algorithm problem. Could you tell us whether this operation would be success by our given layout? If yes, what was the minimum number of interpols needed to achieve this success? Input There are multiple test cases. The first line contains a number T (1 ≤ T ≤ 100) indicating the number of test cases. In each test case, there is an integer N (1 ≤ N ≤ 1000) indicating the number of interpols on the first line. In the following N+1 lines, describe the specification of Dr. Gneh and our N interpols, and the first line for Dr. Gneh and the next N lines for interpols. On each line, three float numbers (range [1e5, 1e5]) represent the speed rate in m/s(which is none negative), x and y coordinate in meters. Output For each test case, you only need to output one single number, the minimum number of interpols to capture Dr. Gneh. If it wouldn't be success with all our interpols, output number 0 instead. Sample Input 2 4 1.0 0 0 1.0 1 0 1.0 0 1 1.0 1 0 1.0 0 1 4 2.0 0 0 1.0 1 0 1.0 0 1 1.0 1 0 1.0 0 1 Sample Output 2 0
 ISBN 的计算
 Problem Description Farmer John's cows enjoy reading books, and FJ has discovered that his cows produce more milk when they read books of a somewhat intellectual nature. He decides to update the barn library to replace all of the cheap romance novels with textbooks on algorithms and mathematics. Unfortunately, a shipment of these new books has fallen in the mud and their ISBN numbers are now hard to read. An ISBN (International Standard Book Number) is a ten digit code that uniquely identifies a book. The first nine digits represent the book and the last digit is used to make sure the ISBN is correct. To verify that an ISBN number is correct, you calculate a sum that is 10 times the first digit plus 9 times the second digit plus 8 times the third digit ... all the way until you add 1 times the last digit. If the final number leaves no remainder when divided by 11, the code is a valid ISBN. For example 0201103311 is a valid ISBN, since 10*0 + 9*2 + 8*0 + 7*1 + 6*1 + 5*0 + 4*3 + 3*3 + 2*1 + 1*1 = 55. Each of the first nine digits can take a value between 0 and 9. Sometimes it is necessary to make the last digit equal to ten; this is done by writing the last digit as X. For example, 156881111X is a valid ISBN number. Your task is to fill in the missing digit from a given ISBN number where the missing digit is represented as '?'. Input * Line 1: A single line with a ten digit ISBN number that contains '?' in a single position Output * Line 1: The missing digit (0..9 or X). Output 1 if there is no acceptable digit for the position marked '?' that gives a valid ISBN. Sample Input 15688?111X Sample Output 1
 Easier Done Than Said? 用C语言实现
 Problem Description Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computergenerated passwords (like xvtpzyo), but users have a hard time remembering them and sometimes leave them written on notes stuck to their computer. One potential solution is to generate "pronounceable" passwords that are relatively secure but still easy to remember. FnordCom is developing such a password generator. You work in the quality control department, and it's your job to test the generator and make sure that the passwords are acceptable. To be acceptable, a password must satisfy these three rules: It must contain at least one vowel. It cannot contain three consecutive vowels or three consecutive consonants. It cannot contain two consecutive occurrences of the same letter, except for 'ee' or 'oo'. (For the purposes of this problem, the vowels are 'a', 'e', 'i', 'o', and 'u'; all other letters are consonants.) Note that these rules are not perfect; there are many common/pronounceable words that are not acceptable. Input The input consists of one or more potential passwords, one per line, followed by a line containing only the word 'end' that signals the end of the file. Each password is at least one and at most twenty letters long and consists only of lowercase letters. Output For each password, output whether or not it is acceptable, using the precise format shown in the example. Sample Input a tv ptoui bontres zoggax wiinq eep houctuh end Sample Output <a> is acceptable. <tv> is not acceptable. <ptoui> is not acceptable. <bontres> is not acceptable. <zoggax> is not acceptable. <wiinq> is not acceptable. <eep> is acceptable. <houctuh> is acceptable.
 Hex Tile Equations 等式问题
 Problem Description An amusing puzzle consists of a collection of hexagonal tiles packed together with each tile showing a digit or '=' or an arithmetic operation '+', '', '*', or '/'. Consider continuous paths going through each tile exactly once, with each successive tile being an immediate neighbor of the previous tile. The object is to choose such a path so the sequence of characters on the tiles makes an acceptable equation, according to the restrictions listed below. A sequence is illustrated in each figure above. In Figure 1, if you follow the gray path from the top, the character sequence is"6/3=97". Similarly, in Figure 2, start from the bottom left 3 to get "3*21+10=73". There are a lot of potential paths through a moderate sized hex tile pattern. A puzzle player may get frustrated and want to see the answer. Your task is to automate the solution. The arrangement of hex tiles and choices of characters in each puzzle satisfy these rules: The hex pattern has an odd number of rows greater than 2. The odd numbered rows will all contain the same number of tiles. Even numbered rows will have one more hex tile than the odd numbered rows and these longer even numbered rows will stick out both to the left and the right of the odd numbered rows. 1.There is exactly one 2. '=' in the hex pattern. 3. There are no more than two '*' characters in the hex pattern. 4. There will be fewer than 14 total tiles in the hex pattern. 5.With the restrictions on allowed character sequences described below, there will be a unique acceptable solution in the hex pattern. To have an acceptable solution from the characters in some path, the expressions on each side of the equal sign must be in acceptable form and evaluate to the same numeric value. The following rules define acceptable form of the expressions on each side of the equal sign and the method of expression evaluation: 6.The operators '+', '', '*', and '/' are only considered as binary operators, so no character sequences where '+' or '' would be a unary operator are acceptable. For example "2*3=6" and "1 =5+4" are not acceptable. 7.The usual precedence of operations is not used. Instead all operations have equal precedence and operations are carried out from left to right. For example "444/2=2+3*4" is acceptable and "14=2+3*4" is not acceptable. 8.If a division operation is included, the equation can only be acceptable if the division operation works out to an exact integer result. For example "10/5=12/6" and "7+3/5=3*4/6" are acceptable. "5/2*4=10" is not acceptable because the sides would only be equal with exact mathematical calculation including an intermediate fractional result. "5/2*4=8" is not acceptable because the sides of the equation would only be equal if division were done with truncation. 9.At most two digits together are acceptable. For example, " 9. 123+1 = 124" is not acceptable. 10.A character sequences with a '0' directly followed by another digit is not acceptable. For example,"3*05=15" is not acceptable. With the assumptions above, an acceptable expression will never involve an intermediate or final arithmetic result with magnitude over three million. Input The input will consist of one to fifteen data sets, followed by a line containing only 0. The first line of a dataset contains blank separated integers r c, where r is the number of rows in the hex pattern and c is the number of entries in the odd numbered rows. The next r lines contain the characters on the hex tiles, one row per line. All hex tile characters for a row are blank separated. The lines for odd numbered rows also start with a blank, to better simulate the way the hexagons fit together. Properties 15 apply. Output There is one line of output for each data set. It is the unique acceptable equation according to rules 610 above. The line includes no spaces. Sample Input 5 1 6 / 3 = 9  7 3 3 1 + 1 * 2 0 = 3 3 7 5 2 9  * 2 = 3 4 + 8 3 4 / 0 Sample Output 6/3=97 3*21+10=73 8/4+3*92=43
 4.1springmvc返回json问题
 用的hibernate+springmvc+spring 都是4.0+的，用了jacksonannotation,jackcore,jacksondatabind,都是2.6.0版本，开启了<mvc:annotationdriven>,然而返回json总是报406：The resource identified by this request is only capable of generating responses with characteristics not acceptable according to the request "accept" headers.
 String Equations 字符串等式
 Problem Description We all understand equations such as: 3 + 8 = 4 + 7 But what happens if we look at equations with strings instead of numbers? What would addition and equality mean? Given two strings x and y, we define x + y to be the concatenation of the two strings. We also define x = y to mean that x is an anagram of y. That is, the characters in x can be permuted to form y. You are given n distinct nonempty strings, each containing at most 10 lowercase characters. You may also assume that at most 10 distinct characters appear in all the strings. You need to determine if you can choose strings to put on both sides of an equation such that the "sums" on each side are "equal" (by our definitions above). You may use each string on either side 0 or more times, but no string may be used on both sides. Input The input consists of a number of cases. Each case starts with a line containing the integer n (2 <= n <= 100). The next n lines contain the n strings. The input is terminated with n = 0. Output For each case, print either "yes" or "no" on one line indicating whether it is possible to form an equation as described above. If it is possible, print on each of the next n lines how many times each string is used, with the strings listed in the same order as the input. On each line, print the string, followed by a space, followed by the letter "L", "R", or "N" indicating whether the string appears on the left side, the right side, or neither side in the equation. Finally, this is followed by a space and an integer indicating how many times the string appears in the equation. Each numeric output should fit in a 64bit integer. If there are multiple solutions, any solution is acceptable. Sample Input 2 hello world 7 i am lord voldemort tom marvolo riddle 0 Sample Output no yes i L 1 am L 1 lord L 1 voldemort L 1 tom R 1 marvolo R 1 riddle R 1
 ISBN 程序的编写
 Problem Description Farmer John's cows enjoy reading books, and FJ has discovered that his cows produce more milk when they read books of a somewhat intellectual nature. He decides to update the barn library to replace all of the cheap romance novels with textbooks on algorithms and mathematics. Unfortunately, a shipment of these new books has fallen in the mud and their ISBN numbers are now hard to read. An ISBN (International Standard Book Number) is a ten digit code that uniquely identifies a book. The first nine digits represent the book and the last digit is used to make sure the ISBN is correct. To verify that an ISBN number is correct, you calculate a sum that is 10 times the first digit plus 9 times the second digit plus 8 times the third digit ... all the way until you add 1 times the last digit. If the final number leaves no remainder when divided by 11, the code is a valid ISBN. For example 0201103311 is a valid ISBN, since 10*0 + 9*2 + 8*0 + 7*1 + 6*1 + 5*0 + 4*3 + 3*3 + 2*1 + 1*1 = 55. Each of the first nine digits can take a value between 0 and 9. Sometimes it is necessary to make the last digit equal to ten; this is done by writing the last digit as X. For example, 156881111X is a valid ISBN number. Your task is to fill in the missing digit from a given ISBN number where the missing digit is represented as '?'. Input * Line 1: A single line with a ten digit ISBN number that contains '?' in a single position Output * Line 1: The missing digit (0..9 or X). Output 1 if there is no acceptable digit for the position marked '?' that gives a valid ISBN. Sample Input 15688?111X Sample Output 1
 It's not a Bug, It's a Feature! 具体实现
 Problem Description It is a curious fact that consumers buying a new software product generally do not expect the software to be bugfree. Can you imagine buying a car whose steering wheel only turns to the right? Or a CDplayer that plays only CDs with country music on them? Probably not. But for software systems it seems to be acceptable if they do not perform as they should do. In fact, many software companies have adopted the habit of sending out patches to fix bugs every few weeks after a new product is released (and even charging money for the patches). Tinyware Inc. is one of those companies. After releasing a new word processing software this summer, they have been producing patches ever since. Only this weekend they have realized a big problem with the patches they released. While all patches fix some bugs, they often rely on other bugs to be present to be installed. This happens because to fix one bug, the patches exploit the special behavior of the program due to another bug. More formally, the situation looks like this. Tinyware has found a total of n bugs B = {b1, b2, ..., bn} in their software. And they have released m patches p1, p2, ..., pm. To apply patch pi to the software, the bugs Bi+ in B have to be present in the software, and the bugs Bi in B must be absent (of course Bi+ ∩ Bi = Φ). The patch then fixes the bugs Fi in B (if they have been present) and introduces the new bugs Fi+ in B (where, again, Fi+ ∩ Fi = Φ). Tinyware's problem is a simple one. Given the original version of their software, which contains all the bugs in B, it is possible to apply a sequence of patches to the software which results in a bug free version of the software? And if so, assuming that every patch takes a certain time to apply, how long does the fastest sequence take? Input The input contains several product descriptions. Each description starts with a line containing two integers n and m, the number of bugs and patches, respectively. These values satisfy 1 <= n <= 20 and 1 <= m <= 100. This is followed by m lines describing the m patches in order. Each line contains an integer, the time in seconds it takes to apply the patch, and two strings of n characters each. The first of these strings describes the bugs that have to be present or absent before the patch can be applied. The ith position of that string is a ``+'' if bug bi has to be present, a ``'' if bug bi has to be absent, and a `` 0'' if it doesn't matter whether the bug is present or not. The second string describes which bugs are fixed and introduced by the patch. The ith position of that string is a ``+'' if bug bi is introduced by the patch, a ``'' if bug bi is removed by the patch (if it was present), and a ``0'' if bug bi is not affected by the patch (if it was present before, it still is, if it wasn't, is still isn't). The input is terminated by a description starting with n = m = 0. This test case should not be processed. Output For each product description first output the number of the product. Then output whether there is a sequence of patches that removes all bugs from a product that has all n bugs. Note that in such a sequence a patch may be used multiple times. If there is such a sequence, output the time taken by the fastest sequence in the format shown in the sample output. If there is no such sequence, output ``Bugs cannot be fixed.''. Print a blank line after each test case. Sample Input 3 3 1 000 00 1 00 0+ 2 0 ++ 4 1 7 00+  0 0 Sample Output Product 1 Fastest sequence takes 8 seconds. Product 2 Bugs cannot be fixed.
 Hex Tile Equations 方程问题
 Problem Description An amusing puzzle consists of a collection of hexagonal tiles packed together with each tile showing a digit or '=' or an arithmetic operation '+', '', '*', or '/'. Consider continuous paths going through each tile exactly once, with each successive tile being an immediate neighbor of the previous tile. The object is to choose such a path so the sequence of characters on the tiles makes an acceptable equation, according to the restrictions listed below. A sequence is illustrated in each figure above. In Figure 1, if you follow the gray path from the top, the character sequence is"6/3=97". Similarly, in Figure 2, start from the bottom left 3 to get "3*21+10=73". There are a lot of potential paths through a moderate sized hex tile pattern. A puzzle player may get frustrated and want to see the answer. Your task is to automate the solution. The arrangement of hex tiles and choices of characters in each puzzle satisfy these rules: The hex pattern has an odd number of rows greater than 2. The odd numbered rows will all contain the same number of tiles. Even numbered rows will have one more hex tile than the odd numbered rows and these longer even numbered rows will stick out both to the left and the right of the odd numbered rows. 1.There is exactly one 2. '=' in the hex pattern. 3. There are no more than two '*' characters in the hex pattern. 4. There will be fewer than 14 total tiles in the hex pattern. 5.With the restrictions on allowed character sequences described below, there will be a unique acceptable solution in the hex pattern. To have an acceptable solution from the characters in some path, the expressions on each side of the equal sign must be in acceptable form and evaluate to the same numeric value. The following rules define acceptable form of the expressions on each side of the equal sign and the method of expression evaluation: 6.The operators '+', '', '*', and '/' are only considered as binary operators, so no character sequences where '+' or '' would be a unary operator are acceptable. For example "2*3=6" and "1 =5+4" are not acceptable. 7.The usual precedence of operations is not used. Instead all operations have equal precedence and operations are carried out from left to right. For example "444/2=2+3*4" is acceptable and "14=2+3*4" is not acceptable. 8.If a division operation is included, the equation can only be acceptable if the division operation works out to an exact integer result. For example "10/5=12/6" and "7+3/5=3*4/6" are acceptable. "5/2*4=10" is not acceptable because the sides would only be equal with exact mathematical calculation including an intermediate fractional result. "5/2*4=8" is not acceptable because the sides of the equation would only be equal if division were done with truncation. 9.At most two digits together are acceptable. For example, " 9. 123+1 = 124" is not acceptable. 10.A character sequences with a '0' directly followed by another digit is not acceptable. For example,"3*05=15" is not acceptable. With the assumptions above, an acceptable expression will never involve an intermediate or final arithmetic result with magnitude over three million. Input The input will consist of one to fifteen data sets, followed by a line containing only 0. The first line of a dataset contains blank separated integers r c, where r is the number of rows in the hex pattern and c is the number of entries in the odd numbered rows. The next r lines contain the characters on the hex tiles, one row per line. All hex tile characters for a row are blank separated. The lines for odd numbered rows also start with a blank, to better simulate the way the hexagons fit together. Properties 15 apply. Output There is one line of output for each data set. It is the unique acceptable equation according to rules 610 above. The line includes no spaces. Sample Input 5 1 6 / 3 = 9  7 3 3 1 + 1 * 2 0 = 3 3 7 5 2 9  * 2 = 3 4 + 8 3 4 / 0 Sample Output 6/3=97 3*21+10=73 8/4+3*92=43
 The Bridges of San Mochti 代码怎么实现的呢
 Problem Description You work at a military training facility in the jungles of San Motchi. One of the training exercises is to cross a series of rope bridges set high in the trees. Every bridge has a maximum capacity, which is the number of people that the bridge can support without breaking. The goal is to cross the bridges as quickly as possible, subject to the following tactical requirements: One unit at a time! If two or more people can cross a bridge at the same time (because they do not exceed the capacity), they do so as a unit; they walk as close together as possible, and they all take a step at the same time. It is never acceptable to have two different units on the same bridge at the same time, even if they don't exceed the capacity. Having multiple units on a bridge is not tactically sound, and multiple units can cause oscillations in the rope that slow everyone down. This rule applies even if a unit contains only a single person. Keep moving! When a bridge is free, as many people as possible begin to cross it as a unit. Note that this strategy doesn't always lead to an optimal overall crossing time (it may be faster for a group to wait for people behind them to catch up so that more people can cross at once). But it is not tactically sound for a group to wait, because the people they're waiting for might not make it, and then they've not only wasted time but endangered themselves as well. Periodically the bridges are reconfigured to give the trainees a different challenge. Given a bridge configuration, your job is to calculate the minimum amount of time it would take a group of people to cross all the bridges subject to these requirements. For example, suppose you have nine people who must cross two bridges: the first has capacity 3 and takes 10 seconds to cross; the second has capacity 4 and takes 60 seconds to cross. The initial state can be represented as (9 0 0), meaning that 9 people are waiting to cross the first bridge, no one is waiting to cross the second bridge, and no one has crossed the last bridge. At 10 seconds the state is (6 3 0). At 20 seconds the state is (3 3 /3:50/ 0), where /3:50/ means that a unit of three people is crossing the second bridge and has 50 seconds left. At 30 seconds the state is (0 6 /3:40/ 0); at 70 seconds it's (0 6 3); at 130 seconds it's (0 2 7); and at 190 seconds it's (0 0 9). Thus the total minimum time is 190 seconds. Input The input consists of one or more bridge configurations, followed by a line containing two zeros that signals the end of the input. Each bridge configuration begins with a line containing a negative integer –B and a positive integer P, where B is the number of bridges and P is the total number of people that must cross the bridges. Both B and P will be at most 20. (The reason for putting –B in the input file is to make the first line of a configuration stand out from the remaining lines.) Following are B lines, one for each bridge, listed in order from the first bridge that must be crossed to the last. Each bridge is defined by two positive integers C and T, where C is the capacity of the bridge (the maximum number of people the bridge can hold), and T is the time it takes to cross the bridge (in seconds). C will be at most 5, and T will be at most 100. Only one unit, of size at most C, can cross a bridge at a time; the time required is always T, regardless of the size of the unit (since they all move as one). The end of one bridge is always close to the beginning of the next, so the travel time between bridges is zero. Output For each bridge configuration, output one line containing the minimum amount of time it will take (in seconds) for all of the people to cross all of the bridges while meeting both tactical requirements. Sample Input 1 2 5 17 1 8 3 25 2 9 3 10 4 60 3 10 2 10 3 30 2 15 4 8 1 8 4 30 2 10 1 12 0 0 Sample Output 17 75 190 145 162
 The Bridges of San Mochti 怎么实现呢
 Problem Description You work at a military training facility in the jungles of San Motchi. One of the training exercises is to cross a series of rope bridges set high in the trees. Every bridge has a maximum capacity, which is the number of people that the bridge can support without breaking. The goal is to cross the bridges as quickly as possible, subject to the following tactical requirements: One unit at a time! If two or more people can cross a bridge at the same time (because they do not exceed the capacity), they do so as a unit; they walk as close together as possible, and they all take a step at the same time. It is never acceptable to have two different units on the same bridge at the same time, even if they don't exceed the capacity. Having multiple units on a bridge is not tactically sound, and multiple units can cause oscillations in the rope that slow everyone down. This rule applies even if a unit contains only a single person. Keep moving! When a bridge is free, as many people as possible begin to cross it as a unit. Note that this strategy doesn't always lead to an optimal overall crossing time (it may be faster for a group to wait for people behind them to catch up so that more people can cross at once). But it is not tactically sound for a group to wait, because the people they're waiting for might not make it, and then they've not only wasted time but endangered themselves as well. Periodically the bridges are reconfigured to give the trainees a different challenge. Given a bridge configuration, your job is to calculate the minimum amount of time it would take a group of people to cross all the bridges subject to these requirements. For example, suppose you have nine people who must cross two bridges: the first has capacity 3 and takes 10 seconds to cross; the second has capacity 4 and takes 60 seconds to cross. The initial state can be represented as (9 0 0), meaning that 9 people are waiting to cross the first bridge, no one is waiting to cross the second bridge, and no one has crossed the last bridge. At 10 seconds the state is (6 3 0). At 20 seconds the state is (3 3 /3:50/ 0), where /3:50/ means that a unit of three people is crossing the second bridge and has 50 seconds left. At 30 seconds the state is (0 6 /3:40/ 0); at 70 seconds it's (0 6 3); at 130 seconds it's (0 2 7); and at 190 seconds it's (0 0 9). Thus the total minimum time is 190 seconds. Input The input consists of one or more bridge configurations, followed by a line containing two zeros that signals the end of the input. Each bridge configuration begins with a line containing a negative integer –B and a positive integer P, where B is the number of bridges and P is the total number of people that must cross the bridges. Both B and P will be at most 20. (The reason for putting –B in the input file is to make the first line of a configuration stand out from the remaining lines.) Following are B lines, one for each bridge, listed in order from the first bridge that must be crossed to the last. Each bridge is defined by two positive integers C and T, where C is the capacity of the bridge (the maximum number of people the bridge can hold), and T is the time it takes to cross the bridge (in seconds). C will be at most 5, and T will be at most 100. Only one unit, of size at most C, can cross a bridge at a time; the time required is always T, regardless of the size of the unit (since they all move as one). The end of one bridge is always close to the beginning of the next, so the travel time between bridges is zero. Output For each bridge configuration, output one line containing the minimum amount of time it will take (in seconds) for all of the people to cross all of the bridges while meeting both tactical requirements. Sample Input 1 2 5 17 1 8 3 25 2 9 3 10 4 60 3 10 2 10 3 30 2 15 4 8 1 8 4 30 2 10 1 12 0 0 Sample Output 17 75 190 145 162
 Jimmy’s travel plan 怎么来编写
 Problem Description Jimmy lives in a huge kingdom which contains lots of beautiful cities. He also loves traveling very much, and even would like to visit each city in the country. Jaddy, his secretary, is now helping him to plan the routes, however, Jaddy suddenly find that is quite a tough task because it is possible for Jimmy to ask route’s information toward any city. What was worth? Jaddy has to response for queries about the distance information nearly between any pair of cities due to the undeterminable starting city which Jimmy is living in when he raises a query. Because of the large scale of the whole country, Jaddy feel hopeless to archive such an impossible job, however, in order to gratify his manager, Jaddy is now looking forward to your assistance. There might be good news about Jaddy’s work: since Jimmy is very lazy and would not like to travel to a destination whose distance between the original city is larger than TWO. That means only one intermediate city among the route is acceptable (Apparently, all the connecting paths between any two cities, if exists, have the same length as ONE). But don’t be fooled: Jimmy also needs to know that how many alternative different routes are available so that he can have more options. In particular two routes were named as different if and only if there is at least one path in the two routes is distinguishable, moreover, if more than one paths exist between a particular pair of cities, they are considered as distinct. Input Input has multiple test cases. The first line of the input has a single integer T indication the number of test cases, then each test case following. For each test case, the first line contains two integers N and M indication the number of cities and paths in the country. Then M lines are following, each line contains a pair of integers A and B, separated by space, denoting an undirected path between city A and city B, all the cities are numbered from 1 to N. Then a new line contains a single integer Q, which means there are Q queries following. Each query contains a couple of integers A and B which means querying the distance and number of shortest routes between city A and B, each query occupy a single line separately. All the test cases are separated by a single blank line. You can assume that N, Q <= 100000, M <= 200000. Output For each test case, firstly output a single line contains the case number, then Q lines for the response to queries with the same order in the input. For each query, if there exists at least one routes with length no longer than TWO, then output two integer separated by a single space, the former is the distance (shortest) of routes and the later means how many different shortest routes Jimmy can choose; otherwise, output a single line contains “The pair of cities are not connected or too far away.” (quotes for clarifying). See the sample data carefully for further details. Sample Input 2 5 7 1 2 2 3 3 4 4 5 2 5 2 4 1 2 4 1 4 1 2 5 3 5 4 2 0 2 1 1 1 2 Sample Output Case #1: 2 2 1 2 2 2 1 1 Case #2: 0 1 The pair of cities are not connected or too far away.
 C语言解答，Hex Tile Equations
 Problem Description An amusing puzzle consists of a collection of hexagonal tiles packed together with each tile showing a digit or '=' or an arithmetic operation '+', '', '*', or '/'. Consider continuous paths going through each tile exactly once, with each successive tile being an immediate neighbor of the previous tile. The object is to choose such a path so the sequence of characters on the tiles makes an acceptable equation, according to the restrictions listed below. A sequence is illustrated in each figure above. In Figure 1, if you follow the gray path from the top, the character sequence is"6/3=97". Similarly, in Figure 2, start from the bottom left 3 to get "3*21+10=73". There are a lot of potential paths through a moderate sized hex tile pattern. A puzzle player may get frustrated and want to see the answer. Your task is to automate the solution. The arrangement of hex tiles and choices of characters in each puzzle satisfy these rules: The hex pattern has an odd number of rows greater than 2. The odd numbered rows will all contain the same number of tiles. Even numbered rows will have one more hex tile than the odd numbered rows and these longer even numbered rows will stick out both to the left and the right of the odd numbered rows. 1.There is exactly one 2. '=' in the hex pattern. 3. There are no more than two '*' characters in the hex pattern. 4. There will be fewer than 14 total tiles in the hex pattern. 5.With the restrictions on allowed character sequences described below, there will be a unique acceptable solution in the hex pattern. To have an acceptable solution from the characters in some path, the expressions on each side of the equal sign must be in acceptable form and evaluate to the same numeric value. The following rules define acceptable form of the expressions on each side of the equal sign and the method of expression evaluation: 6.The operators '+', '', '*', and '/' are only considered as binary operators, so no character sequences where '+' or '' would be a unary operator are acceptable. For example "2*3=6" and "1 =5+4" are not acceptable. 7.The usual precedence of operations is not used. Instead all operations have equal precedence and operations are carried out from left to right. For example "444/2=2+3*4" is acceptable and "14=2+3*4" is not acceptable. 8.If a division operation is included, the equation can only be acceptable if the division operation works out to an exact integer result. For example "10/5=12/6" and "7+3/5=3*4/6" are acceptable. "5/2*4=10" is not acceptable because the sides would only be equal with exact mathematical calculation including an intermediate fractional result. "5/2*4=8" is not acceptable because the sides of the equation would only be equal if division were done with truncation. 9.At most two digits together are acceptable. For example, " 9. 123+1 = 124" is not acceptable. 10.A character sequences with a '0' directly followed by another digit is not acceptable. For example,"3*05=15" is not acceptable. With the assumptions above, an acceptable expression will never involve an intermediate or final arithmetic result with magnitude over three million. Input The input will consist of one to fifteen data sets, followed by a line containing only 0. The first line of a dataset contains blank separated integers r c, where r is the number of rows in the hex pattern and c is the number of entries in the odd numbered rows. The next r lines contain the characters on the hex tiles, one row per line. All hex tile characters for a row are blank separated. The lines for odd numbered rows also start with a blank, to better simulate the way the hexagons fit together. Properties 15 apply. Output There is one line of output for each data set. It is the unique acceptable equation according to rules 610 above. The line includes no spaces. Sample Input 5 1 6 / 3 = 9  7 3 3 1 + 1 * 2 0 = 3 3 7 5 2 9  * 2 = 3 4 + 8 3 4 / 0 Sample Output 6/3=97 3*21+10=73 8/4+3*92=43
 Could not find acceptable representation
 ![图片说明](https://imgask.csdn.net/upload/201709/09/1504972795_771619.png) ![图片说明](https://imgask.csdn.net/upload/201709/10/1504972822_722421.png) 我用jquery的uploadify上传文件到后台，文件已经上传了的，但返回Json数据时老报错。其他返回json的方法都没报错，就这个报错，这是为啥？ Handler execution resulted in exception: Could not find acceptable representation
 String Equations 是如何实现的
 Problem Description We all understand equations such as: 3 + 8 = 4 + 7 But what happens if we look at equations with strings instead of numbers? What would addition and equality mean? Given two strings x and y, we define x + y to be the concatenation of the two strings. We also define x = y to mean that x is an anagram of y. That is, the characters in x can be permuted to form y. You are given n distinct nonempty strings, each containing at most 10 lowercase characters. You may also assume that at most 10 distinct characters appear in all the strings. You need to determine if you can choose strings to put on both sides of an equation such that the "sums" on each side are "equal" (by our definitions above). You may use each string on either side 0 or more times, but no string may be used on both sides. Input The input consists of a number of cases. Each case starts with a line containing the integer n (2 <= n <= 100). The next n lines contain the n strings. The input is terminated with n = 0. Output For each case, print either "yes" or "no" on one line indicating whether it is possible to form an equation as described above. If it is possible, print on each of the next n lines how many times each string is used, with the strings listed in the same order as the input. On each line, print the string, followed by a space, followed by the letter "L", "R", or "N" indicating whether the string appears on the left side, the right side, or neither side in the equation. Finally, this is followed by a space and an integer indicating how many times the string appears in the equation. Each numeric output should fit in a 64bit integer. If there are multiple solutions, any solution is acceptable. Sample Input 2 hello world 7 i am lord voldemort tom marvolo riddle 0 Sample Output no yes i L 1 am L 1 lord L 1 voldemort L 1 tom R 1 marvolo R 1 riddle R 1
 The Bridges of San Mochti 程序代码的实现
 Problem Description You work at a military training facility in the jungles of San Motchi. One of the training exercises is to cross a series of rope bridges set high in the trees. Every bridge has a maximum capacity, which is the number of people that the bridge can support without breaking. The goal is to cross the bridges as quickly as possible, subject to the following tactical requirements: One unit at a time! If two or more people can cross a bridge at the same time (because they do not exceed the capacity), they do so as a unit; they walk as close together as possible, and they all take a step at the same time. It is never acceptable to have two different units on the same bridge at the same time, even if they don't exceed the capacity. Having multiple units on a bridge is not tactically sound, and multiple units can cause oscillations in the rope that slow everyone down. This rule applies even if a unit contains only a single person. Keep moving! When a bridge is free, as many people as possible begin to cross it as a unit. Note that this strategy doesn't always lead to an optimal overall crossing time (it may be faster for a group to wait for people behind them to catch up so that more people can cross at once). But it is not tactically sound for a group to wait, because the people they're waiting for might not make it, and then they've not only wasted time but endangered themselves as well. Periodically the bridges are reconfigured to give the trainees a different challenge. Given a bridge configuration, your job is to calculate the minimum amount of time it would take a group of people to cross all the bridges subject to these requirements. For example, suppose you have nine people who must cross two bridges: the first has capacity 3 and takes 10 seconds to cross; the second has capacity 4 and takes 60 seconds to cross. The initial state can be represented as (9 0 0), meaning that 9 people are waiting to cross the first bridge, no one is waiting to cross the second bridge, and no one has crossed the last bridge. At 10 seconds the state is (6 3 0). At 20 seconds the state is (3 3 /3:50/ 0), where /3:50/ means that a unit of three people is crossing the second bridge and has 50 seconds left. At 30 seconds the state is (0 6 /3:40/ 0); at 70 seconds it's (0 6 3); at 130 seconds it's (0 2 7); and at 190 seconds it's (0 0 9). Thus the total minimum time is 190 seconds. Input The input consists of one or more bridge configurations, followed by a line containing two zeros that signals the end of the input. Each bridge configuration begins with a line containing a negative integer –B and a positive integer P, where B is the number of bridges and P is the total number of people that must cross the bridges. Both B and P will be at most 20. (The reason for putting –B in the input file is to make the first line of a configuration stand out from the remaining lines.) Following are B lines, one for each bridge, listed in order from the first bridge that must be crossed to the last. Each bridge is defined by two positive integers C and T, where C is the capacity of the bridge (the maximum number of people the bridge can hold), and T is the time it takes to cross the bridge (in seconds). C will be at most 5, and T will be at most 100. Only one unit, of size at most C, can cross a bridge at a time; the time required is always T, regardless of the size of the unit (since they all move as one). The end of one bridge is always close to the beginning of the next, so the travel time between bridges is zero. Output For each bridge configuration, output one line containing the minimum amount of time it will take (in seconds) for all of the people to cross all of the bridges while meeting both tactical requirements. Sample Input 1 2 5 17 1 8 3 25 2 9 3 10 4 60 3 10 2 10 3 30 2 15 4 8 1 8 4 30 2 10 1 12 0 0 Sample Output 17 75 190 145 162
 Easier Done Than Said?
 Description Password security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are often insecure. Some sites use random computergenerated passwords (like xvtpzyo), but users have a hard time remembering them and sometimes leave them written on notes stuck to their computer. One potential solution is to generate "pronounceable" passwords that are relatively secure but still easy to remember. FnordCom is developing such a password generator. You work in the quality control department, and it's your job to test the generator and make sure that the passwords are acceptable. To be acceptable, a password must satisfy these three rules: It must contain at least one vowel. It cannot contain three consecutive vowels or three consecutive consonants. It cannot contain two consecutive occurrences of the same letter, except for 'ee' or 'oo'. (For the purposes of this problem, the vowels are 'a', 'e', 'i', 'o', and 'u'; all other letters are consonants.) Note that these rules are not perfect; there are many common/pronounceable words that are not acceptable. Input The input consists of one or more potential passwords, one per line, followed by a line containing only the word 'end' that signals the end of the file. Each password is at least one and at most twenty letters long and consists only of lowercase letters. Output For each password, output whether or not it is acceptable, using the precise format shown in the example. Sample Input a tv ptoui bontres zoggax wiinq eep houctuh end Sample Output <a> is acceptable. <tv> is not acceptable. <ptoui> is not acceptable. <bontres> is not acceptable. <zoggax> is not acceptable. <wiinq> is not acceptable. <eep> is acceptable. <houctuh> is acceptable.
 这是一个关于数据结构的结构体相等问题
 ``` #include<iostream> #include<conio.h> #include<string.h> #define OK 1 #define MAXSIZE 100 using namespace std; typedef int Status; typedef struct { char name[5]; float price; }Book; typedef Book ElemType; typedef struct { ElemType *elem; int length; }SqList; Status InitList(SqList &L) { //L.elem=new ElemType[MAXSIZE]; L.elem=new ElemType[MAXSIZE]; if(!L.elem) exit(1); L.length=0; return OK; } Status GetList(SqList L,int i,ElemType &book) { if(i<1i>L.length) exit(1); else book=L.elem[i1]; return OK; } int LocateElem(SqList L,ElemType e) { int i; for( i=0;i<L.length;i++) if(L.elem[i]==e) return i+1; return 0; } int main() { SqList L; InitList(L); L.elem[0].price=0; L.length++; L.elem[1].price=1; L.length++; ElemType ceshi; GetList(L,2,ceshi); LocateElem(L,ceshi); cout<<ceshi.price; getch(); return 0; } ``` 这是我写的代码，编译后报错 Configuration: 线性表  Win32 Debug Compiling... 线性表.cpp E:\数据结构\线性表.cpp(41) : error C2784: 'bool __cdecl std::operator ==(const class std::allocator<_Ty> &,const class std::allocator<_U> &)' : could not deduce template argument for 'const class std::allocator<_Ty> &' from 'Book' E:\数据结构\线性表.cpp(41) : error C2784: 'bool __cdecl std::operator ==(const class std::istreambuf_iterator<_E,_Tr> &,const class std::istreambuf_iterator<_E,_Tr> &)' : could not deduce template argument for 'const class std::istreambuf_iterator<_ E,_Tr> &' from 'Book' E:\数据结构\线性表.cpp(41) : error C2784: 'bool __cdecl std::operator ==(const class std::reverse_iterator<_RI,_Ty,_Rt,_Pt,_D> &,const class std::reverse_iterator<_RI,_Ty,_Rt,_Pt,_D> &)' : could not deduce template argument for 'const class std::rev erse_iterator<_RI,_Ty,_Rt,_Pt,_D> &' from 'Book' E:\数据结构\线性表.cpp(41) : error C2784: 'bool __cdecl std::operator ==(const struct std::pair<_T1,_T2> &,const struct std::pair<_T1,_T2> &)' : could not deduce template argument for 'const struct std::pair<_T1,_T2> &' from 'Book' E:\数据结构\线性表.cpp(41) : error C2676: binary '==' : 'Book' does not define this operator or a conversion to a type acceptable to the predefined operator Error executing cl.exe. 线性表.exe  5 error(s), 0 warning(s) 经过测验，是查找线性表函数LocateList中的if(L.elem[i]==e)发生错误，也就是结构体匹配出现了问题，请问完成结构体匹配，代码该如何修改呢？
 130 个相见恨晚的超实用网站，一次性分享出来
 相见恨晚的超实用网站 持续更新中。。。
 字节跳动视频编解码面经
 三四月份投了字节跳动的实习（图形图像岗位），然后hr打电话过来问了一下会不会opengl，c++，shador，当时只会一点c++，其他两个都不会，也就直接被拒了。 七月初内推了字节跳动的提前批，因为内推没有具体的岗位，hr又打电话问要不要考虑一下图形图像岗，我说实习投过这个岗位不合适，不会opengl和shador，然后hr就说秋招更看重基础。我当时想着能进去就不错了，管他哪个岗呢，就同意了面试...
 win10系统安装教程（U盘PE+UEFI安装）
 一、准备工作 u盘，电脑一台，win10原版镜像（msdn官网） 二、下载wepe工具箱 极力推荐微pe（微pe官方下载） 下载64位的win10 pe，使用工具箱制作启动U盘打开软件， 选择安装到U盘（按照操作无需更改） 三、重启进入pe系统 1、关机后，将U盘插入电脑 2、按下电源后，按住F12进入启动项选择（技嘉主板是F12） 选择需要启...
 程序员必须掌握的核心算法有哪些？
 由于我之前一直强调数据结构以及算法学习的重要性，所以就有一些读者经常问我，数据结构与算法应该要学习到哪个程度呢？，说实话，这个问题我不知道要怎么回答你，主要取决于你想学习到哪些程度，不过针对这个问题，我稍微总结一下我学过的算法知识点，以及我觉得值得学习的算法。这些算法与数据结构的学习大多数是零散的，并没有一本把他们全部覆盖的书籍。下面是我觉得值得学习的一些算法以及数据结构，当然，我也会整理一些看过...
 Python——画一棵漂亮的樱花树（不同种樱花+玫瑰+圣诞树喔）
 最近翻到一篇知乎，上面有不少用Python（大多是turtle库）绘制的树图，感觉很漂亮，我整理了一下，挑了一些我觉得不错的代码分享给大家（这些我都测试过，确实可以生成） one 樱花树 动态生成樱花 效果图（这个是动态的）： 实现代码 import turtle as T import random import time # 画樱花的躯干(60,t) def Tree(branch, ...
 大学四年自学走来，这些私藏的实用工具/学习网站我贡献出来了
 大学四年，看课本是不可能一直看课本的了，对于学习，特别是自学，善于搜索网上的一些资源来辅助，还是非常有必要的，下面我就把这几年私藏的各种资源，网站贡献出来给你们。主要有：电子书搜索、实用工具、在线视频学习网站、非视频学习网站、软件下载、面试/求职必备网站。 注意：文中提到的所有资源，文末我都给你整理好了，你们只管拿去，如果觉得不错，转发、分享就是最大的支持了。 一、电子书搜索 对于大部分程序员...
 《奇巧淫技》系列python！！每天早上八点自动发送天气预报邮件到QQ邮箱
 将代码部署服务器，每日早上定时获取到天气数据，并发送到邮箱。 也可以说是一个小人工智障。 思路可以运用在不同地方，主要介绍的是思路。
 致 Python 初学者
 欢迎来到“Python进阶”专栏！来到这里的每一位同学，应该大致上学习了很多 Python 的基础知识，正在努力成长的过程中。在此期间，一定遇到了很多的困惑，对未来的学习方向感到迷茫。我非常理解你们所面临的处境。我从2007年开始接触 python 这门编程语言，从2009年开始单一使用 python 应对所有的开发工作，直至今天。回顾自己的学习过程，也曾经遇到过无数的困难，也曾经迷茫过、困惑过。开办这个专栏，正是为了帮助像我当年一样困惑的 Python 初学者走出困境、快速成长。希望我的经验能真正帮到你
 Java描述设计模式(19)：模板方法模式
 本文源码：GitHub·点这里  GitEE·点这里 一、生活场景 通常一款互联网应用的开发流程如下：业务需求，规划产品，程序开发，测试交付。现在基于模板方法模式进行该过程描述。 public class C01_InScene { public static void main(String[] args) { DevelopApp developApp = n...
 加快推动区块链技术和产业创新发展，2019可信区块链峰会在京召开
 11月8日，由中国信息通信研究院、中国通信标准化协会、中国互联网协会、可信区块链推进计划联合主办，科技行者协办的2019可信区块链峰会将在北京悠唐皇冠假日酒店开幕。 区块链技术被认为是继蒸汽机、电力、互联网之后，下一代颠覆性的核心技术。如果说蒸汽机释放了人类的生产力，电力解决了人类基本的生活需求，互联网彻底改变了信息传递的方式，区块链作为构造信任的技术有重要的价值。 1...
 C语言魔塔游戏
 很早就很想写这个，今天终于写完了。 游戏截图： 编译环境: VS2017 游戏需要一些图片，如果有想要的或者对游戏有什么看法的可以加我的QQ 2985486630 讨论 下面我来介绍一下游戏的主要功能和实现方式 首先是玩家的定义，使用结构体，这个名字是可以自己改变的 struct gamerole { char name[20] = "黑蛋"; //玩家名字 int...
 第三个java程序（表白小卡片）
 前言： 向女神表白啦，作为一个程序员，当然也有爱情啦。只不过，虽然前面两个程序都只是学习了基础的语法结构和向量哈希表。这里涉及的是Swing，awt图形用户界面和一点文件输入输出流的知识。 表白代码如下： 另附：里面的音乐和图片可以放在一个自己创建的包里面，也可以放在src里面，或者使用绝对路径。至于布局，我自己的使用的是简单的排班，简单的继承。后面的程序会慢慢实现。 ...
 8年经验面试官详解 Java 面试秘诀
 作者 胡书敏 责编  刘静 出品  CSDN（ID：CSDNnews） 本人目前在一家知名外企担任架构师，而且最近八年来，在多家外企和互联网公司担任Java技术面试官，前后累计面试了有两三百位候选人。在本文里，就将结合本人的面试经验，针对Java初学者、Java初级开发和Java开发，给出若干准备简历和准备面试的建议。 Java程序员准备和投递简历的实...
 知乎高赞：中国有什么拿得出手的开源软件产品？(整理自本人原创回答)
 知乎高赞：中国有什么拿得出手的开源软件产品？ 在知乎上，有个问题问“中国有什么拿得出手的开源软件产品（在 GitHub 等社区受欢迎度较好的）？” 事实上，还不少呢~ 本人于2019.7.6进行了较为全面的回答，对这些受欢迎的 Github 开源项目分类整理如下： 分布式计算、云平台相关工具类 1.SkyWalking，作者吴晟、刘浩杨 等等 仓库地址: apache/skywalking 更...
 化繁为简  腾讯计费高一致TDXA的实践之路
 导语：腾讯计费是孵化于支撑腾讯内部业务千亿级营收的互联网计费平台，在如此庞大的业务体量下，腾讯计费要支撑业务的快速增长，同时还要保证每笔交易不错账。采用最终一致性或离线补...
 Linux网络服务实验PXE和Kickstart的无人值守装机
 目录 一.PXE的原理 二.kickstart的原理 三.PXE与kickstart的结合使用自动装机 一.PXE的原理 PXE(preboot execute environment，预启动执行环境)是由Intel公司开发的最新技术，工作于Client/Server的网络模式，支持工作站通过网络从远端服务器下载映像，并由支持通过网络启动操作系统，再启动过程中，终端要求服务器分配IP地址...
 究竟你适不适合买Mac？
 我清晰的记得，刚买的macbook pro回到家，开机后第一件事情，就是上了淘宝网，花了500元钱，找了一个上门维修电脑的师傅，上门给我装了一个windows系统。。。。。。 表砍我。。。 当时买mac的初衷，只是想要个固态硬盘的笔记本，用来运行一些复杂的扑克软件。而看了当时所有的SSD笔记本后，最终决定，还是买个好（xiong）看（da）的。 已经有好几个朋友问我mba怎么样了，所以今天尽量客观...
 A*搜索算法概述
 编者按：本文作者奇舞团前端开发工程师魏川凯。A*搜索算法（Astar search algorithm）是一种常见且应用广泛的图搜索和寻径算法。A*搜索算法是通过使用启...
 程序员写了一个新手都写不出的低级bug，被骂惨了。
 这种新手都不会范的错，居然被一个工作好几年的小伙子写出来，差点被当场开除了。
 Java工作4年来应聘要16K最后没要,细节如下。。。
 前奏： 今天2B哥和大家分享一位前几天面试的一位应聘者，工作4年26岁，统招本科。 以下就是他的简历和面试情况。 基本情况： 专业技能： 1、 熟悉Sping了解SpringMVC、SpringBoot、Mybatis等框架、了解SpringCloud微服务 2、 熟悉常用项目管理工具：SVN、GIT、MAVEN、Jenkins 3、 熟悉Nginx、tomca...
 2020年，冯唐49岁：我给20、30岁IT职场年轻人的建议
 点击“技术领导力”关注∆每天早上8:30推送 作者Mr.K 编辑 Emma 来源技术领导力(ID：jishulingdaoli) 前天的推文《冯唐：职场人35岁以后，方法论比经验重要》，收到了不少读者的反馈，觉得挺受启发。其实，冯唐写了不少关于职场方面的文章，都挺不错的。可惜大家只记住了“春风十里不如你”、“如何避免成为油腻腻的中年人”等不那么正经的文章。 本文整理了冯...
 从顶级黑客到上市公司老板
 一看标题，很多老读者就知道我在写什么了。今天Ucloud成功上市，季昕华成为我所熟悉的朋友里又双叒叕一个成功上市的案例。我们认识大概是十五年多吧，如果没记错，第一次见面应该是2004年，...
 蓝桥杯知识点汇总：基础知识和常用算法
 文章目录基础语法部分：算法竞赛常用API：算法部分数据结构部分 此系列包含蓝桥杯绝大部分所考察的知识点，以及真题题解~ 基础语法部分： 备战蓝桥杯java（一）：一般输入输出 和 快速输入输（BufferedReader&BufferedWrite） 备战蓝桥杯java（二）：java编程规范和常用数据类型 备战蓝桥杯java（三）：常用功能符以及循环结构和分支结构 备战蓝桥杯java（四...
 作为一个程序员，CPU的这些硬核知识你必须会！
 CPU对每个程序员来说，是个既熟悉又陌生的东西？ 如果你只知道CPU是中央处理器的话，那可能对你并没有什么用，那么作为程序员的我们，必须要搞懂的就是CPU这家伙是如何运行的，尤其要搞懂它里面的寄存器是怎么一回事，因为这将让你从底层明白程序的运行机制。 随我一起，来好好认识下CPU这货吧 把CPU掰开来看 对于CPU来说，我们首先就要搞明白它是怎么回事，也就是它的内部构造，当然，CPU那么牛的一个东...
 破14亿，Python分析我国存在哪些人口危机！
 一、背景 二、爬取数据 三、数据分析 1、总人口 2、男女人口比例 3、人口城镇化 4、人口增长率 5、人口老化（抚养比） 6、各省人口 7、世界人口 四、遇到的问题 遇到的问题 1、数据分页，需要获取从19492018年数据，观察到有近20年参数：LAST20，由此推测获取近70年的参数可设置为：LAST70 2、2019年数据没有放上去，可以手动添加上去 3、将数据进行 行列转换 4、列名...
 强烈推荐10本程序员在家读的书
 很遗憾，这个春节注定是刻骨铭心的，新型冠状病毒让每个人的神经都是紧绷的。那些处在武汉的白衣天使们，尤其值得我们的尊敬。而我们这些窝在家里的程序员，能不外出就不外出，就是对社会做出的最大的贡献。 有些读者私下问我，窝了几天，有点颓丧，能否推荐几本书在家里看看。我花了一天的时间，挑选了 10 本我最喜欢的书，你可以挑选感兴趣的来读一读。读书不仅可以平复恐惧的压力，还可以对未来充满希望，毕竟苦难终将会...
 Linux自学篇——linux命令英文全称及解释
 man: Manual 意思是手册，可以用这个命令查询其他命令的用法。 pwd：Print working directory 意思是密码。 su：Swith user 切换用户，切换到root用户 cd：Change directory 切换目录 ls：List files 列出目录下的文件 ps：Process Status 进程状态 mkdir：Make directory ...
 Python实战：抓肺炎疫情实时数据，画2019nCoV疫情地图
 今天，群里白垩老师问如何用python画武汉肺炎疫情地图。白垩老师是研究海洋生态与地球生物的学者，国家重点实验室成员，于不惑之年学习python，实为我等学习楷模。先前我并没有关注武汉肺炎的具体数据，也没有画过类似的数据分布图。于是就拿了两个小时，专门研究了一下，遂成此文。
 疫情数据接口api
 返回json示例 { "errcode":0,//0标识接口正常 "data":{ "date":"20200130 07:47:23",//实时更新时间 "diagnosed":7736,//确诊人数 "suspect":12167,//疑是病例人数 "death":170,//死亡人数 "cur...
 智力题（程序员面试经典）
 NO.1 有20瓶药丸，其中19瓶装有1克/粒的药丸，余下一瓶装有1.1克/粒的药丸。给你一台称重精准的天平，怎么找出比较重的那瓶药丸？天平只能用一次。 解法 有时候，严格的限制条件有可能反倒是解题的线索。在这个问题中，限制条件是天平只能用一次。 因为天平只能用一次，我们也得以知道一个有趣的事实：一次必须同时称很多药丸，其实更准确地说，是必须从19瓶拿出药丸进行称重。否则，如果跳过两瓶或更多瓶药...