luminous electric

(String args[]) {int n,m,i,len1,len2; String str1,str2; Scanner sc=new Scanner (system.in); while (Sc.hasnext ()) {str1=sc.next (); Str2=sc.next (); Len1=str1.length (); Len2=str2.length (); N=KMP (STR1,STR2); M=KMP (STR2,STR1); if (n==m) {if (Str1.compareto (str2) >0) {System.out.println (str2+str1.substring (N,LEN1)) ; }else{System.out.println (str1+str2.substring (n,len2));

datasets, one per line, of the form:Diameter Revolutions TimeThe diameter is expressed with inches as a floating point value. The revolutions is an integer value. The time is expressed with seconds as a floating point value. Input ends when the value of revolutions is 0 (zero).Outputfor each data set, print:Trip #N: Distance MPHOf course N should is replaced by the data set number, distance by the total distance in miles (accurate to 2 decimal plac ES) and MPH by the speed of miles per hour (ac

problem Description"This summer vacation is not AC?" ”Yes ”"Then what do you do?" ”"Watch the World Cup, you idiot!" ”"@#$%^*% ..."Indeed, the World Cup has come, the fans of the festival has come, it is estimated that many acmer will also throw away the computer, to the TV.As fans, must want to see as much as possible complete game, of course, as a new era of good youth, you will certainly see some other programs, such as news broadcast (never forget about the state of affairs), very 6+7, Super

Problem descriptiongive a number n, find the minimum x (x>0) that satisfies 2^x mod n = 1.Inputone positive integer on each line, the value of N.Outputif the minimum x exists, print a line with 2^x mod n = 1.Print 2^? MoD n = 1 otherwise.You should replace x and n with specific numbers.Sample Input25Sample output2^? MoD 2 = 12^4 MoD 5 = 1 If you do not use the same residual technique, it is often time-out that the remainder of the number product is equal to the sum of each number.Hangzhou

Calculation of the area of any polygon # include http://blog.csdn.net/hemmingway/article/details/7814494----> To understand the principle, see here.Hangzhou Electric OJ--2036 reform spring breeze blowing everywhere

Keep on Truckin 'Time limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 9881 Accepted Submission (s): 6859Problem Descriptionboudreaux and Thibodeaux is on the road again ..."Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!""Don ' t worry, Thibodeaux, I already checked ahead. There is three underpasses and our 18-wheeler would fit through all of the them, so just keep this motor running! ""We ' re not going-make it, I say

New students) In addition to the school race, what avenues can you apply to join the ACM school team? People see Love a^b timelimit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 33751 Accepted Submission (s): 22894Problem description An integer representing the last three digits of the a^b.Description: The meaning of A^b is "A's B-square"Input data contains multiple test instances, one row per instance, consisting of two positive integers

several pieces: ① first with Guo Tianxiang two-computer communication routines, transmission 0-f key value, digital tube display, ② ds18b20 acquisition temperature, 1602 display; ③ dual-machine communication simple characters, 1602 display; ④ to achieve the final scenario. 3. As captain. ① and teachers to do a good job of communication, lubrication, monitoring progress, planning plans, select the appropriate technical route, according to the actual situation to correct and solve some problems i

Original title Address: http://acm.hdu.edu.cn/showproblem.php?pid=1002 "problem Description" I have a very simple problem for you. Given integers A and B, your job is to calculate the Sum of A + B. "input" the first line of the input contains an Integ Er T (1"Sample Output "Case 1:1 + 2 = 3 Case 2:1.,122,334,455,667,79e,+17 + 998877665544332211 = 1111111111111111110" AC Code "1#include 2#include string.h>3 #defineMax (A, b) a > B? A:b4 5 Chara[1024x768];6 Charb[1024x768];7 Charc[1024x768];8 inti

(inti =1;I if(Tim[i] = =-1)Tarjan (i);if(CNT_SCC = =1)Puts"Yes"); ElsePuts"No");}voidGetmap (){intA, B;memset (Instack,0,sizeof(Instack));memset (Low,0,sizeof(low));Memset (Tim,-1,sizeof(Tim));CNT =0;Memset (Head,-1,sizeof(head)); while(m--){scanf"%d%d", a, b);Add (A, b);}}intMain (){ while(~SCANF ("%d%d", n, m), n+m){Getmap ();Solve ();}return0;}Mygod1 Great God Analysis (Scc_tarjan): 2 http://blog.sina.com.cn/s/blog_7a1746820100vtk9.html3 http:// Www.cnblogs.com/saltless/archive/2010/11/08/18

