 bad input shape (60000, 2)

本小白在看机器学习实战时，绘制精度、召回率相对阈值的函数图时报了错。
代码如下：
from sklearn.datasets import fetch_mldata import matplotlib import matplotlib.pyplot as plt import numpy as np from sklearn.linear_model import SGDClassifier from sklearn.model_selection import StratifiedKFold from sklearn.base import clone from sklearn.model_selection import cross_val_score from sklearn.model_selection import cross_val_predict from sklearn.metrics import confusion_matrix from sklearn.metrics import precision_score,recall_score from sklearn.metrics import f1_score from sklearn.metrics import precision_recall_curve from sklearn.metrics import roc_curve from sklearn.metrics import roc_auc_score #导入部分 mnist = fetch_mldata('MNIST original') X,y = mnist["data"],mnist["target"] #显现部分 some_digit = X[36000] some_digit_image = some_digit.reshape(28,28) plt.imshow(some_digit_image,cmap=matplotlib.cm.binary,interpolation="nearest") plt.axis("off") #plt.show() #训练集和测试集 X_train,X_test,y_train,y_test=X[:60000],X[60000:],y[:60000],y[60000:] shuffle_index = np.random.permutation(60000) X_train,y_train = X_train[shuffle_index],y_train[shuffle_index] #二分分类器 y_train_5 = (y_train == 5) y_test_5 = (y_test == 5) sgd_clf = SGDClassifier(random_state=42) sgd_clf.fit(X_train,y_train_5) predict1 = sgd_clf.predict([some_digit]) print(predict1) #实施交叉验证 skfolds = StratifiedKFold(n_splits=3,random_state=42) for train_index,test_index in skfolds.split(X_train,y_train_5): clone_clf = clone(sgd_clf) X_train_folds = X_train[train_index] y_train_folds = (y_train_5[train_index]) X_test_fold = X_train[test_index] y_test_fold = (y_train_5[test_index]) clone_clf.fit(X_train_folds,y_train_folds) y_pred = clone_clf.predict(X_test_fold) n_correct = sum(y_pred == y_test_fold) print(n_correct/len(y_pred)) #kfold方法 print(cross_val_score(sgd_clf,X_train,y_train_5,cv=3,scoring="accuracy")) y_train_pred = cross_val_predict(sgd_clf,X_train,y_train_5,cv=3) #print(confusion_matrix(y_train_5,y_train_pred)) #print(precision_score(y_train_5,y_pred)) #精度 #print(recall_score(y_train_5,y_train_pred)) #召回率 #print(f1_score(y_train_5,y_pred)) #fi分数 y_scores = sgd_clf.decision_function([some_digit]) print(y_scores) #threshold = 0 #y_some_digit_pred = (y_scores>threshold) #print(y_some_digit_pred) #提高阈值 threshold = 200000 y_some_digit_pred = (y_scores>threshold) print(y_some_digit_pred) #绘制阈值函数图 y_scores = cross_val_predict(sgd_clf,X_train,y_train_5,cv=3,method="decision_function") precisions, recalls, thresholds = precision_recall_curve(y_train_5,y_scores) def plot_precison_recall_vs_threshold(precisions,recalls,thresholds): plt.plot(thresholds,precisions[:1],"b",label="Precision") plt.plot(thresholds, recalls[:1], "g", label="Recall") plt.xlabel("Threshold") plt.legend(loc="upper left") plt.ylim([0,1]) plot_precison_recall_vs_threshold(precisions,recalls,thresholds) plt.show()
报错信息如下：
Traceback (most recent call last):
File "F:/python项目/mnist.py", line 77, in
precisions, recalls, thresholds = precision_recall_curve(y_train_5,y_scores)
File "C:\Users\15701\Anaconda3\lib\sitepackages\sklearn\metrics\ranking.py", line 417, in precision_recall_curve
sample_weight=sample_weight)
File "C:\Users\15701\Anaconda3\lib\sitepackages\sklearn\metrics\ranking.py", line 304, in _binary_clf_curve
y_score = column_or_1d(y_score)
File "C:\Users\15701\Anaconda3\lib\sitepackages\sklearn\utils\validation.py", line 583, in column_or_1d
raise ValueError("bad input shape {0}".format(shape))
ValueError: bad input shape (60000, 2)不胜感激
print(y_train_5.shape) 结果为(60000,) print(y_scores.shape)结果为(60000, 2)，
print(y_scores)结果为[[ 0. 229600.48544944]
[ 0. 792845.57622101]
[ 0. 529311.13077603]
...,
[ 0. 806955.80116218]
[ 0. 199716.61091746]
[ 0. 499524.22190059]]
解决方案为： y_scores=y_score[:,1]
precision_recall_curve(y_train_5,y_scores)，这里需要的是两个1维的数组，而你传入的是二维的。
你可以输出下
print(y_train_5.shape)
print(y_scores.shape)
看看哪个不对
 其他相关推荐
 ValueError: bad input shape () 求问这个报错该怎么解决
 对着《python机器学习经典实例》打代码，发现会报错bad input shape ()。感觉问题出在最后一行，菜鸟想问下该怎么解决？非常感谢 数据如下： med,low,5more,more,med,med,good med,low,5more,more,med,high,vgood med,low,5more,more,big,low,unacc med,low,5more,more,big,med,good med,low,5more,more,big,high,vgood low,vhigh,2,2,small,low,unacc low,vhigh,2,2,small,med,unacc low,vhigh,2,2,small,high,unacc ... ``` import numpy as np import sys reload(sys) sys.setdefaultencoding('utf8') from sklearn import preprocessing from sklearn.ensemble import RandomForestClassifier #读取数据 input_path=u'/Users/zhangbei//Desktop/数据挖掘／机器学习/PythonMachineLearningCookbookmaster/Chapter02/car.data.txt' fo=open(input_path) lines=fo.readlines() x=[] for line in lines: line=line.strip() x.append(line.split(',')) x=np.array(x) #把字符串特征转换为数值 encoder=[] x_encoded=np.empty(x.shape) for i,item in enumerate(x[0]): encoder.append(preprocessing.LabelEncoder()) x_encoded[:,i]=encoder[1].fit_transform(x[:,i]) x_encoded.astype(int) x=x_encoded[:,:1] y=x_encoded[:,1] #转换测试数据 input_data=np.array(['vhigh','vhight','2','2','small','low']) data_encoded=[1]*len(input_data) print data_encoded for i,item in enumerate(input_data): data_encoded[i]=int(encoder[i].transform((input_data[i]))) ```
 Brilliant Programmers Show 代码程序编写
 Problem Description Hunan TV holds many talent shows every year, such as Happy Girls and Super Boys which attract the attention of the whole country. This year Hunan University held a new type of talent show called Brilliant Programmers. Millions of programmers had registered online and only top N most brilliant programmers got the opportunity to compete on site. The organizer had hold ten rounds of qualification contest and programmers were ranked by their total scores. The programmers who ranked after N were eliminated. The final show continued for a very long time. Initially programmers were ranked by their qualification scores. The rule was special: A challenge may be happen between exactly two adjacent ranked programmers at any time and the lower ranked one tries to solve the other’s problem. If the challenger successfully solves this problem, their ranks exchange. Otherwise their ranks remain unchanged. It is guaranteed that a programmer never involved in two challenges at the same time. The top ranked programmer at last is the champion. The show was over but… The hard disk which logs the whole progress was burned out. After data rescue, the number of successful challenges of each programmer was recovered but the final rank was disappeared forever. During the rescue some errors may occur, which lead to some wrong recovered numbers. Is the show possible at all? If it is possible, can you help to find the champion from the very limited information? Input There are multiple test cases. Each test case is described in two lines. The first line contains one integer N: the number of programmers. The second line contains a sequence of integers Ai that gives the number of successful challenges of the programmer initially ranked ith. 1 <= N <= 106, 0 <= Ai <= 109 The input will finish with the end of file. Output For each case the output contains only one line. If it is an impossible show, output “Bad Rescue”. Otherwise if the champion is uniquely determined, output the initial rank of the champion. Output “Unknown” if the champion is not sure. Sample Input 2 0 1 3 0 1 5 3 0 1 1 Sample Output 2 Bad Rescue Unknown
 Friendship 友谊的算法问题
 Description In modern society, each person has his own friends. Since all the people are very busy, they communicate with each other only by phone. You can assume that people A can keep in touch with people B, only if 1. A knows B's phone number, or 2. A knows people C's phone number and C can keep in touch with B. It's assured that if people A knows people B's number, B will also know A's number. Sometimes, someone may meet something bad which makes him lose touch with all the others. For example, he may lose his phone number book and change his phone number at the same time. In this problem, you will know the relations between every two among N people. To make it easy, we number these N people by 1,2,...,N. Given two special people with the number S and T, when some people meet bad things, S may lose touch with T. Your job is to compute the minimal number of people that can make this situation happen. It is supposed that bad thing will never happen on S or T. Input The first line of the input contains three integers N (2<=N<=200), S and T ( 1 <= S, T <= N , and S is not equal to T).Each of the following N lines contains N integers. If i knows j's number, then the jth number in the (i+1)th line will be 1, otherwise the number will be 0. You can assume that the number of 1s will not exceed 5000 in the input. Output If there is no way to make A lose touch with B, print "NO ANSWER!" in a single line. Otherwise, the first line contains a single number t, which is the minimal number you have got, and if t is not zero, the second line is needed, which contains t integers in ascending order that indicate the number of people who meet bad things. The integers are separated by a single space. If there is more than one solution, we give every solution a score, and output the solution with the minimal score. We can compute the score of a solution in the following way: assume a solution is A1, A2, ..., At (1 <= A1 < A2 <...< At <=N ), the score will be (A11)*N^t+(A21)*N^(t1)+...+(At1)*N. The input will assure that there won't be two solutions with the minimal score. Sample Input 3 1 3 1 1 0 1 1 1 0 1 1 Sample Output 1 2
 The Embarrassed Cryptographer 的程序的设计
 Problem Description The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic keys are created from the product of two primes, and are believed to be secure because there is no known method for factoring such a product effectively. What Odd Even did not think of, was that both factors in a key should be large, not just their product. It is now possible that some of the users of the system have weak keys. In a desperate attempt not to be fired, Odd Even secretly goes through all the users keys, to check if they are strong enough. He uses his very poweful Atari, and is especially careful when checking his boss' key. Input The input consists of no more than 20 test cases. Each test case is a line with the integers 4 <= K <= 10100 and 2 <= L <= 106. K is the key itself, a product of two primes. L is the wanted minimum size of the factors in the key. The input set is terminated by a case where K = 0 and L = 0. Output For each number K, if one of its factors are strictly less than the required L, your program should output "BAD p", where p is the smallest factor in K. Otherwise, it should output "GOOD". Cases should be separated by a linebreak. Sample Input 143 10 143 20 667 20 667 30 2573 30 2573 40 0 0 Sample Output GOOD BAD 11 GOOD BAD 23 GOOD BAD 31
 Mybatis Plus 的 selectOne一直报错，说sql语法有问题，然而我没有进行mapper拓展啊，咋就有问题了？
 ![图片说明](https://imgask.csdn.net/upload/202002/09/1581177656_966381.png) **第一张表（ItemType）一直报错，后面两张表没错误，我的数据库表设计没问题啊。** 上错误信息： ``` org.springframework.jdbc.BadSqlGrammarException: ### Error querying database. Cause: java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'order FROM item_type WHERE (id = 2)' at line 1 ### The error may exist in com/kuanggong/demo/mapper/ItemTypeMapper.java (best guess) ### The error may involve defaultParameterMap ### The error occurred while setting parameters ### SQL: SELECT id,pid,type_name,order FROM item_type WHERE (id = ?) ### Cause: java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'order FROM item_type WHERE (id = 2)' at line 1 ; bad SQL grammar []; nested exception is java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'order FROM item_type WHERE (id = 2)' at line 1 at org.springframework.jdbc.support.SQLErrorCodeSQLExceptionTranslator.doTranslate(SQLErrorCodeSQLExceptionTranslator.java:235) at org.springframework.jdbc.support.AbstractFallbackSQLExceptionTranslator.translate(AbstractFallbackSQLExceptionTranslator.java:72) at org.mybatis.spring.MyBatisExceptionTranslator.translateExceptionIfPossible(MyBatisExceptionTranslator.java:88) at org.mybatis.spring.SqlSessionTemplate$SqlSessionInterceptor.invoke(SqlSessionTemplate.java:440) at com.sun.proxy.$Proxy109.selectOne(Unknown Source) at org.mybatis.spring.SqlSessionTemplate.selectOne(SqlSessionTemplate.java:159) at com.baomidou.mybatisplus.core.override.MybatisMapperMethod.execute(MybatisMapperMethod.java:108) at com.baomidou.mybatisplus.core.override.MybatisMapperProxy.invoke(MybatisMapperProxy.java:96) at com.sun.proxy.$Proxy136.selectOne(Unknown Source) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:498) at org.springframework.aop.support.AopUtils.invokeJoinpointUsingReflection(AopUtils.java:343) at org.springframework.aop.framework.ReflectiveMethodInvocation.invokeJoinpoint(ReflectiveMethodInvocation.java:198) at org.springframework.aop.framework.ReflectiveMethodInvocation.proceed(ReflectiveMethodInvocation.java:163) at org.springframework.dao.support.PersistenceExceptionTranslationInterceptor.invoke(PersistenceExceptionTranslationInterceptor.java:139) at org.springframework.aop.framework.ReflectiveMethodInvocation.proceed(ReflectiveMethodInvocation.java:186) at org.springframework.aop.framework.JdkDynamicAopProxy.invoke(JdkDynamicAopProxy.java:212) at com.sun.proxy.$Proxy137.selectOne(Unknown Source) at com.kuanggong.demo.DemoApplicationTests.ceshi(DemoApplicationTests.java:55) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:498) at org.junit.runners.model.FrameworkMethod$1.runReflectiveCall(FrameworkMethod.java:50) at org.junit.internal.runners.model.ReflectiveCallable.run(ReflectiveCallable.java:12) at org.junit.runners.model.FrameworkMethod.invokeExplosively(FrameworkMethod.java:47) at org.junit.internal.runners.statements.InvokeMethod.evaluate(InvokeMethod.java:17) at org.springframework.test.context.junit4.statements.RunBeforeTestExecutionCallbacks.evaluate(RunBeforeTestExecutionCallbacks.java:74) at org.springframework.test.context.junit4.statements.RunAfterTestExecutionCallbacks.evaluate(RunAfterTestExecutionCallbacks.java:84) at org.springframework.test.context.junit4.statements.RunBeforeTestMethodCallbacks.evaluate(RunBeforeTestMethodCallbacks.java:75) at org.springframework.test.context.junit4.statements.RunAfterTestMethodCallbacks.evaluate(RunAfterTestMethodCallbacks.java:86) at org.springframework.test.context.junit4.statements.SpringRepeat.evaluate(SpringRepeat.java:84) at org.junit.runners.ParentRunner.runLeaf(ParentRunner.java:325) at org.springframework.test.context.junit4.SpringJUnit4ClassRunner.runChild(SpringJUnit4ClassRunner.java:251) at org.springframework.test.context.junit4.SpringJUnit4ClassRunner.runChild(SpringJUnit4ClassRunner.java:97) at org.junit.runners.ParentRunner$3.run(ParentRunner.java:290) at org.junit.runners.ParentRunner$1.schedule(ParentRunner.java:71) at org.junit.runners.ParentRunner.runChildren(ParentRunner.java:288) at org.junit.runners.ParentRunner.access$000(ParentRunner.java:58) at org.junit.runners.ParentRunner$2.evaluate(ParentRunner.java:268) at org.springframework.test.context.junit4.statements.RunBeforeTestClassCallbacks.evaluate(RunBeforeTestClassCallbacks.java:61) at org.springframework.test.context.junit4.statements.RunAfterTestClassCallbacks.evaluate(RunAfterTestClassCallbacks.java:70) at org.junit.runners.ParentRunner.run(ParentRunner.java:363) at org.springframework.test.context.junit4.SpringJUnit4ClassRunner.run(SpringJUnit4ClassRunner.java:190) at org.junit.runner.JUnitCore.run(JUnitCore.java:137) at com.intellij.junit4.JUnit4IdeaTestRunner.startRunnerWithArgs(JUnit4IdeaTestRunner.java:68) at com.intellij.rt.execution.junit.IdeaTestRunner$Repeater.startRunnerWithArgs(IdeaTestRunner.java:47) at com.intellij.rt.execution.junit.JUnitStarter.prepareStreamsAndStart(JUnitStarter.java:242) at com.intellij.rt.execution.junit.JUnitStarter.main(JUnitStarter.java:70) Caused by: java.sql.SQLSyntaxErrorException: You have an error in your SQL syntax; check the manual that corresponds to your MySQL server version for the right syntax to use near 'order FROM item_type WHERE (id = 2)' at line 1 at com.mysql.cj.jdbc.exceptions.SQLError.createSQLException(SQLError.java:120) at com.mysql.cj.jdbc.exceptions.SQLError.createSQLException(SQLError.java:97) at com.mysql.cj.jdbc.exceptions.SQLExceptionsMapping.translateException(SQLExceptionsMapping.java:122) at com.mysql.cj.jdbc.ClientPreparedStatement.executeInternal(ClientPreparedStatement.java:974) at com.mysql.cj.jdbc.ClientPreparedStatement.execute(ClientPreparedStatement.java:391) at com.alibaba.druid.pool.DruidPooledPreparedStatement.execute(DruidPooledPreparedStatement.java:494) at org.apache.ibatis.executor.statement.PreparedStatementHandler.query(PreparedStatementHandler.java:64) at org.apache.ibatis.executor.statement.RoutingStatementHandler.query(RoutingStatementHandler.java:79) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:498) at org.apache.ibatis.plugin.Plugin.invoke(Plugin.java:63) at com.sun.proxy.$Proxy189.query(Unknown Source) at com.baomidou.mybatisplus.core.executor.MybatisSimpleExecutor.doQuery(MybatisSimpleExecutor.java:67) at org.apache.ibatis.executor.BaseExecutor.queryFromDatabase(BaseExecutor.java:324) at org.apache.ibatis.executor.BaseExecutor.query(BaseExecutor.java:156) at com.baomidou.mybatisplus.core.executor.MybatisCachingExecutor.query(MybatisCachingExecutor.java:155) at com.baomidou.mybatisplus.core.executor.MybatisCachingExecutor.query(MybatisCachingExecutor.java:90) at org.apache.ibatis.session.defaults.DefaultSqlSession.selectList(DefaultSqlSession.java:147) at org.apache.ibatis.session.defaults.DefaultSqlSession.selectList(DefaultSqlSession.java:140) at org.apache.ibatis.session.defaults.DefaultSqlSession.selectOne(DefaultSqlSession.java:76) at sun.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at sun.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at sun.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.lang.reflect.Method.invoke(Method.java:498) at org.mybatis.spring.SqlSessionTemplate$SqlSessionInterceptor.invoke(SqlSessionTemplate.java:426) ... 47 more ```
 Running relay 的实现
 Problem Description The school trackandfield team is taking a running relay race. There are n (2<=n<=104) members in the team. In order to let everybody participate in the race, each member should run at least d (0<=d<=10) meters. Besides that, everyone can run arbitrary distance. The whole length of the track is L (1<=L<=105) meters. For the ith member in the team, if he is in a good mood, then it takes him ti seconds (1<=ti<=4×104) to run one meter. If he is in a bad mood, then it takes him si (1<=si<=4×104, 1<=ti<=si) seconds to run one meter. As the coach of the team, you can assign the running distance of each member in advance. Suppose that, it takes S seconds for the team to complete the relay race if all the members are in bad moods and it takes T seconds for the team to complete the relay race if all the members are in good moods. You do want to have a good score. But you don’t want to have a very bad score even if someone is in a bad mood. So you want to know the minimum value of T on condition that S should not be larger than W (1<=W<=2147483647). Input The input begins with a line containing an integer, indicating the number of test cases. There are no more than 100 test cases. For each case, the first line begins with four integers  the above mentioned n, d, L and W. Then n lines follow, each representing a member. Each line contains two integers s and t, meaning that the member spends s seconds to run one meter when he/she is in a bad mood, and spends t seconds to run one meter when he/she is in a good mood. Output For each test case, if you cannot find a proper way to assign the running distance of each member, output a string “No solution” in a line. Otherwise, output the minimum value of T (rounded to 2 digits after the decimal point) in a line. Sample Input 2 2 1 20 141 8 3 6 6 3 8 20 200 8 3 6 6 7 1 Sample Output 88.50 No solution
 Interesting Maze Game 迷宫的问题
 Description The Police President has recently bought a new game  the famous Ravensburger's aMAZEing Labyrinth. Now, he is really keen on it, he spends any free time playing this game. While we want the Police President during the Summit to perform much more important decisions, we need a program that would substitute him in playing the game. The game is played on the field of 7 * 7 squares with equalsized cards lying on each square. Various path patterns are drawn on the cards, these paths join arbitrary subset of the four edges of a single square. The patterns can form longer paths leading through the whole game field. When following these paths, it is possible to move from a square to its neighbouring square, if both squares contain the path pattern leading to their common edge. It is impossible to travel between squares diagonally. See the picture for a better idea about the game appearance. In the beginning of the move, the player has one game piece on some of the square cards and his/her goal is to move the piece to some other square card (target) following the valid paths. Before the walk, the player alters the maze state by inserting one extra square card into it. The extra card can only be inserted to the position at the field margin. The insertion causes the whole row or column of cards to be shifted one position further, which makes another card to fall out at the other end of the game field. (This card becomes a new extra card for the next move, but we will care of a single move only in this problem.) Since the cards with both coordinates odd are stuck firmly to the playing desk, only the even rows and columns can be shifted. Thus, the extra card can be inserted into an even row or column only. If we number rows and columns with numbers 1 to 7, there are 12 possible positions where the new card can be inserted: (1,2), (1,4), (1,6), (7,2), (7,4), (7,6), (2,1), (4,1), (6,1), (2,7), (4,7), and (6,7). For instance, insertion into the position (7,6) causes the following shift: (7,6) > (6,6) > (5,6) > (4,6) > (3,6) > (2,6) > (1,6) The extra card comes to the position (7,6) and the card formerly being at the position (1,6) is removed from the game field for the rest of the move. Before insertion, the extra card can be rotated to any of the four possible directions. No other card in the game can be rotated. This makes the total maximal number of 48 possible moves (if the extra card is asymmetric). Another important rule considers the case when the target card or the card with the player's piece appears in the row or column being shifted. In such case, the position of the piece or the target is shifted too. This makes it possible to move the target to some more appropriate place. Note that if the target is shifted away from the game (the target card falls out from the game), it is no more possible to reach it in the same move  the piece cannot leave the game field. On the other hand, if the game piece is located on the card which is moved away from the game field, the piece position is "wrapped" to the opposite end of the field, i.e., to the just inserted card. Therefore, a valid move consists of two parts: insertion of the extra card into the game (this action must always be made) and walking the path of an arbitrary length (including zero, i.e., staying on the same square). Your task is to determine, whether it is possible to reach the target in a single move. In other words, if it is possible to insert the extra card into the game and then to walk to the target position. Input The input consists of several game descriptions. The first line of each description contains four integer numbers R1, C1, R2, and C2separated with a space, 1 <= R1, C1, R2, C2 <= 7. (R1,C1) is the position (row and column) of the game piece, (R2,C2) is the position of the target. Note that these positions can sometimes be shifted during the move, as specified above. After these numbers, there is one blank line. The next three lines describe the first row of the game field. Each of these lines contains 27 characters: three for the card in the first column, one space, three characters for the card in the second column, etc. Thus, every card is represented by a square of nine (3 * 3) characters. The middle one of these nine characters is always capital letter "O". The four characters in the corners are always dots ("."). The both left and right characters are either a dot (".") or a dash (""). Dashes mean the path pattern leading to the left or right edge. The top and bottom characters are either a dot or a pipe (""). The pipe means the path pattern leading to the corresponding edge. After the first row, there is one blank line and three other lines describing the second row. Then follow one other blank line and three lines for the third row, etc. After the seventh row, there is a blank line and three other lines containing exactly three characters each. This is the description of the extra card, given in the same way as the cards in the field. The input is terminated by a line containing four zeros instead of piece and target coordinates. Output For each game, output a single line. If it is possible to insert the extra card in such a way that there is a path from the game piece to the target, print the sentence "You can win in one move.". Otherwise, print the sentence "Bad luck!". Sample Input 1 1 7 7 ... ... ... .. ... ... ... O O O .O. O O O. ... ... ... .. ... ... .. ... ... ... ... ... ... .. .O O O O O O O. .. ... ... ... ... ... ... .. ... ... ... ... ... ... .O O O O O O O. ... ... ... ... ... ... .. ... ... ... ... ... ... .. .O O O O O O O. .. ... ... ... ... ... ... .. ... ... ... ... ... ... .O O O O O O O. ... ... ... ... ... ... .. ... ... ... ... ... ... .. .O O O O O O O. .. ... ... ... ... ... ... .. ... ... ... ... ... ... .O O O O O O O. ... ... ... ... ... ... ... .. .O. .. 1 1 7 7 ... ... ... ... ... ... ... O O O O O O O. ... ... ... ... ... ... .. ... ... ... ... ... ... .. .O O O O O O O. .. ... ... ... ... ... ... .. ... ... ... ... ... ... .O O O O O O O. ... ... ... ... ... ... .. ... ... ... ... ... ... .. .O O O O O O O. .. ... ... ... ... ... ... .. ... ... ... ... ... ... .O O O O O O O. ... ... ... ... ... ... .. ... ... ... ... ... ... .. .O O O O O O O. .. ... ... ... ... ... ... .. ... ... ... ... ... ... .O O O O O O O. ... ... ... ... ... ... ... ... .O .. 0 0 0 0 Sample Output You can win in one move. Bad luck!
 Mario and Mushrooms 程序的设计
 Problem Description Mario usually relaxes himself by walking along the shady track near the Mushroom Kingdom. The evil King Koopa noticed that and placed a lot of mushroom on the road. There are two types of mushrooms, max mushrooms and bad mushrooms. The bad mushrooms will decrease Mario's HP by m points, on the other hand, max mushrooms will increase Mario's HP by one point. The mushrooms are randomly placed on the track and Mario will receive them one by one. Once Mario's HP becomes zero or below after he received a mushroom, he will die. Notice that Mario begins with HP zero, so if the first mushroom is bad, Mario will die immediately. Fortunately, if Mario receives all the mushrooms, he will be alive with HP 1. In the other words, if there are k bad mushrooms on the way, there will also be m*k+1 max mushrooms. Princess Peach wants to know the possibility for Mario staying alive. Please help her to calculate it out. Input There are several test cases. The first line contains only one integer T, denoting the number of test cases. For each test case, there is only one line including two integers: m and k, denoting the amount of points of HP the Mario will decrease if he receives a bad mushroom, and the number of bad mushrooms on the track. (1 <= m <= 1000, 1 <= k <= 1000) Output For each test case, output only real number denoting the possibility that Mario will survive if he receives all the randomly placed mushrooms one by one. The answer should be rounded to eight digits after the decimal point. Sample Input 2 1 1 60 80 Sample Output Case #1: 0.33333333 Case #2: 0.00020488
 The Embarrassed Cryptographer
 Problem Description The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic keys are created from the product of two primes, and are believed to be secure because there is no known method for factoring such a product effectively. What Odd Even did not think of, was that both factors in a key should be large, not just their product. It is now possible that some of the users of the system have weak keys. In a desperate attempt not to be fired, Odd Even secretly goes through all the users keys, to check if they are strong enough. He uses his very poweful Atari, and is especially careful when checking his boss' key. Input The input consists of no more than 20 test cases. Each test case is a line with the integers 4 <= K <= 10100 and 2 <= L <= 106. K is the key itself, a product of two primes. L is the wanted minimum size of the factors in the key. The input set is terminated by a case where K = 0 and L = 0. Output For each number K, if one of its factors are strictly less than the required L, your program should output "BAD p", where p is the smallest factor in K. Otherwise, it should output "GOOD". Cases should be separated by a linebreak. Sample Input 143 10 143 20 667 20 667 30 2573 30 2573 40 0 0 Sample Output GOOD BAD 11 GOOD BAD 23 GOOD BAD 31
 Think Positive 如何来实现的
 Problem Description It is well known, that the year on planet Eisiem has n days. Of course, some days are very good for people, while some others are just horrible. Long observations have shown for each day of the year whether this day is good for most people, or bad. The new president of the Planet Federation wants all people to be happy. He knows that good emotions have a tendency to accumulate, just like bad ones do. The New Year however is a special event and all emotions accumulated by this moment just disappear. Therefore the president wants to change the calendar on Eisiem and choose the new first day of the year, so that the positive emotions would prevail the whole year. More precisely, for all i from 1 to n let ai be 1 if ith day is good for most people and 1 if it is bad. Let sjk be the sum of ai for all days from the jth day of the year to the kth, that is: President wants to find such j to order the jth day to be the first day of the year, that sjk is positive for all k from 1 to n. Since he wants several variants to choose from, he asks you to find all such j. Since he doesn't want to get too much information at once, first of all he wants to know the number of such j. That is exactly your task. Input The input contains multiple test cases. The first line of the input is a single integer T (1 <= T <= 30) which is the number of test cases. T test cases follow, each preceded by a single blank line. The first line of each test case contains n  the number of days (1 <= n <= 200 000). Next line contains n integer numbers  ai. Output For each case, output the number of different indices j, such that sjk is positive for all k, in a single line. Sample Input 2 5 1 1 1 1 1 7 1 1 1 1 1 1 1 Sample Output 1 7
 Daizhenyang's Coin 代码的编写
 Problem Description We know that Daizhenyang is chasing a girlfriend. As we all know, whenever you chase a beautiful girl, there'll always be an opponent, or a rival. In order to take one step ahead in this chasing process, Daizhenyang decided to prove to the girl that he's better and more intelligent than any other chaser. So he arranged a simple game: Coin Flip Game. He invited the girl to be the judge. In this game, n coins are set in a row, where n is smaller than 10^8. They took turns to flip coins, to flip one coin from headup to tailup or the other way around. Each turn, one can choose 1, 2 or 3 coins to flip, but the rightmost selected must be headup before flipping operation. If one cannot make such a flip, he lost. As we all know, Daizhenyang is a very smart guy (He's famous for his 26 problems and Graph Theory Unified TheoryNetwork Flow does it all ). So he will always choose the optimal strategy to win the game. And it's a very very bad news for all the competitors. But the girl did not want to see that happen so easily, because she's not sure about her feelings towards him. So she wants to make Daizhenyang lose this game. She knows Daizhenyang will be the first to play the game. Your task is to help her determine whether her arrangement is a losable situation for Daizhenyang. For simplicity, you are only told the position of headup coins. And due to the girl's complicated emotions, the same coin may be described twice or more times. The other coins are tailup, of course. Coins are numbered from left to right, beginning with 0. Input Multiple test cases, for each test case, the first line contains only one integer n (0<=n<=100), representing the number of headup coins. The second line has n integers a1, a2 … an (0<=ak<10^8) indicating the Anth coin is head up. Output Output a line for each test case, if it's a losable situation for Daizhenyang can, print "Yes", otherwise output "No" instead. Sample Input 0 1 0 4 0 1 2 3 Sample Output Yes No Yes
 Group Travel 的问题
 Problem Description After finished the composition exam of GRE, Sigma and QK wanted to have a good rest, and then invented all member of ACMBUAA team to go to a trip. After some hard work, they find a bus for vehicle in the trip. Unfortunately, not all the people in ACMBUAA team want to go to the same place, so the bus must parking at some place. But as we know, the traffic is always bad, so they decided only parking on some place. You can assume all where they want to go is on positive number axis, and Beihang University is on the origin. There are N people on the ACMBUAA team. The ith people want to the place pi. For some reason, they didn't want the number of parking times exceed K. Because all of them are busy preparing the trip, when they realize the parkingproblem, it's too late for them to coding. So they ask you for help, can you minimize the sum of the walking distance for all the people? Input Input includes multiple cases. First line is the number of case t. For each case: The first line contain two integer number N,K (0<K<=N<=3000). The second line contains N numbers, which means pi(0<=pi<=10^5) mentioned before. Output For each case: Output an integer number. It is the minimal sum of the walking distance for all the people. Sample Input 2 3 1 1 11 21 6 2 1 2 4 11 12 14 Sample Output 20 6
 Computational Geometry? 几何的计算
 Problem Description Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. It often comes up with charming shapes and ideas. In this problem, our poor princess is trapped in a castle by some bad guys again, yeah, again. So, let's seize the chance to be a hero. Right now, the beautiful princess is in the original point of a Cartesian coordinate system, for simplification, the castle is treated as a coordinate system, like a common computational geometry problem. There is a bomb which can be exploded anytime, and it locates at (Xo, Yo) in the castle. To save the princess, we need design a route for her to leave away the bomb as far as possible. But she already has a plan written on her notebook, which contains some vectors, and she insists on escaping in the vectors’ direction one by one, that is, if she is in point(0, 0), and the vector is (X, Y), she will be in point(X, Y) if she escapes in this vector. You get her notebook now, and find princess's plan is a not a good plan sometimes. Then you decide to help the princess to make some slight modification, you can change the order of those vectors, and/or reverse some vectors, that is, change vector (X, Y) to vector (X, Y). We want to know the maximum distance to the bomb after modification. Input The first line contains a single integer T, indicating the number of test cases. Each test case begins with three integers N, Xo, Yo. Then N lines following, each line contains two integers, Xi and Yi, indicating a vector. Technical Specification 1. 1 <= T <= 100 2. 1 <= N <= 100 3. 100 <= Xi, Yi <= 100 4. 10 000 <= Xo, Yo <= 10 000 Output For each test case, output the case number first, then the distance rounded to three fractional digits. Sample Input 3 1 1 1 1 1 2 2 3 1 2 1 2 3 3 0 2 3 3 2 1 1 Sample Output Case 1: 2.828 Case 2: 7.000 Case 3: 9.849
 Escape 如何来实现呢
 Problem Description The students of the HEU are maneuvering for their military training. The red army and the blue army are at war today. The blue army finds that Little A is the spy of the red army, so Little A has to escape from the headquarters of the blue army to that of the red army. The battle field is a rectangle of size m*n, and the headquarters of the blue army and the red army are placed at (0, 0) and (m, n), respectively, which means that Little A will go from (0, 0) to (m, n). The picture below denotes the shape of the battle field and the notation of directions that we will use later. The blue army is eager to revenge, so it tries its best to kill Little A during his escape. The blue army places many castles, which will shoot to a fixed direction periodically. It costs Little A one unit of energy per second, whether he moves or not. If he uses up all his energy or gets shot at sometime, then he fails. Little A can move north, south, east or west, one unit per second. Note he may stay at times in order not to be shot. To simplify the problem, let’s assume that Little A cannot stop in the middle of a second. He will neither get shot nor block the bullet during his move, which means that a bullet can only kill Little A at positions with integer coordinates. Consider the example below. The bullet moves from (0, 3) to (0, 0) at the speed of 3 units per second, and Little A moves from (0, 0) to (0, 1) at the speed of 1 unit per second. Then Little A is not killed. But if the bullet moves 2 units per second in the above example, Little A will be killed at (0, 1). Now, please tell Little A whether he can escape. Input For every test case, the first line has four integers, m, n, k and d (2<=m, n<=100, 0<=k<=100, m+ n<=d<=1000). m and n are the size of the battle ground, k is the number of castles and d is the units of energy Little A initially has. The next k lines describe the castles each. Each line contains a character c and four integers, t, v, x and y. Here c is ‘N’, ‘S’, ‘E’ or ‘W’ giving the direction to which the castle shoots, t is the period, v is the velocity of the bullets shot (i.e. units passed per second), and (x, y) is the location of the castle. Here we suppose that if a castle is shot by other castles, it will block others’ shots but will NOT be destroyed. And two bullets will pass each other without affecting their directions and velocities. All castles begin to shoot when Little A starts to escape. Proceed to the end of file. Output If Little A can escape, print the minimum time required in seconds on a single line. Otherwise print “Bad luck!” without quotes. Sample Input 4 4 3 10 N 1 1 1 1 W 1 1 3 2 W 2 1 2 4 4 4 3 10 N 1 1 1 1 W 1 1 3 2 W 1 1 2 4 Sample Output 9 Bad luck!
 The Embarrassed Cryptographer 代码的写法
 Problem Description The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic keys are created from the product of two primes, and are believed to be secure because there is no known method for factoring such a product effectively. What Odd Even did not think of, was that both factors in a key should be large, not just their product. It is now possible that some of the users of the system have weak keys. In a desperate attempt not to be fired, Odd Even secretly goes through all the users keys, to check if they are strong enough. He uses his very poweful Atari, and is especially careful when checking his boss' key. Input The input consists of no more than 20 test cases. Each test case is a line with the integers 4 <= K <= 10100 and 2 <= L <= 106. K is the key itself, a product of two primes. L is the wanted minimum size of the factors in the key. The input set is terminated by a case where K = 0 and L = 0. Output For each number K, if one of its factors are strictly less than the required L, your program should output "BAD p", where p is the smallest factor in K. Otherwise, it should output "GOOD". Cases should be separated by a linebreak. Sample Input 143 10 143 20 667 20 667 30 2573 30 2573 40 0 0 Sample Output GOOD BAD 11 GOOD BAD 23 GOOD BAD 31
 How Many Answers Are Wrong 计算统计
 Problem Description TT and FF are ... friends. Uh... very very good friends ________b FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should write down a sequence of integers_!!(bored). Then, FF can choose a continuous subsequence from it(for example the subsequence from the third to the fifth integer inclusively). After that, FF will ask TT what the sum of the subsequence he chose is. The next, TT will answer FF's question. Then, FF can redo this process. In the end, FF must work out the entire sequence of integers. Boring~~Boring~~a very very boring game!!! TT doesn't want to play with FF at all. To punish FF, she often tells FF the wrong answers on purpose. The bad boy is not a fool man. FF detects some answers are incompatible. Of course, these contradictions make it difficult to calculate the sequence. However, TT is a nice and lovely girl. She doesn't have the heart to be hard on FF. To save time, she guarantees that the answers are all right if there is no logical mistakes indeed. What's more, if FF finds an answer to be wrong, he will ignore it when judging next answers. But there will be so many questions that poor FF can't make sure whether the current answer is right or wrong in a moment. So he decides to write a program to help him with this matter. The program will receive a series of questions from FF together with the answers FF has received from TT. The aim of this program is to find how many answers are wrong. Only by ignoring the wrong answers can FF work out the entire sequence of integers. Poor FF has no time to do this job. And now he is asking for your help~(Why asking trouble for himself~~Bad boy) Input Line 1: Two integers, N and M (1 <= N <= 200000, 1 <= M <= 40000). Means TT wrote N integers and FF asked her M questions. Line 2..M+1: Line i+1 contains three integer: Ai, Bi and Si. Means TT answered FF that the sum from Ai to Bi is Si. It's guaranteed that 0 < Ai <= Bi <= N. You can assume that any sum of subsequence is fit in 32bit integer. Output A single line with a integer denotes how many answers are wrong. Sample Input 10 5 1 10 100 7 10 28 1 3 32 4 6 41 6 6 1 Sample Output 1
 Bad Wiring
 Problem Description The ninja Ryu has infiltrated the Shadow Clan fortress and finds himself in a long hallway. Although ninjas are excellent fighters, they primarily rely on stealth to complete their missions. However, many lights are turned on in the hallway, and this way it will not take long before Ryu is spotted by a guard. To remain unseen, Ryu will need to turn off all the lights as quickly as possible. The hallway contains a sequence of n lights L1......Ln. Some of these lights are turned on. Destroying the lights with his shurikens would be too loud, so he needs to turn them off the oldfashioned way, using light switches. Luckily, there is a switch box nearby with a light switch Si for every light Li. However, after trying one of the switches, he notices something funny. When he ips the switch Si, it does not only turn on/off light Li, but also some of the neighboring lights. Ryu notices that there is a parameter D such that ipping switch Si turns on/off all the lights L(iD)......L(i+D), if they exist(This means that S1 turns on/off all the lights L1 ......L(D+1) and Sn turns on/off all the lights L(nD)......Ln. Of course, if D>=n, then L(D+1) and L(nD) will not exist either.). Turning on or off lights can attract the attention of the guards, so Ryu would like to turn off all the lights with the minimum number of times ipping a switch. Can you help him out? Input The first line of the input contains a single number: the number of test cases to follow. Each test case has the following format: 1.One line with two integers n (1 <= n <= 100) and D (0 <= D <= 15): the number of lights and the parameter mentioned above. 2.One line with n integers. The i(th) integer describes the current state of light Li, where 0 means off and 1 means on. Output For every test case in the input, the output should contain one integer on a single line: the minimum number of times Ryu needs to flip a switch to turn off all the lights. If it is impossible to turn off all the lights, then output the string "impossible" instead. In the first example below,flipping switch S4 followed by S7 will turn off all the lights. Sample Input 2 7 3 1 1 1 0 0 0 0 5 1 1 0 1 0 1 Sample Output 2 3
 Math Geek 实现的步骤
 Problem Description Sheldon's board has been changed! Someone drew a N * N grid on his board. Although he has no idea who's the bad guy, but as a math geek, he decide to play a game on it. He will fill in the grids with integer 1 to N*N. And the sum of each row, each column and each diagonal are distinct (2N+2 distinct integers in total). Input The first line contains a single positive integer T( T <= 200 ), indicates the number of test cases. For each test case: an integer N (3 <= N <= 200). Output For each test case: output the case number as shown and an N * N matrix. The output must contains N+1 lines, or you maybe get wrong answer because of special judge. The numbers in each line must be separated by a blankspace or a tab. leading and trailing blankspace will be ignored. Sample Input 2 3 4 Sample Output Case #1: 7 5 2 1 4 8 3 6 9 Case #2: 2 8 15 1 5 12 10 16 6 9 4 14 3 7 11 13
 Persistent Bits 实现
 Problem Description WhatNext Software creates sequence generators that they hope will produce fairly random sequences of 16bit unsigned integers in the range 0–65535. In general a sequence is specified by integers A, B, C, and S, where 1 ≤ A < 32768, 0 ≤ B < 65536, 2 ≤ C < 65536, and 0 ≤ S < C. S is the first element (the seed) of the sequence, and each later element is generated from the previous element. If X is an element of the sequence, then the next element is (A * X + B) % C where '%' is the remainder or modulus operation. Although every element of the sequence will be a 16bit unsigned integer less than 65536, the intermediate result A * X + B may be larger, so calculations should be done with a 32bit int rather than a 16bit short to ensure accurate results. Some values of the parameters produce better sequences than others. The most embarrassing sequences to WhatNext Software are ones that never change one or more bits. A bit that never changes throughout the sequence is persistent. Ideally, a sequence will have no persistent bits. Your job is to test a sequence and determine which bits are persistent. For example, a particularly bad choice is A = 2, B = 5, C = 18, and S = 3. It produces the sequence 3, (2*3+5)%18 = 11, (2*11+5)%18 = 9, (2*9+5)%18 = 5, (2*5+5)%18 = 15, (2*15+5)%18 = 17, then (2*17+5)%18 = 3 again, and we're back at the beginning. So the sequence repeats the the same six values over and over: Decimal 16Bit Binary 3 0000000000000011 11 0000000000001011 9 0000000000001001 5 0000000000000101 15 0000000000001111 17 0000000000010001 overall 00000000000????1 The last line of the table indicates which bit positions are always 0, always 1, or take on both values in the sequence. Note that 12 of the 16 bits are persistent. (Good random sequences will have no persistent bits, but the converse is not necessarily true. For example, the sequence defined by A = 1, B = 1, C = 64000, and S = 0 has no persistent bits, but it's also not random: it just counts from 0 to 63999 before repeating.) Note that a sequence does not need to return to the seed: with A = 2, B = 0, C = 16, and S = 2, the sequence goes 2, 4, 8, 0, 0, 0, .... Input There are from one to sixteen datasets followed by a line containing only 0. Each dataset is a line containing decimal integer values for A, B, C, and S, separated by single blanks. Output There is one line of output for each data set, each containing 16 characters, either '1', '0', or '?' for each of the 16 bits in order, with the most significant bit first, with '1' indicating the corresponding bit is always 1, '0' meaning the corresponding bit is always 0, and '?' indicating the bit takes on values of both 0 and 1 in the sequence. Sample Input 2 5 18 3 1 1 64000 0 2 0 16 2 256 85 32768 21845 1 4097 32776 248 0 Sample Output 00000000000????1 ???????????????? 000000000000???0 0101010101010101 0???000011111???
 130 个相见恨晚的超实用网站，一次性分享出来
 相见恨晚的超实用网站 持续更新中。。。
 我花了一夜用数据结构给女朋友写个H5走迷宫游戏
 起因 又到深夜了，我按照以往在csdn和公众号写着数据结构！这占用了我大量的时间！我的超越妹妹严重缺乏陪伴而 怨气满满！ 而女朋友时常埋怨，认为数据结构这么抽象难懂的东西没啥作用，常会问道：天天写这玩意，有啥作用。而我答道：能干事情多了，比如写个迷宫小游戏啥的！ 当我码完字准备睡觉时：写不好别睡觉！ 分析 如果用数据结构与算法造出东西来呢？ ...
 字节跳动视频编解码面经
 三四月份投了字节跳动的实习（图形图像岗位），然后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） 选择需要启...
 大学四年自学走来，这些私藏的实用工具/学习网站我贡献出来了
 大学四年，看课本是不可能一直看课本的了，对于学习，特别是自学，善于搜索网上的一些资源来辅助，还是非常有必要的，下面我就把这几年私藏的各种资源，网站贡献出来给你们。主要有：电子书搜索、实用工具、在线视频学习网站、非视频学习网站、软件下载、面试/求职必备网站。 注意：文中提到的所有资源，文末我都给你整理好了，你们只管拿去，如果觉得不错，转发、分享就是最大的支持了。 一、PDF搜索网站推荐 对于大部
 《奇巧淫技》系列python！！每天早上八点自动发送天气预报邮件到QQ邮箱
 此博客仅为我业余记录文章所用，发布到此，仅供网友阅读参考，如有侵权，请通知我，我会删掉。 补充 有不少读者留言说本文章没有用，因为天气预报直接打开手机就可以收到了，为何要多此一举发送到邮箱呢！！！那我在这里只能说：因为你没用，所以你没用！！！ 这里主要介绍的是思路，不是天气预报！不是天气预报！！不是天气预报！！！天气预报只是用于举例。请各位不要再刚了！！！ 下面是我会用到的两个场景： 每日下
 致 Python 初学者
 欢迎来到“Python进阶”专栏！来到这里的每一位同学，应该大致上学习了很多 Python 的基础知识，正在努力成长的过程中。在此期间，一定遇到了很多的困惑，对未来的学习方向感到迷茫。我非常理解你们所面临的处境。我从2007年开始接触 python 这门编程语言，从2009年开始单一使用 python 应对所有的开发工作，直至今天。回顾自己的学习过程，也曾经遇到过无数的困难，也曾经迷茫过、困惑过。开办这个专栏，正是为了帮助像我当年一样困惑的 Python 初学者走出困境、快速成长。希望我的经验能真正帮到你
 Linux(服务器编程):15两种高效的事件处理模式（reactor模式、proactor模式）
 前言 同步I/O模型通常用于实现Reactor模式 异步I/O模型则用于实现Proactor模式 最后我们会使用同步I/O方式模拟出Proactor模式 一、Reactor模式 Reactor模式特点 它要求主线程（I/O处理单元）只负责监听文件描述符上是否有事件发生，有的话就立即将时间通知工作线程（逻辑单元）。除此之外，主线程不做任何其他实质性的工作 读写数据，接受新的连接，以及处...
 HAL 硬件抽象层介绍
 和你一起终身学习，这里是程序员Android本篇文章主要介绍Android开发中的部分知识点，通过阅读本篇文章，您将收获以下内容:和你一起终身学习，这里是程序员 Android本篇文章主要介绍Android开发中的部分知识点，通过阅读本篇文章，您将收获以下内容:一、HAL 概述一、HAL 概述HAL定义了供硬件供应商实施的标准接口，该接口使Android无需考虑底层驱动程序的实现。使用HA...
 加快推动区块链技术和产业创新发展，2019可信区块链峰会在京召开
 11月8日，由中国信息通信研究院、中国通信标准化协会、中国互联网协会、可信区块链推进计划联合主办，科技行者协办的2019可信区块链峰会将在北京悠唐皇冠假日酒店开幕。 区块链技术被认为是继蒸汽机、电力、互联网之后，下一代颠覆性的核心技术。如果说蒸汽机释放了人类的生产力，电力解决了人类基本的生活需求，互联网彻底改变了信息传递的方式，区块链作为构造信任的技术有重要的价值。 1
 8年经验面试官详解 Java 面试秘诀
 作者  胡书敏 责编  刘静 出品  CSDN（ID：CSDNnews） 本人目前在一家知名外企担任架构师，而且最近八年来，在多家外企和互联网公司担任Java技术面试官，前后累计面试了有两三百位候选人。在本文里，就将结合本人的面试经验，针对Java初学者、Java初级开发和Java开发，给出若干准备简历和准备面试的建议。 Java程序员准备和投递简历的实
 知乎高赞：中国有什么拿得出手的开源软件产品？(整理自本人原创回答)
 知乎高赞：中国有什么拿得出手的开源软件产品？ 在知乎上，有个问题问“中国有什么拿得出手的开源软件产品（在 GitHub 等社区受欢迎度较好的）？” 事实上，还不少呢~ 本人于2019.7.6进行了较为全面的 回答  Bravo Yeung，获得该问题下回答中得最高赞(236赞和1枚专业勋章)，对这些受欢迎的 Github 开源项目分类整理如下： 分布式计算、云平台相关工具类 1.SkyWalk
 致 Python 初学者们！
 作者  许向武 责编  屠敏 出品  CSDN 博客 前言 在 Python 进阶的过程中，相信很多同学应该大致上学习了很多 Python 的基础知识，也正在努力成长。在此期间，一定遇到了很多的困惑，对未来的学习方向感到迷茫。我非常理解你们所面临的处境。我从2007年开始接触 Python 这门编程语言，从2009年开始单一使用 Python 应对所有的开发工作，直至今
 究竟你适不适合买Mac？
 我清晰的记得，刚买的macbook pro回到家，开机后第一件事情，就是上了淘宝网，花了500元钱，找了一个上门维修电脑的师傅，上门给我装了一个windows系统。。。。。。 表砍我。。。 当时买mac的初衷，只是想要个固态硬盘的笔记本，用来运行一些复杂的扑克软件。而看了当时所有的SSD笔记本后，最终决定，还是买个好（xiong）看（da）的。 已经有好几个朋友问我mba怎么样了，所以今天尽量客观...
 使用 Angular 打造微前端架构的 ToB 企业级应用
 这篇文章其实已经准备了11个月了，因为虽然我们年初就开始使用 Angular 的微前端架构，但是产品一直没有正式发布，无法通过生产环境实践验证可行性，11月16日我们的产品正式灰度发布，所以是时候分享一下我们在使用 Angular 微前端这条路上的心得（踩过的坑）了额，希望和 Angular 社区一起成长一起进步，如果你对微前端有一定的了解并且已经在项目中尝试了可以忽略前面的章节。 什么是微前...
 大学四年因为知道了这32个网站，我成了别人眼中的大神！
 依稀记得，毕业那天，我们导员发给我毕业证的时候对我说“你可是咱们系的风云人物啊”，哎呀，别提当时多开心啦????，嗯，我们导员是所有导员中最帅的一个，真的???? 不过，导员说的是实话，很多人都叫我大神的，为啥，因为我知道这32个网站啊，你说强不强????，这次是绝对的干货，看好啦，走起来！ PS：每个网站都是学计算机混互联网必须知道的，真的牛杯，我就不过多介绍了，大家自行探索，觉得没用的，尽管留言吐槽吧???? 社...
 拿下微软、Google、Adobe，印度为何盛产科技圈 CEO？
 作者  胡巍巍 出品  CSDN（ID：CSDNnews） 世界500强中，30%的掌舵人，都是印度人。 是的，你没看错。这是近日《哈佛商业评论》的研究结果。 其中又以微软CEO萨提亚·纳德拉（Satya Nadella）、和谷歌CEO桑达尔·皮查伊（Sundar Pichai，以下简称劈柴）最为出名。 微软CEO萨提亚·纳德拉（Satya Nadella） 其他著名印度...
 Linux(内核剖析):19中断总体概述
 一、为什么要引入中断？ 任何操作系统内核的核心任务，都包含有对连接到计算机上的硬件设备进行有效管理，如硬盘、蓝光碟机、键盘、鼠标、3D 处理器，以及无线电等。而想要管理这些设备，首先要能和它们互通音信才行。众所周知，处理器的速度跟外围硬件设备的速度往往不在一个数量级上，因此，如果内核采取让处理器向硬件发出一个请求，然后专门等待回应的办法，显然差强人意。既然硬件的响应这么慢，那么内核就应该在此期间...
 程序员写了一个新手都写不出的低级bug，被骂惨了。
 这种新手都不会范的错，居然被一个工作好几年的小伙子写出来，差点被当场开除了。
 Java工作4年来应聘要16K最后没要,细节如下。。。
 前奏： 今天2B哥和大家分享一位前几天面试的一位应聘者，工作4年26岁，统招本科。 以下就是他的简历和面试情况。 基本情况： 专业技能： 1、 熟悉Sping了解SpringMVC、SpringBoot、Mybatis等框架、了解SpringCloud微服务 2、 熟悉常用项目管理工具：SVN、GIT、MAVEN、Jenkins 3、 熟悉Nginx、tomca...
 深度学习笔记卷积神经网络
 深度学习笔记卷积神经网络
 一文带你入门Linux
 文章目录1.1 Linux的概述：1.1.1 什么是Linux：1.1.1.1 学习Linux之前先了解Unix1.1.1.2 Linux的概述：1.1.1.3 Linux的历史：1.1.1.4 Linux系统的应用：1.1.1.5 Linux的版本1.1.1.6 Linux的主流版本1.2 Linux的安装：1.2.1 虚拟机安装：1.2.1.1 什么是虚拟机1.2.1.2 安装VmWare1....
 普通三本毕业，我怎么一路艰辛进入阿里的
 英雄不问出处？ 自古以来就有这样一句话，真的英雄不问出处吗？这句话太挫了。普通三本院校的我，大四的时候居然都不知道什么是校招，所以出处太重要了。这也是没有机会参加阿里校招的原因，毕竟校招门槛比社招还是要低的，最重要的是校招进入阿里能让你的起点比别人更高。 有幸可以社招进入阿里，了解了校招的思路，赶紧介绍给学弟们，现在我们三本院校的小学弟今年居然有 3 个人通过了阿里的校招。下面我也把这份宝贵的经...
 作为一个程序员，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 本我最喜欢的书，你可以挑选感兴趣的来读一读。读书不仅可以平复恐惧的压力，还可以对未来充满希望，毕竟苦难终将会...
 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瓶拿出药丸进行称重。否则，如果跳过两瓶或更多瓶药...
 疫情防控，开发者集结出战！
 作者  屠敏出品  CSDN（ID：CSDNnews）2020 年伊始，病毒肆虐，人心惶惶。截止北京时间 1 月 31 日 15 时 30 分，全国确诊新型冠状病毒肺炎的数字已达到了...
相似问题

1
 误删了glibc，centos下报错bash: /bin/ls: /lib64/ldlinuxx8664.so.2: bad ELF interpreter: No such file or directory