版权声明:喜欢请点个大拇指,感谢各位dalao。弱弱说下,转载要出处呦 https://blog.csdn.net/qq_35786326/article/details/85856010
分析:
全场最水,没有之一
直接暴力枚举,在检验一波
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
#define ch cheap
using namespace std;
inline LL read() {
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
int w[100005],len,g;
int n=read();
void chu()
{
g=0;
int s;
for(int i=1;i<=len;i++)
{
s=g*10+w[i];
g=s%n;
w[i]=s/n;
}
return;
}
int main()
{
int i=1;
while(i)
{
int j=i;
len=0;
while(j) {w[++len]=j%2;j/=2;}
for(j=1;j<=len/2;j++) swap(w[j],w[len-j+1]);
chu();
if(!g)
{
int k=1;
while(!w[k]&&k<len) k++;
if(k==len) {i++;continue;}
else
{
for(j=k;j<=len;j++) printf("%d",w[j]);
}
break;
}
i++;
}
return 0;
}