April Fools Contest 2017 题解
趁着上课无聊,来补一补……
A. Numbers Joke
直接oeis就好了:http://oeis.org/search?q=numbers+joke&language=english&go=Search
#include<bits/stdc++.h>
using namespace std;
long long p[]={ 4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086, 1111, 1165};
int main(){
int n;
cin>>n;
cout<<p[n-1]<<endl;
}
B - Kids' Riddle
16进制中圈圈的个数。。。。
这TM谁猜得到(微笑)
#include<bits/stdc++.h>
using namespace std;
char getc(long long p){
if(p==10)return 'A';
if(p==11)return 'B';
if(p==12)return 'C';
if(p==13)return 'D';
if(p==14)return 'E';
if(p==15)return 'F';
return char(p+'0');
}
string get(long long x){
string s;
while(x){
s+=getc(x%16);
x/=16;
}
return s;
}
map<char,int> H;
int main(){
H['0']=1;
H['1']=0;
H['2']=0;
H['3']=0;
H['4']=1;
H['5']=0;
H['6']=1;
H['7']=0;
H['8']=2;
H['9']=1;
H['A']=1;
H['B']=2;
H['C']=0;
H['D']=1;
H['E']=0;
H['F']=0;
long long p;
cin>>p;
if(p==0){
cout<<"1"<<endl;
return 0;
}
string s = get(p);
int ans = 0;
for(int i=0;i<s.size();i++)
ans+=H[s[i]];
cout<<ans<<endl;
}
C. INTERCALC
FIND XOR OF LARGEST AND LAST ARRAY ELEMENTS
#include<bits/stdc++.h>
using namespace std;
int n,x,mx;
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&x);
mx=max(x,mx);
}
cout<<(x^mx)<<endl;
}
D - Touchy-Feely Palindromes
给你个字符串,问你这个字符串在盲文的条件下,是否回文
#include<bits/stdc++.h>
using namespace std;
map<char,char>H;
string s;
int main(){
H['3']='3';
H['4']='6';
H['5']='9';
H['6']='4';
H['7']='7';
H['8']='0';
H['9']='5';
H['0']='8';
cin>>s;
int flag = 1;
for(int i=0;i<s.size();i++){
if(!H.count(s[i]))flag=0;
else{
if(H[s[i]]!=s[s.size()-1-i])
flag=0;
}
}
if(flag)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
E - Twisted Circuit
给一个电路图,然后把OR门看成XOR门,把XOR门看成OR门就好了
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int a1=a^b;
int b1=c|d;
int c1=b&c;
int d1=a^d;
int a2=a1&b1;
int b2=c1|d1;
cout<<(a2^b2)<<endl;
}
F - Crunching Numbers Just for You
必须运行超过1秒。。
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000006;
int n,a[maxn];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
}
for(int i=n;i<maxn;i++){
a[i]=101;
}
for(int i=0;i<100;i++){
a[n+i]=102+i;
sort(a,a+maxn);
}
for(int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl;
}
G. BF Calculator
写一个表达式,让你用brainfuck写出答案是多少。
#include<bits/stdc++.h>
using namespace std;
string s;
string get(int p){
if(p==0){
return "0";
}
int flag = 0;
if(p<0)flag=1,p=-p;
string tmp;
while(p){
tmp+=(p%10+'0');
p/=10;
}
if(flag)tmp+='-';
reverse(tmp.begin(),tmp.end());
return tmp;
}
int main(){
cin>>s;
int now = 0;
int num = 0;
int flag = 0;
for(int i=0;i<s.size();i++){
if(s[i]=='+'||s[i]=='-'){
if(flag==0){
now+=num;
}
else{
now-=num;
}
if(s[i]=='+')
flag=0;
else
flag=1;
num=0;
}else{
num=num*10+(s[i]-'0');
}
}
if(flag==0){
now+=num;
}
else{
now-=num;
}
string ss = get(now);
for(int i=0;i<ss.size();i++){
for(int j=0;j<ss[i];j++){
cout<<"+";
}
cout<<".";
cout<<">"<<endl;
}
}
April Fools Contest 2017 题解的更多相关文章
- April Fools Contest 2017 题解&源码(A,数学 B,数学 C,数学 D,字符串 E,数字逻辑 F,排序,卡时间,G,数学)
A. Numbers Joke time limit per test:2 seconds memory limit per test:64 megabytes input:standard inpu ...
- Codeforces April Fools Contest 2017
都是神题,我一题都不会,全程听学长题解打代码,我代码巨丑就不贴了 题解见巨神博客 假装自己没有做过这套
- April Fools Contest 2017 F
Description You are developing a new feature for the website which sells airline tickets: being able ...
- April Fools Contest 2017 E
Description Input The input consists of four lines, each line containing a single digit 0 or 1. Outp ...
- April Fools Contest 2017 D
Description Input The only line of the input contains a string of digits. The length of the string i ...
- April Fools Contest 2017 C
Description DO YOU EXPECT ME TO FIND THIS OUT? WHAT BASE AND/XOR LANGUAGE INCLUDES string? DON'T BYT ...
- April Fools Contest 2017 B
Description Programmers' kids solve this riddle in 5-10 minutes. How fast can you do it? Input The i ...
- April Fools Contest 2017 A
Description Input The input contains a single integer a (1 ≤ a ≤ 30). Output Output a single integer ...
- April Fools Contest 2018
这个比赛不正经,但是我可以一本正经的写代码啊 A. Quirky Quantifiers time limit per test 2 seconds memory limit per test 64 ...
随机推荐
- 53环境Jenkins新增工程配置
1. 登录http://10.179.175.53:8080/环境. 2. 点击新建任务,输入任务名称,并在复制一个NOS的类似工程即可. 3. 在配置页面,修改源码地址: 4. 点击完成,执行构建, ...
- windows2008r2系统破解登录密码方法
破解windows 2008 r2系统登录密码方法: 1.重启系统,使用windows2008r2安装光盘引导 按住shift+f10 2.切换到d:windows\system32目录(使用cmd. ...
- webstrom里面的html页面设置
代码: <!DOCTYPE html> <html lang="zh"> <head> <meta charset="UTF-8 ...
- Android app 在线更新那点事儿(适配Android6.0、7.0、8.0)
一.前言 app在线更新是一个比较常见需求,新版本发布时,用户进入我们的app,就会弹出更新提示框,第一时间更新新版本app.在线更新分为以下几个步骤: 1, 通过接口获取线上版本号,versionC ...
- Socket 实现聊天功能
注:本文来自:简书:jianshu 作者:jijs链接:http://www.jianshu.com/p/7c0722a8b66f來源:简书著作权归作者所有.商业转载请联系作者获得授权,非商业转载请注 ...
- Git 将项目(代码)从GitHub上克隆(下载)到本地仓库
要将项目从GitHub上克隆到本地,首先你得下载并安装好git for window. 配置Git: 1.安装完后,右键单击桌面空白处,选择Git Gui Here,进去之后,选择左上角的help选项 ...
- python接口自动化测试二十五:执行所有用例,并生成HTML测试报告
import requestsimport unittest class TestQQ(unittest.TestCase): '''测试QQ号接口''' # 此注释将展示到测 ...
- HDU1850 尼姆博弈求可行方案数目
尼姆博弈(Nimm's Game) 题型 尼姆博弈模型,大致上是这样的: 有3堆各若干个物品,两个人轮流从某一堆取任意多的物品,规定每次至少取1个,多者不限,最后取光者得胜. 分析 1.首先自己想一下 ...
- bootstrap之表格和按钮
<!DOCTYPE html> <html lang="en"> <head> <meta charset="UTF-8&quo ...
- ubuntu装软件包
查找包 aptitude search pkgName pkgName可以有多个(空格分隔) ffmpeg sudo add-apt-repository ppa:kirillshkrogalev/f ...