i5 2430m

]; for(inti =0; i5; ++i) {Tt[i]=Std::thread (thread_procedure); } for(inti =0; i5; ++i) {Tt[i].join (); } while(true) {Std::lock_guardLG (M); Resource.push_back (rand ()% -); Cv.notify_one (); }}This code uses a Std::mutex and a std::condition_variable to control the corresponding thread, attempting to implement a simple print function.But at run time the code will be stuck at the produce

Https://vjudge.net/contest/259447#problem/EBfs,k constraints are presented in an extra K-dimension of the array.1#include 2 using namespacestd;3 #definell Long Long4 #defineMINV 1e-65 #defineINF 1e96 #definePi 3.14159265367 #defineNL 2.71828182848 Constll mod=1e9+7;//9982443539 Const intmaxn=1e5+Ten;Ten One intqx[maxn* -],qy[maxn* -],num[maxn* -],step[maxn* -],ci[maxn],c[5]={1,Ten, -, +,10000},d[5]; A BOOLvis[maxn][4][3]; - - intMain () the { - intHead,tail,i,j,s,x,y,ss,bu; -Head=0, tail=1

solving problems is. Adding in 10 100 = points from hacks, he total, score becomes 3930 + + = 4930. 1#include 2#include 3#include 4#include 5#include 6#include string>7#include 8#include 9#include Ten using namespacestd; OnetypedefLong Longll; Atypedef unsignedLong Longull; - structSubmission - { the intT; - intwa; - intSC; -}p[5]; + intMain () - { + intShack,fhack; A for(intI=0;i5; i++) at { -scanf"%d",p[i].t); -P[i].sc= -*

Title Link: http://61.187.179.132/JudgeOnline/problem.php?id=1264Test instructions: Give two series, each of the length of the series is 5n, wherein 1-n each number appears 5 times. The longest common child of two columns.Idea: LCS turned into LIS, for each number that appears in the first array, turn it into the position in the second array, notice that the position is from the big to the small row, and then do the LIS for this array.#include #include#include#include#includeintq[1000005],a[1000

