abcd puzzle

The examples in this paper describe the simple puzzle game implemented by Python plus pygame. Share to everyone for your reference. The implementation method is as follows: Import Pygame, sys, randomfrom pygame.locals import *# Some constants windowwidth = 500WINDOWHEIGHT = 500BACKGROUNDCOLOR = (255, 255, 255) BLUE = (0, 0, 255) BLACK = (0, 0, 0) FPS = 40VHNUMS = 3CELLNUMS = Vhnums*vhnumsmaxrandtime = 100# exit def terminate (): P Ygame.quit () Sys.

)The following figure illustrates how to test 5 times with 3 eggs, to solve the 21-storey problem, where the rule is that for independent testing, if the test is broken, a subsequent test is performed on the lower floor, and if it is not broken, follow-up tests are performed on the high floor, where the brackets represent the floor/floor range of the test execution.In fact, for the case of D (n,m-1) Postscript: This is an article of foreign cattle, for the problem of throwing eggs

If the answer is within a fragment, then the direct suspension method solves the time complexity of $o (n\sum) $.If the $n$ is larger, then the $\sum$ is smaller.To find out the length of each point up to extend, enumerate each point upward of this segment as a short board.Figure out the sum of the length of the completely optional fragment and not the full selection, the largest extension distance to the right of the left, update the answer.Time complexity $o (n\sum^2) $.If the $n$ is relativel

); - if(b -) F+=dfs (a,b+1, c,d,e,f) * ( --B)/( Wu-sum); + if(c -) F+=dfs (a,b,c+1, d,e,f) * ( --c)/( Wu-sum); - if(d -) F+=dfs (a,b,c,d+1, e,f) * ( --D)/( Wu-sum); + DoubleMd= -;if(e==4) { for(intI=0;i4; ++i) Md=min (DFS (A,B,C,D,I,F)/( Wu-sum), MD); f+=MD;} AMd= -;if(f==4) { for(intI=0;i4; ++i) Md=min (DFS (a,b,c,d,e,i)/( Wu-sum), MD); f+=MD;} atvis[a][b][c][d][e][f]=true; - returndp[a][b][c][d][e][f]=F; - } - intMain () - { -memset (Vis,false,sizeofvis); in inta,b,c,d;

company purchased a server, then you can choose to host the server to the Hong Kong computer room; As the server needs 24 hours uninterrupted power and network to ensure the smooth, and need the relevant professional and technical personnel to maintain, self-management and maintenance of high cost, once the problem is not timely and may affect the entire network of the group, resulting in a very significant loss; therefore, Hong Kong computer room hosting is a good solution, Hong Kong has built

; }}intMain () {intt,n,m; scanf ("%d%d",t,MoD); Init (); while(t--) {n=read (); m=read (); printf ("%d\n", (LL) ans1[n]*ans2[m]%MoD); } return 0;}Expand Euclid to seek inverse yuan#include #includestring.h>Const intn=1e7+ the; typedefLong Longll;intPr[n],p[n],cnt,mod;intInv[n],ans1[n],ans2[n];intRead () {intx=0;CharCh=GetChar (); while(ch'0'|| Ch>'9') ch=GetChar (); while(ch>='0'ch'9') {x=x*Ten+ch-'0'; ch=GetChar ();} returnx;}intEX_GCD (intAintBintx,inty) { if(!b) {x=1, y=0; returnA

