POJ 1426 Find The Multiple——bfs + 模运算 + 打表
来源:互联网 发布:php eval 编辑:程序博客网 时间:2024/06/05 19:44
//#include <bits/stdc++.h>//using namespace std;//bool mod(string s, int x) {// int sum = 0;// for (int i = 0; i < s.size(); i++) {// sum = (sum * 10 + s[i] - '0') % x;// }// return sum == 0;//}//int main() {// freopen("out.txt", "w", stdout);// for (int i = 1; i <= 200; i++) {// if (i % 10 == 0) cout << endl;// queue<string> q; q.push("1");// while (!q.empty()) {// string temp = q.front(); q.pop();// if (mod(temp, i)) {// cout << "\"" << temp << "\",";// break;// }// q.push(temp + "0");// q.push(temp + "1");// }// }// return 0;//}#include <cstdio>using namespace std;char a[500][500] = {"1","10","111","100","10","1110","1001","1000","111111111","10","11","11100","1001","10010","1110","10000","11101","1111111110","11001","100","10101","110","110101","111000","100","10010","1101111111","100100","1101101","1110","111011","100000","111111","111010","10010","11111111100","111","110010","10101","1000","11111","101010","1101101","1100","1111111110","1101010","10011","1110000","1100001","100","100011","100100","100011","11011111110","110","1001000","11001","11011010","11011111","11100","100101","1110110","1111011111","1000000","10010","1111110","1101011","1110100","10000101","10010","10011","111111111000","10001","1110","11100","1100100","1001","101010","10010011","10000","1111111101","111110","101011","1010100","111010","11011010","11010111","11000","11010101","1111111110","1001","11010100","10000011","100110","110010","11100000","11100001","11000010","111111111111111111","100","101","1000110","11100001","1001000","101010","1000110","100010011","110111111100","1001010111","110","111","10010000","1011011","110010","1101010","110110100","10101111111","110111110","100111011","111000","11011","1001010","10001100111","11101100","1000","11110111110","11010011","10000000","100100001","10010","101001","11111100","11101111","11010110","11011111110","11101000","10001","100001010","110110101","100100","10011","100110","1001","1111111110000","11011010","100010","1100001","11100","110111","11100","1110001","11001000","10111110111","10010","1110110","1010100","10101101011","100100110","100011","100000","11101111","11111111010","1010111","1111100","1111110","1010110","11111011","10101000","10111101","111010","1111011111","110110100","1011001101","110101110","100100","110000","100101111","110101010","11010111","11111111100","1001111","10010","100101","110101000","1110","100000110","1001011","1001100","1010111010111","110010","11101111","111000000","11001","111000010","101010","110000100","1101000101","1111111111111111110","111000011","1000"};int main() { int n; while (~scanf("%d", &n) && n) { printf("%s\n", a[n - 1]); } return 0;}
阅读全文
1 0
- POJ 1426 Find The Multiple——bfs + 模运算 + 打表
- POJ 1426 Find The Multiple(bfs+打表)
- poj 1426 Find The Multiple(DFS或打表)
- POJ 1426 Find The Multiple bfs
- poj 1426 Find The Multiple(bfs)
- Find The Multiple (poj 1426 bfs)
- poj 1426 Find The Multiple(bfs)
- POJ 1426-Find The Multiple(bfs)
- POJ 1426 Find The Multiple(BFS)
- poj - 1426-Find The Multiple-BFS
- [Poj 1426] Find The Multiple BFS
- POJ-1426-Find The Multiple【BFS】
- POJ 1426 Find The Multiple (BFS)
- POJ 1426 Find The Multiple【BFS】
- POJ 1426 Find The Multiple (bfs)
- POJ 1426 BFS-Find The Multiple
- poj 1426 Find The Multiple (bfs / dfs)
- Find The Multiple poj 1426 bfs
- easymall第五天
- pwd命令
- GJJ的日常之再游戏
- Hibernate配置c3p0连接池
- bzoj2815 [ZJOI2012]灾难 支配树
- POJ 1426 Find The Multiple——bfs + 模运算 + 打表
- 边双联通模板
- 把数组中某个相等的值作为键重组数组
- 欢迎使用CSDN-markdown编辑器
- hpuoj--1410--QAQ & 火星情报局
- eCognition最邻近方法分类
- css选择器优先级和页面布局及css拓展
- caffe之训练数据格式
- 是资本泡沫还是生机勃勃?