USACO hamming
来源:互联网 发布:windows系统模拟器 编辑:程序博客网 时间:2024/05/20 23:31
先来看一下题目吧。
Rob Kolstad
Given N, B, and D: Find a set of N codewords (1 <= N <= 64), each of length B bits (1 <= B <= 8), such that each of the codewords is at least Hamming distance of D (1 <= D <= 7) away from each of the other codewords. The Hamming distance between a pair of codewords is the number of binary bits that differ in their binary notation. Consider the two codewords 0x554 and 0x234 and their differences (0x554 means the hexadecimal number with hex digits 5, 5, and 4):
0x554 = 0101 0101 0100 0x234 = 0010 0011 0100Bit differences: xxx xx
Since five bits were different, the Hamming distance is 5.
PROGRAM NAME: hamming
INPUT FORMAT
N, B, D on a single line
SAMPLE INPUT (file hamming.in)
16 7 3
OUTPUT FORMAT
N codewords, sorted, in decimal, ten per line. In the case of multiple solutions, your program should output the solution which, if interpreted as a base 2^B integer, would have the least value.
SAMPLE OUTPUT (file hamming.out)
0 7 25 30 42 45 51 52 75 7682 85 97 102 120 127
这条题目不难,由于数据量很小,因此使用的方法是直接遍历。
/**ID: njuwz151TASK: hammingLANG: C++*/#include <iostream>#include <cstdio>using namespace std;const int maxn = 9;int count(int a, int b);int main() { freopen("hamming.in", "r", stdin); freopen("hamming.out", "w", stdout); int n, b, d; cin >> n >> b >> d; int result[1 << maxn]; result[0] = 0; int n_ptr = 1; for(int i = 1; i < (1 << b); i++) { if(n_ptr > n) { break; } bool can_add = true; for(int j = 0; j < n_ptr; j++) { if(count(i, result[j]) < d) { can_add = false; break; } } if(can_add) { result[n_ptr] = i; n_ptr++; } } for(int i = 0; i < n - 1; i++) { cout << result[i]; if((i + 1) % 10) { cout << " "; } else { cout << endl; } } cout << result[n - 1] << endl;} int count(int a, int b) { int result = 0; for(int i = 0; i < maxn; i++) { if(((a>>i) & 1) != ((b>>i) & 1)) { result++; } } return result;}
- usaco hamming
- USACO hamming
- USACO 2.1 Hamming Codes (hamming)
- usaco——hamming
- 【搜索】【USACO】Hamming Codes
- usaco training-Hamming Codes
- USACO holstein, hamming
- usaco Hamming Codes
- USACO:Hamming Codes
- USACO-Hamming Codes
- USACO Hamming Codes
- USACO Hamming Codes
- USACO--2.1Hamming Codes
- USACO 2.1 Hamming Codes
- usaco 2.1.5 hamming
- USACO 2.1 Hamming Codes
- usaco Hamming Codes
- USACO Hamming Codes 2.1
- html中canvas遇到的问题
- iOS-如何消除警告
- USACO Healthy Holsteins
- SASS学习
- 利用 Hadoop FileSystem listStatus 遍历文件目录 实现HDFS操作
- USACO hamming
- 聚合工程maven报错:Could not resolve dependencies for project
- 关于数据库中除法的一个小问题
- 培养属立足于未来的产品经理人1
- USACO Dynamic Programming (1)
- Codeforces 818B Permutation Game
- A strange lift HDU
- hibernate注解主键生成策略
- 浅谈mysql数据库优化技术