SPOJ_Classical_Problems/count_on_cantor.cpp at master · ranjan019/SPOJ_Classical_Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include<bits/stdc++.h>

using namespace std;

int main()
{
	int t;
	cin>>t;
	int tr=t;
	while(t--)
	{
		int term,flag=0;
		cin>>term;
		float root=sqrt(1+8*term);
		//cout<<"root::"<<root<<endl;
		if(float(root) - int(root) > 0)
		{
			flag=1;

		}
		//cout<<"flag::"<<flag<<endl;
		int level=(-1+root)/2;
		//cout<<"level::"<<level<<endl;

		int sum_upto_level=(level*(2+(level-1)))/2;
		//cout<<"sum_upto_level::"<<sum_upto_level<<endl;
		int x,y,next_steps;
		if(flag==0)
		{
			if(level%2)
			{
				x=1;
				y=level;
				//cout<<"x:"<<x<<" y:"<<y<<endl;
			}
			else
			{
				x=level;
				y=1;
				//cout<<"x:"<<x<<" y:"<<y<<endl;
			}
		}
		else
		{
			next_steps = term - sum_upto_level;
			//cout<<"next_steps::"<<next_steps<<endl;
			if(level%2)
			{
				x=1;
				y=level;
				//cout<<"x:"<<x<<" y:"<<y<<endl;
				y++;
				next_steps--;
				while(next_steps--)
				{
					x++;
					y--;
				}
				//cout<<"after next steps"<<"x:"<<x<<" y:"<<y<<endl;
			}
			else
			{
				x=level;
				y=1;
				//cout<<"x:"<<x<<" y:"<<y<<endl;
				x++;
				next_steps--;
				while(next_steps--)
				{
					x--;
					y++;
				}
				//cout<<"after next steps"<<"x:"<<x<<" y:"<<y<<endl;
			}
		}

		cout<<"TERM "<<term<<" IS "<<x<<"/"<<y<<endl;


	}
	return 0;
}