2017 Multi-University Training Contest
来源:互联网 发布:网络直播需要什么资质 编辑:程序博客网 时间:2024/05/29 10:24
http://acm.hdu.edu.cn/showproblem.php?pid=6130
题意:
现在有一个名字为Kolakoski的序列,关于Kolakoski序列的定义是相邻的相同的数字为一组,第
思路:
直接按Kolakoski的定义模拟即可。简单暴力。数据水到比赛的时候直接判断
代码:
#include<bits/stdc++.h>using namespace std;#define MAXN 10000005int a[MAXN];int main(){ a[1] = 1; a[2] = a[3] = 2; int flag = 0; int total = 4; int idx = 3; while(total < MAXN){ for(int i = 0;i < a[idx];i++){ a[total++] = flag + 1; } idx++; flag = !flag; } int T,n; while(~scanf("%d",&T)){ while(T--){ scanf("%d",&n); printf("%d\n",a[n]); } }}
阅读全文
0 0
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- #2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 2017 Multi-University Training Contest
- 基于qt,opencv交互式的graphcuts算法的实现
- 在linux上安装redis
- 插入排序 @ Python
- 图像处理实例--Retinex增强处理
- 自定义Gradle插件
- 2017 Multi-University Training Contest
- Python 代码的准确性和可维护性
- LeetCode---twoSum
- 1014(暴力树状数组)
- canvas实现粒子星空连线
- HTML5基础篇
- Linux zip 与 unzip命令详解
- ORA-00911: invalid character 错误解决
- HDU 6162 Ch’s gift (树的路径问题 DFS LCA 17多校第九场第2题)