254392026-02-20 09:06:30mihalykocsisSakktábla (75 pont)cpp17Accepted 75/752ms756 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; int m; cin >> n >> m;
	int ans = 1;
	for (int i = 1; i <= sqrt(n + m); i++) {
		if (i % 2 == 0 && i * i / 2 <= min(n, m)) {
			ans = i;
		}
		if (i % 2 == 1 && i * i / 2 <= min(n, m) && i * i / 2 + 1 <= max(n, m)) {
			ans = i;
		}
	}
	cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms500 KiB
2Accepted0/01ms508 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/52ms316 KiB
6Accepted5/52ms316 KiB
7Accepted5/52ms316 KiB
8Accepted5/52ms508 KiB
9Accepted5/51ms316 KiB
10Accepted5/51ms500 KiB
11Accepted7/71ms316 KiB
12Accepted7/71ms316 KiB
13Accepted7/72ms756 KiB
14Accepted7/72ms316 KiB
15Accepted7/71ms316 KiB