题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=0C语言源码：#includeint main(){ int a[100],i,j,n,x; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n-1;i++) {

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=2C语言源码：#includevoid quicksort(int a[],int low,int high){ int key,i,j; i=low; j=high; key=a[low]; while(i<j) { while(i=key) j--; *

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=6C语言源码：#include#includeint leap(int year){ if((year%4==0&&year%100!=0)||year%400==0) return 1; else return 0;}//判断是不是闰年int daynum(int y

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=1C语言源码：#include#includetypedef struct student{ char name[100]; int age,score;}student;void quicksort(student stu[],int add[],int low,int hi

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=3C语言源码：#include#include#includetypedef struct student{ char num[7]; char name[9]; int score;}student;student s[100000];int cmp1(const

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=4C语言源码：#include#include#includeint cmp(const void *a,const void *b){ return (*(char *)a-*(char *)b);}int main(){ char s[201]; int n; wh

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=29C语言源码：#include#includetypedef struct Huffmantree{ int weight,lchild,rchild,parent;}Huffmantree;int depth( Huffmantree H[],int n,int x){

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=27C语言源码：#includeint main(){ int n,i,top,a[10005],x; char s[100]; scanf("%d",&n); while(n) { top=0; for(i=1;i<=n;i++) { scanf("%s

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=28C语言源码：//这个题不是跟第27题一模一样嘛#include#includeint Precede(char a,char b){ int p[5][5]={{-1,-1,-1,-1,1},{-1,-1,-1,-1,1},{1,1,-1,-1,1},{1,1,-1,-1,1},

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=5C语言源码：#includeint leapyear(int year){ if((year%4==0&&year%100!=0)||year%400==0) return 1; else return 0;}int day(int year,int month,in

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=8C语言源码：#includeint leap(int year){ if((year%4==0&&year%100!=0)||year%400==0) return 1; else return 0;}void date(int num,int year,int *mo

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=10C语言源码：#includeint a[1000002];int main(){ int n,m,i,k,j; while(scanf("%d %d",&n,&m)!=EOF) { for(i=1;i<1000002;i++) a[i]=0; for(i=1;i

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=14C语言源码：#include#includeint main(){ int n,i,center,j,len; char a[90][90]; char p,q; while(scanf("%d %c %c",&n,&p,&q)!=EOF) { center=(n+1

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=18C语言源码：#includeint main(){ int n,k,i,a[100],num; while(scanf("%d",&n)!=EOF) { while(n) { n--; scanf("%d",&k); for(i=0;i<k;i++)

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=19C语言源码：#include#includeint cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int search(int a[],int n,int x){ int low,high,ke

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=20C语言源码：#include#includetypedef struct room{ int j,f; float w;}room;int cmp(const void *a,const void *b){ room *aa=(room *)a; room *bb=(

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=7C语言源码：#includeint leap(int year){ if((year%4==0&&year%100!=0)||year%400==0) return 1; else return 0;}int daynum(int year,int month,int

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=9C语言源码：#includeint main(){ int a[101],n,i,score; scanf("%d",&n); while(n) { for(i=0;i<=100;i++) a[i]=0; for(i=1;i<=n;i++) { scan

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=11C语言源码：#includeint main(){ int i,n,m,book[201],person[201]; while(scanf("%d %d",&n,&m)!=EOF) { for(i=1;i<=m;i++) book[i]=0; for(i=1;i

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=13C语言源码：#includeint main(){ int h,i,j; while(scanf("%d",&h)!=EOF) { for(i=1;i<=h;i++) { j=1; while(j<=2*h-2*i) { printf(" ")

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=30C语言源码：#includetypedef struct Huffmantree{ int weight,lchild,rchild,parent;}Huffmantree;int depth(Huffmantree H[],int n,int i){ int d; d=

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=31C语言源码：#include#include#includetypedef struct BiTree{ char data; BiTree *lchild,*rchild;}BiTree;BiTree *create(char a[],char b[],int m,in

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=33C语言地址：#include#includeint depth(int n){ return (int)(log(n)/log(2));}int main(){ int i,n,a[1002],d; while(scanf("%d",&n)!=EOF) { for

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=35C语言源码：#include#include#includetypedef struct Bitree{ int data; struct Bitree *lchild,*rchild;}Bitree;Bitree *create(Bitree *t,int n){

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=36C语言源码：#include#includeint main(){ int a,b,k,n; scanf("%d %d %d",&a,&b,&k); while(a!=0||b!=0) { n=(int)pow(10,k); if(a%n==b%n) prin

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=37C语言源码：#includeint main(){ int n; while(scanf("%d",&n)!=EOF) { if(n>0&&n<10) { if((n*n)%10==n) printf("Yes!\n"); else prin

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=39C语言源码：#includeint is(int a,int b){ if((a%10==b/1000)&&(a/10%10==b%1000/100)&&(a/100%10==b%100/10)&&(a/1000==b%10)) return 1; else return

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=41C语言源码：#includeint root(int n){ int num=0; while(n) { num+=n%10; n/=10; } return num;}int main(){ int n,i; char s[1000]; scanf("

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=12C语言源码：#includeint a[10001];int main(){ int i,n,m,low,high,j; while(scanf("%d %d",&n,&m)!=EOF) { for(i=0;i<=n;i++) a[i]=1; for(i=1;i

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=16C语言源码：#includeint main(){ int a[201],n,i,x; while(scanf("%d",&n)!=EOF) { for(i=0;i<n;i++) scanf("%d",&a[i]); scanf("%d",&x); i=0;

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=17C语言源码：#include#includetypedef struct student{ char number[100],name[100],gender[100],age[100];//数组要开大，要不过不了}student;int main(){ int n,i,

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=22C语言源码：#include#includeint cmp(const void *a,const void *b){ return *(double *)a-*(double *)b;}int main(){ int c,n,v,w,i,num; double p[1

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=23C语言源码：#include#includeint cmp(const void *a,const void *b){ return *(int *)a>*(int *)b?-1:1;}int main(){ int i,n,a[601],L,len; while(sc

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=44C语言源码：#include#includeint main(){ char s[40]; int a[40],t[200],i,len,k,x,top,b[40]; while(scanf("%s",s)!=EOF) { top=0; k=0; getchar

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=45C语言源码：#includeint main(){ int a[8],n,i,top; while(scanf("%d",&n)!=EOF) { top=0; if(n==0) printf("0\n"); else { while(n) {

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=47C语言源码：#includeint max(int a,int b){ if(b==0) return a; else return max(b,a%b);}int main(){ int a,b,c; while(scanf("%d %d",&a,&b)!=E

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=48C语言源码：#include#includelong long gcd(long long a,int b){ return b==0?a:gcd(b,a%b);}int main(){ long long n,m,s,a,i; while(scanf("%lld",&

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=48C语言源码：#include#includelong long gcd(long long a,int b){ return b==0?a:gcd(b,a%b);}int main(){ long long n,m,s,a,i; while(scanf("%lld"

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=49C语言源码：#include#includeint judge(int n){ int i; i=2; while(i<=(int)sqrt(n)) { if(n/i*i==n) return 0; i++; } return 1;}int main

题目地址：http://ac.jobdu.com/problem.php?cid=1040&pid=51C语言源码：#includeint s[10005],top;void pri(){ int i,num; s[top++]=2; num=3; while(top<10000) { for(i=0;i<top;i++) if(num/s[i]*s[i]==nu