当前位置:网站首页>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
边栏推荐
- "Decryption" Huawei machine vision Corps: Huawei is moving up and the industry is moving forward
- PTA 1102 教超冠军卷
- 【Base64笔记】「建议收藏」
- POJ 1182 :食物链(并查集)[通俗易懂]
- PTA 1102 teaching Super Champion volume
- CVPR 2022 - learning non target knowledge for semantic segmentation of small samples
- [software test] from the direct employment of the boss of the enterprise version, looking at the resume, there is a reason why you are not covered
- 2022.07.05
- Static routing configuration
- [Base64 notes] [suggestions collection]
猜你喜欢
2022.07.02
Cadre de validation des données Apache bval réutilisé
cmd命令进入MySQL时报服务名或者命令错误(傻瓜式教学)
Borui data was selected in the 2022 love analysis - Panoramic report of it operation and maintenance manufacturers
10 schemes to ensure interface data security
PV静态创建和动态创建
抢占周杰伦
Review of network attack and defense
基于图像和激光的多模态点云融合与视觉定位
学习open62541 --- [67] 添加自定义Enum并显示名字
随机推荐
[tpm2.0 principle and Application guide] Chapter 9, 10 and 11
企业MES制造执行系统的分类与应用
Initial experience of cache and ehcache "suggestions collection"
Rules for filling in volunteers for college entrance examination
Scientists have observed for the first time that the "electron vortex" helps to design more efficient electronic products
Comparison and selection of kubernetes Devops CD Tools
Antisamy: a solution against XSS attack tutorial
反爬虫的重点:识别爬虫
Uvalive – 4621 CAV greed + analysis "suggestions collection"
博睿数据入选《2022爱分析 · IT运维厂商全景报告》
前首富,沉迷种田
For friends who are not fat at all, nature tells you the reason: it is a genetic mutation
数据验证框架 Apache BVal 再使用
如何给“不卖笔”的晨光估值?
Basic operation of chain binary tree (implemented in C language)
初识缓存以及ehcache初体验「建议收藏」
LeetCode 497(C#)
国内的软件测试会受到偏见吗
RISCV64
Redis