- 博客(15)
- 资源 (10)
- 收藏
- 关注
RSS订阅原创 [ACM] ZOJ 3816 Generalized Palindromic Number （DFS，暴力枚举）
Generalized Palindromic Number Time Limit: 2 Seconds Memory Limit: 65536 KB A number that will be the same when it is written forwards or backwards is known as a palindromic number. For e
2014-09-28 11:18:03
1812
原创 [ACM] poj 1236 Network of Schools (有向强连通分量）
Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11407 Accepted: 4539 Description A number of schools are connected to a computer netwo
2014-09-25 17:30:16
1855
原创 [ACM] POJ 2186 Popular Cows (强连通分量，Kosaraju算法知识整理）
首先是一些知识整理：来源于网络： 以下转载于：http://blog.sina.com.cn/s/blog_4dff87120100r58c.html Kosaraju算法是求解有向图强连通分量（strong connectedcomponent）的三个著名算法之一，能在线性时间求解出一个图的强分量。 什么是强连通分量？在这之前先定义一个强连通性（strong connectivi
2014-09-25 16:10:47
2744
原创 [ACM] POJ 1273 Drainage Ditches （最大流）
Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 56869 Accepted: 21862 Description Every time it rains on Farmer John's fields, a pond fo
2014-09-25 08:57:10
2385
原创 [ACM] hdu 3549 Flow Problem （最大流模板题）
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.
2014-09-24 17:12:56
3059
原创 [ACM] hdu 5038 Grade
Grade Problem Description Ted is a employee of Always Cook Mushroom (ACM). His boss Matt gives him a pack of mushrooms and ask him to grade each mushroom according to its weight. Suppose the
2014-09-22 09:03:02
2444
原创 [ACM] POJ 3233 Matrix Power Series （求矩阵A+A^2+A^3...+A^k，二分求和或者矩阵转化）
Matrix Power Series Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 15417 Accepted: 6602 Description Given a n × n matrix A and a positive integer k,
2014-09-18 12:19:05
3659
2
原创 [ACM] POJ 3070 Fibonacci （矩阵幂运算）
Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9517 Accepted: 6767 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = F
2014-09-18 09:45:21
2272
原创 [ACM] hdu 5001 Walk （概率DP）
Walk Problem Description I used to think I could be anything, but now I know that I couldn't do anything. So I started traveling. The nation looks like a connected bidirectional graph, and
2014-09-17 17:23:32
1791
原创 [ACM] hdu 4403 A very hard Aoshu problem (DFS暴搜数字）
A very hard Aoshu problem Problem Description Aoshu is very popular among primary school students. It is mathematics, but much harder than ordinary mathematics for primary school students. T
2014-09-11 14:53:27
2607
1
原创 [ACM] zoj 3809 The Himalayas (2014 ACMICPC Regional 牡丹江站网络赛 A题）
he Himalayas Time Limit: 2 Seconds Memory Limit: 65536 KB As an artist, Bob usually need to travel around the world. He made a lot of sketch of scenery on his journey. A famous spot he ha
2014-09-09 09:17:58
2606
原创 [ACM] zoj 3818 Pretty Poem (2014 ACMICPC Regional 牡丹江站网络赛 J题）
Pretty Poem Time Limit: 2 Seconds Memory Limit: 65536 KB Poetry is a form of literature that uses aesthetic and rhythmic qualities of language. There are many famous poets in the contempo
2014-09-09 09:14:34
3078
原创 [ACM] hdu 3037 Saving Beans (Lucas定理，组合数取模）
Saving Beans Problem Description Although winter is far away, squirrels have to work day and night to save beans. They need plenty of food to get through those long cold days. After some tim
2014-09-04 20:32:43
3286
转载 ACM中的java使用
ACM中java的使用 import java.io.*; import java.math.*; import java.util.*; import java.text.*; class MyMath { public static double add(double d1, double d2) { // 进行加法运算 BigDec
2014-09-03 20:03:34
2399
原创 [BestCoder Round #7] hdu 4985 Little Pony and Permutation (找循环节）
Little Pony and Permutation Problem Description As a unicorn, the ability of using magic is the distinguishing feature among other kind of pony. Being familiar with composition and dec
2014-09-01 09:21:01
1759
listView异步加载（多线程和AsyncTask)以及缓存的使用
2016-04-13
AsyncTask加载网络图片并模拟进度条更新
2016-04-13
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人