WOJ1123-Bishops

最新推荐文章于 2017-09-10 13:09:49 发布

暴走777

最新推荐文章于 2017-09-10 13:09:49 发布

阅读量596

点赞数

CC 4.0 BY-SA版权

分类专栏： WOJ

本文链接：https://blog.youkuaiyun.com/LXQ1071717521/article/details/77824589

WOJ 专栏收录该内容

144 篇文章

订阅专栏

探讨了在一个N*N的棋盘上，最多可以放置多少个象而不互相威胁的问题，并给出了简洁的数学公式解答。

KO learned the rules of chess and defeated his father, all his friends, his little brother, and now no one wants to play with him any more.
And so he plays with himself, that is, he often asks some interesting questions. One day, he moved to this question: ?Given a N*N chessboard,
how many bishops can be placed on a chessboard without threatening each other at most??. KO was in trouble and you must help the poor boy.

输入格式

There will be multiple test cases. For each test case, there is a single number n (1 <= n <= 2^32-1) representing the size of the chessboard.

输出格式

For each test case, you must output the maximum bishops that can be placed without threatening each other.

样例输入

2
3

样例输出

2
4

ans=2*n-2，证明比较简单。。N=1的时候要特判

#include<stdio.h>
long long n;
int main(){
    while(scanf("%d",&n)!=EOF){
    	if(n==1)
    	printf("1\n");
    	else
    	printf("%lld\n",2*n-2);
    }
    return 0;
}