Namomo Summer Camp 23 Day 1

A - Amusement Arcade

#include<iostream>
#include<algorithm>
#include<cstring>
#define int long long
using namespace std;

int check(int x)
{
	return (x>0)&&(x&(x-1))==0;
}
void solve()
{
	int t;
	int x=1;
	cin>>t;
	
	if(t==1||t==3)
	{
		cout<<1<<endl;
		return;
	}
	for(int i=0;i<=60;i++)
	{
		x*=2;
		if(check(t-x-1))
		{
			cout<<x+1<<endl;
			return;
		}
	}
	cout<<"impossible"<<endl;
}
signed main()
{
	solve();
	
	return 0;
}

B - Brexiting and Brentering

#include<iostream>
#include<algorithm>
#include<cstring>

using namespace std;

void solve()
{
	string s;
	
	cin>>s;
	int x;
	int len=s.size()-1;
	
	for(int i=len;i>=0;i--)
	{
		if(s[i]=='a'||s[i]=='e'||s[i]=='i'||s[i]=='o'||s[i]=='u')
		{
			x=i;
			break;
		}
	}
	for(int i=0;i<=x;i++) cout<<s[i];
	cout<<"ntry"<<endl;
}
int main()
{
	solve();
	
	return 0;
}

I - Monty’s Hall

考察知识点

• 三门问题
• 结论：要想得到最优的概率必须要换门，且换的门不是包括在已被揭晓的门内

#include<iostream>
#include<algorithm>

using namespace std;

void solve()
{
	double d,s,e;
	
	cin>>d>>s>>e;
	
	double p=s/d;
	
	int m=d-s-e;
	double res=0;
	if(m>=s)
	{
		res+=(1-p)*s/m;
	}
	else{
		res+=(1-p);
		res+=(s-m)/d;
	}
	printf("%.8lf\n", res);
}
int main()
{
	solve();
	
	return 0;
}