Algorithm
Problem link- https://www.spoj.com/problems/NSTEPS/
NSTEPS - Number Steps
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...10000.
Input
The first line of the input is N, the number of test cases for this problem. In each of the N following lines, there is x, and y representing the coordinates (x, y) of a point.
Output
For each point in the input, write the number written at that point or write No Number if there is none.
Example
Input: 3 4 2 6 6 3 4 Output: 6 12 No Number
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <iostream>
using namespace std;
main()
{
long long t;
cin>>t;
while(t--)
{
int x,y;
cin>>x>>y;
if(x==y)
{
if(x%2==0&&y%2==0)
{
cout<<x+y<<endl;
}
else
{
cout<<x+y-1<<endl;
}
}
else if(x-y==2)
{
if(x%2==0&&y%2==0)
{
cout<<x+y<<endl;
}
else
{
cout<<x+y-1<<endl;
}
}
else
{
cout<<"No Number"<<endl;
}
}
}Input
4 2
6 6
3 4
Output
12
No Number
#2 Code Example with Java Programming
Code -
Java Programming
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class NSTEPS {
public static void main(String[] args) throws Exception
{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
int numTestCases = Integer.parseInt(reader.readLine());
for(int i = 0; i < numTestCases; i++)
{
String[] data = reader.readLine().split(" ");
int x = Integer.parseInt(data[0]);
int y = Integer.parseInt(data[1]);
if(x == y || (x-y==2))
{
if(x % 2 == 0)
{
out.println(x+y);
}
else
{
out.println(x+y-1);
}
}
else
{
out.println("No Number");
}
out.flush();
}
}
}Input
4 2
6 6
3 4
Output
12
No Number
Demonstration
SPOJ Solution-NSTEPS Number Steps-Solution in C, C++, Java, Python ,SPOJ Solution,NSTEPS Number Steps