当前位置:网站首页>Educational Codeforces Round 122 (Rated for Div. 2)
Educational Codeforces Round 122 (Rated for Div. 2)
2022-07-06 09:29:00 【狗蛋儿l】
A. Div. 7
题目:
You are given an integer n. You have to change the minimum number of digits in it in such a way that the resulting number does not have any leading zeroes and is divisible by 7.
If there are multiple ways to do it, print any of them. If the given number is already divisible by 7, leave it unchanged.
Input
3
42
23
377
Output
42
28
777
中文翻译:
给你n个数,改这些数的一个位数,让他变成7的整数,如果有多个答案,输出一个就行(百度翻译的是最小的位数,但是样例有一个不是我就没那么干)
代码:
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
int q;
cin>>q;
if(q%7==0)
{
cout<<q<<endl;
}
else
{
int k=q%10;
q-=k;
for(int i=1;i<=9;i++)
{
q+=i;
if(q%7==0)
{
cout<<q<<endl;
break;
}
else
{
q-=i;
}
}
}
}
return 0;
}
B. Minority
题目:
You are given a string s, consisting only of characters ‘0’ and ‘1’.
You have to choose a contiguous substring of s and remove all occurrences of the character, which is a strict minority in it, from the substring.
That is, if the amount of '0’s in the substring is strictly smaller than the amount of '1’s, remove all occurrences of ‘0’ from the substring. If the amount of '1’s is strictly smaller than the amount of '0’s, remove all occurrences of ‘1’. If the amounts are the same, do nothing.
You have to apply the operation exactly once. What is the maximum amount of characters that can be removed?
Input
4
01
1010101010111
00110001000
1
Output
0
5
3
0
中文翻译:
给你个字符串,如果0比1多删除所有的1,如果1比0多删除所有的0,按照翻译应该是如果相等就不进行操作,但我第一次交的wr了,然后对比了下样例答案,发现相同的话输出这个值-1就行。也可能是百度翻译的我没看懂。
代码:
#include <iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
string s;
cin>>s;
int l=0,y=0;
for(int i=0;i<s.length();i++)
{
if(s[i]=='0')
{
l++;
}
else if(s[i]=='1')
{
y++;
}
}
if(l==0||y==0)
{
cout<<0<<endl;
}
else if(l==y)
{
cout<<l-1<<endl;
}
else
{
cout<<min(l,y)<<endl;
}
}
return 0;
}
C. Kill the Monster
题目:
Monocarp is playing a computer game. In this game, his character fights different monsters.
A fight between a character and a monster goes as follows. Suppose the character initially has health hC and attack dC; the monster initially has health hM and attack dM. The fight consists of several steps:
the character attacks the monster, decreasing the monster’s health by
dC;the monster attacks the character, decreasing the character’s health
by dM;the character attacks the monster, decreasing the monster’s health by
dC;the monster attacks the character, decreasing the character’s health
by dM;and so on, until the end of the fight.
The fight ends when someone’s health becomes non-positive (i. e. 0 or less). If the monster’s health becomes non-positive, the character wins, otherwise the monster wins.
Monocarp’s character currently has health equal to hC and attack equal to dC. He wants to slay a monster with health equal to hM and attack equal to dM. Before the fight, Monocarp can spend up to k coins to upgrade his character’s weapon and/or armor; each upgrade costs exactly one coin, each weapon upgrade increases the character’s attack by w, and each armor upgrade increases the character’s health by a.
Can Monocarp’s character slay the monster if Monocarp spends coins on upgrades optimally?
Input
4
25 4
9 20
1 1 10
25 4
12 20
1 1 10
100 1
45 2
0 4 10
9 2
69 2
4 2 7
Output
YES
NO
YES
YES
中文翻译:
一个人打游戏,这个游戏是打死各种怪物,角色和怪物都有血条和攻击力,第一行是角色的血条和攻击力,第二行是怪物的,第三行是硬币,能提升的血的装备和能提升攻击力的装备,问能不能杀死这个怪物
代码:
#include <iostream>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
while(n--)
{
long long int hc,dc,hm,dm;
cin>>hc>>dc>>hm>>dm;
long long int k,w,a;
cin>>k>>w>>a;
long long int nhc,ndc;
for(long long int i=0;i<=k;i++){
nhc = i* a +hc;
ndc = (k-i)* w + dc;
if((hm + ndc - 1)/ ndc <= (nhc + dm - 1)/ dm){
cout<<"YES\n";
break;
}
if(i==k)
{
cout<<"NO\n";
}
}
}
return 0;
}
边栏推荐
- Click QT button to switch qlineedit focus (including code)
- 图像处理一百题(11-20)
- Li Kou - 298th weekly match
- 简单尝试DeepFaceLab(DeepFake)的新AMP模型
- (lightoj - 1369) answering queries (thinking)
- QT实现窗口渐变消失QPropertyAnimation+进度条
- Codeforces Global Round 19
- Effet d'utilisation, déclenché lorsque les composants de la fonction sont montés et déchargés
- Discussion on QWidget code setting style sheet
- Codeforces - 1526C1&&C2 - Potions
猜你喜欢
Pytorch extract skeleton (differentiable)
Installation and use of VMware Tools and open VM tools: solve the problems of incomplete screen and unable to transfer files of virtual machines
Codeforces Round #799 (Div. 4)A~H
Pull branch failed, fatal: 'origin/xxx' is not a commit and a branch 'xxx' cannot be created from it
第5章 NameNode和SecondaryNameNode
Li Kou: the 81st biweekly match
Chapter 6 rebalance details
Spark独立集群Worker和Executor的概念
Raspberry pie 4b64 bit system installation miniconda (it took a few days to finally solve it)
Chapter 5 namenode and secondarynamenode
随机推荐
Research Report on market supply and demand and strategy of China's four seasons tent industry
(lightoj - 1349) Aladdin and the optimal invitation (greed)
ffmpeg命令行使用
Market trend report, technical innovation and market forecast of double-sided foam tape in China
Codeforces Round #801 (Div. 2)A~C
(lightoj - 1323) billiard balls (thinking)
浏览器打印边距,默认/无边距,占满1页A4
Pull branch failed, fatal: 'origin/xxx' is not a commit and a branch 'xxx' cannot be created from it
Click QT button to switch qlineedit focus (including code)
(lightoj - 1370) Bi shoe and phi shoe (Euler function tabulation)
Research Report of desktop clinical chemical analyzer industry - market status analysis and development prospect prediction
Codeforces Round #800 (Div. 2)AC
业务系统兼容数据库Oracle/PostgreSQL(openGauss)/MySQL的琐事
<li>圆点样式 list-style-type
It is forbidden to trigger onchange in antd upload beforeupload
QT implementation window gradually disappears qpropertyanimation+ progress bar
计算时间差
业务系统从Oracle迁移到openGauss数据库的简单记录
Useeffect, triggered when function components are mounted and unloaded
China double brightening film (dbef) market trend report, technical dynamic innovation and market forecast