pku1781 In Danger

最新推荐文章于 2024-12-08 21:52:28 发布

最新推荐文章于 2024-12-08 21:52:28 发布 · 62 阅读

本文介绍了一个基于C++的程序，该程序使用特定的查找算法处理整数输入，并输出相应的查找结果。程序中定义了find函数来实现查找逻辑，通过递归方式处理不同条件下的查找过程。

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;

#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FFF(i,a)        for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);

int find(int x)
{
	if(x==1)
	{
		return 1;
	}
	else if(x&1)
	{
		int temp = find(x/2);
		return temp*2+1;
	}
	else
	{
		int temp = find(x/2);
		return temp*2-1;
	}
}

int main()
{
	int x,y;
	while(scanf("%de%d",&x,&y))
	{
		if(x==0 && y==0) return 0;
		for(int i=1;i<=y;i++)
		{
			x*=10;
		}
		cout<<find(x)<<endl;
	}
	return 0;
}