1 条题解
-
0
#include<bits/stdc++.h> using namespace std; int laobeizha,liangzhiji; bool naoziying; void dfs(string laozhaji, int mod/*余数*/) { liangzhiji=laozhaji.size(); if(liangzhiji>19){ return; } if(naoziying){ return; } if (mod==0) { cout<<laozhaji; naoziying = true; return; } dfs(laozhaji+"0",(mod*10)%laobeizha); dfs(laozhaji+"1",(mod*10+1)%laobeizha); } int main() { freopen("find.in","r",stdin); freopen("find.out","w",stdout); cin>>laobeizha; dfs("1",1); return 0; }神临😍😍😍
信息
- ID
- 553
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 9
- 标签
- (无)
- 递交数
- 248
- 已通过
- 19
- 上传者