USACO Hamming Codes 2.1
2017-01-15 14:23
260 查看
一遍过。但是题意是百度出来的。。看来英语还是太烂太烂了。
题意是:对于给出的例子从0000000开始,找出下一个密码,是0000111,再找下一个,这个是必须既和0又和7符合密码规则的密码。
thinking:1、直接DFS深搜,然后把之前的重复判断一遍
代码:
/*
ID: me
PROG: hamming
LANG: C++
*/
#include<iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int q1[500][500];
int q2[500];
int q3[500];
int main(){
freopen("hamming.in","r",stdin);
freopen("hamming.out","w",stdout);
memset(q1,0,sizeof(q1));
memset(q2,0,sizeof(q2));
memset(q3,0,sizeof(q3));
q3[0]=0;
int n,i,j,k,f1,f2,a,b,f3,t1,t2,t3,t4,t5;
cin >> n >> a >> b;
t1=0;
f1=0;
t5=1;
while(t1<n-1){
f1++;
f2=f1;
t3=0;
memset(q2,0,sizeof(q2));
while(f2){
q2[t3++]=f2%2;
f2=f2/2;
}
t4=0;
for(j=0;j<t5;j++){
t2=0;
for(i=0;i<a;i++){
if(q1[j][i]!=q2[i]&&t2<b)t2++;
}
/*for(i=0;i<a;i++)
cout << q1[j][i] << " ";
cout << endl;
for(i=0;i<a;i++)
cout << q2[i] << " ";
cout << "这个的对比"<< endl;
cout << f1 << "有" << t2 <<endl;*/
if(t2>=b){
t4++;
}
}
// cout << f1 << " " << t4 << endl;
if(t4==t5){
t1++;
// cout << "you" << endl;
for(i=0;i<a;i++)
q1[t5][i]=q2[i];
//cout << q2[i] <<" " ;//t5加的时候是加先再存,还是存再加
q3[t5++]=f1;
}
}
for(i=0;i<t5;i++)
if(i%10==0&&i){
cout << endl;
cout << q3[i];
}else if(i==0){
cout << q3[i];
}else{
cout << " " << q3[i];
}
cout << endl;
return 0;
}
题意是:对于给出的例子从0000000开始,找出下一个密码,是0000111,再找下一个,这个是必须既和0又和7符合密码规则的密码。
thinking:1、直接DFS深搜,然后把之前的重复判断一遍
代码:
/*
ID: me
PROG: hamming
LANG: C++
*/
#include<iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int q1[500][500];
int q2[500];
int q3[500];
int main(){
freopen("hamming.in","r",stdin);
freopen("hamming.out","w",stdout);
memset(q1,0,sizeof(q1));
memset(q2,0,sizeof(q2));
memset(q3,0,sizeof(q3));
q3[0]=0;
int n,i,j,k,f1,f2,a,b,f3,t1,t2,t3,t4,t5;
cin >> n >> a >> b;
t1=0;
f1=0;
t5=1;
while(t1<n-1){
f1++;
f2=f1;
t3=0;
memset(q2,0,sizeof(q2));
while(f2){
q2[t3++]=f2%2;
f2=f2/2;
}
t4=0;
for(j=0;j<t5;j++){
t2=0;
for(i=0;i<a;i++){
if(q1[j][i]!=q2[i]&&t2<b)t2++;
}
/*for(i=0;i<a;i++)
cout << q1[j][i] << " ";
cout << endl;
for(i=0;i<a;i++)
cout << q2[i] << " ";
cout << "这个的对比"<< endl;
cout << f1 << "有" << t2 <<endl;*/
if(t2>=b){
t4++;
}
}
// cout << f1 << " " << t4 << endl;
if(t4==t5){
t1++;
// cout << "you" << endl;
for(i=0;i<a;i++)
q1[t5][i]=q2[i];
//cout << q2[i] <<" " ;//t5加的时候是加先再存,还是存再加
q3[t5++]=f1;
}
}
for(i=0;i<t5;i++)
if(i%10==0&&i){
cout << endl;
cout << q3[i];
}else if(i==0){
cout << q3[i];
}else{
cout << " " << q3[i];
}
cout << endl;
return 0;
}
相关文章推荐
- USACO-Section2.1 Hamming Codes [搜索]
- USACO Section 2.1 Hamming Codes - 题意相当坑爹..很无聊..
- Hamming Codes chapter 2.1
- USACO Hamming Codes 求汉明距离
- usaco 2.1 hamming...枚举...
- usaco2.1 hamming(blog 写到一半发现大事不妙
- USACO Hamming Codes DFS 构造
- usaco Hamming Codes
- USACO :Hamming Codes 解题报告
- usaco-2.1-hamming-pass
- USACO Hamming Codes
- 从usaco hamming Codes谈FP思想及FP技巧
- USACO Hamming Codes
- usaco 2.1 hamming 2008.6.10
- USACO 2.1 Hamming Codes (hamming)
- USACO 2.1 Ordered Fractions
- USACO-Section 2.1 Hamming Codes (DFS)
- USACO 2.1 Hamming Codes (迭代)
- USACO 2.1 The Castle
- USACO-Section2.1 Healthy Holsteins [搜索][枚举]