() {///Expand nodes (Add new nodes to the tree) A for(; ii) { thech[cur][s[i]-'a']=alloc++; +cur=ch[cur][s[i]-'a']; -++Val[cur]; $ } $ } - voidIns () {///the value of the curried node (expands the value of the existing node) -len=strlen (s); theCur=0; - for(i=0; ii) {Wuyi if(ch[cur][s[i]-'a']==-1) Add (); the Else{ -cur=ch[cur][s[i]-'a']; Wu++Val[cur]; - } About } $ } - intQuery () {///Ask -len=strlen (s); -Cu

on the bit. 1 #pragmaComment (linker, "/stack:1024000000,1024000000")2#include 3#include 4#include 5#include 6#include 7#include 8#include 9#include Set>Ten#include One#include A#include -#include -#include the using namespacestd; - intdirx[]={0,0,-1,1}; - intdiry[]={-1,1,0,0}; - #definePI ACOs (-1.0) + #defineMax (a) (a) > (b)? (a): (b) - #defineMin (a) (a) + #definell Long Long A #defineEPS 1e-10 at #defineMOD 1000000007 - #defineN 506 - #defineINF 1e12 - intn,m,q; - intMp[n][n]; - int

1#include 2 3 intMain ()4 {5 Long Longi,j;6 intN//The number of prime numbers used to record the input to be multiplied7 Long Longproduct=1;//used to record the product of the first n prime numbers and initialize them to 18 intnum=0;//used to record the number of prime numbers currently found9 Ten //input Onescanf"%d", n);//Enter the number of prime numbers to be multiplied A - for(i=2;; i++)//traverse a positive integer of i>=2 to find the first n prime numbers

) { the if(Vis[s])return ; *Vis[s] =true; $ if(Bitcount (s) = =1){Panax NotoginsengNode[s].push_back (node{0,0}); - return ; the } + for(intL = (s1) s; L >0; L = (l1) s) { A intR = S ^l; theDFS (L); DFS (R);//all scenarios for a two subset of a root node. Node[l].size () left scheme number node[r].size () to the right of the scheme number + for(inti =0; I ){ - for(intj =0; J ){ $ Doublell = min (-sumw[r]/(Sumw[l] + sumw[r]) +

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=1251The power of map, but it runs too long.Code:1#include 2#include string.h>3#include 4#include 5#include 6#include 7#include 8#include 9#include Ten#include One using namespacestd; A -mapstring,int>M; - the intMain () { - stringx; - CharA; - while(true){ +scanf"%c",a); - if(a=='\ n'){ +scanf"%c",a); Ax="";//string x Empty at } - if(a=='\ n') Break; -x+=A; -m[x]+=1; - } - while(cin>>x) inprint

maximum weight of these edges is minimized, and the point pairs that satisfy any hostile relationship end up in the same connected block.Summary: This is a good question, I used O (n^2) to record all the distance to meet the point pair, and then O (M log m) with and check the merger and lookup points between the relationship between, apparently too violent.The most recent point pair of plane. This is the core of the subject, whether you are violent or non-violent, using O (n log n) to find the

Original refer:http://www.cnblogs.com/happyfreelife/p/4240100.htmlWhen a form with username and password is submitted, the viewer intelligently asks the user if they want to save the password. If developers don't want this "smart" thing, they can use Ajax to submit the form so that the viewer is not "smart"."When the browser is allowed to save the password for the site, the next time any page of the site is opened, the browser automatically detects that the page has a password element , and if t

if(C[i] (1k)) {111Addedge (II, jj+1); theAddedge (ii+1, JJ);113Addedge (JJ, ii+1); theAddedge (jj+1, ii); the}Else { the Addedge (ii, JJ);117Addedge (ii+1, jj+1);118 Addedge (JJ, ii);119Addedge (jj+1, ii+1); - }121 }122 }123 for(i=0; ii)124 if(!Pre[i]) the DFS (i);126 for(i=0; flagi2)127 if(Bn[i] = = bn[i+1]) -Flag =false;129 } the if(flag)131Puts"YES");

and right J card is not equal to the score of the card we are currently pumping! So in the end we can maintain a minimum interval, extending the interval to n-2 (removing the leftmost and most right two), and the resulting value is the last smallest fraction.　　And this method is exactly the order of matrix multiplication, the idea of familiarity and kindness　　1#include 2#include 3#include string.h>4 5 Static Long Longcards[ -];6 Static Long Longdp[ -][ -];7 8 voidSearch (Const int);9 Long LongM

=Dummychild Dummychild.next=None whileRoot:ifRoot.left:cur.next=root.left cur=Cur.nextifRoot.right:cur.next=root.right cur=Cur.next Root=Root.next Root= Dummychild.nextView CodeFollow up to Problem "populating Next right pointersin each Node".What if the given tree could is any binary tree? Would your previous solution still work?Note: Constant extra space. For example,Given The following binary tree, 1 / 2 3 /\ 4 5 7After calling your functi

Analytical:1, can choose M individual (n=>m>=2), there is CN (m) in the selection;2, and then the M-Personal divided into 2 groups (everyone to group), to meet the minimum AC number is greater than the maximum AC number, only need to be inserted in the M-person board can be;For example:M-Individuals if the distinction is:1,2,3,4,......m-1,m (M personal AC number arranged from small to large)The board can be divided into 2 groups that meet the requirements in any position:1,2,3......T, | | T+1...

http://poj.org/problem?id=3678Test instructions: Very naïve topic to see the english problem directly =#include 　　Just screw it up. = ="POJ" 3678 katu Puzzle

, dynamic planning many topics to do problems in the way there is common: first we have to modify the operation to design the state of the problem, the state must be no Overlap exists individually (that is, for each element in the dynamic planning array corresponds to only one state), and we are able to get the answer through a linear shift. Some states are obvious, easy to design, such as "chorus Formation", "Turtle Chess", "energy necklace" feeling to be able to see the approximate model, but

Topic linksGive a string number, take out a number i the price is a[i-1]*a[i]*a[i+1], the first number and the last number can not be taken, to take away the remaining number of the minimum value of the price.#include #include#include#include#include#include#include#includeSet>#includestring>#includeusing namespacestd;#definePB (x) push_back (x)#definell Long Long#defineMK (x, y) make_pair (x, y)#defineLson L, M, rt#defineMem (a) memset (a, 0, sizeof (a))#defineRson m+1, R, rt#defineMem1 (a) mem