csust-8.9早训CF之800-2200分

最新推荐文章于 2019-08-14 14:35:45 发布

lonely_wind_

最新推荐文章于 2019-08-14 14:35:45 发布

阅读量280

点赞数

分类专栏： csust暑训

本文链接：https://blog.csdn.net/qq_43906000/article/details/99005782

版权

csust暑训专栏收录该内容

18 篇文章 3 订阅

订阅专栏

A - Toda 2

B - Minimum and Maximum

C - Bulmart

D - Buy a Shovel

E - Cormen — The Best Friend Of a Man

F - Sanatorium

#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false)
int main() 
{
	IOS;
	int ans, n, k, r, nb = 1;
	cin >> n >> r;
	k = n;
	while (1) {
		if (n % 10 == r || n%10==0) {
			break;
		}
		nb++; n += k;
	}
	cout << nb << endl; 
}

E - Cormen — The Best Friend Of a Man

CodeForces - 732B

题目链接https://codeforces.com/problemset/problem/732/B

#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false)
int a[550];
int main() 
{
	IOS;
	int ans, n, k, r, nb = 0;
	cin >> n >> r;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	for (int i = 1; i < n; i++) {
		if (a[i] + a[i + 1] < r) nb += r - a[i] - a[i + 1], a[i + 1] += r - a[i] - a[i + 1];
	}
	cout << nb << endl; 
	for (int i = 1; i <= n; i++)
		cout << a[i] << " ";
	cout << endl;
	return 0;
}

F - Sanatorium

CodeForces - 732C

题目链接https://codeforces.com/problemset/problem/732/C

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false)
#define ll long long
const int inf = 1e18 + 10;
const int mac = 1e6 + 10;
int main()
{
	IOS;
	ll a, b, c;
	cin >> a >> b >> c;
	ll ans = inf;
	ll r = max(a, b);
	r = max(r, c);
	ll m = 0;
	if (a < r) m = r - 1 - a;
	if (b < r) m += r - 1 - b;
	if (c < r) m += r - 1 - c;
	cout << m << endl;
	return 0;
}