C++

#include using namespace Std;int main () {Int J; int i;int k;int a[100][100]={0};for (i = 1; iA[i][0]=i;for (j = 1; jA[0][j]=j;for (i = 1; i for (j = 1; J A[I][J] = A[i][0]*a[0][j];k= A[i][j];if (a[i][j]>9)A[I][J] = k/10 + k% 10;if (A[i][j] > 9) {k =

Tomorrow multi-benefit network side, in the evening wrote a simple list of flip program to find the feeling, two ideas to achieve. One is to flip through the head interpolation method, and the other is to implement it by changing the pointer point

Sun Xin MFC Study Notes 14: Network Programming and mfc Study Notes1. OSI 2. Relationship between TCP/IP and OSI 3. Socket 4. Client/Server mode 5. Windows Sockets 6. Socket Type 7. connection-oriented socket programming 8.

LeetCode | minimum path andGiven a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[[2],[3, 4],[6, 5, 7],[4, 1, 8, 3]]The minimum path sum

HLJOJ1214 (Shortest Path)   1214: Around the worldTime Limit: 1 Sec Memory Limit: 128 MB Submit: 12 Solved: 2 [Submit] [Status] [Web Board] Description Now there are N cities on the map (your city number is 1), but your car tank capacity is

Compile OpenSSL notes for Windows and compile openssl notes OpenSSL coding process in Window 1. Download ActivePerl-5.12.4.1205, openssl-0.9.8, configure Perl environment variables, unzip openssl-0.9.82. Go to CMD and enter the VS2008/VS2010 command

[LeetCode] Fraction to Recurring Decimal  Fraction to Recurring Decimal Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repeating, enclose the repeating

Fzu 2186 James's maze (State compression dp + bfs)Resolution: I read the code of other people on the network to understand how to do it.First use BFS to calculate the distance between each point and other points, that is, the shortest circuit

Ultraviolet A-10125-Sumsets (violent enumeration + STL)       Idea: the idea at the beginning was to enumerate O (n3) with brute force, and I felt that it would time out. But I tried to repeat it. I used the set in STL to find the last number, it

Ultraviolet A 10130 SuperSale (01 backpack)The data in each group includes two parts: 1) the value and weight of the goods 2) the maximum negative weight of each person. The greatest value that these people can take away. Solution: note that there

BZOJ 3620 seems to have seen it in a dream. KMP + violence Given A string, find the number of substrings in the string that meet the requirements of this substring, which can be split into ABA forms. | A |> = k, | B |> = 1 In my dream, I think

[LeetCode 129] Sum Root to Leaf Numbers     Import java. util. optional list;/*** Given a binary tree containing digits from 0-9 only, each root-to-leaf path cocould represent a number. an example is the root-to-leaf path 1-> 2-> 3 which represents

[LeetCode] Rotate List Given a list, rotate the list to the right by k places, where k is non-negative. For example:Given 1-> 2-> 3-> 4-> 5-> NULL and k = 2,Return 4-> 5-> 1-> 2-> 3-> NULL. This question requires that the single-chain table

Uvalive 4328 (Greedy) N couples want to have a wedding, and a priest needs to hold a ceremony at all weddings. Each ceremony must take more than half of the wedding time and cannot be interrupted, given the start time and end time for n weddings,

Algorithm learning-bitmap implementation (c ++)BitMap Introduction Here, BitMap refers to storing data in a data structure in bit.Each user has only two values: 0 and 1. If it is 0, it indicates that the value does not exist. If it is 1, it

Hdu4277 dfs + set    Problem Description Like everyone, cows enjoy variety. Their current fancy is new shapes for pastures. The old rectangular shapes are out of favor; new geometries are the favorite. I. m. hei, the lead cow pasture regular ect, is

FZU Problem 2183 simple question (string processing)FZU Problem 2183 simple question Problem Description There are some simple compressed strings. For example, a [120] represents 120. For the string acb [3] d [5] e Now we will give you two strings,

Interaction between C ++ and JavaScript in IWebbrowser2JS calls C ++ The interaction between C ++ and JS in IWebbrowser2 mainly processes two interfaces in IDispatch. 1. GetIDsOfNames Here, we mainly compile a code for calling the JS function. Why

Ultraviolet A 10655 Contemplation! Algebra (matrix fast power) Given the valueA + BAndABYou will have to find the valueAn + bn  Input The input file contains several lines of inputs. Each line does t the last line contains3Non-negative

[LeetCode] Surrounded Regions, problem solving reportDirectory Directory preface topic ideas external DFS ideas 2_BFS Preface In the past two days, to solve the problem that Android Rom is adapted to the underlying layer, it stays up till 2 o'clock