- 博客(6)
- 收藏
- 关注
RSS订阅原创 2020-12-22
#include<stdio.h>#include<stdlib.h>#include<string.h>#include<math.h>void huiwen(){ int i,j,length; char a[100]; scanf("%s",a); length=strlen(a); for(i=0,j=length-1;i<=j;i++,j--) { if(a[i]!=a[j]) { break; } }
2020-12-22 22:50:34
76
原创 快速排序
#include<stdio.h>#include<stdlib.h>#include<time.h> int kuaipai(int *n,int low,int high){ int key; n[0]=n[low]; key=n[low]; while(low<high) { while(low<high&&n[high]>=key) { --high; } n[low]=n[high];
2020-12-22 21:22:06
91
3
原创 查找
#include<stdio.h>#include<stdlib.h>int sq(int x,int a[]){ for(int i=0;i<5;i++) { if(x==a[i]) { printf("yes"); break; } if(i==4) { printf("no"); break; } } return 0;}int erfen(int x,int a[]){ int low,high,mi
2020-12-22 21:21:10
80
原创 进制转换
nclude<stdio.h>#include<math.h>#include<stdlib.h>char a[16]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F'};char b[1000]={0};void change(int n,int r){ int i=0; if(n<0) { printf("-"); n=fabs(n); while(n)
2020-12-22 21:19:04
71
原创 HDU母牛的故事
HDU 母牛的故事#include<stdio.h>#include<malloc.h>#include<string.h>int fun(int n){ if(n<=4) { return n; } else { return fun(n-1)+fun(n-3); }}int main(){ int n,a; while(scanf("%d",&n)) { if(n>0) { a=fun(n)
2020-11-24 16:58:16
89
原创 HDU 回文的判断
AC代码#include<stdio.h>#include<string.h>int main(){int n;scanf("%d",&n);while(n–){char a[100];int i,j;scanf("%s",a);int length=strlen(a);for(i=0,j=length-1;i<=j;i++,j–){if(a[i]!=a[j]){break;}}if(i<=j){printf(“no\n
2020-11-24 16:54:23
84
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人