搜索资源列表
Sicily1000-1097
- 新增的sicily1000-1097部分AC代码，个人手打，均可通过-New sicily 1000-1097 Part AC code, personal hand to play, and can be accessed through
10389114_ex2
- 数据结构第二次作业——sicily上的水题-Data structure second job- water on sicily title ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~
sicily
- 编写一个程序，把一个非负的十进制数转换为任意base(2<=base<=16)进制的数。 -To write a program, a non-negative decimal number to convert to any base (2 < = base < = 16) hexadecimal number.
sicily-searching-map
- 数据结构中图的实现广度优先和宽度优先算法的C++源代码-Data structures, breadth-first and breadth-first algorithm C++ source code
1264.-Atomic-Car-Race
- sicily 1264，动态规划，计算最佳换轮胎方案，输出最短时间-Sicily 1264, dynamic programming, to calculate the best to change a tire program, the output shortest time
stack
- 堆栈的实现方法（Sicily 1021）关于堆栈的简单代码的方法，其实撇开复杂的类实现方式，写起来是很好写的。-Stack implementations (Sicily 1021) a simple code on the stack method, in fact, leaving aside complex class implementation, write-up is a good written.
taotaozhaiapple
- 在sicily平台里的陶陶摘苹果，程序实现简单快捷-Tao Tao in sicily platform where apples, procedures to achieve quick and easy
ch05
- sicily 1015 解题方法，这样行了么，20个字到底是要闹哪样?嗯？你说啊？
1155
- sicily1155 的代码，代码质量可能不好，见谅-the solution of the sicily 1155
week6
- 西西里上的几道题，dev-c++编译器编译的东东，是几道很好的练习题哦。-A few questions on Sicily, dev-c++ compiler stuff, is a few good exercises oh.
Fibonacci2
- Fibonacci问题，sicily 张老师题目-Fibonacci problem, sicily Zhang topic
Helpful_Paper
- sicily，1739题，Helpful Paper原创代码-Sicily Online Judge,Original Codes for 1739_Helpful_Paper
Pushbox
- Sicily平台，1041,Pushing Boxes，原创代码-Sicily Online Judge, Original Codes for 1041_Pushing_Boxes
Hie_with_Pie
- Sicily Online Judge,1404,Hie with the Pie,原创代码-Sicily Online Judge,original codes for 1404_Hie_with_the_Pie
couples
- 情侣对对消问题经典代码 SICILY可以通过-COUPLE PROBLEMS
1093
- 中山大学ACM SICILY 1913. Slides题目代码-Sun Yat-sen University ACM SICILY 1913. Slides subject code-Sun Yat-sen ACM SICILY 1913. Slides subject code-Sun Yat-sen University ACM SICILY 1913. Slides subject code
1198
- sicily 1198题 给出N个字符串，求这几个字符串组成的序列中字典序最小序列-Descr iptionDr lee cuts a string S into N pieces,s[1],…,s[N]. Now, Dr lee gives you these N sub-strings: s[1],…s[N]. There might be several possibilities that the string S could be. For example, if Dr. lee
A-B
- 中山大学在线编程题目水题之1000 A-B(Sun Yat - sen University Online programming)
Sicily_Stacks
- 程序解决了Sicily平台上的Stack问题，有较好的可读性(The program solves the Stack problem on the Sicily platform)
Sicily_Linked Stacks and Queues
- 程序解决了Sicily平台上的Queue问题，有较好的可读性(The program solves the Queue problem on the Sicily platform and has good readability)