发表评论取消回复
相关阅读
相关 找规律博弈小记(更新)
最近在HDOJ上水博弈的题目,在这里记录一些小规律。 !!1)http://acm.hdu.edu.cn/showproblem.php?pid=2897 题意:一堆n个石
相关 HDU 1564-Play a game(博弈-找规律)
Play a game Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/
相关 HDU 2147-kiki's game(博弈/找规律)
kiki's game Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/10000 K (Java/
相关 Codeforces Round #431 (Div. 2) A. Odds and Ends(找规律)
A. Odds and Ends time limit per test 1 second memory limit per test 256 megabytes i
相关 codeforces 167C Wizards and Numbers(找规律,博弈)
C. Wizards and Numbers time limit per test 2 seconds memory limit per test 256 megab
相关 CodeForces 152C Pocket Book(找规律+哈希)
One day little Vasya found mom's pocket book. The book had n names of her friends and un
相关 codeforces 146D Lucky Number 2 (找规律)
Petya loves lucky numbers very much. Everybody knows that lucky numbers are positive int
相关 找规律-CodeForces 1027B-Numbers on the Chessboard
找规律-CodeForces 1027B-Numbers on the Chessboard -------------------- 题目链接:
相关 Codeforces 401D Roman and Numbers
题目大意 Description 给定一个数 N(N<1018) , 求有多少个经过 N 重组的数是 M(M≤100) 的倍数. 注意: ①重组不能有前导零;
还没有评论,来说两句吧...