栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 2213 Code

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 2213 Code

#include<iostream>#include<string>#include<cstdio>#include<cstring>#include<cmath>using namespace std;#define DBG 0#define sz(c) ((int)(c).size())#define    forl(i, a, b) for(int i = (a); i <  (b); ++i)#define   forle(i, a, b) for(int i = (a); i <= (b); ++i)#define    forg(i, a, b) for(int i = (a); i >  (b); --i)#define   forge(i, a, b) for(int i = (a); i >= (b); --i)#define   forlc(i, a, b) for(int i##_b = (b), i = (a); i <  i##_b; ++i)#define  forlec(i, a, b) for(int i##_b = (b), i = (a); i <= i##_b; ++i)#define   forgc(i, a, b) for(int i##_b = (b), i = (a); i >  i##_b; --i)#define  forgec(i, a, b) for(int i##_b = (b), i = (a); i >= i##_b; --i)#define  forall(i, v   )  forl(i, 0, sz(v))#define forallc(i, v   ) forlc(i, 0, sz(v))#define  forlla(i, v   ) forge(i, sz(v)-1, 0)#define   forls(i, n, a, b) for(int i = a; i != b; i = n[i])#define rep(n)  for(int    repp = 0; repp <    (n); ++repp)#define repc(n) for(int repp_b = (n), repp = 0; repp < repp_b; ++repp)#define rst(a, v) memset(a, v, sizeof a)#define cpy(a, b) memcpy(a, b, sizeof a)#define rstn(a, v, n) memset(a, v, (n)*sizeof((a)[0]))#define cpyn(a, b, n) memcpy(a, b, (n)*sizeof((a)[0]))#define ast(b) if(DBG && !(b)) { printf("%d!!|n", __LINE__); while(1) getchar(); }#define dout DBG && cout << __LINE__ << ">>| "#define pr(x) #x"=" << (x) << " | "#define mk(x) DBG && cout << __LINE__ << "**| "#x << endl#define pra(arr, a, b) if(DBG) {     dout<<#arr"[] | ";     forlec(i, a, b) cout<<"["<<i<<"]="<<arr[i]<<" |"<<((i-(a)+1)%13?" ":"n");     if(((b)-(a)+1)%13) puts("");   }#define rd(type, x) type x; cin >> xinline int     rdi() { int d; scanf("%d", &d); return d; }inline char    rdc() { scanf(" "); return getchar(); }inline string  rds() { rd(string, s); return s; }inline double rddb() { double d; scanf("%lf", &d); return d; }template<class T> inline bool updateMin(T& a, T b) { return a>b? a=b, true: false; }template<class T> inline bool updateMax(T& a, T b) { return a<b? a=b, true: false; }const int N = 32;int n;char s[N];int main() {  repc(rdi()) {    scanf("%d %s", &n, s);    int xorsum = 0, ans = 0;    forl(i, 0, n) {      xorsum ^= s[i]=='1';      ans = ans<<1 | xorsum;    }    static int cas;    printf("Poslanec %d se posadi na sedadlo cislo %d.n", ++cas, ++ans);  }  return 0;}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/379042.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号