风吼迷林-CSDN博客

原创 51nodoj 1240（莫比乌斯函数）

1240 莫比乌斯函数基准时间限制：1 秒空间限制：131072 KB 分值: 0 难度：基础题收藏关注莫比乌斯函数，由德国数学家和天文学家莫比乌斯提出。梅滕斯(Mertens)首先使用μ(n)（miu(n)）作为莫比乌斯函数的记号。（据说，高斯(Gauss)比莫比乌斯早三十年就曾考虑过这个函数）。具体定义如下：如果一个数包含平方因子，那么miu(n) = 0。例如：miu(

2016-09-07 17:00:40 648

原创 51nodoj 1256（逆元再探）

1256 乘法逆元基准时间限制：1 秒空间限制：131072 KB 分值: 0 难度：基础题收藏关注给出2个数M和N(M < N)，且M与N互质，找出一个数K满足0 < K < N且K * M % N = 1，如果有多个满足条件的，输出最小的。 Input 输入2个数M, N中间用空格分隔（1 <= M < N <= 10^9) Output 输出一个数K，满足0 < K <

2016-09-07 15:45:44 550

原创 51nodoj 1384（全排列）

1384 全排列基准时间限制：1 秒空间限制：131072 KB 分值: 0 难度：基础题收藏关注给出一个字符串S（可能又重复的字符），按照字典序从小到大，输出S包括的字符组成的所有排列。例如：S = “1312”，输出为：1123 1132 1213 1231 1312 1321 2113 2131 2311 3112 3121 3211 Input

2016-09-05 21:09:04 437

原创 HDU 1532（网络流之最大流）

Drainage Ditches Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15400 Accepted Submission(s): 7336Problem Description Every time it rains

2016-09-02 21:37:30 277

原创 HDU 1709 （母函数）

The Balance Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7565 Accepted Submission(s): 3138Problem Description Now you are asked to meas

2016-09-01 20:54:54 321

原创 HDU 1171 （母函数）

Big Event in HDU Time Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 1171 Appoint description: Description Nowadays, we all know that Computer Col

2016-08-31 21:15:59 308

原创 HDU 1085 （母函数）

Holding Bin-Laden Captive! Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 1085 Appoint description: Description We all know that Bin-Laden is

2016-08-31 19:30:25 287

原创 HDU 1398 （母函数）

Square Coins Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11363 Accepted Submission(s): 7783Problem Description People in Silverland us

2016-08-30 21:11:24 235

原创 CodeForces 601A （dijkstra算法）

Destroying Roads Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeCodeForces 543B Description In some country there are exactly n cities and m bidir

2016-08-24 12:04:15 584

原创 Lightoj 1282 （数学题）

Description You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits of nk.Input Input starts with an integer T (≤ 1000), denoti

2016-08-24 09:24:58 245

