April Fools Day Contest 2016 A. Da Vinci Powers
2016-04-02 18:39
585 查看
A. Da Vinci Powers
题目连接:
http://www.codeforces.com/contest/656/problem/ADescription
The input contains a single integer a (0 ≤ a ≤ 35).Input
Output a single integer.Output
In the first line print "YES" (without quotes), if Polycarpus can perform the reorganisation and "NO" (without quotes) otherwise. If the answer is "YES" (without quotes), then in next n lines print m numbers — the heights of the remaining hay stacks. All the remaining non-zero values should be equal, represent a connected area and at least one of these values shouldn't be altered.If there are multiple answers, print any of them.
Sample Input
3Sample Output
8Hint
题意
给你a,让你输出达芬奇幂题解:
达芬奇这个智障把2^n算错了,他把2^13算错了算成8092了
代码
#include<bits/stdc++.h> using namespace std; long long a[]={1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496, 8485076992, 16970153984, 33940307968}; int main() { int n; scanf("%d",&n); cout<<a <<endl; }
相关文章推荐
- iOS Sprite Kit教程之xcode安装以及苹果帐号绑定
- 有表头链表的基本操作
- Java日记——识别简单的验证码
- Qt应用的单实例运行
- //最大乘积
- Swift中的可选类型(Optional)以及?和!的用法详解
- Eclipse进行可视化的GUI开发3大GUI插件
- 改善C#程序的50种方法
- 深入理解Java的接口和抽象类
- 出现次数最多的数
- MIPS体系结构--指令集
- 新的计划——XX监测与预警平台
- HDU-1087Super Jumping! Jumping! Jumping!
- AJAX-----script简单版
- test
- ARToolKit for Unity
- __restrict,restrict关键字
- tail -f -F是个好东西
- java集合
- Android 网络通信框架Volley的二次封装