- 博客(32)
- 资源 (1)
- 收藏
- 关注
原创 Doing Homework again HDU 1789 (贪心)
Doing Homework againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 93 Accepted Submission(s): 81 Problem Descrip
2017-05-31 22:13:03 293
原创 2017 计蒜之道 初赛 第四场 (第二题) B. 商汤科技的行人检测(简单)
商汤科技近日推出的 SenseVideo 能够对视频监控中的对象进行识别与分析,包括行人检测等。在行人检测问题中,最重要的就是对行人移动的检测。由于往往是在视频监控数据中检测行人,我们将图像上的行人抽象为二维平面上若干个的点。那么,行人的移动就相当于二维平面上的变换。在这道题中,我们将行人的移动过程抽象为 平移,有两个 移动参数:dxdx 和 dydy。每次行人的移动过程会将行人对
2017-05-31 16:42:51 823 1
原创 2017 计蒜之道 初赛 第四场 (计蒜课比赛)第一题
商汤科技致力于引领人工智能核心“深度学习”技术突破,构建人工智能、大数据分析行业解决方案。作为一家人工智能公司,用机器自动地解决各类实际问题自然不在话下。近日,商汤科技推出了一套安全令牌,令牌如下图所示:安全令牌上的小孔有 nn 行 mm 列,不过有些行和有些列已经用导线整体焊接了,共有 kk 根导线。我们可以在安全令牌上 不重叠 地焊接若干个小芯片,每个芯片需要在相邻(不能斜着相邻,
2017-05-31 16:36:22 430
原创 A == B ? HOJ2054 (字符串(小数点))
A == B ?Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 153 Accepted Submission(s): 68 Problem DescriptionGiv
2017-05-31 16:32:25 268
原创 Lucky Coins Sequence (矩阵快速幂)
Lucky Coins SequenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46 Accepted Submission(s): 32 Problem Descrip
2017-05-28 10:34:29 385
原创 HD-2842 Chinese Rings(矩阵应用)
Chinese RingsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 53 Accepted Submission(s): 32 Problem Description
2017-05-25 21:16:17 311
原创 HDU - 3117 Fibonacci Numbers
Fibonacci NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 82 Accepted Submission(s): 47 Problem Descriptio
2017-05-25 09:24:09 346
原创 HDU2294 Pendant (齐次线性方程的矩阵解法 + 矩阵快速幂)
PendantTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 115 Accepted Submission(s): 70 Problem DescriptionOn S
2017-05-23 14:43:43 371
原创 A Simple Math Problem (矩阵快速幂、构造矩阵)
A Simple Math ProblemTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 89 Accepted Submission(s): 74 Problem Descri
2017-05-21 17:12:13 330
原创 Tr A (矩阵快速幂)
Tr ATime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 108 Accepted Submission(s): 80 Problem DescriptionA为一个方阵,
2017-05-21 16:22:25 327
原创 John (尼姆博弈)
JohnTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 63 Accepted Submission(s): 43 Problem DescriptionLittle J
2017-05-20 11:00:06 302
原创 Being a Good Boy in Spring Festival (nim game 尼姆博弈)
Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 54 Accepted Submission(s): 47
2017-05-19 08:50:40 240
原创 Rabbit and Grass (nim game 尼姆 博弈)
Rabbit and GrassTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44 Accepted Submission(s): 42 Problem Description
2017-05-18 15:52:01 248
原创 Fibonacci again and again (尼姆博弈 nim game)
Fibonacci again and againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 140 Accepted Submission(s): 86 Problem D
2017-05-18 09:41:42 307
转载 sg 函数 入门 + 证明 (侵删
SG函数入门sg[i]为0表示i节点先手必败。首先定义mex(minimal excludant)运算,这是施加于一个集合的运算,表示最小的不属于这个集合的非负整数。例如mex{0,1,2,4}=3、mex{2,3,5}=0、mex{}=0。对于一个给定的有向无环图,定义关于图的每个顶点的Sprague-Grundy函数g如下:g(x)=mex{ g(y) | y是
2017-05-18 09:34:59 500
原创 Good Luck in CET-4 Everybody! (巴什博弈 bash game)
Good Luck in CET-4 Everybody!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 92 Accepted Submission(s): 75 Proble
2017-05-16 20:36:15 259
原创 Brave Game (巴什博弈)
Brave GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 87 Accepted Submission(s): 75 Problem Description十年
2017-05-16 20:25:37 297
原创 HDU 1387 Team Queue (队列模拟)
Team QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 140 Accepted Submission(s): 66 Problem DescriptionQ
2017-05-16 17:23:22 266
原创 汇编 AX, BX, CX, DX, SI, DI,
AX――累加器(Accumulator),使用频度最高BX――基址寄存器(Base Register),常存放存储器地址CX――计数器(Count Register),常作为计数器DX――数据寄存器(Data Register),存放数据SI――源变址寄存器(Source Index),常保存存储单元地址DI――目的变址寄存器(Destination Index),常保存存储单
2017-05-15 20:57:41 3322
原创 Flipper (栈模拟)
FlipperTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 68 Accepted Submission(s): 54 Problem DescriptionLittl
2017-05-14 10:00:38 433
原创 Train Problem I (栈的模拟)
Train Problem ITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 108 Accepted Submission(s): 82 Problem Description
2017-05-13 19:33:50 218
原创 ACboy needs your help again! (栈、队列 模拟)
ACboy needs your help again!Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 100 Accepted Submission(s): 80 Proble
2017-05-13 15:33:12 308
原创 The Balance (母函数)
The BalanceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 137 Accepted Submission(s): 90 Problem Description
2017-05-12 09:25:59 365
转载 母函数详解(转 侵删)
母函数与排列组合 在谈论母函数问题之前,我们先看一个简单的问题描述:假如有两组数据(A,B)和(C,D),每组中选出一个构成一个组合,总共有几种选法?很显然总共有4种选法:AC,AD,BC,BD。而且很容易联想到这个式子(A+B)*(C+D)=A*C+A*D+B*C+B*D。式子中的几个乘积项就是上面的4种选法。假如把问题换一下:每组中选出一个或0个数据构成组合,总共有几种组合?那么结果
2017-05-11 21:20:30 1275
原创 RMQ(二维模板)
//freopen("/Users/zhangzhichao/Documents/HDOJ/HDOJ/1.txt", "r", stdin);#include #include #include #include #include #include #include #include #include using namespace std;int dp[303][303][
2017-05-05 10:57:03 695
原创 敌兵布阵 (线段树 单点更新)
敌兵布阵Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 439 Accepted Submission(s): 267 Problem DescriptionC国的死对头
2017-05-04 21:11:11 228
原创 确定比赛名次 (拓扑排序)
确定比赛名次Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 477 Accepted Submission(s): 238 Problem Description有N个比
2017-05-03 17:40:20 419
原创 Hat’s Words (字典树 + 智能指针shared_ptr)
Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 295 Accepted Submission(s): 138 Problem Description
2017-05-02 17:03:35 354
原创 Find Small A [HDU-5980] (水)
Find Small ATime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1113 Accepted Submission(s): 541Problem DescriptionAs is known to
2017-05-02 11:18:22 391
原创 Wrestling Match 2016ACM/ICPC亚洲区大连站-重现赛(感谢大连海事大学)hdu 5971
Wrestling MatchTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1034 Accepted Submission(s): 391Problem DescriptionNowadays, a
2017-05-02 10:41:50 755
原创 The Debut Album (dp + 滚动数组)
G - The Debut Album URAL - 2018 #include #include #include #include #include #include using namespace std;const int mod = 1000000007;int dp[2][2][505];int main() { int n, a, b;
2017-05-02 08:55:33 280
原创 Game of Taking Stones (大数 + 威佐夫博弈 java写的)
C - Game of Taking Stones import java.math.BigDecimal;import java.util.Scanner;public class Main{ public static void main(String[] args) { BigDecimal TWO = BigDecimal.valu
2017-05-01 17:34:18 346
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人