lpic 2 training

Test instructions: There is a ring with a length of L, some apples on the ring, a maximum of k apples at a time, ask the shortest distance that all apples are taken.Idea: Greedy plus DP.First of all, if the ring from the point of the cut, then only need to greedy on both sides, and now connected together, then there is a possibility, that is, around the ring for a week to get the apple this solution.It is not difficult to prove that, at most, it is possible to circle only once, because the loop

Delicious Apples problem ' s Link: http://acm.hdu.edu.cn/showproblem.php?pid=5303 Mean:The number of n apples is planted on a ring road long as L.The position of the first Apple number is in XI, there are AI apples, the position of the apple tree is given in a clockwise order, and are all integers.There is a warehouse in 0 positions, a basket with a capacity of k, need to use this basket will all apple receive in the warehouse, the perfection process of the shortest. Analy

The next section continues to say SersyncThis section is about the actual experiment of Sersync.Installation of primary server Sersync, settingAnd then a synchronous demo.Let people know more about the principle of synchronous automation softwareIn which the real-time synchronization is explainedWhen the amount of synchronization is highThe client may not be able to update in real time20170705l07-09-03 old boy Linux Operational training-sersync real-t

First, we create a new project, and then to localize, localization is based on user-set language and so on information to display. So how to set it, open our project, click on supporting files in the Info.plist.The first column on the right selects China, so if you encounter some system components, it will automatically become Chinese.Now let's edit the first page. Add a text box to the storyboard. The simple part I can't, notice here the placeholder (placeholder), represents the display informa

| Transmission | | 3 | 2 | Data | | 4 | 2 | Home Width | | 5 | 3 | Network Excellent | | 6 | 3 | Transmission | +------+----------+--------+ 6 rows in Set (0.00 sec) At this time the f_id is still continuous. When we insert the record again, the problem arises. Insert into T_dept (f_areaid,f_dept) Select 3, ' Data ' union Select 3, ' Home width '; We see the result again, 7 missing: mysql> select * fro

