C. Sanatorium time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation! Every day th…

Sanatorium time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation! Every day there…

C. Sanatorium time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation! Every day th…

time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation! Every day there was a breakfas…

题意:某人去旅游,记录了一共吃了多少顿饭,早中晚,但是有可能缺少,问你最少缺少了多少顿. 析:每把三个数排序,然后再一一对比,肯定是以最大数为主,其他两个肯定是缺少了. 代码如下: #pragma comment(linker, "/STACK:1024000000,1024000000") #include <cstdio> #include <string> #include <cstdlib> #include <cmath> #i…

A. Buy a Shovel time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is so…

A. Buy a Shovel time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is so…

Sanatorium CodeForces - 732C Vasiliy spent his vacation in a sanatorium, came back and found that he completely forgot details of his vacation! Every day there was a breakfast, a dinner and a supper in a dining room of the sanatorium (of course, in t…

PS:这一场真的是上分场,只要手速快就行.然而在自己做的时候不用翻译软件,看题非常吃力非常慢,还有给队友讲D题如何判断的时候又犯了一个毛病,一定要心平气和,比赛也要保证,不要用翻译软件做题: Codeforces732A 水题: #include<cstdio> #include<math.h> #include<queue> #include<map> #include<string> #include<string.h> #inc…

A. Buy a Shovel 题意是很好懂的,一件商品单价为k,但他身上只有10块的若干和一张r块的:求最少买几件使得不需要找零.只需枚举数量判断总价最后一位是否为0或r即可. #include<bits/stdc++.h> using namespace std; const int N=100000+10; //int a[N]; int main() { long long n,k; while(~scanf("%I64d%I64d",&k,&n))…