A - Eating Soup CodeForces - 1163A

A - Eating Soup CodeForces - 1163A

题目大意

给出一个数，按顺序从1—n连成一圈，再给出一个数m，求从圈中删去m个数后，最多有多少组数联通。

思路

手写以下规律就出来了，但我傻逼的把规律写错了，找了很久错没有找到，最后重写规律A了，我就是个憨憨！

#include <iostream>
#include <cstdio>
#include<cstdlib>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include<time.h>
#include <stack>
#include <list>
#include <set>
#include <sstream>
#include <iterator>
using namespace std;
#define FOPI freopen("input.in", "r", stdin)
#define DOPI freopen("output.out", "w", stdout)
#define ll long long int
#define fro(i,a,n) for(ll i=a;i<n;i++)
#define pre(i,a,n) for(ll i=n-1;i>=a;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define ls l,mid,rt<<1
#define rs mid+1,r,rt<<1|1
#define fi first
#define se second
#define s_d(a) scanf("%d",&a)
#define s_lld(a) scanf("%lld",&a)
#define s_s(a) scanf("%s",a)
#define s_ch(a) scanf("%c",&a)
typedef pair<ll,ll> P;
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
const double PI = 3.1415926535897932;
const double EPS=1e-6;
const int INF=0x3f3f3f3f;
const int maxn = 1e2+100;
int lowbit(int x){return x&(-x);}
int main()
{
    ios::sync_with_stdio(0);
    int m,n;
    cin>>m>>n;
    int a=m/2;
    if(n<=a&&n>0)
        cout<<n<<endl;
    if(n>a)
        cout<<m-n<<endl;
    if(n==0)
        cout<<1<<endl;
    return 0;
}