poj 1969(水题)


#include
using namespace std;
int main(){
    int n,i,j,p,q,t;
    while(scanf("%d",&n)==1){
        for(i=1;;i++){
            if(i*(i+1)/2>=n){
                break;
            }
        }
        t = i*(i+1)/2 - n;
        j = i + 1;
        if(j%2==1){
            q = t + 1;
            p = j - q;
        }
        else{
            p = t + 1;
            q = j - p;
        }
        printf("TERM %d IS %d/%d\n",n,p,q);
    }
    return 0;
} 

相关