OJ Board

Victor wrote:

but there in your output is one extra space at every line

my output didn't print extra space.it was happened when you copied from
this page. anyways,is there any tricky i/o?still getting worng answer.


Thanks in advance.

i know it is simply a LDS problem and my prog gives same output as mf.
but i got wrong answer in 0.107 sec and cannot find bugs.my algorithm is
i use LDS from the reverse of the array then find the increasing seqence
from the front side for each query.
can anyone check if my given output is correct ...

correct your output pattern and check your input patter.i am sure that your code is correct.why?because my code is same

the number will be at best 9999*10000 .
so how do you check prime if the number will be greater then 300000000?

i followed the same procedure of guest #2 but getting worng answer.
can you please give some input output of the problem?

Thanks.

i don't understand this

cout << div;
switch (rem) {
case 0: cout << "00";
break;
case 1: cout << "25";
break;
case 2: cout << "50";
break;
case 3: cout << "75";
break;
}


why you print div then the other value that is in switch-case.

did your output matches with the sample?
for input ...

this is a huge code .
it is better to post your procedure than code for better undestanding
for the reader.
and you also may get the reply from all the programmers of different
languages .

try this :

INPUT :

33
5 3 5 6 3 8
5 6 4 5 4 12
21 15 17 16 32 28 22 26 30 34 29 31 20 24 18 33 35 25 27 23 19 21
8 922 7912 7299 6369 9734 5226 9503 2307
12 6667 1903 2516 6149 4515 3388 2497 9125 7007 7727 2658 1221
3 9858 1730 8553
9 2429 7761 9133 5532 8835 7629 5560 2815 8383
4 8930 4868 7901 ...

read this :
You should note that 80% of the test cases will have at most 1000 numbers in the sequence.

so you can run siv atmost for 100000

and remember that this is a consecutive subsequence of length at least two.

so sum them and check in siv if it is in limit .if not then check menually
that ...

Thanks Cho for your great response.

I do the same calculation in integer data type
and accepted now.

Thanks again.

Thanks again Cho. same output again without any modify. its may be floating point error. Ok, i'll try to solve without floating point oparetion. but i can't understand without floating point calculation how do i know that red balls are invalid?

To Shamim

when the roots become negetive then this ...

Again same output.why wrong answer ? My procedure is :

1. First I solve the equation to find the roots.
2.if the roots are fractional then R false.
3.Otherwise . if they are not less than .7 or negetive B false.
4.if not,print the root / roots by checking them.

Here is the parts of my code ...

Thanks Cho for your reply.
My prog gives same output but still wrong answer.
is there any spacial case?
if possible please give some more input data.

thnaks again.

Can some one give me some test cases for this problem?
i can't find bug in my code.

Thanks in advance .[/b]