- 博客(18)
- 资源 (6)
- 收藏
- 关注
原创 Good Bye 2014(codeforces)
这次倒序写题解。D. New Year Santa NetworkNew Year is coming in Tree World! In this world, as the name implies, there aren cities connected by n - 1 roads, and for any two distinct citi
2014-12-31 11:09:01 556
原创 后缀自动机poj1509
今天终于知道什么是后缀自动机了,知道他长啥样了,知道他的几个性质了,但是构造的过程还没太明白,对于用节点维护某些东西肯定还不行,先敲一道水题,算整理一下模板poj1509有最小表示法的算法,这里中后缀自动机求解。思路:把串重复一边加到后面,然后构造后缀自动机,然后从根遍历字符串长度,得到位置#include#include#include#include#include#in
2014-12-30 16:26:14 927 1
原创 Codeforces Round #280 (Div. 2)E good
E. Vanya and Fieldtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya decided to walk in the field of size n × n c
2014-12-30 13:49:02 409
原创 Codeforces Round #279 (Div. 2)(good)
隔了好久才补上这场,感觉这场总体还不错C. Hacking Cyphertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarpus participates in
2014-12-28 21:31:42 406
原创 高斯消元(good)hdu4870
官方题解:令(x, y)表示高分为x,低分为y的状态(x >= y),E(x, y)表示从(x, y)到达(1000, ?)的比赛场数期望。容易得到E(x, y) = P * E(x1, y1) + (1 - P) * E(x2, y2) + 1,其中,(x1, y1)表示rating上升后的状态,(x2, y2)表示rating下降后的状态。每50分一个状态,共有210个状态(21*20/2
2014-12-26 19:23:58 505
原创 高斯消元+大数SGU200
Cracking RSATime Limit:250MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescription200. Cracking RSA time limit per test: 0.25 sec. memor
2014-12-25 18:59:34 503
原创 Codeforces Round #283 (Div. 2)D(good)
D. Tennis Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya and Gena love playing table tennis. A single mat
2014-12-23 23:05:47 461
原创 高斯消元 SGU275 To xor or not to xor
To xor or not to xorTime Limit:250MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusDescription275. To xor or not to xor time limit per tes
2014-12-23 16:19:19 594
原创 高斯消元poj2065
跟poj2945基本一模一样,只不过是模的值是题目中给定的#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=100;char s[maxn];int p,MOD;int
2014-12-20 14:35:48 530
原创 高斯消元解同余方程poj2947
Language:DefaultWidget FactoryTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 4689 Accepted: 1595DescriptionThe widget factory produces several
2014-12-20 13:37:56 496
原创 高斯消元(从一个状态到另一个状态)poj1830
Language:Default开关问题Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5967 Accepted: 2265Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的时候,其他的与此
2014-12-19 22:42:18 406
原创 高斯消元异或枚举变元(poj1681)
Language:DefaultPainter's ProblemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4647 Accepted: 2266DescriptionThere is a square wall which is m
2014-12-18 13:41:37 608
原创 高斯消元模板
#include#include#include#include#include#include#include#include#include#include#includeusing namespace std;const int maxn=100;int equ,var;int a[maxn][maxn];int x[maxn];bool free_x[max
2014-12-17 22:25:25 396
转载 高斯消元讲解
高斯消元法(转) 2009-10-02 00:25:38| 分类:ACM模版题 |举报|字号 订阅高斯消元法,是线性代数中的一个算法,可用来求解线性方程组,并可以求出矩阵的秩,以及求出可逆方阵的逆矩阵。高斯消元法的原理是:若用初等行变换将增广矩阵 化为 ,则AX = B与CX = D是同解方程组。所以我们可以用初等行变换把增广矩阵
2014-12-17 20:49:15 753
原创 高斯消元(开关灯问题)poj1222
Online JudgeProblem SetAuthorsOnline ContestsUserWeb BoardHome PageF.A.QsStatistical ChartsProblemsSubmit ProblemOnline StatusProb.ID:RegisterUpdate your infoAu
2014-12-16 23:30:21 847
原创 伸展树hdu4453(good)
Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu
2014-12-09 22:00:11 605
原创 伸展树+二分hdu3436(多校联合)
Online JudgeOnline ExerciseOnline TeachingOnline ContestsExercise AuthorF.A.QHand In HandOnline AcmersForum | DiscussStatistical ChartsProblem ArchiveRealtime Judge Statu
2014-12-04 11:57:33 488
原创 伸展树zoj3765
LightsTime Limit: 8 Seconds Memory Limit: 131072 KB Now you have N lights in a line. Don't worry - the lights don't have color. The only status they have is on and off. And, each ligh
2014-12-02 14:22:09 472
高效awk编程
2018-06-03
hadoop-eclipse-plugin-2.7.2.jar
2016-03-19
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人