oracle university training

Balala power!Time limit:4000/2000 MS (java/others) Memory limit:131072/131072 K (java/others)Total submission (s): 2668 Accepted Submission (s): 562Problem Description Sample Input1a2aabb3abaabcSample OutputCase #1:25Case #2:1323Case #3:18221Source multi-university Training contest-team 1 topics Link: http://acm.hdu.edu.cn/showproblem.php?pid=6034Test instructions: give you n a string of lowercase let

Master of the Grass time limit:3000/1000ms (java/other) Memory limit:65535/32768k (Java/other) total submission (s): KT Accepted SUbmission (s): 26font:times New Roman |Verdana | Georgiafont Size:←→problem Description Suzhou University team again diligently began the training.Today opened a 5-hour team training tournament, Suzhou University's N (1Now give each team the AC, please follow the penalty from les

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=4925Apple TreeTime limit:2000/1000 MS (java/others) Memory limit:262144/262144 K (java/others)Total submission (s): 176 Accepted Submission (s): 120Problem Descriptioni ' ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant a apple tree to get one apple or fertilize the soil to speed up its neighbors ' productio N. When a grid is fertilized, th

Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=4925Apple TreeTime limit:2000/1000 MS (java/others) Memory limit:262144/262144 K (java/others)Total submission (s): 188 Accepted Submission (s): 129Problem Descriptioni ' ve bought an orchard and decide to plant some apple trees on it. The orchard seems like an N * M two-dimensional map. In each grid, I can either plant a apple tree to get one apple or fertilize the soil to speed up its neighbors ' productio N. When a grid is fertilized, th

Not easy ah. Can finally fill the second question.By the way: the template to write the residue do not blame the people ah ~ (This crippled template study for a long time to find fault)Main topic:There is a matrix of n*m. There will be a number in each lattice. Give you the sum of the numbers in each line and the number of each column.Ask each position to fill in the number between 0~k. Suppose there are multiple possible outputs of "not Unique", assuming there is no output "impossible", assumin

empty the array is a bit simpler#include //#include #include string.h>#include#include#include#includeSet>#include#include#include#include#include#defineINF 0X3FFFFFFF#defineINF 0x3f3f3f3f#defineLson l,m,rt#defineRson m+1,r,rt#defineLL Long Long#defineULL unsigned long Longusing namespacestd;Chars[ -][ -];inta[ -][ -];inti,j;intn,m;intMain () {intx, y; inti,j; while(cin>>n>>m) {memset (A,0,sizeof(a)); intsum=0; intans; for(i=1; i) { for(j=1; j) {cin>>S[i][j]; if(s[i][j]=='*

, k); - ints = (11; -Memset (DP,0,sizeofDP); indp[0] =1; - while(n--){ to for(intj = S; J >=0; j--){ +ll tem =Dp[j]; - if(!tem)Continue; the for(intp =1; P ){ * intNEX = (11)) | J | (j s); $Dp[nex] = (Dp[nex] + tem)%MoD;Panax Notoginseng } -DP[J] = (TEM * (1+ D))%MoD; the } + } All ans =0; the for(inti = s; I >=0; i--) + if(I (11))) -Ans = (ans + dp[i])%MoD

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