I done it. But i can't understand it.
Thxs

If you get wrong answer on test #6,you should notice that there may be a '+' following the 'e'.

If WA 25, try this:
1
1010
1100

Error in record #1. Correct number is: 1100.

ok, I wanne say that double is not a precise number in computer.
there must be many unusual mistakes if you use double...
so, a better way is read them as strings,and then translate them to a long long number,which is 100 times as big as the input number.
so,now you can solve this without the trouble of precise....

p.s. you can also times the double with 100, but I think you will get a TLE....

sorry for my english....

Sorry, it was a very stupid bug in my program

Edited by author 07.06.2011 22:52

How to solve this (1315) faster than 0.1 sec?

Which algo for this?

My algo like this:
For each cell i store: type (air, water or rock) and swim-air-capacity (number of cells can swim from this point)

After load I have map with air and rocks
First I filling topmost air-spaces with water and continue graph-fill to left to right and downwards, to determine which air-cells filled with water

Second, I make air-capacity for start-cell is D+1, and thent I start BFS-fill of map like this:
while cell-air-capacity is more than 0, i fill neighbour-cells: if neighbour-cell is air, set air-capacity to (D + 1), if water, and that air-capacity less than in this cell - then set air-capacity to value of this cell, decreased by 1.

If one of cells in topmost row filled with Air-capacity 2 or more, then result "Can be rescued by himself"

This algo takes 0,328 sec. But I can see in statistic there 0,031 and 0,045 sec results.

Which algo can do it faster?

Excuse my English )

Edited by author 06.06.2011 21:22

Can we have any numbers in our input text???

Solution deleted by author

Edited by author 06.06.2011 01:53

test 7 only has a single '(', nothing more. When you are using linux and read from file, be careful with that an '\n' will be added.

Could someone explain me why I've got Crash #9?
I was trying all tests here but I've got nothing.

#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;

int n, a[111111], b[111111], i, l = 0, sum, index = 1;

int main()
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif

    cin >> n;

    for(i=1;i<=100000;i++) {
        a[i] = a[i-1] + i;
    }

    while(true) {
        sum = a[index] - a[l] + l;
        if(sum == n) {
            int e = index - l + 1;
            if(l == 0)    l++, e--;
            cout << l << " " << e;
            return 0;
        }
        if(sum > n) {
            l++;
        }
        else {
            index++;
        }
    }

    return 0;
}

Edited by author 05.06.2011 21:10

I was talking bullshit if you read this before.
Test 6 has k = 0, that was my problem.


Edited by author 24.09.2010 19:18

Someone advices this test
4
4 0
3 0
4 0
0
when I try it output is 0101 is it right?

Hello all i am new to programming problems and i want to improve.

I am having trouble understanding this problem.
The ticket is lucky if the sum of first half of digits is equal to the sum of next half of digits rite??

that is if the number is 23 then 2+0 must be equal to 3+0 rite???

if that is the case i am having trouble regarding my program

in my program i break up the digits for example for 2 digit numbers i have two vars d1 and d2

i have a loop from n=10 to n<=99
if the number is 24(i am considering only two digit numbers)
then d1 is 2 and d2 is 4
and then i check the condition using
if((d1+0)==(d2+0))
 count++;

i know my code would be very long for nums with more than 2 digits but even for this i am not getting the answer..I just dont understand the mathematics part of this program on how to split the numbers and how to run the loop. any help would be greatful

How to see tests for the program?

I used graf[n][n] and got MLE on test9.My solution is O(n^2).

Edited by author 05.06.2011 15:08

It is not clear if empty lines can be used in the input.
Is the next example possible?
<empty line>
5
#

Who can help me?
I dont't konw how to change my code now!
Can anyone show your c++ code to me?
Thank you very much!

It is clear that we can't have leading spaces in case correct real number. But is it possible to have spaces after correct number till the end of the string?
Example:
1.2e-3SSS
5
#