qiutiao
  • 板块P1885 Moo
  • 楼主_Tatsu_
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/12/9 17:46
  • 上次更新2024/12/9 21:21:35
查看原帖
qiutiao
1224895
_Tatsu_楼主2024/12/9 17:46
#include <bits/stdc++.h>
#define int long long
#define fro for
using namespace std;
int len[114514];
int n,num=0;
char find(int num,int n)
{
	if (num==0)
	{
		if (n==1)
		return 'm';
		return 'o';
	}
	if (n>len[num]-len[num-1])
	return find(num-1,len[num]-len[num-1]);
	if (n<=len[num-1])
	return (num-1,n);
	if (n==len[num-1]+1)
	return 'm';
	return 'o';
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	//freopen (".in","r",stdin);
	//freopen (".out","w",stdout);
	cin>>n;
	len[0]=3;
	while (len[num]<n)
	{
		num++;
		len[num]=2*len[num-1]+num+3;
	}
	cout<<find(num,n);
	return 0;
}
2024/12/9 17:46
加载中...