Eating Soup

https://codeforces.com/contest/1163/problem/A

题解：

C++版本一

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{};
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&m);int l=n/2;if(m==0){cout<<1<<endl;}else if(m<=l){cout<<m<<endl;}else if(n%2&&m==l+1){cout<<n/2<<endl;}else if(n%2){cout<<n/2-(m-1-l)<<endl;}else{cout<<n/2-(m-l)<<endl;}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

C++版本二

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{};
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&m);cout<<min(n-m,max(m,1))<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

Eating Soup相关推荐

水题Eating Soup
A. Eating Soup time limit per test1 second memory limit per test256 megabytes inputstandard input ou ...
Codeforces 1163A - Eating Soup
题目链接:http://codeforces.com/problemset/problem/1163/A 题意:n 只猫围成一圈,离开 m 只,最多剩下几组猫. 思路:当 n == m 即猫都离开时 ...
行家来信 | 我在国际AI开源组织LFAI当董事的200天
来信行家:肖涵腾讯AI Lab高级科学家量子位出品 | 公众号 QbitAI 编者按:在国际知名开源组织工作是一种怎样的体验?目前中国组织和公司,正在越来也多参与到全球技术开源的生态建设中,口碑 ...
soup.a.parents都有哪些
代码: import requests from bs4 import BeautifulSoup r = requests.get("https://python123.io/ws/dem ...
Python Beautiful Soup类的基本元素
Beautiful Soup库是解析,遍历,维护"标签树"的功能库. 条件: pip install lxml pip install html5lib 以下5种基本元素是使用方法 ...
Python爬虫利器之Beautiful Soup的用法，以及实例！
可以利用 pip 来安装: pip install beautifulsoup4 源代码: import requests r = requests.get("https://python1 ...
Python爬虫利器之Beautiful Soup的全世界最强用法五百行文章！
0. 前言爬虫是一个非常有意思的东西,比如自己做的一个网页上面什么数据都没有就可以爬虫别人的然后进行去重数据分析等等在这里因为爬虫涉及到的方面非常多 1. Beautiful Soup的简介 ...
lxml安装_Beautiful Soup的安装和使用
不用正则也可匹配html语言,代替正则解析html的这个工具叫做Beautiful Soup(美味的汤?哈哈哈哈哈哈哈) 安装Beautiful Soup Pip install Beautiful ...
python爬虫beautifulsoup实例-Python爬虫学习（二）使用Beautiful Soup库
(一)使用Beautiful Soup库(默认将HTML转换为utf-8编码) 1,安装Beautiful Soup库:pip install beautifulsoup4 2,简单使用: impor ...

Eating Soup

Eating Soup相关推荐

最新文章

热门文章