1. Winning Ticket - Regular Expressions - More Exercise - C# Fundamemtals
Здравейте,
става въпрос за задача 1. Winning Ticket - More Exercise , гърмят ми 6, 7 и 8 тест и не мога да разбера къде е проблема, какъвто и вход да въведа работи правилно, но в judge ми дава 70/100. Ще съм много благодарна, ако някой ми помогне
Ето коса ми - https://pastebin.com/8h79rbas
Условие
Lottery is exciting. What is not, is checking a million tickets for winnings only by hand. So, you are given the task to create a program which automatically checks if a ticket is a winner.
You are given a collection of tickets separated by commas and spaces. You need to check every one of them if it has a winning combination of symbols.
A valid ticket should have exactly 20 characters. The winning symbols are '@', '#', '$' and '^'. But in order for a ticket to be a winner the symbol should uninterruptedly repeat for at least 6 times in both the tickets left half and the tickets right half.
For example, a valid winning ticket should be something like this:
"Cash$$$$$$Ca$$$$$$sh"
The left half "Cash$$$$$$" contains "$$$$$$", which is also contained in the tickets right half "Ca$$$$$$sh". A winning ticket should contain symbols repeating up to 10 times in both halves, which is considered a Jackpot (for example: "$$$$$$$$$$$$$$$$$$$$").
Input
The input will be read from the console. The input consists of a single line containing all tickets separated by commas and one or more white spaces in the format:
- "{ticket}, {ticket}, … {ticket}"
Output
Print the result for every ticket in the order of their appearance, each on a separate line in the format:
- Invalid ticket - "invalid ticket"
- No match - "ticket "{ticket}" - no match"
- Match with length 6 to 9 - "ticket "{ticket}" - {match length}{match symbol}"
- Match with length 10 - "ticket "{ticket}" - {match length}{match symbol} Jackpot!"
Constrains
- Number of tickets will be in range [0 … 100]
Examples
Input |
Output |
Cash$$$$$$Ca$$$$$$sh |
ticket "Cash$$$$$$Ca$$$$$$sh" - 6$ |
$$$$$$$$$$$$$$$$$$$$, aabb , th@@@@@@eemo@@@@@@ey |
ticket "$$$$$$$$$$$$$$$$$$$$" - 10$ Jackpot! invalid ticket ticket "th@@@@@@eemo@@@@@@ey" - 6@ |
validticketnomatch:( |
ticket "validticketnomatch:(" - no match |
Много благодаря, това ми беше грешката!
Hello everybody!
Although with every given input I receive the correct output, I have problem with test- 6,7 and 8 as well. I get the correct ouput with those inputs too:
@@th@@@@@@e@@m@@@@@@ - 6
@@@@@@@@@@et@@@@@@@@ - 8
Is it possible that Judge gives me only 70/100, because I don't use the second regex to count the max sequences of the repeating symbols? I used two for loops for the left and the right side in order to count the repeating sequences.
https://pastebin.com/phRuc71B
I have just founded one of my mistake- in the last if/else conditions we have to use only:
int validTheRepeatingLengthInBothSide = Math.Min(maxRightLengthOfTheSameSequences, maxLeftLengthOfTheSameSequences);
At the moment I have problem with only test Test #8 (Incorrect answer) 90/100: https://pastebin.com/phRuc71B .
If anybody has any idea about the Test 8 input, please share it. Thanks!