摘要：#include<stdio.h>#include<stdlib.h>#include<math.h>#include<string.h>int n;char str1[500][20];void p_quick_sort(char str[500][20],int i,int j);void main(){ int i; while(1) { printf("请输入字符串个数:\n"); scanf("%d",&n); for(i=0;i<n;i++) scanf("%s" 阅读全文

摘要：地址：http://acm.xmu.edu.cn/JudgeOnline/problem.php?id=1349题目大意是给出1-n个数，并且这n个数为范围为1-n,并且各不相同。直接模拟：#include<cstdio>#include<cstdlib>#include<cmath>int a[40010];int main(){ int tcase,n,i,temp,ans,temp1; while(scanf("%d",&tcase)==1) { while(tcase--) { scanf("%d",& 阅读全文

摘要：#include<cstdio>#include<cstdlib>#include<cmath>#include<ctime>void c_sort(int *a,int n,int *t);//选择排序void ins_sort(int *a,int n,int *t);//插入排序void quick_sort(int *a,int n,int *t);//快速排序1void p_quick_sort(int *a,int i,int j);void heap_sort(int *f,int n);//堆排序void build_heap(i 阅读全文

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=2523求出每种组合并进行排序，题意给的是小于但不包含等于的情况，在此种情况下，适合使用基数排序的方法。#include<cstdio>#include<cstdlib>#include<cmath>#include<cstring>int cmp(const void *a,const void *b);int f[1010],x[10010];int main(){ int tcase,n,k,i,j,temp,num,ans; while(scanf(&qu 阅读全文