Ignatius and the Princess II hdu 1027
摘要:
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <algorithm>using namespace std;int str[11000];int main( ){ int N, M, i, j; while ( scanf("%d%d", &N, &M) != EOF) { for ( i = 1; i <= N; i++) str[i-1] = i; //默认已经是第1小了 int num = 0; while( num 阅读全文
posted @ 2011-08-26 02:08 more think, more gains 阅读(127) 评论(0) 推荐(0) 编辑