flexibility of global variables use global variables for values that have an effect on the main function in the calling function and then the understanding of backtracking requires that the searched node also needs to be searched and that the topic does not need to be written to the DFS call function (the alignment is fixed) The first thing to be clear is the condition of the recursive termination (including the possibility of finding and not finding possible) in the continue and return to make

system to obtain the feedback information of the motherland, so as to realize the self-discipline and the allocation of grasping force. "Dexterous Hand Adaptive Operation Flow" is: pre-set, contact, hold, squeeze and relax 5 states, transitions between states rely on the contraction and stretching of a single muscle to achieve C. The time domain characteristics (over 0 pips, average absolute value, etc.) of EMG signals in Canada using different modes of operation, using artificial neural networ

Problem Descriptiongiven A string containing only ' a '-' Z ', we could encode it using the following method:1. Each sub-string containing k same characters should being encodedto "KX" where "X" is the only character in this Sub-strin G.2. If the length of the sub-string is 1, ' 1 ' should beignored.Inputthe first line contains an integer N (1 Outputfor each test case, output the encoded string in Aline.Sample INPUT2ABCABBCCCSample outputabca2b3c #include #include #include using namespace Std;in

output infSample INPUT3 72 20 0Sample Output11infSourcethe 6th UESTC Programming ContestRecommendlcy | We have carefully selected several similar problems for you:1573 1060 1018 2535 3244 n days without knocking over the title, my fault. Brain Tease TM fast out of Xiang. First of all, look for a two times the feeling. Find the law, see the puzzle. Summarize it. int doesn't know why he can't live.#include #include#includeusing namespaceStd;__int64 gcd (__int64 x, __int64 y) {returnx%y==0? Y:GCD

whether these numbers can be similar into the stack out of the operation of the stack to get the number of questions given to the series;It's good to simulate with a stack.PS: Be sure to pay attention to the output format!!! After writing the code, Leng has been WA, started because the stack did not empty, and then found that the output format is not correct!!!The lesson of blood, changed long time!!!1#include 2#include 3#include 4#include 5#include 6#include 7#include 8#include 9#include Ten#i

Max Sumproblem Descriptiongiven A sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a Sub-sequenc E. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.Inputthe first line of the input contains an integer T (1Outputfor Each test case, you should output of the lines. The first line was "Case #:", # means the number of the the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-

world;Thanks to the opponents, they make us keep making progress and efforts.Likewise, we would like to thank the pain and hardship brought to our wealth ~ Input data first contains a positive integer c, which indicates that there is a C set of test cases, the first line of each set of test cases is two integers n and m (1Output for each set of test data, export the maximum weight that can be purchased for rice, and you can assume that you are spending more than all of the rice, and you c

Problem Description this summer holiday training team The first composition girls team, including a team called RPG, but as one of the training team members of the wild camel unexpectedly do not know RPG three person specifically who. RPG gave him the chance to let him guess, the first guess: R is the princess, p is the grass, G is the Moon hare; the second guess: R is grass, p is the Moon hare, G is the princess; Third guess: R is grass, p is princess, G is moon Hare; The poor wild camel finall

, (1,k) is not P-state. For example, if you face the 1,3 situation, you are likely to win. Similarly, (k,2), (1 + k, 2 + K) are also not P-states, and these points are zoned out and their symmetry points. Then find the remaining points above y = x, and you will find that (3,5) is a P-state, so go on, assuming we just find out the P-state of A≤b. Then they are (0,0). (For each). (3,5), (4,7), (6,10) ... Do they have any rules? Ignoring (0,0), it is very fast to find a for the P-State of I. A = i

This kind of problem with decimals always gives me extra headaches./*id:modengd1prog:fence9lang:c++*/#include 　　Usaco Electric Fence