Number Steps 代碼語言:c

來源:互聯網
上載者:User
文章目錄
  • Number Steps
Number Steps時限:1000ms 記憶體限制:10000K  總時限:3000ms

描述:

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.

輸入:

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

輸出:

write the number written at that point or write No Number if there
is none.

輸入範例:

4 2
6 6
3 4

輸出範例:

6
12
No Number

提示:

 

來源:

代碼:

  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. int main()
  4. {
  5. int x,y;
  6. scanf("%d%d",&x,&y);
  7. if(x%2==0&&y%2==0&&x>=y)
  8. printf("%d\n",x+y);
  9. else if(x%2!=0&&y%2!=0&&x>=y)
  10. printf("%d\n",x+y-1);
  11. else
    printf("No Number\n");
  12. return 0;
  13. }
相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.