h d electric

Descriptiona range is given, the begin and the end are both integers.You should sum the cube of all the integers in the range. Inputthe first line of the input was T (1 Each case of input is a pair of integer A, a (0 1#include 2__int64 a[1000000]={0,1};3 intMain ()4 {5 for(__int64 i=1; i1000000; i++)6 {7a[i]=a[i-1]+i*i*i;8 }9__int64 t,k=0;;Tenscanf"%i64d",t); One while(t--) A { - __int64 m,n; -scanf"%i64d%i64d",m,n); theprintf"Case #%i64d:%i64d\n", ++k,a[n]-a[m-1]); - }

. Then a long time to think about the reason, finally after I Baidu to know where the problem.When n (n+1) is multiplied, it overflows. The title asks "may assume the result is in the range of 32-bit signed integer", which requires that the sum is a 32-bit signed integer. The sum of the test data given by OJ (n (n+1)/2) must be within the range of 32-bit integers, but (n (n+1)) is not necessarily. The reason you can infer WA should be here. You can subtly change the formula:Putsum=n* (n+1)/2;Swi

#include#includeusing namespaceStd;inlineintRd () {intx=0, f=1; CharCh=GetChar (); for(;! IsDigit (CH); Ch=getchar ())if(ch=='-') f=-1; for(; isdigit (ch); Ch=getchar ()) x=x*Ten+ch-'0'; returnx*F;} InlinevoidWriteintx) { if(x0) Putchar ('-'), x=-x; if(x>9) Write (x/Ten); Putchar (x%Ten+'0'); return ;}intn,m;inthead[100006];intnxt[200006],to[200006];intTotal=0;voidAddintXinty) { Total++; To[total]=y; Nxt[total]=Head[x]; HEAD[X]=Total ; return ;}intdfn[100006],low[100006];inttot=0;intnum[100

Problem Description There is many lamps in a line. All of the themare off at first. A series of operations is carried out on these lamps. On thei-th operation, the lamps whose numbers is the multiple of I change thecondition (on to off and off).Input Each test case contains only a number n (0Output output The condition of the n-th lamp after infinity operations (0-off, 1-on).Sample Input 15Sample Output 10HintConsider the second test case:The initial condition:0 0 0 0 0 ...After the first Operat

The least oneTime limit:9000/3000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 492 Accepted Submission (s): 184Problem Description in the RPG game ' go back Ice Age ' (I decide to develop the game after my undergraduate education), all Heros has their own respected value, and the skill of killing monsters is defined as the following rule:one hero can Ki LL the monstrers whose respected values is smaller then himself and the both respected values have none common

positive.Input the first line have one integer Q, then Q lines follow. In the Q lines there are an integer Mi, 0Output for each case, there is Q results, in each result, you should output the value of the hero you'll dispatch to C Omplete the task.Sample Input237Sample Output511AuthorwangyeSource2008 "Insigma International Cup" Zhejiang Collegiate Programming Contest-warm up (4)Recommendwangye | We have carefully selected several similar problems for you:1793 1796 1797 1794 1798 test instructio

)); in -current.x=x; tocurrent.y=y; +Current.time=0; -vis[current.x][current.y]=1; the Q.push (current); * $ Panax Notoginseng while(!q.empty ()) - { the +Current=q.top (); A Q.pop (); the for(intI=0;i4; i++) + { -next.x=current.x+dir[i][0]; $next.y=current.y+dir[i][1]; $ - if(next.x>=0next.x0next.y'#'!Vis[next.x][next.y]) - { the - if(map[next.x][next.y]=='R')Wuyi returncurrent.time+1; the

input; Otherwise 1 Outputfor each grid, output the number of distinct oil deposits. The different pockets is part of the same oil deposit if they is adjacent horizontally, vertically, or diagonally. An oil deposit won't contain more than pockets.Sample INPUT1 1 * 3 5 *@*@* **@** *@*@* 1 8 @@****@* 5 5 ****@ *@@*@ *@**@ @@@*@ @@**@ 0 0Sample Output0 1 22Sourcemid-central USA 1997Recommendeddy | We have carefully selected several similar problems for you:1016 1010 1312 1242 1240//Mark →→1#include

Prime Ring problemTime limit:4000/2000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 28204 Accepted Submission (s): 12561Problem Descriptiona Ring is compose of n circles as shown in diagram. Put Natural number 1, 2, ..., n into each circle separately, and the sum of numbers in the adjacent circles should is a PR Ime.Note:the number of first circle should always be 1.INPUTN (0 Outputthe output format is shown as sample below. Each row represents a series of cir

input data. The first row of each group of data has two positive integer n,m (0Note: There is no relationship between inquiries, it is for the current state!OutputEach set of input data corresponds to one row of output. If you can eliminate the output "YES", you cannot output "no".Sample InputSample OutputYesnonononoyes This topic at that time to pit me an afternoon time .... The code is flawed, and there are always unexpected letters, and the most pit is that dir array elements are not the sam

)Outputfor each data set, your program should output a line which contains the number of tiles he can reach from the Initia L tile (including itself).Sample Input6 9....#......#..............................#@...#.#. #.11 9.#..........#.#######. #.#.....#.. #.#.###.#.. #.#[email protected]#.#. #.#####.#.. #.......#.. #########............ 11 6..#. #.. #....#.. #.. #....#.. #.. ###.. #.. #.. #@...#.. #.. #....#.. #.. #.. 7 7..#.#....#.#. ###.###[email protected]###.###. #.#....#.#.. 0 0Sample Out

Least common multipleTime limit:2000/1000 MS (java/others) Memory limit:65536/32768 K (java/others)Total submission (s): 38681 Accepted Submission (s): 21606Problem DescriptionGiven two positive integers, calculate the least common multiple of these two numbers.InputThe input contains multiple sets of test data, with only one row per group, including two positive integers not greater than 1000.OutputFor each test case, the least common multiple of these two numbers is given, and each instance ou