147742025-02-02 11:52:07PKBSakktábla (75 pont)cpp17Wrong answer 35/751ms548 KiB
#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int N, M;
    cin >> N >> M;

    int max_side = 0;

    for (int K = 1; K <= 1000; K++) {
        int white_needed = (K * K + 1) / 2;
        int dark_needed = K * K / 2;

        if ((white_needed <= N && dark_needed <= M) || (dark_needed <= N && white_needed <= M)) {
            max_side = K;
        } else {
            break;
        }
    }

    cout << max_side << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/75
1Accepted0/01ms548 KiB
2Wrong answer0/01ms316 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms316 KiB
9Accepted5/51ms316 KiB
10Wrong answer0/51ms316 KiB
11Wrong answer0/71ms316 KiB
12Wrong answer0/71ms316 KiB
13Wrong answer0/71ms316 KiB
14Wrong answer0/71ms316 KiB
15Wrong answer0/71ms316 KiB