Red Huang

Red Huang

uva 903

寫出兩種函式,給值傳座標 跟給座標傳值

//  
//        GGGGGGGGGGGGG        CCCCCCCCCCCCC               AAA  
//     GGG::::::::::::G     CCC::::::::::::C              A:::A  
//   GG:::::::::::::::G   CC:::::::::::::::C             A:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C            A:::::::A  
// G:::::G       GGGGGG C:::::C       CCCCCC           A:::::::::A  
//G:::::G              C:::::C                        A:::::A:::::A  
//G:::::G              C:::::C                       A:::::A A:::::A  
//G:::::G    GGGGGGGGGGC:::::C                      A:::::A   A:::::A  
//G:::::G    G::::::::GC:::::C                     A:::::A     A:::::A  
//G:::::G    GGGGG::::GC:::::C                    A:::::AAAAAAAAA:::::A  
//G:::::G        G::::GC:::::C                   A:::::::::::::::::::::A  
// G:::::G       G::::G C:::::C       CCCCCC    A:::::AAAAAAAAAAAAA:::::A  
//  G:::::GGGGGGGG::::G  C:::::CCCCCCCC::::C   A:::::A             A:::::A  
//   GG:::::::::::::::G   CC:::::::::::::::C  A:::::A               A:::::A  
//     GGG::::::GGG:::G     CCC::::::::::::C A:::::A                 A:::::A  
//        GGGGGG   GGGG        CCCCCCCCCCCCCAAAAAAA                   AAAAAAA  
#include <iostream>  
#include <cstdio>  
#include <cstring>  
#include <algorithm>  
#include <cmath>  
#include <climits>  
#include <vector>  
#include <set>  
#include <map>  
#include <queue>  
#include <cctype>  
#include <utility>  
#include <ctime>  
using namespace std;  
#ifdef DEBUG  
#define VAR(a,b) decltype(b) a=(b)  
#define debug(...) printf("DEBUG: "),printf(__VA_ARGS__)  
#define gettime() end_time=clock();printf("now running time is %.7f\\n",(float)(end_time - start_time)/CLOCKS_PER_SEC);  
#else  
#define VAR(a,b) __typeof(b) a=(b)  
#define debug(...)  
#define gettime()  
#endif  
typedef unsigned int uint;  
typedef long long int Int;  
typedef unsigned long long int UInt;  
#define Set(a,s) memset(a,s,sizeof(a))  
#define Write(w) freopen(w,"w",stdout)  
#define Read(r) freopen(r,"r",stdin)  
#define Pln() printf("\\n")  
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()  
#define De(x)printf(#x"%d\\n",x)  
#define For(i,x)for(int i=0;i<x;i++)  
#define CON(x,y) x##y  
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\\  
    printf("%d ",dp[htx][hty]);}Pln();}  
#define M 30005  
#define PII pair<int,int>  
#define PB push_back  
#define oo INT_MAX  
#define Set_oo 0x3f  
#define FOR(a,b) for(VAR(a,(b).begin());a!=(b).end();++a)  
#define eps 1e-6  
#define X first  
#define Y second  
clock_t start_time=clock(), end_time;  
bool xdy(double x,double y){return x>y+eps;}  
bool xddy(double x,double y){return x>y-eps;}  
bool xcy(double x,double y){return x<y-eps;}  
bool xcdy(double x,double y){return x<y+eps;}  
int min3(int x,int y,int z){  
    int tmp=min(x,y);  
    return min(tmp,z);  
}  
int max3(int x,int y,int z){  
    int tmp=max(x,y);  
    return max(tmp,z);  
}  
int n;  
void gpfc(int num,int &ansx,int &ansy){  
    if(num==1){  
        ansx=0;ansy=0;  
        return;  
    }  
    int layer=sqrt(num);  
    if(!(layer&1))layer--;  
    int lnum=layer*layer;  
    layer/=2;  
    int x=layer,y=layer;  
    if(lnum==num){  
        ansx=x;ansy=y;  
        return ;  
    }  
    int dir=(num-lnum-1)/(2*layer+2);  
    if(dir==0){  
        x=x+1;  
        y=y-((num-lnum-1)%(2*layer+2));  
    }else if(dir==1){  
        y=y-(layer*2+1);  
        x=x-((num-lnum-1)%(2*layer+2));  
    }else if(dir==2){  
        x=x-(layer*2+1);  
        y=y+((num-lnum-1)%(2*layer+2))-(layer*2);  
    }else if(dir==3){  
        y=y+1;  
        x=x+((num-lnum-1)%(2*layer+2))-(layer*2);  
    }  
    ansx=x;ansy=y;  
}  
int gcfp(int x,int y){  
    int layer;  
    int ans;  
    if(x==0&&y==0)return 1;  
    if(x==y&&x>0&&y>0)layer=x;  
    else{  
        layer=max(abs(x),abs(y));  
        layer--;  
    }  
    ans=(layer*2+1)*(layer*2+1);  
    int fixx=layer,fixy=layer;  
    int dx=(x-fixx),dy=(y-fixy);  
    if(dx==1){  
        ans++;  
        ans+=abs(dy);  
    }else if(dy==-(2*layer+1)){  
        ans+=(layer*2+2)+1;  
        ans+=abs(dx);  
    }else if(dx==-(2*layer+1)){  
        ans+=1+2*(layer*2+2);  
        ans+=(2*layer);  
        if(dy<=0)ans-=abs(dy);  
        else ans++;  
    }else if(dy==1){  
        ans=((layer+1)*2+1)*((layer+1)*2+1)-1;  
        ans-=abs(dx);  
    }  
    return ans;  
}  
int main() {  
    ios_base::sync_with_stdio(0);  
    while(~scanf("%d",&n)){  
        int x,y;  
        gpfc(n,x,y);  
        for(int i=1;i>=-1;i--){  
            for(int j=-1;j<=1;j++){  
                printf("%d;",gcfp(x+j,y+i));  
            }Pln();  
        }  
//        printf("%d %d\\n",x,y);  
//        printf("%d\\n",gcfp(x,y));  
  
    }  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
}  

載入中......
此文章數據所有權由區塊鏈加密技術和智能合約保障僅歸創作者所有。