
bupt计导
something for nothing
这个作者很懒,什么都没留下…
展开
-
12-7结构排序
#include<stdio.h>struct Student{ int order; char ID[11]; char name[11]; int grade[4];};typedef struct Student student;void add(student a[],int n);void de(student a[],int n);void change(student a[],int n);void show(student a[],int n);int原创 2021-09-06 11:39:21 · 90 阅读 · 0 评论 -
12-6结构排序
#include<stdio.h>struct student{ char name[21]; int grade;};typedef struct student Student;void person(Student a[],int n);int main(){ int i,j,n; scanf("%d",&n); Student a[n]; for(i=0;i<n;i++) scanf("%s%d",a[i].name,&a[i].gra原创 2021-09-06 11:38:44 · 87 阅读 · 0 评论 -
12-5初识结构数组
#include<stdio.h>struct student{ char name[21]; char number[21]; int grade[6]; double average; int total;};typedef struct student Student;void person(Student a,int n);int main(){ int n,i,j,t; scanf("%d",&n); Student a[n]; i=0; wh原创 2021-09-06 11:38:14 · 95 阅读 · 0 评论 -
12-4初识结构
#include<stdio.h>struct student{ char name[21]; char number[21]; int grade[6]; double average; int total;};typedef struct student Student;int main(){ int i,j,t; Student a; Student *ptr=&a; gets(a.name) ; scanf("%s",a.number); a.t原创 2021-09-06 11:36:57 · 84 阅读 · 0 评论 -
12-3动态数组进阶
#include<stdio.h>#include<string.h>#include<stdlib.h>int main(){ int n,i,j,length; char *t; scanf("%d",&n); getchar(); char **a=(char**)malloc(sizeof(char*)*n);; char huan[1000]; for(i=0;i<n;i++) { gets(huan); lengt原创 2021-09-06 11:36:07 · 116 阅读 · 0 评论 -
12-2指针数组进阶
#include<stdio.h>#include<string.h>#include<stdlib.h>void judge(char *num[],int n);int main(){ int n,i,j,a; char *t; scanf("%d",&n); char sentence[100000]; char *num[n]; getchar(); num[0]=sentence; for(i=0;i<n;i++) {原创 2021-09-06 11:35:22 · 103 阅读 · 0 评论 -
12-1结构图-学生成绩
#include <stdio.h>typedef struct{ char id[16] ;//学生账号 int total ; //综合成绩 int ce ; //机试成绩 int ws ; //加权成绩 }STUDENT;void Sort(STUDENT a[],int size) ; void Swap(STUDENT * s1,STUDENT * s2) ;int原创 2021-09-06 11:34:27 · 121 阅读 · 0 评论 -
11-5动态分配内存2
#include<stdio.h>#include<string.h>#include<stdlib.h>int main(){ int **a,n,m,i,j; scanf("%d%d",&n,&m); a=(int **)malloc(sizeof(int *)*n);//建立长度为n的动态指针数组 for(i=0;i<n;i++) a[i]=(int *)malloc(sizeof(int)*m);//原创 2021-09-06 11:32:53 · 85 阅读 · 0 评论 -
11-4动态分配内存
#include<stdio.h>#include<string.h>#include<stdlib.h>int main(){ int *a,n; scanf("%d",&n); a=(int * )malloc(sizeof(int) * n); int i; for(i=0;i<n;i++) scanf("%d",&a[i]); for(i=0;i<n;i++) a[i]=a[i]原创 2021-09-06 11:32:20 · 88 阅读 · 0 评论 -
11-3指针分单词
#include<stdio.h>int getString( char * source , char *strPtr[] ) ;int main(){ char str[100005]; char *strPtr[1005]={0}; int i, num ; gets(str); num = getString( str , strPtr ) ; for( i = 0 ; i < num ; i++ )原创 2021-09-06 11:31:27 · 135 阅读 · 0 评论 -
11.2指针定位
#include <stdio.h>char *locatesubstr(char *str1,char *str2);int main(){ char str1[505],str2[505]; char *p; gets(str1); gets(str2); p=locatesubstr(str1,str2); if(p==NULL) printf("NULL!\n"); else puts(p); retu原创 2021-08-06 17:45:17 · 240 阅读 · 0 评论 -
11.1指针删除
#include<stdio.h>void delcharfun(char *str,char ch);int main(){ char ch,str[110]; scanf("%s",str); getchar(); scanf("%c",&ch); delcharfun(str,ch); printf("%s\n",str); return 0; }v原创 2021-08-06 17:44:36 · 406 阅读 · 0 评论 -
10.7字符串排序
#include<stdio.h>#include<string.h>#include<stdlib.h>int main (){ int n,i,s; scanf("%d",&n); char a[201][101]; char t[201]; getchar(); for(i=0;i<n;i++) gets(a[i]); for(s=n-1;s>=1;s--) { for(i=0;i<s;i++) {原创 2021-08-06 17:23:43 · 90 阅读 · 0 评论 -
10.6统计子串
#include<stdio.h>int main(){ int i,j,a[100][100],n,k; scanf("%d",&n); k=1; for(i=0; i<n; i++) for(j=0; j<=i; j++) { if(i%2==0) a[j][i-j]=k; else a[i-j][j]=k; k++; }原创 2021-08-06 17:22:52 · 70 阅读 · 0 评论 -
10.5蛇形矩阵
#include<stdio.h>int main(){ int i,j,a[100][100],n,k; scanf("%d",&n); k=1; for(i=0; i<n; i++) for(j=0; j<=i; j++) { if(i%2==0) a[j][i-j]=k; else a[i-j][j]=k; k++; }原创 2021-08-06 17:21:54 · 92 阅读 · 0 评论 -
10.4矩阵转换
#include<stdio.h>int main(){ int n,i,s,min,t; scanf("%d",&n); int a[n][n]; int average[100]= {0}; int count[100]; for(i=0;i<n;i++) count[i]=-1; for(i=0;i<n;i++) { for(s=0;s<n;s++) { scanf("%d",&a[i][s]); average原创 2021-08-06 17:21:19 · 106 阅读 · 0 评论 -
10.3矩阵鞍点
#include<stdio.h> int zong(int [][100],int,int);int heng(int [][100],int,int);int main(){ int m,n,i,s,b,c,d; scanf("%d%d",&n,&m); int a[100][100]; d=0; for(i=0;i<n;i++) for(s=0;s<m;s++) scanf("%d",&a[i][s]); f原创 2021-08-06 17:20:36 · 68 阅读 · 0 评论 -
10.2推销员
#include<stdio.h>int main(){ int n,i,s; scanf("%d",&n); int a,b; float c; float su[6][5]={0}; i=0; while(n--) { scanf("%d%d%f",&a,&b,&c); su[b-1][a-1]+=c; i++; } for(i=0;i<6;i++) { for(s=0;s<4;s++) su[i][4原创 2021-08-06 17:19:57 · 89 阅读 · 0 评论 -
10.1矩阵转置
#include<stdio.h>int main(){ int n,m; int i,s; scanf("%d%d",&n,&m); int a[n][m]; int b[m][n]; for(i=0;i<n;i++) for(s=0;s<m;s++) scanf("%d",&a[i][s]); for(i=0;i<n;i++) for(s=0;s<m;s++) b[s][i]=a[i][s]; f原创 2021-08-06 17:19:24 · 123 阅读 · 0 评论 -
mypow函数
#include<stdio.h>int mypow(int , int ) ;int main(){ int x, n ; scanf("%d%d",&x,&n) ; printf("%d\n",mypow(x,n)) ; return 0;}int mypow(int x, int n){ int i; int m; m=1; for(i=1;i<=n;i++) { m*=x; } return原创 2021-09-07 08:32:43 · 2905 阅读 · 0 评论 -
reserveNum函数
#include<stdio.h>int reverseNum(int) ; int main(){ int num ; scanf("%d",&num); printf("The reverse form of number %d is %d.\n",num,reverseNum(num)) ; return 0;}int reverseNum(int num) { int i,s,a,b; for(i=1,s=1;num/s!=0;i++) {原创 2021-09-07 08:33:15 · 189 阅读 · 0 评论 -
judgeTriangle函数
int judgeTriangle(int,int,int) ; int main(){ int a, b, c ; scanf("%d%d%d",&a,&b,&c); switch(judgeTriangle(a,b,c)) { case -1 : printf("It is not a triangle.\n") ; break ; case 0 : printf("It is a scalenous triangle.\n") ; break ;原创 2021-09-07 08:32:03 · 239 阅读 · 0 评论 -
isPerfect与printPerfect函数
#include <stdio.h>//判断一个数是否为完全数的函数int isPerfect(int);//打印完全数的函数 void printPerfact(int);int main(){ int i,a,b,count; scanf("%d%d",&a,&b); count = 0 ;//a,b两数间完全数的数量,初始化为0 for(i=a;i<=b;i++) { if (isPerfect(i)) //如果是完全数原创 2021-09-07 08:31:15 · 737 阅读 · 0 评论 -
getDigit函数
#include<stdio.h>int getDigit(long long n); int main(){ long long n ; int len ; scanf("%lld",&n); len = getDigit(n) ; if (len > 1) printf("The integer %lld has %d digits.\n",n, len) ; else printf("The integer %lld has %d di原创 2021-09-07 08:30:32 · 1022 阅读 · 0 评论 -
getday函数
#include<stdio.h>int getDays(int,int) ;int main(){ int year, month ; scanf("%d%d",&year,&month); printf("There are %d days in month %d year %d.",getDays(year,month), month, year) ; return 0 ; }int getDays(int year,int month) {原创 2021-09-07 08:29:41 · 689 阅读 · 0 评论 -
fun函数
#include<stdio.h>int fun(int) ;int main(){ int x ; scanf("%d",&x); printf("The result is:y=%d\n",fun(x)) ; return 0 ; }int fun(int){ if(x<1) x=x; else if(x<=10&&x>=1) x=2*x-1; else if(x>10&&x<=10原创 2021-09-07 08:28:23 · 4429 阅读 · 0 评论 -
50个素数
#include<stdio.h>int main(){ int x; int cnt=0; int i,a; int m=1; a=1; for(x=2;cnt<=50;x++) { a=1; for(i=2;i<x;i++) { if(x%i==0) { a=0; } } if(a) { if(m%5!=0) prin原创 2021-09-07 08:27:33 · 237 阅读 · 0 评论 -
T恤尺码。
#include<stdio.h> int main(){ int n; scanf("%d",&n); int a[n],b[n]; char body[181][146]; int i,j,k,c; j=0; k=0; c=0; body[160][130]='M'; body[160][135]='M'; body[160][140]='L'; body[160][145]='L'; body[165][130]='M'; body[165][135原创 2021-09-07 08:34:20 · 184 阅读 · 0 评论 -
5.6小学奥赛
#include<stdio.h>int main(){ long long int x,i,m,n,a,b,c; scanf("%lld",&x); m=1; n=1; c=1; a=1; b=1; for(i=1;i<=x;i+=2) { m=i; n=i+2; if(i>=2) b=b*n+a*m;原创 2021-08-06 17:10:07 · 73 阅读 · 0 评论 -
5.5牛顿迭代法
#include<stdio.h>#include<math.h>int main(){ double a,b,c,d,s,x,m,n; scanf("%lf%lf%lf%lf",&a,&b,&c,&d); x=1; s=1; while(fabs(s)>1e-5) { m=a*pow(x,3)+b*pow(x,2)+c*x+d; n=3*a*pow(x,2)+2*b*x+c ; s=m/n; x=x原创 2021-08-04 09:08:23 · 113 阅读 · 0 评论 -
5.4进制转换
#include<stdio.h>#include<math.h>int main(){char n;double c,i,a,b,d;n=getchar();i=0;a=0;b=n;c=0;while((n=getchar())!=’#’){n=getchar();i++;b=b*10+n;if(n==’.’){a++;}}for(i=i-a;i>=0;i--){ c+=b/pow(10,i)*pow(2,i);}if(a==原创 2021-08-04 09:04:25 · 136 阅读 · 0 评论 -
5.2解密加密
#include<stdio.h>int main(){int n,f;scanf("%d%d",&n,&f);int a,b,c,d,m,i;a=n/1000;b=n/100%10;c=n/10%10;d=n%10;if(f==1){a=(a+7)%10;b=(b+7)%10;c=(c+7)%10;d=(d+7)%10;m=a;a=c;c=m;i=b;b=d;d=i;n=a1000+b100+c10+d;printf(“After原创 2021-08-04 09:03:27 · 132 阅读 · 0 评论 -
5.1韩信点兵
#include<stdio.h>int main(){int x;scanf("%d",&x);for(x;;x++){if(x%51&&x%65&&x%76&&x%1110)break;}printf("%d",x);return 0;}原创 2021-08-04 09:01:27 · 92 阅读 · 0 评论 -
4-2-6输出三角形字符序列
#include<stdio.h>int main(){int n,s,l,i,a;char c=‘A’;scanf("%d",&n);for(l=1;l<=n;l++){ for(s=n+1-l;s>=1;s--) { if(s>1) printf("%c ",c); if(s==1) printf("%c \n",c); c=c+1; }}retu原创 2021-08-04 08:58:09 · 112 阅读 · 0 评论 -
4-2-5水仙花数
#include<stdio.h>int main(){int n,s,l,i,a;char c=‘A’;scanf("%d",&n);for(l=1;l<=n;l++){ for(s=n+1-l;s>=1;s--) { if(s>1) printf("%c ",c); if(s==1) printf("%c \n",c); c=c+1; }}retu原创 2021-08-04 08:57:26 · 77 阅读 · 0 评论 -
4-2-4换硬币
#include<stdio.h>int main(){int x,fen1,fen2,fen5,count,total;scanf("%d",&x);count=0;for(fen5=x/5;fen5>=1;fen5–){for(fen2=x/2;fen2>=1;fen2–){for(fen1=x;fen1>=1;fen1–)if(5fen5+2fen2+fen1==x){total=fen1+fen2+fen5;printf(“fen5:原创 2021-08-04 08:56:37 · 76 阅读 · 0 评论 -
4.5辗转相减法
#include<stdio.h>int main(){long long int x, y, m, n;scanf("%lld%lld", &x, &y);m = x, n = y;while (x!=y){if (x>y)x = x-y;elsey = y-x;}printf("%lld %lld", x, m*n / x);return 0;}原创 2021-08-04 08:56:05 · 305 阅读 · 0 评论 -
4.4遍历搜寻
#include<stdio.h>#include<math.h>int main(void){int a,b,c,m,n=1,num,t=0;scanf("%d%d%d",&a,&b,&c);for(a=a;a<=b;a++){ num=0; if(a==1&&a<=c) { printf("%d\t",a); n++; } else if(a!=1&&a>=0)原创 2021-08-04 08:54:30 · 137 阅读 · 0 评论 -
4.3求幂值
#include<stdio.h>#include<math.h>int main(){double x,n,a,b;a=1;b=1;scanf("%lf",&x);double y=pow(x,n);for(n=1;fabs(y/a)>=1e-8;n++){y=pow(x,n);a=a*n;b=b+y/a;}printf("%.4lf\n",b);printf("%.4lf",exp(x));return 0;}原创 2021-08-04 08:53:39 · 125 阅读 · 0 评论 -
4.2哥德巴赫猜想
#include<stdio.h>int main(){long long int n,i,m,a;scanf("%d",&n);int p,q;for(p=2;p<=n/2;p++){a=1;for(i=2;ii<=p;i++){if(p%i==0)a=0;}q=n-p;if(a){for(i=2;ii<=q;i++){if(q%i==0)a=0;}}if(a)break;}printf("%d = %d + %d"原创 2021-08-01 11:24:58 · 89 阅读 · 0 评论