#267B. Fedor and New Game-----每日两道水(1)
2016-04-21 18:55
281 查看
http://codeforces.com/contest/467/problem/B#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
char s[1005][22];
void change(int i,int d,char s[][22])
{
for(int q=0;q<22;q++)
s[i][q]='0';
int b,j=0;
while(1)
{
b=d%2;
s[i][j]=b+'0';
d=d/2;
if(d==0)break;
j++;
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n,m,k,d,cnt;
cin>>n>>m>>k;
cnt=0;
for(int i=0;i<=m;i++)
{
cin>>d;
change(i,d,s);
}
int ans=0;
for(int i=0;i<m;i++)
{
cnt=0;
for(int j=0;j<n;j++)
{
if(s[i][j]!=s[m][j])cnt++;
}
if(cnt<=k)
ans++;
}
cout<<ans<<endl;
return 0;
}
http://codeforces.com/contest/467/problem/A 略
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <queue>
#define maxn 10000+5
#define ull unsigned long long
#define ll long long
#define reP(i,n) for(i=1;i<=n;i++)
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001
#define PI 3.141592657
#define INF 1<<30
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
bool cmp(int a,int b){
return a>b;
}
char s[1005][22];
void change(int i,int d,char s[][22])
{
for(int q=0;q<22;q++)
s[i][q]='0';
int b,j=0;
while(1)
{
b=d%2;
s[i][j]=b+'0';
d=d/2;
if(d==0)break;
j++;
}
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n,m,k,d,cnt;
cin>>n>>m>>k;
cnt=0;
for(int i=0;i<=m;i++)
{
cin>>d;
change(i,d,s);
}
int ans=0;
for(int i=0;i<m;i++)
{
cnt=0;
for(int j=0;j<n;j++)
{
if(s[i][j]!=s[m][j])cnt++;
}
if(cnt<=k)
ans++;
}
cout<<ans<<endl;
return 0;
}
http://codeforces.com/contest/467/problem/A 略
相关文章推荐
- js操作cookie
- Difference Between Primes----素数筛选
- js 设置 读取cookie
- javascript入门篇之函数
- Json
- javascript入门篇之基础语法
- jQuery 监控键盘一段时间内没输入
- js二维数组案例,以及矩阵转置
- 高性能Javascript笔记
- zufe-机智的zhourist
- angular学习(三)—— Controller
- mac 下 sublime 如何直接运行 javascript
- 半期考html5小游戏制作
- 【CSS3进阶】酷炫的3D旋转透视
- 利用JS实现点击按钮后图片自动切换
- Html学习笔记3
- 框架之浅入浅出
- UVA_497_Strategic Defense Initiative
- javascript AES加密解密,AES/ECB/PKCS7
- AngularJS的学习