当前位置:网站首页>L1-025 positive integer a+b (Lua)
L1-025 positive integer a+b (Lua)
2022-07-07 19:14:00 【Just be interesting】
subject
The goal of the question is very simple , It's two positive integers A and B And , among A and B It's all in the range [1,1000]. A little bit of a hassle , The input is not guaranteed to be two positive integers .
Input format :
Type in on a line to give A and B, They are separated by spaces . The problem is A and B It doesn't have to be a positive integer , Sometimes it can be out of range numbers 、 negative 、 A real number with a decimal point 、 It's even a mess of code .
Be careful : Let's put... In the input 1 A space is taken as A and B Separation of . Make sure that there is at least one space for the question , also B It's not an empty string .
Output format :
If the input is really two positive integers , According to the format A + B = And the output . If an input is not satisfactory , Output at corresponding position ?, Obviously at this time and also ?.
sample input 1:
123 456
sample output 1:
123 + 456 = 579
sample input 2:
22. 18
sample output 2:
? + 18 = ?
sample input 3:
-100 blabla bla…33
sample output 3:
? + ? = ?
Code
function io.read2value()
local s = io.read()
local n = #s
for i = 1, n do
if s:sub(i, i) == " " then
return s:sub(1, i - 1), s:sub(i + 1)
end
end
end
local s1, s2 = io.read2value()
local flag1, flag2 = true, true
if tostring(tonumber(s1)) ~= s1 or s1:find(".", 1, true) ~= nil then
flag1 = false
end
if tostring(tonumber(s2)) ~= s2 or s2:find(".", 1, true) ~= nil then
flag2 = false
end
local s = ""
local n1, n2 = tonumber(s1), tonumber(s2)
if n1 and (n1 <= 0 or n1 > 1000) then flag1 = false end
if n2 and (n2 <= 0 or n2 > 1000) then flag2 = false end
s = s .. (flag1 and n1 or "?")
s = s .. " + "
s = s .. (flag2 and n2 or "?")
s = s .. " = "
s = s .. ((flag1 and flag2) and (n1 + n2) or "?")
print(s)
边栏推荐
- testing and SQA_动态白盒測试[通俗易懂]
- 嵌入式面试题(算法部分)
- [unity shader] insert pass to realize the X-ray perspective effect of model occlusion
- Redis的发布与订阅
- 6.关于jwt
- 如何给“不卖笔”的晨光估值?
- Will domestic software testing be biased
- 从39个kaggle竞赛中总结出来的图像分割的Tips和Tricks
- 5billion, another master fund was born in Fujian
- Redis cluster and expansion
猜你喜欢
Redis集群与扩展
Redis
[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
99% of people don't know that privatized deployment is also a permanently free instant messaging software!
前首富,沉迷种田
2022.07.05
微信网页调试8.0.19换掉X5内核,改用xweb,所以x5调试方式已经不能用了,现在有了解决方案
6.关于jwt
Standard ACL and extended ACL
链式二叉树的基本操作(C语言实现)
随机推荐
5billion, another master fund was born in Fujian
ip netns 命令(备忘)
RISCV64
Business experience in virtual digital human
Basic operation of chain binary tree (implemented in C language)
微服务远程Debug,Nocalhost + Rainbond微服务开发第二弹
AI写首诗
[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
ES6笔记一
Draw squares with Obama (Lua)
Static routing configuration
6. About JWT
6.关于jwt
Redis
10 schemes to ensure interface data security
[HDU] 5248 sequence transformation (greedy + dichotomy) [recommended collection]
Charles+Postern的APP抓包
Kirk borne's selection of learning resources this week [click the title to download directly]
Differences between rip and OSPF and configuration commands
Basic concepts and properties of binary tree