2011年04月_陈思有

原创将两个数组组合成有序数组

#include <stdio.h>void main(){ int a[100],b[100]; int i,j,k,temp,n,m; printf("输入a数组的个数n:"); scanf("%d",&n); printf("输入b数组的个数m:"); scanf("%d",&m); printf("array a:/n"); for( i=0; i<n; i++) scanf("%d",&a[i]); printf("

2011-04-28 12:49:00 850

原创查找字符串中一个子串的个数

#include <stdio.h>#include <string.h>int find_str( char *str, char *des );void main(){ char str[40],des[10]; int n; gets( str ); gets( des ); n = find_str( str, des ); printf("%d/n",n);}int find_str( char *str, cha

2011-04-27 16:52:00 1409

原创将小写前移

#include <stdio.h>#include <string.h>void proc( char *str );void main(){ char str[30]; gets( str ); proc( str ); printf("/n%s/n",str);}void proc( char *str ){ char *p,temp; for ( p=str; *str!='/0'; str++ )

2011-04-27 15:18:00 658

原创找出两个字符串中最大公共子字符串,如"abccade","dgcadde"的最大子串为"cad"

#include <stdio.h>#include <string.h>void same_str( char *str1, char const *str2, char const *str3 );void main(){ char str1[10],str2[30],str3[30]; gets( str2 ); gets( str3 ); same_str( str1, str2, str3 ); printf("/n%s/n",

2011-04-27 14:23:00 6663 1

原创字符串原地压缩

#include <stdio.h>void yasuo( char *str );void main(){ char str[40]; gets( str ); yasuo( str ); printf("%s/n",str);}void yasuo( char *str ){ int i,j=0,len=1; /*j用来将数组重新复制，len用来记载连续的个数*/ for ( i=0; *(str+i)!='/0'

2011-04-26 19:40:00 1483

原创对称子字符串的最大长度

#include <stdio.h>int max_len( char *str );void main(){ char str[30]; int len; gets( str ); len = max_len( str ); printf("最长的对称子串的长度%d/n",len);}int max_len( char *str ){ int len,i,j,k,max=0; for ( i=0; *(str+i)

2011-04-25 22:09:00 679

原创将字符串后面的数字存入另一个数字字符串中

#include <stdio.h>int char_int( char *str, int *a );int main(){ int a[10]; char str[30]; int i,len; gets( str ); len = char_int( str, a ); for ( i=0; i<len; i++) printf("%d ",*(a+i)); printf("/n");}int char

2011-04-24 15:58:00 1145

原创 9.15将钱的数值用逗号隔开

#include <stdio.h>#include <string.h>void dollars( char *dest, char const *src );void main(){ char str[20],string[25]; gets( str ); dollars( string, str ); printf("%s/n",string);}void dollars( char *dest, char const *s

2011-04-23 15:11:00 1671

原创 9.10字母回文

#include <stdio.h>#include <string.h>#include <math.h>int palindrome( char *string );void main(){ char str[30]; int n; gets(str); n = palindrome( str ); if ( n==1 ) printf("%s/n",str); else printf("No/n");}

2011-04-22 17:45:00 897

原创 9.11找出the的个数

#include <stdio.h>int num_the( char *str );int main(){ char str[100]; int the; gets(str); the = num_the( str ); printf("the number of the are:%d/n",the);}int num_the( char *str ){ int i,the=0; for ( i=0; *(str+

2011-04-22 15:05:00 384

原创 n*n个数按口字顺序存放

