GSS4 - Can you answer these queries IV
You are given a sequence A of N(N <= 100,000) positive integers. There sum will be less than 1018. On this sequence you have to apply M (M <= 100,000) operations:
(A) For given x,y, for each elements between the x-th and the y-th ones (inclusively, counting from 1), modify it to its positive square root (rounded down to the nearest integer).
(B) For given x,y, query the sum of all the elements between the x-th and the y-th ones (inclusively, counting from 1) in the sequence.
Multiple test cases, please proceed them one by one. Input terminates by EOF.
For each test case:
The first line contains an integer N. The following line contains N integers, representing the sequence A1..AN.
The third line contains an integer M. The next M lines contain the operations in the form "i x y".i=0 denotes the modify operation, i=1 denotes the query operation.
For each test case:
Output the case number (counting from 1) in the first line of output. Then for each query, print an integer as the problem required.
Print an blank line after each test case.
See the sample output for more details.
Input: 5 1 2 3 4 5 5 1 2 4 0 2 4 1 2 4 0 4 5 1 1 5 4 10 10 10 10 3 1 1 4 0 2 3 1 1 4 Output: Case #1: 9 4 6 Case #2: 40 26
Note that Ai may hold a negative number, this was not mentioned in the statement
Purely for optimization, sacrificed code quality for AC
Last edit: 2019-01-01 09:17:39
Don't forget edge cases, when a query(l, r) has l > r;
just pruning got ac
@Riddhi EOF is == -1. While thinks it as TRUE. So, after getting the last number while loop won't stop. As a result scanf will try again to take a number but there is nothing left to take input in judge data. Thus you program will cause a RTE.Last edit: 2018-04-20 07:28:54
didn't know that <while(scanf("%d", &n))> gives runtime error
hello,can anyone make an editorial for this problem or poste his solution
Good problem, learned new things :)