We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Greedy
  4. Sherlock and The Beast
  5. Discussions

Sherlock and The Beast

  • RobertsN
     + 2 comments

    No need for repeated subtractions or loops. It's purely O(1) (just straightforward formula split in two parts, two calculations).

    int q = ((3-(N%3))%3) *5;
if (N-q < 0)
	cout << -1 << endl;
else
	cout << string(N-q,'5') << string(q,'3') << endl;