between B, KB, MB conversion relationship[Email protected]:~/software$ ls-l sogoupinyin_2.2.0. 0102_amd64.deb-rw-rw-r--1 Ghostwu ghostwu 22852956 February 2 14:36 sogoupinyin_2.2.0. 0102_amd64.deb[email protected]:~/software$ LS-LH sogoupinyin_2.2.0. 0102_amd64.deb-rw-rw-r--1 Ghostwu ghostwu 22M February 2 14:36 sogoupinyin_2.2.0. 0102_amd64.deb[email protected]:~/software$ Pythonpython2.7.12 (Default, Dec

Shen Yi's notes on PHP devil training (2), Shen Yi's devil 1. This course will learn a few lazy functions: 1、file_put_contents (PHP 5, PHP 7) File_put_contents-write a string to a fileDescription int File_put_contents(String $filename, Mixed $data[, Int $flags= 0 [, resource $context]) It is the same as calling the fopen (), fwrite (), and fclose () functions in turn. IffilenameDoes not exist, the file is c

methods of this permutation is the triple loop.4. Answerint main(){ int x, y, z; 0; x 101; x++) for (y = 0; y 101; y++) for (z = 0; z 101; z++) if (x + 2 * y + 3 * z == 100) printf("x = %d, y = %d, z = %d\n", x, y, z); return 0;}The results of the implementation are as follows:Execution resultsOf course, this program also has to continue to optimize the space, the value range of x 0~100,y range of 0~50,z value range is 0~34. T

common body variable: union common body name variable name; size End---"Storage modeBig -Endian storage: Low-byte data stored at high addresses, high-byte data stored at low addressSmall-End storage: low-byte data stored at low addresses, high-byte data stored at high addresses 3. Enumeration----is generally used as the definition of error codeenum enum name {member 1,member 2,Members 3};Entry Training Not

Description An undirected Weighted Connected Graph with black or white edges. Let you find a generative tree with a need white edge that has the minimum weight. The question must be resolved. Input The first line V, E, and need indicate the number of points, the number of edges, and the number of required white edges. Next, line E, each line of S, T, C, Col indicates the endpoint (vertex starts from 0), Edge Weight, color (0 white 1 black ). Output A row indicates the Edge Weight of the desire

Linux administrator Training Level 2-General Linux technology-Linux technology and application information. The following is a detailed description. Level 1: Common Administrator 1. Features: You can understand the concept of partitions and install linux systems and common databases, table managers, and application software, make some basic configurations (such as network, printer, and modem ), install and

Test instructions: Give you a lot of logarithm, either 0 or 1. Not all 0 are ans++.The idea is test instructions.#include #include#includeusing namespacestd;#defineMAX (x, Y) (((x) > (y))? (x): (y))#defineMIN (x, Y) ((() #defineABS (x) ((x) >0? ( x):-(x))Const intINF =0x7fffffff;Const intn= the;intwin[n][2*N];intState[n]; ZintMain () {intn,m; while(cin>>n>>m) {intCnt=0; for(intI=1; i) { for(intj=1; j2*m; J + +) {scanf ("%d",Win[i]

The willpower has been so precarious lately. I don't know if I can keep on.So weak still blind tangled ... Can roll away.Water problems are not done.LCS (A)WaterLCS (B)No problem.Gym 100989CWater1D Cafeteria (B)Won't catchGym 100989EWaterGym 100989FWaterMission in Amman (B)No problem.Queue (A)I feel test instructions understand something.1#include 2#include 3#include 4#include 5 using namespacestd;6 intn,f[6],c[6],b[6],cnt[ -];7 8 intCheckintx) {9

, respectively.Students is numbered from 1 to N. Places is numbered from 1 to M.The second line contains N integers, where the ith integer represents the location cov Ered by the ith student initially.Each of the following Q lines represents a command and contains the integers, a and B, WH ere A(1?≤? A? ≤? N) is the number of aStudent and B(1?≤? B? ≤? M) is the number of a place. The command means student number A should go and cover place number B.It is guaranteed this B is different from

Topic:Workaround: PackageCom.algorithm.java.blueBirdge;ImportJava.lang.reflect.Array;Importjava.util.ArrayList;Importjava.util.Arrays;ImportJava.util.Scanner; Public classLeastcommonmultiple { Public Static voidMain (string[] args) {Scanner read=NewScanner (system.in); intn=Read.nextint (); System.out.println (ICD (N,n-1,n-2));//Assign Value } Public Static intICD (intAintBintc) {//Beg least common multiple//int K=getmax (A,B,C); for(int

================================================================================================>start_iq @params. CFG Add database Users two ways:Grant connect to U1 identified by ' 123456 ';Sp_iqaddlogin ' U2 ', ' sap123456 ';----note letters plus numbersa series of actions for groups and usersGrant connect to marketing;..... Grant execute on sp_iqlocks to U1Set stored procedure execution permissions. RevokeIQ Non-chained, open client connection, no explicit commit required. DML still c

Impressions: Depth First has a deeper understanding, just beginning to write the idea of a little confusion, do not know how to write recursion, export also made a mistake, over and over the process of deep understanding.#include #include#includeusing namespacestd;inta[ +],b[ +],c[ +][ +],n,sum,tp=0, tp2=0;voidBFsintTpintl);intMain () {memset (A,0, +); //memset (b,-1,21); while(SCANF ("%d", n)! =EOF) { for(intI=0; i) for(intj=0; j) scanf ("%d",C[i][j]); BFS (0,1); printf ("%d\n", su

:@ "Tmp/rongtian.txt"];if (![ MyString writetofile:path atomically:yes encoding:nsutf8stringencoding Error:error]) {NSLog (@ "Write file error%@", error);return;}2.NSString RangeNsrange R;r.location = 4;r.length = 5;nsstring *strsub = [str substringwithrange:r];NSLog (@ "Range%@", strsub);3. Searchnsrange searchrange = [str rangeofstring:@ "Five"];if (searchrange.location! = nsnotfound) {NSLog (@ "Search location%d%d", searchrange.location,searchrange

Topic linksTest instructions: l rings, n trees, backpack capacity K, tells you the ID of K apple tree, and the number of fruit on each tree, once the backpack is full to return to the starting point (id==0)Empty, ask you at least how many road, can pick up all the apples.Ideas:Because it is a ring, so in fact, the farthest point from the beginning should be L/2;Two ways of picking apples, one starting from the top half, using dp[0][i] to record;Anothe

point, and add the adjacent points together with the value of the point itself to compare, which big take which. (simple example, the point adjacent to it has no other adjacent points)If there are other points adjacent to the point, then the method is still the same, according to the method of recursion.#include #include#includestring.h>#includestring>#include#include#include#include#include#includeusing namespacestd;#defineMet (A, b) memset (A, B, sizeof (a))#defineMAXN 11000#defineINF 0x3f3f3