HDOJ 4696 Answers 乱搞

乱搞:

rt,有1就能输出所有的数,否则只能输出偶数

Answers

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 489 Accepted Submission(s): 294

Problem Description HDOJ 4696 Answers 乱搞

Sample Input

2 4 2 2 2 1 0 1 2 3

Sample Output

NO YES YES YES

Source 2013 Multi-University Training Contest 10

#include #include #include #include using namespace std; int n,m; int t[100100],c[100100]; int main() { while(scanf("%d%d",&n,&m)!=EOF) { bool flag=false; for(int i=1;i

点击复制链接 与好友分享!回本站首页
您对本文章有什么意见或着疑问吗?请到论坛讨论您的关注和建议是我们前行的参考和动力
上一篇:codeforces Round #259(div2) E解题报告
下一篇:UVA 10306 e-Coins(完全背包: 二维限制条件)
相关文章

hdoj 1385 Minimum Transport Cos

HDOJ 1757 A Simple Math Problem

hdoj 1575 Tr A

Hdoj 1379 DNA Sorting

hdoj2149

HDOJ 2955 Robberies

HDOJ 2546 饭卡

HDOJ 2546 饭卡 (01背包)

HDOJ 1203 I NEED A OFFER! (01背包)

HDOJ 2586 How far away?

图文推荐
HDOJ 4696 Answers 乱搞
ZOJ 3640 Help Me
HDOJ 4696 Answers 乱搞
CF 518C(Anya and
HDOJ 4696 Answers 乱搞
hdu 1016 Prime R
UVA - 11987 - A

分类:默认分类 时间:2012-01-07 人气:3
本文关键词:
分享到:

相关文章

  • hdu4027 Can you answer these queries? (区间修改,区间查询) 2013-12-31

    对一个区间两种操作: c x y 1、使区间[x,y]的数等于其开方数(四舍五入)。 2、查询区间[x,y]的和。 剪枝: 当一个数小于等于1时其开方数将不再变化 -------------------------------------------------------- 1、线段树 #include #include #include #include #include using namespace std; const int maxn = 100100; typedef long l

  • codeforces Round #259(div2) E解题报告 2014-07-31

    E. Little Pony and Summer Sun Celebration time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Twilight Sparkle learnt that the evil Nightmare Moon would return during the upcoming Summer Sun Ce

  • HDOJ 5001 Walk 2012-03-05

    姒???DP dp[j][d] 琛ㄧず涓?缁?杩?i?硅蛋d姝ュ????姒??? dp[j][d]=sigma ( dp[k][d-1] * Probability ) ans = sigma ( dp[j][D] ) Walk Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 401 Accepted Submission(s): 261

  • HDOJ 4451 Dressing 2012-06-10

    Dressing Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2484 Accepted Submission(s): 1076 Problem Description Wangpeng has N clothes, M pants and K shoes so theoretically he can have N×M×K differ

  • HDOJ 3485 Count 101 2012-09-19

    数位DP。。。。 Count 101 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 912 Accepted Submission(s): 477 Problem Description You know YaoYao is fond of his chains. He has a lot of chains and each chain

  • HDOJ 4937 Lucky Number 2012-11-30

    当进制转换后所剩下的为数较少时(2位,3位),对应的base都比较大,可以用数学的方法计算出来。 预处理掉转换后位数为3位后,base就小于n的3次方了,可以暴力计算。。。。 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 521 Accepted Submission(s): 150 Problem Description “Ladie

  • HDOJ 4814 Golden Radio Base 2013-02-27

    利用题目中给出的公式和hint可以得到两个有用的公式: phi^(n) = phi^(n-1)+phi^(n-2) 2*(phi^n) = phi^(n+1)+phi^(n-2) 可以计算出phi^100远大于10^9,所以推测最后得到的phi进制的数整数和小数部分应该不会超过100位,事实表明,50位就能过。 所以最终变成了简单的模拟。 Golden Radio Base Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/3

  • HDOJ 2769 Disgruntled Judge 扩展GCD 2013-03-20

    扩展GCD: 枚举a,扩展GCD求b,再暴力检查 Disgruntled Judge Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 329 Accepted Submission(s): 142 Problem Description Once upon a time, there was an nwerc judge with a ten

  • HDOJ 4010 Query on The Trees LCT 2013-04-08

    LCT: 切割、合并子树,路径上所有点的点权增加一个值,查询路径上点权的最大值 Query on The Trees Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 2582 Accepted Submission(s): 1208 Problem Description We have met so many problems on th

Copyright (C) quwantang.com, All Rights Reserved.

趣玩堂 版权所有 京ICP备15002868号

processed in 0.114 (s). 10 q(s)