Manio

下载地址：http://sourceforge.net/projects/dev-cpp/Dev-C++ is an full-featured Integrated Development Environment (IDE) for Win32. It uses GCC, Mingw or Cygwin as compiler and libraries set.

Longest Ordered Subsequence Time Limit:2000MS  Memory Limit:65536KTotal Submit:2685 Accepted:964 DescriptionA numeric sequence of ai is ordered if a1 a2 aN. Let the subsequence of the given numeric

IP Address Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users: 254

Josephs Puzzle Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit use

Lowest Bit Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users: 257

  Sorting by Swapping Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submi

Palindromes Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users:

The Triangle Time Limit: 1000ms, Special Time Limit:2000ms, Memory Limit:32768KB Total submit users: 1

Speed Limit Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users: 16

置换排列 Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users: 201, Acce

Magician Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users: 157,

Fibonacci Number Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit user

分硬币 Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users: 61, Accept

Polar Explorer Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB Total submit users:

#include iostream>using namespace std;class empty ...{      };//sngly-linked list nodetemplate class Elem> class Link ...{public:    Elem element; //value for this node    Link *next;    Link(const 

//this is a program in,p9#include iostream>using namespace std;template class Type>void perm(Type list[],int k,int m){        if( k == m)        {                for (int i = 0 ; i  m ; i++)        

Recamans Sequence Time Limit:3000MS  Memory Limit:60000K Total Submit:2885 Accepted:1071 DescriptionThe Recamans sequence is defined by a0 = 0 ; for m > 0, am = am−1 − m if the rsulting am is posi

Gridland Time Limit:1000MS  Memory Limit:10000KTotal Submit:544 Accepted:360 DescriptionBackground For years, computer scientists have been trying to find efficient solutions to different computing

　　《算法》（《算法与信息学竞赛》）一书对ACM/ICPC选手阅读此书的建议是：重点阅读部分章节，刚接触到竞赛的先浏览全书，然后阅读理论部分，跳过一些思路巧妙或者难度很大的题；把书中大部分的程序都亲自编写一下，并加入到自己的程序库中。　　今天没怎么看书：（

『推荐』搜索算法全集（也是特别爽的哦，内部资料！！）搜　索　算　法  搜索算法是利用计算机的高性能来有目的的穷举一个问题的部分或所有的可能情况，从而求出问题的解的一种方法。搜索过程实际上是根据初始条件和扩展规则构造一棵解答树并寻找符合目标状态的节点的过程。所有的搜索算法从其最终的算法实现上来看，都可以划分成两个部分──控制结构和产生系统，而所有的算法的优化和改进主要都是通过修改其控制结构来完成的。

Faulty Odometer Time Limit:1000MS  Memory Limit:65536KTotal Submit:619 Accepted:381 DescriptionYou are given a car odometer which displays the miles traveled as an integer. The odometer has a defect

TURBO C在DOS下用，很不方便的，刚从网上搜了一下几款C COMPLIER，与大家分享。试过了，都能下的。lcc-win32http://www.cs.virginia.edu/~lcc-win32/MyTC http://download.zol.com.cn/detail/4/30278.shtmlMiracle C Compilerhttp://www.zdnet.com.

Hangover Time Limit:1000MS  Memory Limit:10000KTotal Submit:12059 Accepted:4808 DescriptionHow far can you make a stack of cards overhang a table? If you have one card, you can create a maximum ov

I Think I Need a Houseboat Time Limit:1000MS  Memory Limit:10000KTotal Submit:13733 Accepted:4437 DescriptionFred Mapper is considering purchasing some land in Louisiana to build his house on. In

判断到了字符串的末尾main(){int i=0 ;char s[10];scanf("%s",s); while(s[i]!=){                     /*这里可以用,也可以用/0来判断到了字符串的末尾*/   printf("s is not empty/n");   i++; }printf("now is empty");}  

Pi to one MILLION decimal places3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679 8214808651328230664709384460955058223172535940812848111

Evas Problem Time Limit:1000MS  Memory Limit:10000KTotal Submit:3235 Accepted:1733 DescriptionEva的家庭作业里有很多数列填空练习。填空练习的要求是：已知数列的前四项，填出第五项。因为已经知道这些数列只可能是等差或等比数列，她决定写一个程序来完成这些练习。Input第一行是数列的数目t（0

DNA Sorting Time Limit:1000MS  Memory Limit:10000KTotal Submit:6862 Accepted:2809 DescriptionOne measure of ``unsortedness in a sequence is the number of pairs of entries that are out of order wit

取石子游戏 Time Limit:1000MS  Memory Limit:10000KTotal Submit:2539 Accepted:579 Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的

Financial Management Time Limit:1000MS  Memory Limit:10000KTotal Submit:14420 Accepted:6246 DescriptionLarry graduated this year and finally has a job. Hes making a lot of money, but somehow never

  动态规划.rar (458 K)

Expanding Fractions Time Limit:1000MS  Memory Limit:10000KTotal Submit:555 Accepted:192 DescriptionIn this problem you are to print the decimal expansion of a quotient of two integers. As you well k

//insort function//插入法排序//n是元素个数template  class Elem >void insort ( Elem A[], int n ){    for ( int i = 1; i  n ; i++ )        for ( int j = i ; ( j > 0) && (  A[j]  A[j-1]  );j--)            swap(A