ZOJ2185 简单分块 找规律

初步找大概位置，然后找精确位置，算是简单化的分块吧！

#include<cstdio>
#include<cstdlib>
#include<iostream>
using namespace std;
int c[];
int num=;
void _get()
{
      int  k=,m;
      while(true){
        m=(k+)*k/;
        if(m>) break;
        c[++num]=m;
        k++;
    }
}
void _work(int v)
{
     int k=num,a,b,V=v;
     for(int i=;i<=num;i++)
      if(c[i-]<=v&&c[i]>v) {k=i-;break;}
     if(k%==)
     {
        a=;b=k;
        if(c[k]==v) { printf("TERM %d IS %d/%d\n",V,a,b); return ;}
        b++;v--;
        if(c[k]==v) { printf("TERM %d IS %d/%d\n",V,a,b); return ;}
        while(b>)
        {
                a++;b--;v--;
               if(c[k]==v) {printf("TERM %d IS %d/%d\n",V,a,b); return;}
        }
        }
        else {
        a=k;b=;
        if(c[k]==v) { printf("TERM %d IS %d/%d\n",V,a,b); return ;}
         a++;v--;
        if(c[k]==v) { printf("TERM %d IS %d/%d\n",V,a,b); return ;}
        while(a>)
        {
                a--;b++;v--;
               if(c[k]==v) {printf("TERM %d IS %d/%d\n",V,a,b); return;}
        }
    }
}
int main()
{
    int n;
    _get();
     while(~scanf("%d",&n))
      _work(n);
    return ;
}