2018年9月18日

zoj 4057

摘要: #include #include #include #include #include #include using namespace std; #define ll long long const int N =1e5+9; int t,n,a[N]; int b[50]; /* 要想两个数的异或结果比两者都大 必须两数的首位都为1,其他位... 阅读全文

posted @ 2018-09-18 09:32 cltt 阅读(184) 评论(0) 推荐(0) 编辑

zoj 4056

摘要: At 0 second, the LED light is initially off. After BaoBao presses the button 2 times, the LED light turns on and the value of the counter changes to 1 阅读全文

posted @ 2018-09-18 09:21 cltt 阅读(179) 评论(0) 推荐(0) 编辑

zoj 4054

摘要: #define ll long long const int N =1e5+9; int t; ll ans,tmp; char s[N]; int main() { scanf("%d",&t); while(t--) { scanf("%s",s); int l=strlen(s)... 阅读全文

posted @ 2018-09-18 00:27 cltt 阅读(182) 评论(0) 推荐(0) 编辑

zoj 4049

摘要: In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program, whether the program w 阅读全文

posted @ 2018-09-18 00:12 cltt 阅读(289) 评论(0) 推荐(0) 编辑

导航