1783 병든 나이트

 

모든 경우를 다 구했다..

 

 

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <string>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <cmath>
#include <cstring>
#include <bitset>
#include <stdio.h>
#include <math.h>

#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()

using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using iis = pair<int, string>;
using ii64 = pair<i64, i64>;
using iii = tuple<int, int, int>;

int main() {
    i64 n, m;
    scanf("%lld %lld", &n, &m);
    
    int ans;
    if (n == 1)
        ans = 1;
    else if (n == 2)
        ans = min(4ll, (m - 1)/2 + 1);
    else if (m <= 6)
        ans = min(4ll, m);
    else
        ans = m - 2;
    
    printf("%d", ans);
    
    return 0;
}