- 博客(741)
- 资源 (10)
- 问答 (1)
- 收藏
- 关注
RSS订阅原创 POJ 1845 Sumdiv （数论，约数和）
DescriptionConsider two natural numbers A and B. Let S be the sum of all natural divisors of A^B. Determine S modulo 9901 (the rest of the division of S by 9901).InputThe only line contains the two nat
2017-01-21 14:04:38
442
原创 POJ 1942 Paths on a Grid (组合数学)
Description Imagine you are attending your math lesson at school. Once again, you are bored because your teacher tells things that you already mastered years ago (this time he’s explaining that (a+b)
2017-01-21 13:49:35
385
原创 POJ 1850 Code (组合数学)
Description Transmitting and memorizing information is a task that requires different coding systems for the best use of the available space. A well known system is that one where a number is associa
2017-01-21 13:36:36
501
原创 POJ 3292 Semi-prime H-numbers (筛法统计)
Description This problem is based on an exercise of David Hilbert, who pedagogically suggested that one study the theory of 4n+1 numbers. Here, we do only a bit of that. An H-number is a positi
2017-01-17 19:25:30
289
原创 POJ 2635 The Embarrassed Cryptographer (同余问题)
Description The young and very promising cryptographer Odd Even has implemented the security module of a large system with thousands of users, which is now in use in his company. The cryptographic ke
2017-01-17 14:42:58
433
原创 POJ 3122 Pie （二分）
Description My birthday is coming up and traditionally I’m serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party
2017-01-11 21:25:44
635
原创 hihocoder 1453 Rikka with Tree （简单DP）
描述 众所周知，萌萌哒六花不擅长数学，所以勇太给了她一些数学问题做练习，其中有一道是这样的： 勇太有一棵 n 个节点的以1为根的有根树。现在他可以对这棵树进行若干次操作，每一次操作可以选择树上的一个点然后删掉这个点和它的儿子之间的所有边。 现在勇太想要知道对于每一个 k ∈ [1, n]，最少需要多少次操作才能让图中恰好存在 k 个联通块。 当然，这个问题对于萌萌哒
2016-12-25 21:13:52
530
原创 Python3 + django 支持 MySQL
最近要做一个数据库的课程设计，嗯，没记错的话是三周的时间（17,18,19）下周还有一个很重要的考试，所以一定要赶快完成。
2016-12-22 12:12:20
2263
1
原创 HDU 3394 Railway (点双联通分量+桥)
Problem Description There are some locations in a park, and some of them are connected by roads. The park manger needs to build some railways along the roads, and he would like to arrange tourist rou
2016-12-11 21:35:21
530
原创 POJ 1459 Power Network (最大流)
Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce a
2016-12-11 10:45:39
693
1
原创 POJ 1273:Drainage Ditches (最大流)
Description Every time it rains on Farmer John’s fields, a pond forms over Bessie’s favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to reg
2016-12-11 09:38:27
530
原创 POJ 3469：Dual Core CPU （最大流）
Description As more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW. The rou
2016-12-10 20:33:59
744
原创 计算机组成原理 - 实验报告
第一次实验 手动实验环境十六位机运算器实验第二次实验 通用寄存器实验准双向I/O口实验地址总线组成实验第三次实验 十六位数据总线实验存储器读写实验指令总线运用实验第四次实验 微控制器实验
2016-12-10 10:58:14
16116
原创 HDU 3549 Flow Problem （最大流）
Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.Input The first line of inpu
2016-12-04 18:56:23
522
原创 HDU 3376 Matrix Again （最小费用最大流）
Problem Description Starvae very like play a number game in the n*n Matrix. A positive integer number is put in each area of the Matrix. Every time starvae should to do is that choose a detour w
2016-12-04 14:04:28
853
原创 POJ 2135 Farm Tour （最小费用流）
Description When FJ’s friends visit him on the farm, he likes to show them around. His farm comprises N (1 <= N <= 1000) fields numbered 1..N, the first of which contains his house and the Nth of whi
2016-12-01 20:44:33
826
原创 HDU 1269：迷宫城堡 （Tarjan强连通分量）
Problem Description 为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10000)和M条通道(M<=100000)，每个通道都是单向的，就是说若称某通道连通了A房间和B房间，只说明可以通过这个通道由A房间到达B房间，但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否任意两个房间都是相互连通的，即：对于任意的i和j，至少存在
2016-12-01 09:49:24
557
原创 HDU 3853 LOOPS （概率DP）
Problem Description Akemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl). Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trappe
2016-11-27 14:19:10
307
原创 HDU 4336 Card Collector （容斥原理||概率DP）
Problem Description In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in the famous novel Water Margin,
2016-11-25 12:37:16
692
原创 HDU 4586:Play the Dice (数学)
Problem Description There is a dice with n sides, which are numbered from 1,2,…,n and have the equal possibility to show up when one rolls a dice. Each side has an integer ai on it. Now here is a gam
2016-11-25 10:12:50
501
原创 『数论』扩展欧几里得算法
扩展欧几里德算法是用来在已知a, b求解一组x，y，使它们满足贝祖等式： ax+by = gcd(a, b) =d（解一定存在，根据数论中的相关定理）。扩展欧几里德常用在求解模线性方程及方程组中。欧几里德算法概述欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。
2016-11-24 15:33:48
607
原创 HDU 3555 Bomb （数位DP）
Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the curren
2016-11-19 20:40:52
453
原创 HDU 2476：String painter （区间DP）
String painterProblem Description There are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter
2016-11-19 14:44:42
482
原创 HDU 1796:How many integers can you find（容斥原理）
How many integers can you findTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7456 Accepted Submission(s): 2205Problem Descripti
2016-11-01 21:41:59
537
原创 HDU 4135：Co-prime （容斥原理）
Co-primeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4289 Accepted Submission(s): 1698Problem DescriptionGiven a number N,
2016-11-01 21:35:17
467
原创 POJ 3370:Halloween treats（鸽巢原理）
Halloween treatsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8099 Accepted: 2950 Special JudgeDescriptionEvery year there is the same problem at
2016-10-31 09:47:49
394
原创 POJ 2356：Find a multiple （鸽巢原理）
Find a multipleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7743 Accepted: 3379 Special JudgeDescriptionThe input contains N natural (i.e. positi
2016-10-31 09:32:37
427
原创 HDU 4372：Count the Buildings （Stirling数）
Count the BuildingsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1300 Accepted Submission(s): 422Problem DescriptionThere a
2016-10-31 09:22:47
441
原创 HDU 3037：Saving Beans（Lucas定理）
Saving BeansTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4540 Accepted Submission(s): 1788Problem DescriptionAlthough wint
2016-10-31 09:14:02
488
原创 hihocoder 1080 : 更为复杂的买卖房屋姿势 （线段树）
描述小Hi和小Ho都是游戏迷，“模拟都市”是他们非常喜欢的一个游戏，在这个游戏里面他们可以化身上帝模式，买卖房产。在这个游戏里，会不断的发生如下两种事件：一种是房屋自发的涨价或者降价，而另一种是政府有关部门针对房价的硬性调控。房价的变化自然影响到小Hi和小Ho的决策，所以他们希望能够知道任意时刻某个街道中所有房屋的房价总和是多少——但是很不幸的，游戏本身并不提供这样的计算。不过这难不倒小H
2016-10-16 14:03:40
680
原创 HDU 1576：A/B （乘法逆元）
A/BTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4603 Accepted Submission(s): 3590Problem Description要求(A/B)%9973，但由于A很大，我们
2016-10-08 18:32:15
575
原创 Python - 统计字母个数
题目内容：定义函数countchar()统计字符串中所有出现的字母的个数（允许输入大写字符，并且计数时不区分大小写）。形如：def countchar(str): ... ... return a listif __name__ == "__main__": str = raw_input() ... ...
2016-10-04 21:37:22
18367
2
原创 HDU 5907：Find
Find QTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 263 Accepted Submission(s): 148Problem DescriptionByteasar is addicte
2016-10-02 12:41:57
723
原创 Python - 寻找第n个默尼森数
题目内容：找第n个默尼森数。P是素数且M也是素数，并且满足等式M=2**P-1，则称M为默尼森数。例如，P=5，M=2**P-1=31，5和31都是素数，因此31是默尼森数。输入格式:用input()函数输入，注意如果Python 3中此函数的返回类型。输出格式：int类型输入样例：4
2016-10-01 14:53:03
3039
原创 HDU 2841：Visible Trees （容斥原理）
Visible TreesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2796 Accepted Submission(s): 1222Problem DescriptionThere are ma
2016-09-29 21:01:02
534
原创 前100个卡特兰数
留作备用string catalan[]={ "1", "2", "5", "14", "42", "132", "429", "1430", "4862", "16796", "58786", "208012", "742900", "2674440", "9694845
2016-09-28 20:38:52
4186
原创 HDU 5904：LCIS（LCIS）
LCISTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 440 Accepted Submission(s): 201Problem DescriptionAlex has two sequences
2016-09-25 15:45:05
625
原创 HDU 5902：GCD is Funny （GCD）
GCD is FunnyTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 306 Accepted Submission(s): 65Problem DescriptionAlex has invente
2016-09-25 14:50:36
626
Spig 网站浮动小人 (javascript)
2018-06-17
OICQ 聊天室（Java 课程设计）
2018-06-17
Little Giant （C++ 课程设计）
2018-06-17
Flow blog（数据库课程设计）
2018-06-17
Codeforces Edu Hacking
2018-06-17
HDU 自动 AC 机（Python）
2018-06-17
黑白棋 （Reversi)
2016-10-30
黑客帝国C语言
2016-01-07
VC绘图库Easyx
2016-01-05
C语言一个小小的问题，望解答
2016-01-08
TA创建的收藏夹 TA关注的收藏夹
TA关注的人