ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 2037. Richness of binary words

Wa 8
Posted by Felix_Mate 29 Aug 2016 13:40
What is test 8?
I tested my program for 9<=n<=200 brute force and my answers is right.
For 1<=n<=8 output is:
i : NO when i<=n-1
n: aaaaaaaa (n times)
Re: Wa 8
Posted by bsu.mmf.team 29 Aug 2016 16:29
This is not true for n = 8. The correct answer is:
1 : NO
2 : NO
3 : NO
4 : NO
5 : NO
6 : NO
7 : aababbaa
8 : aaaaaaaa
Re: Wa 8
Posted by Felix_Mate 29 Aug 2016 17:19
Thanks! I got AC! My error: I found solution for n<=8 by hand.