搜索资源列表
贪心算法--会场安排
- ACM竞赛题目 公司面试题目 链表 循环 相交
p
- 这个资料是2009年acm/icpc世界总决赛的比赛试题，可以通过试题了解到acm比赛的试题动向-This information is in 2009 acm/icpc final game of the world' s total questions, questions that can match acm test trends
1
- 北大ACM第1045题Bode Plot答案，有兴趣的自己上北大ACM的题库去-ACM North title Bode Plot No. 1045 answers, there is interest on their own ACM sharPKUngfu go take a look at the questions
PolyAdd
- 给定两个多项式P(x)与Q(x)，通过链表实现它们的加法。ACM程序设计练习题。-Given two polynomials P (x) and Q (x), through the realization of their additive list. ACM Programming Exercises.
wave-convert
- 使用acm做的gsm-pcm格式转换库程序，在VC6下编译，生成waveConvert.d-Acm done using the gsm-pcm format conversion library procedures under VC6 compiler to generate waveConvert.dll
1815
- acm pku 1815 求最小点割集 acm pku 1815 求最小点割集-acm pku 1815 求最小点割集 acm pku 1815 求最小点割集 acm pku 1815 求最小点割集
IslandsandBridges
- Shanghai 2004 ACM ICPC world final Islands and Bridges 状态DP+汉密尔顿回路-Shanghai 2004 ACM ICPC world final Islands and Bridges State DP+ Hamilton circuit
750
- ACM線上題庫第750題"八后問題"的解法。http://acm.uva.es/p/v7/750.html-The solution to#750 in ACM online problem set. http://acm.uva.es/p/v7/750.html
2262GoldbacsConjecture
- POJ2262解答源码 有兴趣做ACM题目的可以参考下。-POJ2262
pc2-9.1.6-2136
- pc2的测评系统，用于ACM竞赛，希望大家都能下载！-pc2 in the evaluation system for the ACM competition
750
- C ALGORITHM 750, COLLECTED ALGORITHMS FROM ACM. C THIS WORK PUBLISHED IN TRANSACTIONS ON MATHEMATICAL SOFTWARE, C VOL. 21, NO. 4, December, 1995, P. 410--415.-C ALGORITHM 750, COLLECTED ALGORITHMS FROM ACM. C THIS WORK PUBLISHED IN TR
HDUACM
- 杭州电子科技大学ACM的PPT，适合刚接触ACM的学生学习。是参加浙江大学计算机学院研究生复试机试的重要参考资料。-ACM, Hangzhou University of Electronic Science and Technology of the PPT, suitable for students new to ACM' s. Participating in graduate student of Computer Science, Zhejiang University, th
fast-projective-clustering
- 一种子空间聚类的算法，此算法属于子空间聚类算法-a monte caro algorithm for fast projective clustering，C. M. Procopiuc, M. Jones, P. K. Agarwal and T. M. Murali， Proceedings of the 2002 ACM SIGMOD international conference on Management of data
1162-Building-with-Blocks
- 求和由于最后一扇门肯定在正方形的边界举，对每一个中点都求出要从给定点P到达此中点的所需要的最少的门的个数。-hello word wellcom to our school Delphi/java,CppBuilder visual c++Gone Fishing (1042) - ACM/ICPC Regional Contest East Central North America1999Descr iption Archeologists from the Ant
hdu1297
- 杭电acm1297 #include<stdio.h> #include<string.h> #define m 1002 int f[m][70]={{1,1},{1,1},{1,2},{1,4}} void add(int p[],int q[],int sum[]) { int i,len if(p[0]<q[0])len=q[0] else len=p[0] for(i=1 i<=len i++)
1002_A-P-B-Problem-II
- hdu acm 1002 1002_A + B Problem II 杭州电子科技大学 acm 1002 题目 ac代码-hdu acm 1002 1002_A+ B Problem II
1002-A-P-B-Problem-II
- acm1002 答案-acm answer...............
acm
- A message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November 16, 1974. The message consisted of 1679 bits and was meant to be translated to a rectangular pict