USACO 2.1.5 Hamming Code
来源:互联网 发布:制作简谱软件 编辑:程序博客网 时间:2024/06/06 18:55
水题。DFS暴搜即可。
注意题目要求输出十个数换行。
/*ID:szwjcch971LANG:C++TASK:hamming*/#include "stdio.h"#include "string.h"int pw2m1[9]={0,1,3,7,15,31,63,127,255};int N,B,D,top=1;int stack[70];FILE *fin=fopen("hamming.in","r");FILE *fout=fopen("hamming.out","w");int judge(int a,int b,int d){int i,temp;temp=a^b;i=0;while(temp){i+=temp&1;temp=temp>>1;}if(i>=d)return 1;else return 0;}int DFS(int layer,int num){int i,flag,j,k=0;if(layer==N){return 1;}if(num>pw2m1[B]){return 0;}for(i=num+1;i<=pw2m1[B];i++){flag=1;for(j=1;j<=top;j++){if(!judge(i,stack[j],D)){flag=0;break;}}if(flag){top++;stack[top]=i;k=DFS(layer+1,i);if(k)break;}}return k;}int main(){memset(is_visited,0,sizeof(is_visited));memset(q,0,sizeof(q));int i,j,k;fscanf(fin,"%d%d%d",&N,&B,&D);for(i=0;i<=pw2m1[B]-N+2;i++){top=1;stack[top]=i;k=DFS(1,i);if(k){break;}}for(i=1;i<=top;i++){fprintf(fout,"%d",stack[i]);if((i%10==0)||(i==top))fprintf(fout,"\n");else fprintf(fout," ");}return 0;}
0 0
- USACO 2.1.5 Hamming Code
- usaco 2.1.5 hamming
- USACO 2.1.5 Hamming Codes
- [USACO 2.1.5] Hamming Codes
- usaco 2.1.5 Hamming Codes
- USACO 2.1.5 Hamming Codes
- USACO 2.1.5 Hamming Codes
- USACO 2.1 Hamming Codes (hamming)
- USACO:2.1.5 Hamming Codes 汉明码
- USACO--2.1Hamming Codes
- USACO 2.1 Hamming Codes
- USACO 2.1 Hamming Codes
- USACO Hamming Codes 2.1
- USACO Section 2.1 Hamming Codes
- USACO Section 2.1 Hamming Codes
- USACO 2.1 Hamming Codes (递归)
- usaco 2.1 hamming 2008.6.10
- USACO 1.2.5 Hamming Codes
- js 使用驱动调用硬件
- 南京邮电大学OJ——1062直接插入排序
- mysql 全部备份的shell脚本
- 检测SOCKET是否断开
- 图像分割方法概述
- USACO 2.1.5 Hamming Code
- 排序问题
- android上传图片至服务器
- 简单插入排序
- 使用sqoop1导出mysql数据到hbase中
- eclipse创建android项目点击finish没反应
- 算法复杂度
- Join Optimization in Apache Hive
- 互联网协议以及网络分层