【April Fools Day Contest 2014F】【愚人节脑洞 OEIS大法】000001 输出序列某一项

最新推荐文章于 2023-01-11 20:50:18 发布

snowy_smile

最新推荐文章于 2023-01-11 20:50:18 发布

阅读量802

点赞数

分类专栏：题库-CF CodeForces 脑洞文章标签：题库-CF CodeForces 脑洞

本文链接：https://blog.csdn.net/snowy_smile/article/details/50930503

版权

题库-CF CodeForces 同时被 2 个专栏收录

280 篇文章 2 订阅

订阅专栏

脑洞

48 篇文章 0 订阅

订阅专栏

Input

The input contains a single integer a (1 ≤ a ≤ 64).

Output

Output a single integer.

Examples

input

output

input

output

input

output

input

output

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }
const int N = 0, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int ans[100] =
{
    0, 1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51, 1, 2, 1, 14, 1, 2, 2, 14, 1, 6, 1, 4, 2, 2, 1, 52, 2, 5, 1, 5, 1, 15, 2, 13, 2, 2, 1, 13, 1, 2, 4, 267, 1, 4, 1, 5, 1, 4, 1, 50, 1, 2, 3, 4, 1, 6, 1, 52, 15, 2, 1, 15, 1, 2, 1, 12, 1, 10, 1, 4, 2
};
int n;
int main()
{
    while (~scanf("%d", &n))
    {
        printf("%d\n", ans[n]);
    }
    return 0;
}
/*
http://oeis.org/A000001
【trick&&吐槽】
看题目，看题目，看题目，看题目
答案就在题目中，ORZ
然而正式比赛是不能OESI的哦
*/