---------------算法竞赛-----------
文章平均质量分 84
而濡木染
不赶时间也奔跑
展开
-
poj1113Wall(凸包周长计算)
poj1113Wall(凸包周长计算):http://poj.org/problem?id=1113题目描述:WallTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35235 Accepted: 11996DescriptionOnc原创 2016-08-11 11:40:36 · 689 阅读 · 0 评论 -
高斯消元模板+十进制数
#include#include#include#include#includeusing namespace std;const int MAXN=50;int a[MAXN][MAXN];//增广矩阵int x[MAXN];//解集bool free_x[MAXN];//标记是否是不确定的变元/*void Debug(void){ int i, j原创 2016-10-25 21:40:02 · 478 阅读 · 0 评论 -
nefu504new Flip Game+高斯消元
nefu504new Flip Game+高斯消元题目链接:http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=504题面描述:new Flip GameProblem:504Time Limit:1000msMemory Limit:65原创 2016-10-25 21:52:41 · 1335 阅读 · 0 评论 -
hdu5478 Can you find it+快速幂
hdu5478 Can you find it+快速幂 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5478题面描述:Can you find itTime Limit: 8000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total原创 2016-10-26 19:31:37 · 411 阅读 · 0 评论 -
codeforces100917 Constant Ratio
codeforces100917 Constant Ratio 题目链接:http://codeforces.com/gym/100917/problem/C题面描述:C. Constant Ratiotime limit per test1 secondmemory limit per test256 megabytesinpu原创 2016-10-01 20:10:55 · 438 阅读 · 0 评论 -
codeforces100917dir -C
codeforces100917dir -C 题目链接:http://codeforces.com/gym/100917/problem/D题目描述:D. dir -Ctime limit per test1 secondmemory limit per test256 megabytesinputstandard input原创 2016-10-01 21:10:50 · 564 阅读 · 0 评论 -
UVALive6859 Points +凸包
UVALive6859 Points +凸包 题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4871题面描述:题目大意:二维平面上,给定n个点题目分析:代码实现:#inclu原创 2016-10-18 21:25:50 · 399 阅读 · 0 评论 -
2016弱校联盟十一专场10.5 F. Fibonacci of Fibonacci
2016弱校联盟十一专场10.5 F. Fibonacci of Fibonacci 题目链接:https://acm.bnu.edu.cn/v3/problem_show.php?pid=52322题面描述:题面描述:Find FFn mod 20160519.题目分析:由于斐波那契数对M求模运算一定会产生循环节,而这个第一层循环节原创 2016-10-06 15:55:51 · 506 阅读 · 0 评论 -
poj 3735 Training little cats 构造矩阵+稀疏矩阵加速连乘+矩阵快速幂
poj 3735 Training little cats 构造矩阵+稀疏矩阵加速连乘 题目链接:http://poj.org/problem?id=3735题面描述:Training little catsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13366原创 2016-10-07 19:04:30 · 689 阅读 · 0 评论 -
2016ACM/ICPC亚洲区沈阳站1003题 Recursive sequence +构造矩阵+矩阵连乘
2016ACM/ICPC亚洲区沈阳站1003题 Recursive sequence +构造矩阵+矩阵连乘题目链接:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1003&cid=733题面描述:Recursive sequenceTime Limit: 2000/1000 MS (Java/Other原创 2016-10-30 16:13:47 · 758 阅读 · 0 评论 -
hdu5833 Zhu and 772002 (高斯消元的简单应用)
hdu5833 Zhu and 772002 (高斯消元的简单应用):http://acm.hdu.edu.cn/showproblem.php?pid=5833题面描述:Zhu and 772002Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total原创 2016-08-15 12:00:27 · 669 阅读 · 0 评论 -
nefu503矩阵求解+十进制高斯消元
nefu503矩阵求解+高斯消元:http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=503题目描述:矩阵求解Problem:503Time Limit:1000msMemory Limit:65536KDesc原创 2016-10-24 19:22:58 · 471 阅读 · 0 评论 -
POJ 2965 The Pilots Brothers' refrigerator 高斯消元
POJ 2965 The Pilots Brothers' refrigerator 高斯消元 题目链接:http://poj.org/problem?id=2965题面描述:The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submis原创 2016-09-12 20:25:30 · 445 阅读 · 0 评论 -
计算几何题目入门-8月6号讲解
计算几何入门题目1. nefu 919 最最难的题:http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=919题面描述:最最难的题Problem:919Time Limit:1000msMemory Limit:65536K原创 2016-08-11 19:59:07 · 705 阅读 · 0 评论 -
hdu5317 RGCDQ (素数筛+递推方程)
hdu5317 RGCDQ (素数筛+递推方程):http://acm.split.hdu.edu.cn/showproblem.php?pid=5317题面描述:RGCDQTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission原创 2016-08-24 16:40:58 · 594 阅读 · 0 评论 -
2016 Multi-University Training Contest 8-1006 physics
2016 Multi-University Training Contest 8-1006 physics:http://acm.hdu.edu.cn/showproblem.php?pid=5826题目描述:physicsTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Jav原创 2016-08-11 20:22:44 · 454 阅读 · 0 评论 -
URAL2015 Zhenya moves from the dormitory (暴力)
URAL2015 Zhenya moves from the dormitory (暴力)题面描述:2015. Zhenya moves from the dormitoryTime limit: 1.0 secondMemory limit: 64 MBAfter moving from his parents’ place Zhenya has be原创 2016-08-13 19:07:31 · 571 阅读 · 0 评论 -
URAL2020 Traffic Jam in Flower Town (模拟)
URAL2020 Traffic Jam in Flower Town (模拟)题面描述:2020. Traffic Jam in Flower TownTime limit: 1.0 secondMemory limit: 64 MBHaving returned from Sun City, Dunno told all his friends th原创 2016-08-13 19:31:13 · 594 阅读 · 0 评论 -
hdu5832 A water problem (大数求余)
hdu5832 A water problem (大数求余):http://acm.hdu.edu.cn/showproblem.php?pid=5832题目描述:合训练的同学们~ A water problemTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65原创 2016-08-15 10:22:02 · 581 阅读 · 0 评论 -
高斯消元训练
EXTENDED LIGHTS OUTTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 6443Accepted: 4229DescriptionIn an extended version of the game Lights Out, is a puzzle with 5原创 2016-09-06 20:33:07 · 435 阅读 · 0 评论 -
poj3597 Polygon Division +动态规划+递推公式+公式转化技巧
poj3597 Polygon Division +动态规划+递推公式+公式转化技巧 题目链接:http://poj.org/problem?id=3597题面描述:Polygon DivisionTime Limit: 2000MS Memory Limit: 131072KTotal Submissions: 1335 Accep原创 2016-10-10 21:43:33 · 833 阅读 · 0 评论 -
poj 1753 Flip Game 高斯消元+枚举
poj 1753 Flip Game 高斯消元+枚举 题目链接:http://poj.org/problem?id=1753题目描述:Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 40652 Accepted: 17652D原创 2016-09-11 21:05:59 · 787 阅读 · 0 评论 -
欧拉函数和费马小定理(基础题题解)
poj 2407 Relatives#include #include using namespace std;long long phi(long long n){ long long res=n; for(long long i=2;i*i<=n;i++) {///任何一个合数都至少有一个不超过根号n的素因子,复杂度为根号n if(n%原创 2017-03-14 20:40:39 · 1024 阅读 · 0 评论 -
构造矩阵+矩阵连乘+fibonacci
hdu1021 链接:点击打开链接题目解析:找规律;小乔出嫁了—周期;循环节。对4求模余2即可代码实现:#include #include using namespace std;int main(){ /*int a[100]; a[0]=7; a[1]=11; for(int i=2;i<=30;i++) { a[原创 2017-04-19 19:28:15 · 567 阅读 · 0 评论 -
ZOJ 3822 Domination (概率期望)
ZOJ 3822 Domination(概率期望):http://acm.hust.edu.cn/vjudge/contest/view.action?cid=115193#problem/E 传送门:nefu题面描述:Time Limit:8000MS Memory Limit:131072KB 64bit IO Format:%lld & %lluSubmi原创 2016-05-05 13:23:45 · 380 阅读 · 0 评论 -
ACdream 1113 The Arrow (概率DP)
ACdream 1113 The Arrow (概率DP):http://acm.hust.edu.cn/vjudge/contest/view.action?cid=114332#problem/E 传送门:nefu题面:Time Limit:1000MS Memory Limit:64000KB 64bit IO Format:%lld & %lluSubm原创 2016-04-30 16:15:41 · 521 阅读 · 0 评论 -
POJ 3744 Scout YYF I (矩阵相乘+概率DP)
POJ 3744 Scout YYF I (矩阵相乘+概率DP):http://poj.org/problem?id=3744题面:Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7254 Accepted: 2118DescriptionYY原创 2016-04-30 17:10:42 · 545 阅读 · 0 评论 -
HDU Walk (概率DP)
HDU Walk (概率DP):http://acm.hdu.edu.cn/showproblem.php?pid=5001题面描述:Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 996 Accepted Sub原创 2016-04-30 11:28:59 · 571 阅读 · 0 评论 -
POJ 3071 Football (概率DP)
POJ 3071 Football (概率DP):http://poj.org/problem?id=3071题面:Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4389 Accepted: 2239DescriptionConsider原创 2016-04-30 14:42:03 · 456 阅读 · 0 评论 -
搜索_复习
太久没有做过搜索相关的题目,基本的代码实现都要忘记了,作为复习吧,分别用栈来模拟深搜,队列来模拟广搜,借助于递归(系统栈)来模拟搜索三种方法来求解问题。作为一个ACMer,一题多解释最基本的素质!题目链接:http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=465题目代码实现:#include #原创 2017-03-23 21:01:00 · 471 阅读 · 2 评论 -
ACMer永远不退役—20170725网络赛题解
1. Add More Zero题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6033签到题,公式code:#include #include using namespace std;const double ppi=log10(2);int main(){ int m; int t=1;原创 2017-07-27 09:58:16 · 430 阅读 · 1 评论 -
poj1321+poj2251
poj1321代码实现(dfs):#include <iostream>#include <string.h>using namespace std;int n,k;char str[10][10];int flag[10];int sum;void dfs(int i){ if(i>n) return; int ...原创 2018-03-04 22:18:56 · 273 阅读 · 0 评论 -
分支定界算法
1.题目用分支定界算法求以下问题:某公司于乙城市的销售点急需一批成品,该公司成品生产基地在甲城市。甲城市与乙城市之间共有 n 座城市,互相以公路连通。甲城市、乙城市以及其它各城市之间的公路连通情况及每段公路的长度由矩阵M1 给出。每段公路均由地方政府收取不同额度的养路费等费用,具体数额由矩阵M2 给出。请给出在需付养路费总额不超过 1500 的情况下,该公司货车运送其产品从甲城...原创 2019-01-18 21:37:16 · 4604 阅读 · 1 评论 -
HDU 5245 Joyful (概率期望)
HDU 5245 Joyful (概率) :http://acm.hdu.edu.cn/showproblem.php?pid=5245 题面描述:Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 877 Accepted原创 2016-05-05 10:40:37 · 883 阅读 · 0 评论 -
HDU 3853 LOOPS (概率DP)
HDU 3853 LOOPS (概率DP)http://acm.hdu.edu.cn/showproblem.php?pid=3853题面:LOOPSTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 4567原创 2016-05-07 10:50:37 · 853 阅读 · 0 评论 -
HDU 5159 Card (概率DP)
HDU 5159 Card (概率DP):http://acm.hdu.edu.cn/showproblem.php?pid=5159 题面描述:CardTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 802原创 2016-05-07 11:36:05 · 890 阅读 · 0 评论 -
皇后问题 搜索
代码实现:#include #include #include #include using namespace std;const int maxn=100;int q[maxn];void myqcqueen(int n){ memset(q,0,sizeof(q)); for(int i=1;i<=n;i++) { q[i]=原创 2017-05-03 16:21:29 · 300 阅读 · 0 评论 -
约瑟夫环Josephu
代码实现:#include #include #include using namespace std;void qdjsph(int *p,int n,int m,int k){ int *b; b=(int *)malloc(n*sizeof(int)); for(int i=0;i<n;i++) { b[i]=i+1;原创 2017-05-03 17:05:52 · 426 阅读 · 0 评论 -
fibonacci扩展+矩阵连乘
dhu1757 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1757题目分析:标准的构造矩阵矩阵连乘问题代码实现:#include #include using namespace std;const long long maxn=10;long long mod;long long data[maxn];long lo原创 2017-04-23 09:21:00 · 301 阅读 · 0 评论 -
C++中map的简单使用
话不多说,直接上代码,Y宝宝手把手教的我很开心呢!#include #include #include #include #include using namespace std;int main(){ mapmp; map :: iterator it; int n; string str; while(cin>>n) {原创 2017-05-16 11:01:31 · 363 阅读 · 0 评论