318C - Perfect Pair - CodeForces Solution


greedy math *1600

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>

using x64 = long long;

int main() {
    x64 x, y, m;
    std::cin >> x >> y >> m;

    if (x > y) std::swap(x, y);

    if (y >= m) {
        std::cout << 0 << std::endl;
    }
    else {
        if (y <= 0) {
            std::cout << -1 << std::endl;
        }
        else {
            x64 ctr = 0;
            if (x < 0) {
                ctr = (-x + y - 1) / y;
                x += ctr * y;
            }
            while (y < m) {
                x += y;
                if (x > y) std::swap(x, y);
                ctr++;
            }
            std::cout << ctr << std::endl;
        }
    }
}


Comments

Submit
0 Comments
More Questions

1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest