Search found 9 matches
- Fri Jun 09, 2017 11:53 pm
- Forum: Volume 12 (1200-1299)
- Topic: 1294 - Mini-Spreadsheet
- Replies: 1
- Views: 1024
Re: 1294 - Mini-Spreadsheet
According to my assert() logic, I am not processing all input. for (row = 1; row <= 10; ++row) { row_ids["r" + number[row]] = row; row_ids["R" + number[row]] = row; } while (std::cin >> token) { if (row_ids.count(token) == 1) { //...read 10 cells worth of content } // THIS ASSERT causes fault else a...
- Thu May 18, 2017 9:22 pm
- Forum: Volume 12 (1200-1299)
- Topic: 1295 - Houses Divided
- Replies: 1
- Views: 1048
Re: 1295 - Houses Divided
Problem statement contains the output specification guidance: The output should be labeled exactly as shown in the sample output below, with a blank line separating the outputs for consecutive data sets. Following the quoted guidance gave me a Presentation Error. When I added an extra blank line at ...
- Thu May 19, 2016 6:05 pm
- Forum: Volume 119 (11900-11999)
- Topic: 11906 - Knight in a War Grid
- Replies: 13
- Views: 7607
Re: 11906 - Knight in a War Grid
Regarding the count of zero at (0,0)... "start" != "visit". If this is applicable for other grids as well, can somebody please tell how the AC output for below input is 1 0? +----------------------+------------------------------------------+ | (0, 0) -> (-29, -7) | X & Y Grid coordinates are off the...
- Thu May 19, 2016 5:48 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10117 - Nice Milk
- Replies: 6
- Views: 3229
Re: 10117 - Nice Milk
This worked for me: assume the judge input contains concave polygons.
Concave polygon input:
AC-ish output:
Whether or not the judge input actually contains concave polygons I do not know.
Concave polygon input:
Code: Select all
4 3 2
0 0
5 1
10 0
5 10
0 0 0
Code: Select all
41.87
- Sat Apr 09, 2016 2:09 am
- Forum: Volume 116 (11600-11699)
- Topic: 11682 - Shift Register
- Replies: 1
- Views: 2910
Re: 11682 - Shift Register
If anyone could clarify how totally off base this approach is, that would be great... I am attempting to solve this using baby step, giant step. Being my first attempt at solving a LFSR, I am very likely failing to model the problem correctly. For input (3rd sample input case) 7 3 0 2 3 4d 1a I have...
- Tue Mar 29, 2016 1:34 am
- Forum: Volume 109 (10900-10999)
- Topic: 10902 - Pick-up Sticks
- Replies: 24
- Views: 13314
Re: 10902 - Pick-up Sticks
Just noting...for test cases:
uDebug AC output is:
My AC output is:
Code: Select all
2
1 1 2 2
2 2 3 3
6
0 0 -1 1
-2 2 -3 3
0 0 -1 1
-2 2 -3 3
0 0 -1 1
-2 2 -3 3
0
Code: Select all
Top sticks: 1, 2.
Top sticks: 1, 2, 3, 4, 5, 6.
Code: Select all
Top sticks: 2.
Top sticks: 5, 6.
- Tue Feb 23, 2016 12:07 am
- Forum: Volume 1 (100-199)
- Topic: 163 - City Directions
- Replies: 24
- Views: 10382
Re: 163 - City Directions
Input:
FWIW, my AC output is:
Code: Select all
A50W S49S S
TURN LEFT
TURN LEFT
STOP
END
Code: Select all
A49W S50S N
- Fri Jan 29, 2016 11:40 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10389 - Subway
- Replies: 0
- Views: 1251
10389 - Subway
In case anyone has a concern about producing a rounded output for this problem... For input 3 0 0 0 10000 0 0 0 14999 0 20000 -1 -1 0 0 0 10000 0 0 0 15000 0 20000 -1 -1 0 0 0 10000 0 0 0 15001 0 20000 -1 -1 uDebug delivers the output 52 52 53 My AC output 52 53 53 My C++11 print statement would see...
- Wed Jan 13, 2016 3:34 am
- Forum: Volume 118 (11800-11899)
- Topic: 11821 - High-Precision Number
- Replies: 8
- Views: 5254
Re: 11821 - High-Precision Number
Interesting point of difference between my AC submission and uDebug...
Test input:
My AC result:
uDebug result:
Should I consider my solution unacceptable?
Test input:
Code: Select all
1
0.00000000000007
0
Code: Select all
0.00000000000007
Code: Select all
7E-14