当前位置:网站首页>L1-019 who falls first (Lua)
L1-019 who falls first (Lua)
2022-07-07 19:13:00 【Just be interesting】
subject
Boxing is an interesting part of the ancient Chinese wine culture . The method of two people on the wine table is : Shout out a number from each mouth , Draw a number with your hand . If someone's number is exactly equal to the sum of the two Numbers , Who is lost , The loser gets a glass of wine . Either a win or a loss goes on to the next round , Until the only winner comes along .
So let's give you a 、 B how much for two ( How many cups can you drink at most ) And punching records , Please judge which of the two should go first .
Input format :
The first line of input gives us a 、 B how much for two ( No more than 100 Non-negative integer ), Space off . The next line gives a positive integer N(≤100), And then N That's ok , Each line gives a record of one stroke , The format is :
A shout A stroke Ethyl shout B row
Among them, shouting is the number , A stroke is a number drawn out , No more than 100 The positive integer ( Row with both hands ).
Output format :
Output the first person to fall on the first line :A On behalf of a ,B On behalf of the b . The second line shows how many drinks the person who didn't pour had . They guarantee that one person will fall . Note that the program terminates when someone drops , You don't have to deal with the rest of the data .
sample input :
1 1
6
8 10 9 12
5 10 5 10
3 8 5 12
12 18 1 13
4 16 12 15
15 1 1 16
sample output :
A
1
Code
function ReadValue(str)
local arr = {
}
local idx = 1
for i = 1, #str do
if str:sub(i,i) == " " then
table.insert(arr, tonumber(str:sub(idx, i - 1)))
idx = i + 1
end
end
table.insert(arr, tonumber(str:sub(idx)))
return arr[1], arr[2], arr[3], arr[4]
end
local str = io.read()
local x1, x2 = 0, 0
for i = 1, #str do
if str:sub(i,i) == " " then
x1 = tonumber(str:sub(1, i - 1))
x2 = tonumber(str:sub(i + 1))
break
end
end
local n = io.read()
local d1, d2 = 0, 0
for i = 1, n do
local a1, a2, b1, b2 = ReadValue(io.read())
local ans = a1 + b1
if a2 == ans and b2 ~= ans then
d1 = d1 + 1
else
if a2 ~= ans and b2 == ans then
d2 = d2 + 1
end
end
if d1 > x1 then
print("A")
print(d2)
break
end
if d2 > x2 then
print("B")
print(d1)
break
end
end
边栏推荐
- For friends who are not fat at all, nature tells you the reason: it is a genetic mutation
- 2022-07-04 matlab读取视频帧并保存
- 2022上半年朋友圈都在传的10本书,找到了
- Tapdata 的 2.0 版 ,开源的 Live Data Platform 现已发布
- 初识缓存以及ehcache初体验「建议收藏」
- The performance and efficiency of the model that can do three segmentation tasks at the same time is better than maskformer! Meta & UIUC proposes a general segmentation model with better performance t
- Realize payment function in applet
- Classification and application of enterprise MES Manufacturing Execution System
- 基于图像和激光的多模态点云融合与视觉定位
- Redis的发布与订阅
猜你喜欢
Seize Jay Chou
微服务远程Debug,Nocalhost + Rainbond微服务开发第二弹
gsap动画库
Simple configuration of single arm routing and layer 3 switching
Creative changes brought about by the yuan universe
Former richest man, addicted to farming
多个kubernetes集群如何实现共享同一个存储
如何选择合适的自动化测试工具?
Tsinghua, Cambridge and UIC jointly launched the first Chinese fact verification data set: evidence-based, covering many fields such as medical society
链式二叉树的基本操作(C语言实现)
随机推荐
二叉树的基本概念和性质
LeetCode 497(C#)
SD_ DATA_ SEND_ SHIFT_ REGISTER
Wechat web debugging 8.0.19 replace the X5 kernel with xweb, so the X5 debugging method can no longer be used. Now there is a solution
【HDU】5248-序列变换(贪心+二分)「建议收藏」
Reinforcement learning - learning notes 8 | Q-learning
脑洞从何而来?加州大学最新研究:有创造力的人神经连接会「抄近道」
DeSci:去中心化科学是Web3.0的新趋势?
Uvalive – 4621 CAV greed + analysis "suggestions collection"
Seize Jay Chou
RISCV64
Borui data was selected in the 2022 love analysis - Panoramic report of it operation and maintenance manufacturers
如何选择合适的自动化测试工具?
【MIME笔记】
Thread factory in thread pool
企业展厅设计中常用的三种多媒体技术形式
高温火烧浑不怕,钟薛高想留清白在人间
Comparison and selection of kubernetes Devops CD Tools
Review of network attack and defense
Will low code help enterprises' digital transformation make programmers unemployed?