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

  • asbear
     + 4 comments

    This function works quicker than of editorial.

    // return negative number if not found 
// otherwise pivot is returned.
// caller can print 5 x pivot + 3 x (n-pivot)
int getPivot(int n) {
    while(n > 0) {
        if(n%3 == 0)
            break;
        else
            n -= 5;
    }
    return n;
}

    So you can do this:

    int pivot = getPivot(n);
if(pivot < 0) 
    cout << "-1" << endl;
else {
    int repeat = pivot/3;
    while(repeat--)
        cout << "555";
    repeat = (n-pivot)/5;
    while(repeat--)
        cout << "33333";
    cout << endl;
}