Location:
Search - poj
Search list
Description:
Platform: |
Size: 1242 |
Author: 1016867741 |
Hits:
Description: 该程序完成在两个字符串中寻找最长公共子串，如果这样的字符串有多个，则将它们全部找出来，它在最坏情况下的复杂度为O(m*n).-the procedure is completed in two for the longest string of public substrings, if such a number of strings, will they all find out in the worst of the complexity of O (n* m).
Platform: |
Size: 3072 |
Author: 唐海浪 |
Hits:
Description: 程序实现了大素数的判断和如果不是素数，则其可分解的最小的素数-program of large prime numbers and if the judgment is not prime, then decomposition of the smallest prime number
Platform: |
Size: 5120 |
Author: car |
Hits:
Description: 解决时钟问题，acm竞赛题
A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you cannot use any other kind. There are infinite number of coins of each kind, each marked with a number d ( 0 <= 1000 ), meaning that this coin will make the minute hand move d times clockwise the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15.
Now you are given the initial time s ( 0 <= s <= 59 ) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.-clock to solve the problem, acm contest A weird clock marked from 0 to 59 has only a minute hand. It won t move until a special coin is thrown into its box. There are different kinds of coins as your options. However once you make your choice, you can not use any other kind. There are infinite number of coins of each kind, each marked with a number d (0 lt; = 1000), meaning that this coin will make the minute hand move clockwise d times the current time. For example, if the current time is 45, and d = 2. Then the minute hand will move clockwise 90 minutes and will be pointing to 15. Now you are given the initial time s (0 lt; s = lt; = 59) and the coin s type d. Write a program to find the minimum number of d-coins needed to turn the minute hand back to 0.
Platform: |
Size: 1024 |
Author: 王冠 |
Hits:
Description: 简易电子地图hinik hijijdfo jpopod jfpojpaj pojpjo kjopkapkfd -simple electronic map hinik hijijdfo jpopod jfpojpaj POJ pjo kjopkapkfd
Platform: |
Size: 17408 |
Author: 方圆 |
Hits:
Description: 软件破解入门教程和解密手册
程序简单易学，实用性也很强-crack entry software tutorials and decryption procedures manual is easy, practical, also strong
Platform: |
Size: 1386496 |
Author: danfengfeng |
Hits:
Description: 菜鸟破解从头学（全教程），手把手教你软件的破解-as they resolve to learn (all Directory), the software Shoubashoujiao you crack
Platform: |
Size: 48128 |
Author: zhao jie |
Hits:
Description: poj 1149 pigs 最大流的例题 还要写什么-poj 1,149 pigs maximum flow of excellence he wrote.
Platform: |
Size: 1024 |
Author: 王一然 |
Hits:
Description: poj2411 基本0ms的算法，多交流-poj2411 basic algorithm 0ms, more exchanges
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 用vc自己写的在poj上的题目，10多个的源代码，都是自己写的
Platform: |
Size: 7168 |
Author: 杨一一 |
Hits:
Description: 高效求一超大数组中第i个元素到第j个元素间第k小的元素.-One super-efficient for the first array element i to the first j elements of the first k elements small.
Platform: |
Size: 1024 |
Author: 苏钿煌 |
Hits:
Description: 问题：已经平面上的若干点，求包围这些点的最小包围长
度
算法：经典的凸包算法，注意求解时对最外圈做处理。-Question: has a number of points on the plane, and surrounded by the smallest of these points, surrounded by the length of algorithm: the classic convex hull algorithm, when attention to solving the most to do deal with the outer ring.
Platform: |
Size: 1024 |
Author: 苏钿煌 |
Hits:
Description: 这是pku，就是poj上的1517，大家可以-This is pku, is POJ on 1517, we can
Platform: |
Size: 157696 |
Author: 林东 |
Hits:
Description: http://www.cppblog.com/aclayton
流牛木马原创解题报告集４-Trojan cattle flow http://www.cppblog.com/aclayton original problem-solving report set 4
Platform: |
Size: 2048 |
Author: 刘雅轩 |
Hits:
Description: poj1088原代码, 这是最新的版本, 经过我们dhuACM团队合作而编写的!
-poj1088 the original code, which is the latest version, after we dhuACM team prepared!
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 北京大学编程站http://poj.grids.cn/
（ACM练习网站）
1321、2927、3225题源文件
http://poj.grids.cn/problem?id=1321
http://poj.grids.cn/problem?id=2927
http://poj.grids.cn/problem?id=3225-Peking University programming station http://poj.grids.cn/ (ACM practice site) 1321,2927,3225 title source file http://poj.grids.cn/problem?id=1321http://poj.grids. cn/problem? id = 2927http:// poj.grids.cn/problem? id = 3225
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 如果你安装的是Windows XP操作系统，不慎忘记了系统登录用户的密码，你可以NET命令来解决问题-If you install the Windows XP operating system, the system inadvertently forgotten user login password, you can order to solve the problem NET
Platform: |
Size: 1024 |
Author: qq |
Hits:
Description: poj1008代码，尽量压缩的长度，与大家交流一下。-poj1008 code, as far as possible the length of compression, with the U.S. exchange.
Platform: |
Size: 1024 |
Author: tony180 |
Hits:
Description: POJ1151 Atlantis的源代码，非常经典线段树应用的题目，求面积。-POJ1151 Atlantis source code, is a classic application of the subject tree line, and area.
Platform: |
Size: 1024 |
Author: zuobaojing |
Hits:
Description: 北大acm平台正版源代码acm2749
-North acm genuine platform source code acm2749
Platform: |
Size: 891904 |
Author: 王鄍 |
Hits:
«
1
2
...
5
6
7
8
9
1011
12
13
14
15
...
30
»