牛客刷题:Number Steps(编程题)

本文介绍了如何解决编程题‘Number Steps’。从(0,0)开始,非负整数按特定模式分布在平面上,程序需根据输入的坐标(x, y)找到对应的数字。题目要求坐标在0...5000范围内,解析中强调了找出规律和处理边界值的重要性。" 128183827,15094193,JSP基础教程:从脚本到指令的全面解析,"['Java', 'servlet', 'web开发', 'JSP', 'IDEA']
摘要由CSDN通过智能技术生成

题目描述

Starting from point (0,0) on a plane, we have written all non-negative integers 0,1,2, ... as shown in the figure. For example, 1, 2, and 3 has been written at points (1,1), (2,0), and (3, 1) respectively and this pattern has continued.

You are to write a program that reads the coordinates of a point (x, y), and writes the number (if any) that has been written at that point. (x, y) coordinates in the input are in the range 0...5000.

输入描述:

each line, there is x, and y representing the coordinates (x, y) of a point.

输出描述:

For each point in the input, write the number written at that point or write No Number if there is none.

输入

4 2

输出

6

解答:

while True:
    try:
        x,y=map(int,input().strip().split(" &#
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值