Welcome![Sign In][Sign Up]
Location:
Search - acm poj

Search list

[Windows DevelopPOJ

Description: 北京大学ACM竞赛试题集锦,希望对你的编程能力因为它而更上一层楼,它的算法设计方面很有帮助对你-Beijing University ACM Collection questions, and I hope to your programming capability because it is being, it's helpful in the design of algorithms to you
Platform: | Size: 435942 | Author: 陈万通 | Hits:

[Mathimatics-Numerical algorithmsPOJ

Description: 北京大学ACM在线评测系统 OnlineJudge
Platform: | Size: 13457285 | Author: 崔四 | Hits:

[Mathimatics-Numerical algorithmsPOJcode

Description: ACM poj 题目以及重要经典题目的分析与解答,配所有源代码.
Platform: | Size: 14349 | Author: 杨德杰 | Hits:

[Windows DevelopPOJ

Description: 北京大学ACM竞赛试题集锦,希望对你的编程能力因为它而更上一层楼,它的算法设计方面很有帮助对你-Beijing University ACM Collection questions, and I hope to your programming capability because it is being, it's helpful in the design of algorithms to you
Platform: | Size: 435200 | Author: 陈万通 | Hits:

[Data structsaccepted1

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:

[Mathimatics-Numerical algorithmsPOJ

Description: 北京大学ACM在线评测系统 OnlineJudge-ACM Online Evaluation System, Peking University OnlineJudge
Platform: | Size: 13505536 | Author: 崔四 | Hits:

[Data structsACM_Code

Description: 包括计算几何、特殊数据结构、组合数学等知识点的代码。每个代码对应一道ACM试题,根据代码头说明找到题目具体来源,比如POJ 2050。来自NUAA ACM校队,ACM比赛必备!-Include computational geometry, special data structure, combinatorial mathematics and other knowledge-point code. Each code corresponds to ACM questions together, in accordance with the code first note to find the topic specific sources, such as POJ 2050. NUAA ACM from the school team, ACM must match!
Platform: | Size: 154624 | Author: yesrush | Hits:

[JSP/Java2749

Description: 北大acm平台正版源代码acm2749 -North acm genuine platform source code acm2749
Platform: | Size: 891904 | Author: 王鄍 | Hits:

[Mathimatics-Numerical algorithmsPOJcode

Description: ACM poj 题目以及重要经典题目的分析与解答,配所有源代码.-ACM poj important topic, as well as the classic analysis of the topic with the answer, with all the source code.
Platform: | Size: 14336 | Author: 杨德杰 | Hits:

[Mathimatics-Numerical algorithmspoj_acm_solutions

Description: 北大在线ACM系统中的经典解题方法思路还有源码。其中是按ACM中的题号作为标题的。-ACM System sharPKUngfu online classic problem-solving methods also source ideas. Which is based on ACM
Platform: | Size: 2553856 | Author: jackie | Hits:

[Mathimatics-Numerical algorithmspoj2007

Description: poj题目,北京大学acm队选拔用题,经典好题-POJ topic acm Peking University team selection by title, classic good title
Platform: | Size: 513024 | Author: | Hits:

[Mathimatics-Numerical algorithmsACM

Description: 北大ACM题目例程 详细的解答过程 程序实现 算法分析-ACM North Title routine procedures detailed answers to the process of realization of Algorithm Analysis
Platform: | Size: 456704 | Author: hugo | Hits:

[Mathimatics-Numerical algorithmsPOJ2115

Description: ACM POJ 2115 扩展欧几里得算法解题报告-ACM POJ 2115 Euclid algorithm for solving the report of the expansion
Platform: | Size: 7168 | Author: zhaodongdong | Hits:

[Windows DevelopPOJ

Description: ACM/ICPC poj 解题报告 100多篇 很强大-ACM/ICPC poj problem-solving more than 100 articles reporting very strong
Platform: | Size: 5961728 | Author: flabby | Hits:

[Data structsPOJ1000-1010

Description: ACM 相关的,POJ 1000-1010的全部解答,程序十分完备 部分还有文字说明-ACM-related, POJ 1000-1010 all the answers, procedures, and there is still a very complete text description
Platform: | Size: 3641344 | Author: 平凡 | Hits:

[OtherACMPOJ

Description: ACM POJ 2247.cpp 2051.cpp 1656.c 1326.cpp 1016.cpp保证正确-ACM POJ 2247.cpp 2051.cpp 1656.c 1326.cpp 1016.cpp
Platform: | Size: 2048 | Author: 刘亚 | Hits:

[Data structs123456ACM

Description: ACM POJ上的源码~~1000-3217一共719道题,这是网站http://acm.pku.edu.cn/JudgeOnline/,非常好的C++源码-ACM POJ on the source code ~ ~ 1000-3217 a total of 719 questions, this is the site http://acm.pku.edu.cn/JudgeOnline/, a very good C++ source code ~ ~
Platform: | Size: 456704 | Author: lqtsing | Hits:

[OtherACM-solutions

Description: 北大 acm poj题解 对于学习数据结构练习编程很有用-North acm poj problem solution for learning programming exercises useful data structures
Platform: | Size: 1684480 | Author: zodiac | Hits:

[source in ebookACM report

Description: POJ上的部分题解 详细有PPT 每道题有思路+复杂度分析(Solution for problems on POJ)
Platform: | Size: 5851136 | Author: speeddail | Hits:

[Mathimatics-Numerical algorithmsACM

Description: poj两道题的c++实现。已经测试过可以通过oj(The c++ implementation of the POJ two problem. It has been tested through OJ)
Platform: | Size: 1024 | Author: dagg | Hits:
« 12 3 4 5 6 7 »

CodeBus www.codebus.net