UVa：10161 - Ant on a Chessboard

NickHdx

于 2014-09-18 22:18:31 发布

阅读量425

点赞数

分类专栏： OJ：UVa 题目分类：数学基础

本文链接：https://blog.csdn.net/Freeddong/article/details/39379665

版权

OJ：UVa 同时被 2 个专栏收录

40 篇文章 0 订阅

订阅专栏

题目分类：数学基础

12 篇文章 0 订阅

订阅专栏

找规律……

#include<stdio.h>
#include<math.h>
int main(){
    int time;
    while(scanf("%d",&time)!=EOF){
        if(!time)
            break;
        int s=ceil(sqrt(time));
        int N=s*s;
        if(s%2){
            if(N==time)
                printf("%d %d\n",1,s);
            else if(N-s+1==time)
                printf("%d %d\n",s,s);
            else if(time>N-s+1)
                printf("%d %d\n",N-time+1,s);
            else if(time<N-s+1)
                printf("%d %d\n",s,2*s+time-N-1);
        }
        else{
            if(N==time)
                printf("%d %d\n",s,1);
            else if(N-s+1==time)
                printf("%d %d\n",s,s);
            else if(time>N-s+1)
                printf("%d %d\n",s,N-time+1);
            else if(time<N-s+1)
                printf("%d %d\n",2*s+time-N-1,s);
        }
    }
    return 0;
}

--------------------------------------------------------------------------------------------

Keep It Simple,Stupid!

--------------------------------------------------------------------------------------------