搜索资源列表
sicily
- 这是一个Sicily上的题目，可供大家参考-This is a topic on Sicily
1002
- Sicily上的1002题，主要是为一些初学者设计的-Problem Given a sequence of consecutive integers n,n+1,n+2,...,m, an anti-prime sequence is a rearrangement of these integers so that each adjacent pair of integers sums to a composite (non-prime) number. For example, if
1198
- sicily 1198题 给出N个字符串，求这几个字符串组成的序列中字典序最小序列-Descr iption Dr 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
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.
week6
- 西西里上的几道题，dev-c++编译器编译的东东，是几道很好的练习题哦。-A few questions on Sicily, dev-c++ compiler stuff, is a few good exercises oh.