, there are several functions related to the image convolution, such as imfilter can achieve convolution, or conv2 also line, their speed is quite fast, such as 3000*3000 grayscale, convolution matrix size is 15* 15, on the I5 CPU running time as long as about 170ms, quite to force.In Celery's blog, also mentioned his optimized conv2 and MATLAB is quite even faster than MATLAB, see http://blog.csdn.net/celerychen2009/article/details/38852105.As the MA

},{0,1,1,1,1},{0,0,2,1,1},{0,0,0,0,1},{0,0,0,0,0}};intD,MAXDEP;BOOLfo;intnow[5][5];intx0,y0;intxs[]={1,1,-1,-1,2,2,-2,-2};intys[]={2,-2,2,-2,1,-1,1,-1};CharC;inlineBOOLeq () { for(intI=0;i5; i++) for(intj=0;j5; j + +)if(Ans[i][j]!=now[i][j])return 0; return 1;} InlinevoidSwapint*a,int*b) { intt=*A; *a=*b; *b=T;} Inlineintminsteps () {inta=-1; for(intI=0;i5; i++) for(intj=0;j5; j + +)if(Ans[i][j]

on others to give you the wrong, so that your level is not how much improvement. Okay, no more nonsense, put the code (the level is too low, can only write so long code to =)#include #includestring.h>intMain () {Charpuzzle[6][6],move[ +],temp; intI,j,k,si,sj,flag,count=0; while(Gets (puzzle[0])!=nullstrcmp (puzzle[0],"Z")!=0) {Count++; Flag=1; for(i=1; i5; i++) {gets (puzzle[i]); } for(i=0;i5; i+

Topic linksViolence DFS of course notSo iterate and deepen it. ida*1#include 2#include 3#include 4 using namespacestd;5 intTt,k,flag;6 intans[5][5]=7 {8{1,1,1,1,1},9{0,1,1,1,1},Ten{0,0,2,1,1}, One{0,0,0,0,1}, A{0,0,0,0,0} - }; - intxx[8]={1,1,-1,-1,2,2,-2,-2},yy[8]={2,-2,2,-2,1,-1,1,-1}; the intPD1 (inta[5][5]) - { - for(intI=0;i5; i++) - for(intj=0;j5; j + +) + if(Ans[i][j]!=a[i][j])return 0; - return 1; + } A intPD2 (int

) .... A5204205 Hardware Location Code ... U0.1-p1/e2 PLATFORM specific Name: Ethernet Node: [email protected] Device Type: Network Physical Location:u0.1-p1/e2 Physical Locationlocation to determine if the NIC is plugged into the PCI interface [[email protected]/] #lsslot-C PCI# Slot Description Device (s)U0.1-p2-i1 pci-x capable, + bit, 133MHz slot EmptyU0.1-p2-i2 pci-x capable, + bit, 133MHz slot EmptyU0.1-p2-i3 pci-x capable, 133MHz slot FCS0U0.1-p2-i4 pci-x capable,

1. There are 5 students, each of whom has a test score of 3 courses in Chinese, maths and foreign languages. Programming statistics The total score and average scores of each student and the average score of all students in each section. Requires that the results be initialized in the program, and the result is output in tabular form. #include #defineN 5#defineM 6#defineL 3intMain () {intI,j,sumi,sumii,flag; Doublescore[n][m]={{1, -, the, -},{2, the, the, the},{3, the, +, -},{4, the, the, the},

(1) Each conversion column can appear three times at most, because if it appears four times, it is equivalent to turning a circle, equal to 0. There are a total of 4 ^ 9 cases, which can be traversed. For example: Void DFS (INT clocks []) { For (INT I1 = 0; I1 For (INT I2 = 0; I2 For (INT I3 = 0; I3 For (INT I4 = 0; I4 For (INT I5 = 0; I5 For (INT I6 = 0; I6 For (INT i7 = 0; i7 For (INT i8

overclock, but servers can only reduce the frequency and not exceed. In addition, the CPU and Xeon series in the same period are much more expensive than the home-level I3 I5 I7, which is very cost-effective. Understanding servers is actually to learn about redundant memory, redundant hard disks, redundant CPUs, redundant power supplies, and BMC remote management. It can be said that the household machine is a high startup, but the base is thin and

Configuration: [root@aix211 /]#lscfg -vpl en0[root@aix211 /]#lscfg -vpl et0[root@aix211 /]#lscfg -vpl ent0 ent0 U0.1-P1/E2 10/100 Mbps Ethernet PCI Adapter II (1410ff01) 10/100 Mbps Ethernet PCI Adapter II: Network Address.............000255CF1406 ROM Level.(alterable).......SCU015 Product Specific.(Z0).......A5204205 Hardware Location Code......U0.1-P1/E2 PLATFORM SPECIFIC Name: ethernet Node: ethernet@1 Device Type: network Physical

The difference between static and non-static is only revealed if the value is initialized during runtime. Because the values during compilation are considered by the compiler to be phaseThe same. Packagethinking; Public classFinalData {//Can be Compile-time constants Final intI1 = 9; Static Final intI2 = 99; //Typical public constant: Public Static Final intI3 = 39; //cannot be Compile-time constants: Final intI4 = (int) (Math.random () *20); Static Final inti5 = (int) (Math.random ()

DEMO Program: Testsemaphore_demo.rarSource code: Testsemaphore_src.rar---Key code is as follows---voidCtestsemaphoredlg::onbnclickedbuttonthread1 () {//TODO: Add control notification handler code hereAfxBeginThread (Afx_threadproc) Thread1writea, This);}voidctestsemaphoredlg::onbnclickedbuttonthread2 () {//TODO: Add control notification handler code hereAfxBeginThread (Afx_threadproc) Thread2writeb, This);}voidctestsemaphoredlg::onbnclickedbuttonthread3 () {//TODO: Add control notification handl

Toshiba launched a series of new notebooks this year, with the satellite p55t series positioned in the midrange home entertainment market, with the latest Intel Haswell processor, 8GB memory and a 1080P Full HD touch screen and Harman Kardon speakers. The price is 779 U.S. dollars (about 4782 yuan), with a high price, below to see the machine is actually hand experience. Toshiba Satellite p55t (model A5202) main parameter information: Screen: 15.6-inch 1920*1080 resolution capacitive touch scr

peripherals, if you do not like the original mouse or keyboard, we can switch to the likes of the style at any time, if not satisfied with the internal configuration, we can easily upgrade the part of the modification. But obviously, configuring upgrades is very difficult for one computer. Therefore, the configuration specification of one computer is very important for making purchasing decision. What about Dell's configuration specs for the XPS 18? Dell XPS 18 Parameter specifications 18.4-i

get (Object key) Gets the value according to the key - * set + * collection A * E. Length function at * int size () returns the number of all key-value pairs in the collection - * - */ - Public Static voidMain (string[] args) { - - //demo1 (); in //Demo2 (); - //Demo3 (); tomapNewHashmap(); +Integer I1 = Map.put ("Zhang San", 23); -Integer i2 = Map.put ("John Doe", 24); theInteger i3 = Map.put ("Harry", 25); *Integer i4 = Map.put ("Zhao Liu", 26); $Integ

1. Introduction to the Apriori algorithmThe Apriori algorithm is an algorithm for mining the frequent itemsets of Boolean association rules. The Apriori algorithm uses a priori knowledge of the nature of frequent itemsets, and through the iterative method of layered search, the K-itemsets are used for the exploration (k+1) itemsets to exhaust all the frequent itemsets in the data set. Find the frequent itemsets 1-itemsets collection L1, then use L1 to find the frequent 2-itemsets collection L2,

The code is as follows:#include #includestring.h>intMain () {inti,j; Charword[5][ -]; printf ("Please enter the five words to sort:"); for(i=0;i5; i++) {scanf ("%s",Word[i]); } //sort words by using the Bubbling method for(i=0;i5; i++) { for(j=0;j4; j + +) { if(strcmp (word[j],word[j+1]) 0) { Char*p; Charm[ -]; P=m; strcpy (P,word