
数学
吃货妍
努力学习中
展开
-
Hrb1924
分数表达式Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 249(118 users)Total Accepted: 123(114 users)Rating: Special Judge: NoDescription原创 2016-04-20 21:24:23 · 290 阅读 · 0 评论 -
HDU Friend-Graph(离散数学)
Friend-GraphTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 611 Accepted Submission(s): 313Problem Description It is well known that small原创 2017-08-19 23:38:12 · 314 阅读 · 0 评论 -
第四届“图灵杯”NEUQ-ACM程序设计竞赛(团队赛)-网络同步赛A(组合数学)
问题 A: 谷神的游戏 时间限制: 1 Sec 内存限制: 16 MB 提交: 344 解决: 72 [提交][状态][讨论版] 题目描述 NEUQ的谷神要和我玩一个游戏:谷神要求我随机在纸上写出整数集合{1,2,3,…,3n+1}(n是整数)的一个排列(即不重复的随机写出从1到3n+1的所有整数)。并且要求在我写的过程中,从我写的第一个数开始一直加到我正在写的数的总和不被3整除。原创 2017-06-11 16:18:33 · 460 阅读 · 0 评论 -
Codeforces Round #404 (Div. 2) D. Anton and School - 2(组合数学)
D. Anton and School - 2 time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output As you probably know, Anton goes to school. One of the school subj转载 2017-03-17 23:19:57 · 716 阅读 · 0 评论 -
Codeforces Round #395 (Div. 2)E: Timofey and remoduling(数学+数论)
E. Timofey and remodulingtime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputLittle Timofey likes integers a lot. Unfortunately, he is very young a原创 2017-02-05 23:36:35 · 972 阅读 · 6 评论 -
Codeforces Round #370 (Div. 2)C. Memory and De-Evolution(数学,思维))
C. Memory and De-Evolutiontime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputMemory is now interested in the de-evolution of objects, specifically原创 2016-10-29 21:50:29 · 399 阅读 · 0 评论 -
HDU5895 Mathematician QSC(经典数论集合题)(一点点更新)
Mathematician QSCTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 142 Accepted Submission(s): 66Problem DescriptionQSC dream of原创 2016-09-19 10:37:53 · 755 阅读 · 0 评论 -
N阶幻方
对于n阶幻的定义和详解,请点击传送门:叫我萌萌哒的传送门。我自己写了一下代码实现,代码写的有点渣,将就看。。。。1:奇数阶void dfs(int x,int y){ if(k==n*n+1) return ; int fx=x-1>=1?x-1:n; int fy=y+1>n?1:y+1; if(a[fx][fy]==0) {原创 2016-08-23 21:26:40 · 812 阅读 · 0 评论 -
Poj1364 King
DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound king.'' After nine months her child w原创 2016-03-30 22:49:41 · 438 阅读 · 0 评论 -
差分约束
一直不知道差分约束是什么类型题目,最近在写最短路问题就顺带看了下,原来就是给出一些形如x-y好神奇的是这类问题竟然可以转换成图论里的最短路径问题,下面开始详细介绍下比如给出三个不等式,b-a由题我们可以得知,这个有向图中,由题b-a根据以上的解法,我们可能会猜到求解过程实际就是求从a到c的最短路径,没错的....简单的说就是从a到c沿着某条路径后把所有权值和k求出就是c转载 2016-03-30 22:39:27 · 357 阅读 · 0 评论 -
HDU 6216 A Cubic number and A Cubic Number
A Cubic number and A Cubic NumberTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 224 Accepted Submission(s): 129Problem Description A cubic原创 2017-09-17 22:32:26 · 300 阅读 · 0 评论