1969.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 51 行

#define debug 0
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>

#ifdef debug
	#define NMAX 10
#else 
	#define NMAX 1001
#endif
void solve(long s)
{
	long n,a=(long)s,b=1,d;
	long tmp;
	n=long(ceil((-1+sqrt(1+8*s))/2));
	tmp=n;
	long k=(n+1)*n/2;
	d=k-a;
	b+=d;
	n-=d;
	if(tmp%2)
	{
		printf("TERM %d IS %d/%d\n",a,b,n);
	}
	else
		printf("TERM %d IS %d/%d\n",a,n,b);
	
}

main()
{
#if debug 	
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
#endif
	int n;
	while(scanf("%d",&n)!=EOF)
	{
		solve(n);
	}
#if debug
	fclose(stdin);
	fclose(stdout);
#endif;
	return 1;
}