原创 Lightoj 1045 （数学题）

Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu SubmitStatus Description Factorial of an integer is defined by the following functionf(0) = 1 f(n) = f(n - 1) * n, if(n >

2016-08-23 19:54:34 512 1

原创 HDU 1053 Entropy（哈夫曼编码）

Entropy Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5888 Accepted Submission(s): 2471Problem Description An entropy encoder is a data

2016-08-22 20:49:19 378

原创 poj 2352（树状数组）

Stars Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description Astronomers often examine star maps where stars are represented by points on a plane and

2016-08-21 14:10:26 327

原创 Codeforces 29C Mail Stamps（离散化 && map初探）

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatus Description One day Bob got a letter in an envelope. Bob knows that when Berland’s post officers send a let

2016-08-20 11:57:40 392

原创 HDU 1394 Minimum Inversion Number（树状数组）

Minimum Inversion Number Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description The inversion number of a given number sequence a1, a2, …, an is the n

2016-08-19 18:14:57 269

原创 POJ 昂贵的聘礼（dijkstra）

昂贵的聘礼 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 1062 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出

2016-08-19 12:43:43 428

原创 HDU 5636 （floyd算法）

Shortest Path Time Limit:2000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 5636 Description There is a path graph G=(V,E)G=(V,E) with nn vertices. Vertices

2016-08-18 21:19:27 422

原创 zzulioj 1916 （DFS序树状数组）

Time Limit: 1 Sec Memory Limit: 128 MB Submit: 228 Solved: 20SubmitStatusWeb Board Description给一颗树,有n个结点,编号为1到n，1为根节点,有两种操作，1 x y把x结点权值加y,2 x查询x到根节点所有结点的权值和. 每个结点权值初始化为0。Input第一行输入一个整数t，代表有t组测试数据。

2016-08-18 18:16:00 259

原创 HDU 1599 find the mincost route（floyd算法）

find the mincost route Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeHDU 1599 Description 杭州有N个景区，景区之间有一些双向的路来连接，现在8600想找一条旅游路线，这个路线从A点出发并且最后回到A点，

2016-08-18 15:03:25 355

Description Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A blockhouse is a smal

2016-08-18 10:28:58 366

原创 POJ 1961 Period （KMP）

Period Time Limit:3000MS Memory Limit:30000KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 1961 Appoint description: Description For each prefix of a given string S with N characte

2016-08-17 23:58:08 202

原创 zzuli 1919（二分）

Description晴天想把一个包含n个整数的序列a分成连续的若干段，且和最大的一段的值最小，但他有强迫症，分的段数不能超过m段，然后他就不会分了。。。他想问你这个分出来的和最大的一段的和最小值是多少？Input第一行输入一个整数t，代表有t组测试数据。每组数据第一行为两个整数n,m分别代表序列的长度和最多可分的段数。接下来一行包含n个整数表示序列。 0<=n<=50000 1<=m<=

2016-08-17 19:06:09 300

原创 HDU 1498 50 years, 50 colors （二分图）

On Octorber 21st, HDU 50-year-celebration, 50-color balloons floating around the campus, it’s so nice, isn’t it? To celebrate this meaningful day, the ACM team of HDU hold some fuuny games. Especially,

2016-08-17 10:58:24 367

原创 HDU 2063 过山车（二分图）

过山车 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 18738 Accepted Submission(s): 8176Problem Description RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求

2016-08-16 20:09:47 233

原创 POJ 2406 Power Strings（KMP）

Power Strings Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 44033 Accepted: 18369 DescriptionGiven two strings a and b we define a*b to be their concatenation. For example,

2016-08-16 16:40:08 256

原创 POJ 2752 Seek the Name, Seek the Fame（KMP）

Seek the Name, Seek the Fame Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 2752 Appoint description: Description The little cat is so famous,

2016-08-16 14:19:39 213

原创 poj 3461 （看毛片算法初探）

Oulipo Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 3461 Appoint description: Description The French author Georges Perec (1936–1982) once wr

2016-08-16 11:04:34 12320

原创 POJ 2299 Ultra-QuickSort（归并排序 || 树状数组 || 线段树）

Ultra-QuickSort Time Limit:7000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu SubmitStatus Description In this problem, you have to analyze a particular sorting algorithm. The algorith

2016-08-14 20:47:07 472

原创 CodeForces 510C （拓扑排序）

Description Fox Ciel is going to publish a paper on FOCS (Foxes Operated Computer Systems, pronounce: “Fox”). She heard a rumor: the authors list on the paper is always sorted in the lexicographical o

2016-08-14 17:46:02 1111

原创 CodeForces 508C （贪心）

Description Anya loves to watch horror movies. In the best traditions of horror, she will be visited by m ghosts tonight. Anya has lots of candles prepared for the visits, each candle can produce ligh

2016-08-14 14:53:00 390

原创 CodeForces 546D （质因子打表法）

Description Two soldiers are playing a game. At the beginning first of them chooses a positive integer n and gives it to the second soldier. Then the second one tries to make maximum possible number o

2016-08-14 11:18:27 268

原创 Lightoj 1058 （组合数学）

Description There are n distinct points in the plane, given by their integer coordinates. Find the number of parallelograms whose vertices lie on these points. In other words, find the number of 4-ele

2016-08-13 21:53:23 460

原创 UVA 10200 （高精度）

Euler is a well-known matematician, and, among many other things, he discovered that the formula n 2 + n + 41 produces a prime for 0 ≤ n < 40. For n = 40, the formula produces 1681, which is 41 ∗ 41.

2016-08-13 17:26:41 587

原创 zzuli 1912: 小火山的爱情密码（二分 || 尺取）

1912: 小火山的爱情密码Time Limit: 1 Sec Memory Limit: 128 MB Submit: 274 Solved: 79SubmitStatusWeb Board Description小火山获得了一个字符串，然而大火山让小火山从里面截取一段字符串，并且让小火山截取的字符串满足一些字符达到一定数量。小火山觉得很容易，但是他想要知道他至少得截取多长的字符串。

2016-08-13 10:55:20 394

原创 HDU 5773 The All-purpose Zero（LIS）

The All-purpose Zero Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1592 Accepted Submission(s): 763Problem Description ?? gets an sequen

2016-08-12 21:23:08 227

原创 HDU 5748 Bellovin（LIS）

Bellovin Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1045 Accepted Submission(s): 468Problem Description Peter has a sequence a1,a2,

2016-08-12 19:15:40 222

原创 HDU 1513 Palindrome（LCS）

Palindrome Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5171 Accepted Submission(s): 1765Problem Description A palindrome is a symmetri

2016-08-12 17:22:01 256

原创 HDU 1503 Advanced Fruits （LCS）

Advanced Fruits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2957 Accepted Submission(s): 1503 Special JudgeProblem Description The co

2016-08-12 16:55:15 300

原创 HDU 1159 Common Subsequence（LCS）

Common Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 34218 Accepted Submission(s): 15598Problem Description A subsequence of

2016-08-12 14:38:33 278

原创 HDU 1166 敌兵布阵（初学线段树 || 初学树状数组）

敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 77133 Accepted Submission(s): 32510Problem Description C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子D

2016-08-12 11:52:31 486

空空如也

空空如也