kaggle competition

0Note: Use only ANSI c/ansi C + + standards, and do not invoke special functions that depend on the compilation environment or operating system.Note: All dependent functions must explicitly #include When committing, be careful to choose the type of compiler you expect."Answer": not sure at the moment.PS: The first Blue Bridge Cup, is considered to be the title of the pit to, also blame their strength is not enough, knowledge is not complete, is an experience, normal play is the biggest play! Co

After-school exercises the third wave came, to the third chapter after the code and the like a little bit longer, so I put this chapter of the answer into a few parts. This chapter focuses on the processing of strings, for string problems, usually as long as careful there is no problem, the following few said directly on the detailed.Exercise 3-1 Score Statistics (STAT)Task 1: This is straightforward on the code:#include Task 2: This relative task 1 more difficult, one of the questions, in the u

Welcome to Exchange Discussions!@2-1#include 　　Rujia Algorithm Competition Introduction Classic second unit exercise answer self-editing

= cin.nextint (); BigInteger ans = biginteger.one;for (int i = 1; I F-Calf re-warI am looking at the sample to guess, except that the number of 1 is all different or up to see if it is $0$. The reason is to study it in depth.#include G-Flood problem$ shaped pressure dp$.$DP [i]$ indicates that the number of digits divisible by the $i$ state can be divided by a few, and the number of digits that can be divisible by the state $i$ is calculated backwards, $DP [0]$ is the answer. Look at the code

* 6.3 Tree and two fork tree* * Ball Drop problem//Ball Drop problem/*There is a binary tree with a maximum depth of D, and all leaves have the same depth. All nodes are numbered 1,2,3,4,..., 2^d-1 from top to bottom. Place a small ball at node 1 and it will fall. Each inner node has a switch, initially all closed, when there is a small ball falling on the switch is, the state will change. When the ball reaches an inner node, if the switch on the node is closed, go left, or go right until

(XL) Lt1-2The problem is still not very difficult, but note the operator overloads so that sort, as well as the construction members, and the sort encounter vector iterator.Wrote two copies of the code.Attach your own common method first:#include #include#includeusing namespacestd;Const intmaxn= ++5;structsoldier{intb; intJ; BOOL operatorConstSoldier a)Const{ returnJ>A.J; }}; Soldier A[MAXN];intMain () {intN,kase=0; while(SCANF ("%d", n) = =1N) { for(intI=0; i"%d%d",a[i].b,A[I].J

Link to original topicDescribeSmall fish spit bubble, toot toot out. Small fish will spit out two kinds of bubbles: Big bubble "o", Small bubble "O".Two adjacent small bubbles will melt into a large bubble, two adjacent large bubbles will explode.(Yes, you're right, little bubbles and bubbles don't make any difference, and I don't know why.) ）Note: Merge from left to right.For example: Oooooooo will become OO after a period of time.InputThe data has multiple groups and is processed to the end of

Blasting-1: Open link, yes 502I'm just adding a variable parameter to the back:? a=1Out a piece of codeThe Var_dump () function, with $ $a, may have used a hyper-global variable GlobalsPass a globals to the Hello parameterGet flag Blasting-2: Open linkVar_dump () returns the type and value of the data variableEval () treats the string as PHP codeThere are two ways to get flag1:?hello=file (' flag.php ')2:?hello=); Show_source (' flag.php '); Var_dump ( Blasting-3:

Topic at I spring and Autumn CTF training campLook at the source code, found tips:Open user.php, page blank, refer to the big guy's blog to know there may be a User.php.bak backup file, download the file can get the user name listTake the burp blasting:None of the 700 supposedly were born in 1999? Take 1998 and try again ..... It's cold again ... I've been trying until 1990, and finally there's a big guy who's been in this year.Account Lixiuyun, password lixiuyun1990Enter into a blank personal c

Question Link: Https://www.nowcoder.com/acm/contest/76/AIdeasThe right and bottom of each ' # ' if it is also ' # ' indicates that the two points constitute the path, in order to reconstruct a picture, and then find the maximum match of the binary graph.Code#include using namespacestd;Charmp[ -][ -];BOOLvis[2505];vectorint>g[2505];intmp1[ -][ -], match[2505], N;BOOLDfsintu) { for(inti =0; I ) { intv =G[u][i]; if(!Vis[v]) {Vis[v]=1; if(Match[v] = =-1||DFS (Match[v])) {Match[v]=u; re

Exercise 3-6Enter cardinality B (2#include Summary: N>0 can be used as a condition for judgingExercise 3-7Enter cardinality B (2#include Algorithmic competition Getting Started classic exercise 3-5 3-6 binary conversion

know, asking if they have a teacher's phone number, and if they don't, they'll ask their classmates to ask for their phone numbers. So, can you contact the teacher and get the computer? Input Description:There are several samples of test sampleThe first line of each sample is two integers n (1The next M-line, each line has two integers x (1Output Description:For each set of sample samples, if you can eventually contact the teacher, output "Yes", otherwise output "No". 输入例子:5 51 32 33 42 44 5输出

steps, take more than 6 I know where I goCode:#include using namespacestd;#definell Long Long#definePB Push_backVectorint>a[3];intMain () {Ios::sync_with_stdio (false); Cin.tie (0); ll N,k; while(cin>>n>>k) { for(intI=0;i3; i++) a[i].clear (); llBase=1; for(intI=1; i){ intT= (k/Base)%6; if(t>2) t=5-T; A[T].PB (i); Base*=3; } for(intI=0;i3; i++){ if(A[i].size ()) for(intJ=a[i].size ()-1; j>=0; j--) cout0?'\ n':' '); Elsecout0Endl; } } r

]]belong[mp[i][2]]!=belong[mp[i][3]]mp[i][4]==0) mp[i][3]=0; if( isI2I3) mp[i][2]>0belong[mp[i][2]]==belong[mp[i][3]]belong[mp[i][3]]!=belong[mp[i][4]]mp[i][1]==0) mp[i][4]=0; if( isI2I3) mp[i][2]>0belong[mp[i][2]]==belong[mp[i][3]]belong[mp[i][2]]!=belong[mp[i][1]]mp[i][4]==0) mp[i][1]=0; if( isI4I3) mp[i][3]>0belong[mp[i][3]]==belong[mp[i][4]]belong[mp[i][3]]!=belong[mp[i][2]]mp[i][1]==0) mp[i][2]=0; } for(intI=1; i4; i++){ if( is(1I2, i) mp[1][i]>0belong[mp[1][i]]==

Https://www.nowcoder.com/acm/contest/67/EIdeas:DfsCode:#include using namespacestd;#definell Long Long#definePB Push_back#defineMP Make_pair#definePII pair#defineMem (A, B) memset (A,b,sizeof (a))Const intn= the;Const intinf=0x3f3f3f3f;intCnt=0;intHead[n];intCost[n];intD[n];BOOLUsed[n];BOOLVis[n];structedge{intTo,w,next;} Edge[n];voidAdd_edge (intUintVintW) {edge[cnt].to=v; EDGE[CNT].W=W; Edge[cnt].next=Head[u]; Head[u]=cnt++;}intans=inf,c,k;voidDfsintu) {Vis[u]=true; if(u==c) { inttot=0;

, the answer is "welcome.html". Concrete solution to the implementation of the process see brainfuck--make your mind messy programming languageWhen I see this keyboard, I find it is not the same as our usual keyboard layout. So I thought, the problem is to replace the characters of the keyboard with the characters in the corresponding position on our computer keyboard. So I did it quickly and the result is as followsMain () {printf (unix["\021%six\012\0"], (Unix) ["has"]+ "fun" -0x60);}see here

This is a help to promote the post, remember I have translated an article called "WordPress ten Adsense Plug-ins", can easily let bloggers in WordPress use Google AdSense, now, Ali mother sponsored WordPress Chinese Forum held "WordPress plug-in competition." Through this contest, WordPress Chinese forum hope to be able to design based on WordPress ali mom Plug-ins, WordPress users enable the plugin, you can in WordPress more convenient and release an

video in China and do not do in the United States, such as the U.S. video site in addition to the technical model must add other things, such as strong implementation capabilities, external operational capabilities. So many sites including Yahoo, Google is very successful abroad, but in China is not so successful, so is the lack of implementation capacity and operational capabilities. So in China we must add their own characteristics so as to be successful. Other people's good things must learn

Link: 2018 South-South University Program Design competition: K-Pony Super Brine Test instructions: Small Mago Cup brine, Cup has unit of Salt and unit of water. Pony is very bored, so he wants to know how many kinds of this cup of brine non-empty set, pour together after the salt and water ratio is. Troubleshooting: Binary. MAXN = 35, Direct enumeration is sure to be tle, binary time complexity is enough. (A1 + A2)/(B1 + B2) = x/y; A1 * Y-B1 * x =

interaction, each time the article to let them comment, these are also quite valuable. Whether it is Weibo or QQ group or not, these are only the user's truncated body. Because our website is totally belong to the WBE1.0 can only see the era that can not participate. In this WBE2.0 we need to use these microblogging and QQ group to host our users. With a display-type site and a micro-blog and QQ group combination, will be a good way to circle users. Believe that the further commercialization of