搜索资源列表
ProgramowanieObiektowe4-6
- Zadaniem tego moduł u jest zapoznanie studentów z paradygmatem programowania obiektowego. Omówione zostaną cechy programowania obiektowego oraz jego fundamentalne poję cia: klasy i obiektu file2-Zadaniem tego moduł u jest zapoznani
ProgramowanieObiektowe7-9
- Zadaniem tego moduł u jest zapoznanie studentów z paradygmatem programowania obiektowego. Omówione zostaną cechy programowania obiektowego oraz jego fundamentalne poję cia: klasy i obiektu chapter3-Zadaniem tego moduł u jest zapozna
Algorithms
- 压缩包中包括几个常用算法对应的POJ练习题的实现，包括，无向图的欧拉回路，点的割集，TRIE树，最优比率生成树，最小树形图-Compressed package includes several commonly used algorithms POJ corresponds to the realization of exercises, including, undirected graph of the Euler circuit, point cut sets, TRIE tree, t
POJ1169-1179
- ACM POJ 1169-1179的全部代码 部分还有文字说明 十分详尽-ACM POJ 1169-1179 all the code and there is still a very detailed text descr iption
POJ2664-2681
- POJ 2664-2681的题目 中间有些没有 共10个题目的详尽解答-POJ 2664-2681 the subject of the middle of a total of 10 subjects who do not have a detailed answer
main
- Tehran 2003 Preliminary poj 2396 Budget
main
- acm regional kaohsiung 2006 Perfect Service poj 3398
ACMPOJ
- ACM POJ题目 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.c-ACM POJ 2159.cpp 1918.cpp 1887.cpp 1835.cpp 1458.c 1258.c 1125.cpp
poj3601
- 北京大学online judge题号3601，解答及其实验报告-, No. 3601, Peking University online judge questions to answer and the experimental report
code
- 中山大学acm online sicily，一些经典的题目-problems of sysu sicily
pojACM
- poj ACM将近400道题的源码，有些题有多个源码供参考- the source of poj ACM question nearly 400, some questions have more than one source for reference
acm_code_ComputingGeometry
- acm计算几何模板，涵盖了包括hdu,pku,zju,fzu等评测平台的逾90个通过的计算几何代码。 适合想要学习计算几何的acmer.-acm computational geometry templates, covering hdu, pku, zju, fzu such as evaluation platforms, more than 90 adopted by the computational geometry code. Want to learn computatio
ChonSu
- 北大poj2835 ChonSu 自己编的，因为不是刷POJ而是单纯的作业，所以只测试过作业中要求的数据，并没有极限测试禁宫参考-ChonSu
acm_poj
- 部分POJ_ACM题目的源代码，是一部分题目的解答，可以帮您熟悉POJ环境，而且里面的题目偏基础-Some POJ_ACM subject source code, is a part of the subject answers that can help you become familiar with POJ environment, but also the basis of which the subject of bias
2815
- This the answer to poj 2815 chengbao welcome here to solve this problem-This is the answer to poj 2815 chengbao welcome here to solve this problem
poj2814
- Time Limit: 1000ms Memory limit: 65536kB 题目描述 有9个时钟，排成一个3*3的矩阵。 现在需要用最少的移动，将9个时钟的指针都拨到12点的位置。共允许有9种不同的移动。如右表所示，每个移动会将若干个时钟的指针沿顺时针方向拨动90度。 移动 影响的时钟 1 ABDE 2 ABC 3 BCEF 4 ADG 5 BDEFH 6 CFI 7 DEGH 8 GHI 9 EFHI (图 2
pojquestionssource
- 北大poj的一些简单题目源码，建议先自己做然后看源码-North poj some simple questions source, it is recommended to do and then look at their source ... ...
CodeOfACM
- 一些ACM题源码,包括部分北大poj上的题目和《新编常用算法及程序题解》里面算法的程序实现-some code of ACM problems
1159_Palin
- poj 第1159题palin_drome_回文 最长公共子序列 LCS DP 滚动数组-poj 1159 title palin_drome_ palindrome longest common subsequence LCS DP rolling array
3723_Conscription_Kruskal
- POJ 第3723题Conscr iption_Kruskal最小生成树-POJ No. 3723 Conscr iption_Kruskal minimum spanning tree problem