include <stdio.h>void main(){ int a[10][10]; int i,j,k,n,b=0; scanf("%d",&n); for ( i=0; i<n/2; i++) { for ( j=i; j<n-i; j++) /*四个循环按不同的方向进行*/ a[i][j] = ++b; for ( k=i+1,j--; k<n-i; k++ ) a[k][j] = ++b; for (

2011-04-22 13:37:00 460

原创 8.2求个人所得税

#include <stdio.h>float single_tax( float income );void main(){ float income,profice; printf("printf insert the income :"); scanf("%f",&income); profice = single_tax( income ); printf("the profice is %.2f/n",profice);}

2011-04-20 16:40:00 531

原创 8.3判断单位矩阵

#include <stdio.h>int matrix( int (*a)[] );void main(){ int a[10][10]; int i,j,n; for ( i=0; i<10; i++) for ( j=0; j<10; j++) scanf("%d",&a[i][j]); n = matrix( a ); if ( n==0 ) printf("no/n"); else print

2011-04-20 14:24:00 1267

原创 7.5编输出函数

#include <stdio.h>void print_float( float x ){ printf("%f/n",x);}void print_integer( int x ){ printf("%d/n",x);}void main(){ int a; float b; char c; char d[20]; int i; scanf("%d%f%c%s",&a,&b,&c,d); prin

2011-04-19 21:35:00 371

原创 7.4找出最大的数

#include <stdio.h>int max_list( int a[] );void main(){ int a[100],max; int i; for ( i=0; i<100; i++) { scanf("%d",&a[i]); if ( a[i]==-1 ) break; } max = max_list( a ); printf("%d/n",max);}int max_list( i

2011-04-19 21:02:00 380

原创 7.3将字符串中的数字字符转换为数字输出

#include <stdio.h>int ascii_to_interger( char *string );void main(){ char str[50]; int n; gets( str ); n = ascii_to_interger( str ); if ( n==-1 ) printf("none/n"); else printf("%d/n",n);}int ascii_to_interger

2011-04-19 20:25:00 1556

原创 7.2用递归求两个数的最大公约数

#include <stdio.h>int gcd( int m, int n );void main(){ int m,n,r; scanf("%d%d",&m,&n); r = gcd( m, n); if ( r==0 ) printf("wrong/n"); else printf("%d/n",r);}int gcd( int m, int n ){ int r,temp; if

2011-04-19 19:51:00 701

原创 7.1厄密多项式

#include <stdio.h>int hermite( int n, int x );void main(){ int n,x,s; scanf("%d%d",&n,&x); s = hermite( n, x ); printf("%d/n",s);}int hermite( int n, int x ){ if ( n<=0 ) return(1); else if ( n==1 ) return(2*

2011-04-19 19:00:00 783

原创 6.4用筛选法求素数

#include <stdio.h>#include <math.h>#define TRUE 1#define FAULSE 0void main(){ int i,a[1001],j,n; int *p=a; for (i=2; i<1001; i++) /*将数组的各个元素赋值为0*/ *(p+i) = TRUE; for ( i=2; i<1001; i++) { if ( *(p+i)==FAULSE ) cont

2011-04-18 21:58:00 448

原创 6.2删除一个字符串包含的另一个字符串

#include <stdio.h>int del_substr( char *str, char const *substr );void main(){ char str1[30],str2[20]; int n; gets(str1); gets(str2); n = del_substr( str1, str2 ); if ( n==0 ) { printf("/nno find/n"); printf("%s/n%

2011-04-18 18:46:00 765

原创 6.3将字符串倒置

#include <stdio.h>void reverse_string( char *string );void main(){ char str[20]; gets(str); printf("%s/n",str); reverse_string( str ); printf("%s/n",str);}void reverse_string( char *string ){ int i,n,m,temp;

2011-04-18 16:46:00 1863

原创 6.1找出两个字符串第一个相同的字符

#include <stdio.h>char *find_char( char const *source, char const *chars );void main(){ char source[20],chars[20]; char *p; gets(source); gets(chars); p = find_char(source, chars); if ( p != NULL ) printf("%c/

2011-04-18 12:49:00 834

原创求任意数的任意次方最后三位数的值

#include <stdio.h>#include <math.h>void main(){ int a,i,b; long sum,n,s; scanf("%d%d",&a,&b); sum = pow(a,b); for ( i=3; i>0; i-- ) { s = sum/pow(10,i-1); n = s%10; printf("%ld ",n); } printf("/n");}

2011-04-17 21:56:00 2639

原创 2.2大括号

#include <stdio.h>#include <stdlib.h>void main(){ char c; int left=0,right=0; while ( (c=getchar()) != EOF ) { if ( c == '{') left++; else if ( c == '}') { if ( left <= right) printf("extor/n"); else

2011-04-17 20:24:00 564

原创 4.3判断三角形

#include <stdio.h>void main(){ float a,b,c; scanf("%f%f%f",&a,&b,&c); if ( a+b<=c || a+c<=b || b+c<=a ) printf("不是三角形/n"); else { if ( a==b || a==c || b==c ) { if ( b==c && a==c) printf("等边三角形/n");

2011-04-17 19:55:00 472

原创 4.4将一个字符串中的n个字符复制到另一个字符串中，如果n大于这个字符串的长度，则超出部分以NUL补充

#include <stdio.h>#include <string.h>void copy_n( char dst[], char src[], int n );void main(){ int n,i; char dst[30],src[30]; gets(dst); scanf("%d",&n); copy_n(dst, src, n); for ( i=0; i<n; i++) printf("%c",src[i]); p

2011-04-16 00:29:00 2374

原创当相同的字符串连续出现至少两行时，输出该字符串，只有输出一遍

#include #include void main(){ char a[10][128]; int i,j=0; for (i=0; i

2011-04-15 22:13:00 694

原创 4.6把一个字符串中某一位数（start）开始，复制len个字符到另一个字符串

#include <stdio.h>#include <string.h>int substr( char dst[], char src[], int start, int len);void main(){ char src[30],dst[30]; int start,len,n,i; gets(src); scanf("%d%d",&start,&len); n = substr(dst,src,start,len); for

2011-04-15 20:24:00 1622

原创将单词之间多余的空格去掉

#include <stdio.h>#include <string.h>void main(){ void deblank( char string[], int len ); char str[50]; int len; gets(str); len = strlen(str); deblank(str,len); printf("%s/n",str);}void deblank( char string[], i

2011-04-15 18:59:00 1376

原创 4.14和4.15的吃汉堡问题

#include <stdio.h>void eat_hamberger( int x);int hungry( int x);void main(){ int n,j; printf("hungry number:"); scanf("%d",&n); j = hungry(n); if (j==0) { printf("so full/n"); eat_hamberger(j); } else eat_ha

2011-04-15 13:24:00 414

原创将字母之间的字母补充

#include <stdio.h>void main(){ char str[10],c; int i,j; scanf("%s",str); for (i=0; str[i]!='/0'; i++) { c = str[i]; putchar(c); while (c < str[i+1]-1) { c = c+1; putchar(c); } } printf("/n");}

2011-04-13 13:12:00 474

原创用指向指针的指针来对数组排序（字符串）

#include <stdio.h>#include <string.h>void main(){ void sort(char **p, int n); char *name[5],**p,a[5][20]; int i,j; for (i=0; i<5; i++) name[i] = a[i]; for (i=0; i<5; i++) scanf("%s",name[i]); p = &name; sort(p,5); for (

2011-04-12 18:55:00 944

原创用指向指针的指针来对数组排序

#include <stdio.h>void main(){ void sort(int **q, int n); int n,*a[20],**q,i,b[20]; printf("insert the total number:"); scanf("%d",&n); printf("insert every number:/n"); for (i=0; i<n; i++) a[i] = &b[i]; for (i=0; i<n; i++)

2011-04-11 17:55:00 1794 1

原创将一个多位数重新组合成最大的数

#include <stdio.h>void main(){ int i,n,a[10],b,j,z,temp; scanf("%d",&n); b = n; for (i=0; b!=0; i++) b = b/10; for (j=0; j<i; j++) { a[j] = n%10; n = n/10; } for (z=1; z<i; z++) { for (j=0; j<i-z; j++) {

2011-04-11 12:02:00 1091

原创将一个字符串放到另一个字符串最小字符的后面

#include <stdio.h>#include <string.h>void main(){ char s[40],v[20],min; int i,j,len,n; char *p; gets(s); gets(v); min = s[0]; p = &s[0]; n = 1; for (i=1; s[i]!='/0'; i++) /*找出s字符串中最小的字母*/ { if (s[i] < min) {

2011-04-10 22:41:00 2273 1

原创任意给定一个自然数N，要求M是N的倍数，且他的所有各位数字都是由0或1组成，并要求M尽可能小

#include <stdio.h>#include <math.h>void main(){ int n,m; int a,i,j,c; scanf("%d",&n); for (m=n,j=1; ; m+=n,j++) { a = m; for (i=0; a!=0 ;i++) /*求m的位数*/ a = a/10; for (a=m; i!=0 ; i-- ) /*判断m的各位是否为1或者0*/ { c

2011-04-10 19:39:00 6579 3

原创学生成绩平均分的链表

#include<stdio.h>#include<stdlib.h>struct stu *head,*p,*tail;struct stu{ float math,english,c; struct stu *next;};int n,m;struct stu * creat(){ head = NULL; p = tail = (struct stu *)malloc(sizeof(struct stu));

2011-04-10 15:12:00 1797

原创回文数

#include <stdio.h>#include <math.h>void main(){ int n,i,j,z,a,b,m,c,d; scanf("%d",&n); c = n; for (i=1; ;i++) { c = c/10; if (c==0) break; } z = i; m = n; d = n; for (j=1; j<=(i/2); j++) { z = z - 1;

2011-04-09 11:40:00 378

原创中空的菱形

#include <stdio.h>void main(){ int i,j,k; for (i=1; i<=4; i++) { for (j=3;j>=i;j--) printf(" "); printf("*"); for (k=1; k<=(i-1)*2-1; k++) printf(" "); if (i != 1) printf("*"); printf("/n"); }

2011-04-07 22:17:00 967

原创将链表的头变成链表的尾

#include <stdio.h>#include <malloc.h>#define NULL 0#define LEN sizeof(struct student)struct student{ int num; float score; struct student *next;};int n=0;void main(){ void print(struct student *head); struct student *creat

2011-04-07 21:54:00 545

空空如也

空空如也