A. Da Vinci Powers

題目連接：

http://www.codeforces.com/contest/656/problem/A

Description

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

3

Sample Output

8

Hint

題意

給你a，讓你輸出達(dá)芬奇冪

題解：

達(dá)芬奇這個(gè)智障把2^n算錯(cuò)了，他把2^13算錯(cuò)了

算成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[n]<<endl; }

總結(jié)

以上是生活随笔為你收集整理的April Fools Day Contest 2016 A. Da Vinci Powers的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。