## Search found 69 matches

Fri Jun 29, 2018 11:21 pm
Forum: Volume 16 (1600-1699)
Topic: 1619 - Feel Good
Replies: 1
Views: 1733

### Re: 1619 - Feel Good

I think, that something is not correct with problem description or testing input/output. I was wondered about statistics, more than 50% submission were WA. I tried to solve this problem and I had many WA's too. At first, I tried write empty line after last case, it didn't help. Empty line should be ...
Mon Oct 23, 2017 11:22 pm
Forum: Volume 8 (800-899)
Topic: 804 - Petri Net Simulation
Replies: 9
Views: 6472

### Re: 804 - Petri Net Simulation

I had many WA's because I didn't assume, that NT (number of transitions) can be zero. After this assumption, I had AC. Sample input: 2 1 0 2 -1 2 0 -2 1 0 100 2 0 0 2 -1 2 0 -2 1 0 0 3 3 0 0 3 -1 2 0 -2 -2 3 0 -3 1 0 100 2 0 0 2 -1 2 0 -2 1 0 0 0 Correct output: Case 1: still live after 100 transiti...
Sun Dec 14, 2014 5:42 pm
Forum: Volume 128 (12800-12899)
Topic: 12806 - Grand Tichu!
Replies: 1
Views: 741

### Re: 12806 - Grand Tichu!

Hi alexhighviz, I agree with you. I have to submit wrong program, when I want get "Accepted". In fact, it is not needed "dM" in input. It is enough to have Phoenix and just two aces in the first eight cards and all we need is Dragon, because of the first or second case of winning (D, P, A+ or D, 2A+...
Sat Feb 09, 2013 9:54 am
Forum: General
Topic: More unsolvable problems(?)
Replies: 1
Views: 6736

### More unsolvable problems(?)

Last days, I have noticed, that my number of solved problems decreases about 16. I found out, that missing problems are 509, 582, 778, 781, 789, 930, 932, 933, 937, 938, 942, 943, 963, 971, 994, 998. All this problems (and maybe more in generally) change their mark from green/yellow to red. We can s...
Sun Apr 17, 2011 12:32 am
Forum: Volume 119 (11900-11999)
Topic: 11953 - Battleships
Replies: 23
Views: 6310

### Re: 11953 - Battleships

Hi truewt, I think, your output is not correct for sample input, you forgot print end of line character, so your output is only one line... Change cout << "Case " << counter++ << ": " << ans; to cout << "Case " << counter++ << ": " << ans << "\n"; and I hope you will get AC now. Your floodfill seems...
Fri Apr 15, 2011 11:00 pm
Forum: Volume 119 (11900-11999)
Topic: 11952 - Arithmetic
Replies: 11
Views: 4335

### 11952 - Arithmetic

Hello, I think, that this problem is not difficult, but it have many WA's (me too). Are there some critical test cases? I want ask for sentence "in base 1 character '1' is used as only possible digit". As I know, number in base b can have digits from 0 to b-1, that means no '1' can be in base-1 numb...
Fri Apr 08, 2011 11:04 pm
Forum: Volume 119 (11900-11999)
Topic: 11944 - \$ 10 to Win?
Replies: 5
Views: 2602

### Re: 11944: \$ 10 to Win?

Hello, I have many WA's in this problem and I don't want make a guesses many more, I have question about "More than 1 million rule" (= if the value is above 1000000, that return 1000000). When should I apply this rule? Only in the end of computation ("Total returned"), and/or by every single Wager (...
Sat Feb 26, 2011 10:08 am
Forum: Volume 9 (900-999)
Topic: 958 - A Homer's Holiday
Replies: 0
Views: 1717

### 958 - A Homer's Holiday

I have many WAs in this problem. I have some questions. 1. What to do, when proposition begins with "N" and another proposition is the same except first "N"? Example of sample input: 2 canWalk NcanWalk canBreathe 1 NcanWalk What is the correct answer? When I assume N(canWalk), it is "no", when I ass...
Sat Oct 09, 2010 1:21 pm
Forum: Volume 118 (11800-11899)
Topic: 11800 - Determine the Shape
Replies: 47
Views: 13104

### Re: 11800 - Determine the Shape

I have 13 RTE's and 3 WA's before AC :) My idea was make convex hull from the input points and get input points in (counter)clockwise order. I assumed, that 4 points form always convexhull of 4 points - that is not correct. For input 1 0 3 -3 0 0 6 3 0 the 4 input points form convex hull of 3 points...
Sat May 22, 2010 1:24 pm
Forum: Volume 9 (900-999)
Topic: 952 - Uno game
Replies: 1
Views: 2199

### 952 - Uno game

It seems, that I misunderstood the strategy of play. I understand it so, that player choose card from his pile when it match with top card of discard pile in color of value and it has best rank (blue card better than red, red better than yellow, yellow better than green, by equal color pass card bet...
Sat Apr 03, 2010 10:49 pm
Forum: Volume 117 (11700-11799)
Topic: 11770 - Lighting Away
Replies: 27
Views: 8567

### Re: WA in problem 11770

Hi shaon3343, 11504 is very similar problem to this problem. I solved this problem by submitting solution of 11504 :D Problem 11504 has two differencies. First difference is in input, in 11504 there can be maximum of 100000 vertices, not only 10000. Maximum number of edges is the same. Second differ...
Mon Oct 12, 2009 8:28 pm
Forum: Volume 7 (700-799)
Topic: 760 - DNA Sequencing
Replies: 33
Views: 12692

### Re:

rio wrote:How about using more simple approach?
I don't know, if my approach is more simple, but I solved this problem with trie.
Fri Sep 11, 2009 7:38 pm
Forum: Volume 116 (11600-11699)
Topic: 11664 - Langton's Ant
Replies: 10
Views: 3611

### Re: 11664 - Langton's Ant

Hi slxst, test your function div2. For some inputs returns wrong answers. For example, for 215 returns 17 (correct 107 --> "0" is missing) for 441 returns 22 (correct 220 --> "0" is missing again), etc. The reason is in this part: if(digit % TWO == 0) { r += (digit / TWO) + '0'; } else { if(digit !=...
Mon Sep 07, 2009 10:44 am
Forum: Volume 116 (11600-11699)
Topic: 11664 - Langton's Ant
Replies: 10
Views: 3611

### Re: 11664 - Langton's Ant

Hi Igor9669, My AC code assumed, that cell(x,y) is cell in x-th column and y-th row. I think, that your problem may be in reading of second number of input. According problem description, this value is in range 0 to 2^(n^2)-1 in decimal representation. For n=16, maximal value for this number is 1157...
Mon Aug 31, 2009 5:09 pm
Forum: Volume 116 (11600-11699)
Topic: 11623 - Tic Tac Toe
Replies: 6
Views: 3800

### Re: 11623 - Tic Tac Toe

At the first sight, I think, that this problem is easy. But at the second sight, I don't think so :) For example, if m=3 and we find 3 consecutive 'X' in row, column or diagonal, this not automatically means, that X wins. Here is sample input and output from my AC program, some cases may be critical...