indian camp summary

experience to make 1 questions and half of the problem is not big. I heard that there are two problems in the laboratory of Soft work center, one of which is about binary tree. The interview is to speak PPT, the introduction of personal situation, the teacher will be based on the content of PPT questions, relax on the line.In short, a word, a handsome cover hundred ugly, if your resume is very strong, will naturally get a lot of teachers praise and recognition.To say a little off-topic, some te

the starting point can arrive, to relax this edge even two points, do not know why need n-1 times can relax ...FloydFeel this more violent, the direct triple loop to traverse the number of n, K cycle n times, is to see whether K this point can shorten the weight, can shortenUse the first estimate will not time out. Initialization is the addition of the read-in Edge, the d[i][i]=0SpfaAn algorithm that is seen on the net is generally slower than Dijkstra.My favorite, feel like Bellman-ford optimi

];} else {OP2 = [nsstring stringwithformat: @ "% @ % d", OP2, 1] ;}}-(ibaction) button3clicked :( ID) sender {nslog (@ "3 clicked"); If (op! = '+' Op! = '-' Op! = '*' Op! = '/') {// 1231 OP1 = [nsstring stringwithformat: @ "% @ % d", OP1, 1];} else {OP2 = [nsstring stringwithformat: @ "% @ % d", OP2, 1] ;}}-(ibaction) add :( ID) sender {op = '+' ;}- (ibaction) jieguo :( ID) sender {If (OP = '+') {// nsstring to int integer value int a1 = [OP1 intvalue]; int a2 = [OP2 intvalue]; int sum = A1 +

Today, tea continues to explain the knowledge points and precautions of C language to us. As there is no foundation, the learning progress is very slow. Although many things are hard to understand, the more difficult it is to understand, the greater the charm of programming, even if I only let the computer output a hello, I also have a sense of accomplishment, the charm of the programming world is hard to resist, today big tea gave us a question, I cannot write my skills for the moment, so I thi

Today, Shan Ge explained preprocessing, macro definition, array, and drawing, macro definition .... Compile preprocessing: the work done before the source program is compiled. It is done by the Preprocessing Program. During compilation, the system will automatically reference the Preprocessing Program to process the preprocessing commands in the source program. Preprocessing commands: commands starting. # Define is a macro definition. Before the main function, data of the function type is defi

Today, shange explained the conversion of hexadecimal and 32 keywords in C. Then I tried to calculate a conversion question. Binary Conversion to decimal 1010 = 1*2 ^ 3 + 0*2 ^ 2 + 1*2 ^ 1 + 0*2 ^ 0 = 10 Decimal to binary 10 = 10/2 remainder 0 5/2 remainder 1 2/2 remainder 0 1/2 remainder 1 1 # include Output result: A = 4B = 1C = 8D = 4.000000E = 8.000000F = 2****************G = 2.3000Program ended with exit code: 0 Summary of classes on the seco

We joined the student base camp in September 21 last year, and today we are in February, March 21, just half a year. Come on! There are too many things to talk about,... below is the contents of these articles from this year. 1. Java basic series Java basics: 41st this and super Java basics: 40th upward transformation and forced type conversion Java basics: 39th Polymorphism Java basics: 38th abstract classes and abstract methods Java basics: 37th inh

Big tea today tells us about the recursion of C language and the call of functions. You can create the source file of functions in other files and call them in the main file, you can save on multiple lines of code in the main function. Once a program fails, debugging is very convenient. You do not need to find some small errors in a large segment of code. Recursive statements are similar to loops and have judgment statements. When the judgment statement is not true, the conditions of the judgme

. Data Segment Initialize data segments (global variables, static variables) Non-initialized Data Segment The initialization data segment needs to be defined by ourselves, and should be substituted into it before running. Non-initialized data segments are entered by the system when the program is running. 3. Stack is allocated by the system itself Data is first-in-first-out (or later-in-first-out) A. Local Variables B. Return address for function calling C. Information about the called Envir

Alas, finally team up, finally can only BB, I will BB, I will not on!Team up with Xiper and chenxh.Here is a summary:Day1The first day to eat and drink enough, and then on the road, I saw a C problem in the beginning, but I dare not imagine this problem incredibly water ... And the teammate BB a bit, then jumped, look at other questions, or a blood is mine and then teammates found a problem, the theoretical complexity of the estimate, is 10e8, feeling more Xuan, and then did not do, after the fa