关闭
当前搜索:

HDU 1517 A Multiplication Game(博弈找规律)

传送门A Multiplication GameTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5309    Accepted Submission(s): 3021Problem Description Stan and Ollie pl...
阅读(422) 评论(0)

HDU 1850 Being a Good Boy in Spring Festival(简单 尼姆博弈应用)

传送门 Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6828    Accepted Submission(s): 4138Problem Description 一...
阅读(413) 评论(0)

HDU 5387 Clock(简单模拟)——2015 Multi-University Training Contest 8

传送门 ClockTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1178    Accepted Submission(s): 671Problem Description Give a time.(hh:mm:ss),you sho...
阅读(476) 评论(0)

Codeforces 711 E. ZS and The Birthday Paradox(数学)——Codeforces Round #369 (Div. 2)

[传送门](http://codeforces.com/contest/711/problem/E) E. ZS and The Birthday Paradoxtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder has r...
阅读(948) 评论(0)

HDU 5373 The shortest problem(模拟)——2015 Multi-University Training Contest 7

传送门The shortest problemTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2223    Accepted Submission(s): 902Problem Description In this problem, we...
阅读(445) 评论(0)

51NOD 1661 黑板上的游戏(博弈 找规律)——算法马拉松17(告别奥运)

传送门1661 黑板上的游戏Alice和Bob在黑板上玩一个游戏,黑板上写了n个正整数a1, a2, …, an,游戏的规则是这样的:1 . Alice占有先手主动权。2 . 每个人可以选取一个大于1的数字擦去,并写上一个更小的数字,数字必须是整数,然后由对方进行下一次操作。3 . 如果擦去的数字是 x (x > 1) ,则写上的数字不能比 x/k 小,但是要比 x 小。这里的除法为有理数除法。4...
阅读(806) 评论(0)

51NOD 1537 分解(矩阵快速幂)——算法马拉松17(告别奥运)

传送门问 (1+2√)n(1+\sqrt 2) ^n 能否分解成 m−−√+(√m−1)\sqrt m +\sqrt(m-1)的形式 如果可以 输出 m MOD (109+7)m\ MOD\ (10^9+7) 否则 输出 nonoInput一行,一个数 nn。 (n<=1018)(n<=10^{18})Output一行,如果不存在 mm 输出 nono,否则输出 m MOD 109+7 m\ M...
阅读(645) 评论(0)

HDU 5351 MZL's Border(大数 + 找规律)——2015 Multi-University Training Contest 5

传送门 MZL’s BorderTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1374    Accepted Submission(s): 452Problem Description As is known to all, MZL i...
阅读(486) 评论(0)

HDU 5318 The Goddess Of The Moon(构造矩阵 )——2015 Multi-University Training Contest 3

传送门 The Goddess Of The MoonTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1471    Accepted Submission(s): 636Problem Description Chang’e (嫦娥)...
阅读(754) 评论(0)

HDU 5319 Painter(模拟 + 规律)——2015 Multi-University Training Contest 3

传送门 PainterTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1946    Accepted Submission(s): 777Problem Description Mr. Hdu is an painter, as we...
阅读(719) 评论(0)

Codeforces 710 C. Magic Odd Square(构造)——Educational Codeforces Round 16

传送门Find an n × nn × n matrix with different numbers from 11 to n2n^2, so the sum in each row, column and both main diagonals are odd.Input The only line contains odd integer n(1 ≤ n ≤ 49).n (1 ≤ n ≤...
阅读(807) 评论(0)

HDU 5312 Sequence(三角形数应用)——BestCoder 1st Anniversary ($)

传送门 SequenceTime Limit: 2000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1424    Accepted Submission(s): 442Problem Description Today, Soda has learned a...
阅读(662) 评论(0)

HDU 5288 OO’s Sequence(数学)——2015 Multi-University Training Contest 1

传送门 OO’s SequenceTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 3597    Accepted Submission(s): 1318Problem Description OO has got a ar...
阅读(436) 评论(0)

[Offer收割]编程练习赛6 题目1 : Playfair密码表 (密码学——模拟)

传送门时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 小Hi和小Ho经常用Playfair密码表加密自己的代码。 密码表是按以下步骤生成的。 随机选择一个只包含大写字母的单词S作为密钥。 将S中的所有字母J替换为字母I。 将S中的字母依次填写进一个5x5的矩阵,按照从上到下、从左到右的顺序填充格子。填充过程中略过已经在密码表中的字母。 将’A’-‘I...
阅读(765) 评论(0)

HiHoCoder [Offer收割]编程练习赛6 C. 图像算子(高斯消元小数版)

传送门时间限制:10000ms 单点时限:1000ms 内存限制:256MB描述在图像处理的技术中,经常会用到算子与图像进行卷积运算,从而达到平滑图像或是查找边界的效果。假设原图为 H×WH × W 的矩阵 AA,算子矩阵为 D×DD × D 的矩阵 OpOp ,则处理后的矩阵 BB 大小为 (H−D+1)×(W−D+1)(H-D+1) × (W-D+1)。其中:B[i][j]=∑(A[i−1+...
阅读(755) 评论(0)
53条 共4页1 2 3 4 下一页 尾页
    个人资料
    • 访问:484373次
    • 积分:11081
    • 等级:
    • 排名:第1619名
    • 原创:636篇
    • 转载:5篇
    • 译文:0篇
    • 评论:93条
    博客专栏