cantor表 纯模拟

#include <bits/stdc++.h>
using namespace std;
int n,q,s=1,p;
int main(){
    cin>>n;
    q=n;
    while(q>0){p=q;q-=s;s++;}
    if(s%2!=0)cout<<p<<"/"<<s-p<<endl;
    else cout<<s-p<<"/"<<p<<endl;
    return 0;
}