zoukankan      html  css  js  c++  java
  • 【Number Steps 专题训练排序】

    Number Steps
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
    Appoint description: 

    Description

    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.
     

    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.
     

    Sample Input

    3 4 2 6 6 3 4
     

    Sample Output

    6 12 No Number
     
     
     1 // Project name : C ( Number Steps ) 
     2 // File name    : main.cpp
     3 // Author       : Izumu
     4 // Date & Time  : Tue Jul 10 21:58:22 2012
     5 
     6 
     7 #include <iostream>
     8 using namespace std;
     9 
    10 int main()
    11 {
    12     int t;
    13     cin >> t;
    14     
    15     while( t-- )
    16     {
    17         int x, y;
    18         cin >> x >> y;
    19         
    20         if( x==y && x%2==0 )
    21         {
    22             cout << 2*x << endl;
    23         }
    24         else if( x==y && x%2==1 )
    25         {
    26             cout << (2*(x-1))+1 << endl;
    27         }
    28         else if( x-y==2 && x%2==0 )
    29         {
    30             cout << (2*(x-2))+2 << endl;
    31         }
    32         else if( x-y==2 && x%2==1)
    33         {
    34             cout << (2*(x-3))+3 << endl;
    35         }
    36         else
    37         {
    38             cout << "No Number" << endl;
    39         }
    40         
    41     }
    42     
    43     return 0;
    44 }
    45 
    46 // end 
    47 // ism 
  • 相关阅读:
    李时珍的皮肤衣【快速幂】
    ClickHouse深度解析
    Hadoop&HDFS知识点整理
    实时日志数据写入Clickhouse
    Kafka consumer Job异常重置offset
    Flink WaterMark原理与实现
    Spark定期合并Hive表小文件
    Flink 1.11 Table & SQL深度解读
    Docker 安装Elasticsearch、Kibana实战——避免踩坑
    Flink 异步IO实践
  • 原文地址:https://www.cnblogs.com/ismdeep/p/2585359.html
Copyright © 2011-2022 走看看