当前位置:网站首页>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
边栏推荐
- Comparison and selection of kubernetes Devops CD Tools
- 虚拟数字人里的生意经
- Redis cluster and expansion
- Review of network attack and defense
- GSAP animation library
- Reinforcement learning - learning notes 8 | Q-learning
- POJ 2392 Space Elevator
- Hutool - lightweight DB operation solution
- Where does brain hole come from? New research from the University of California: creative people's neural connections will "take shortcuts"
- App capture of charles+drony
猜你喜欢

【塔望方法论】塔望3W消费战略 - U&A研究法

The top of slashdata developer tool is up to you!!!

抢占周杰伦

Version 2.0 of tapdata, the open source live data platform, has been released

Standard ACL and extended ACL

博睿数据入选《2022爱分析 · IT运维厂商全景报告》

RISCV64

Redis

Scientists have observed for the first time that the "electron vortex" helps to design more efficient electronic products

Charles+Postern的APP抓包
随机推荐
Simple configuration of single arm routing and layer 3 switching
The top of slashdata developer tool is up to you!!!
面试唯品会实习测试岗、抖音实习测试岗【真实投稿】
Will low code help enterprises' digital transformation make programmers unemployed?
Antisamy: a solution against XSS attack tutorial
Reinforcement learning - learning notes 8 | Q-learning
[tpm2.0 principle and Application guide] Chapter 16, 17 and 18
Redis的发布与订阅
UVALive – 4621 Cav 贪心 + 分析「建议收藏」
PTA 1102 teaching Super Champion volume
初识缓存以及ehcache初体验「建议收藏」
Nat address translation
"Decryption" Huawei machine vision Corps: Huawei is moving up and the industry is moving forward
How much does it cost to develop a small program mall?
[sword finger offer] 59 - I. maximum value of sliding window
博睿数据入选《2022爱分析 · IT运维厂商全景报告》
Differences between rip and OSPF and configuration commands
ip netns 命令(备忘)
脑洞从何而来?加州大学最新研究:有创造力的人神经连接会「抄近道」
A hodgepodge of ICER knowledge points (attached with a large number of topics, which are constantly being updated)