a__white的博客

原创 flag35寻找坏键盘

# include <stdio.h># include <string.h>struct node{ int a; int b;}base[256];int main(){char a[100];char b[100];int c[256]={0};for(int i=0;i<256;i++){ base[i].a=base[i].b=0;}strcpy(a,"7 ...

原创 flag34 志愿投档系统

# include <stdio.h># include <malloc.h>typedef struct stuent{ int id; int a[2]; int b[3]; int sum; int rank;}Stu,*Pstu;typedef struct school{ int schoolid; int max; int cnt; int studentid[...

原创 flag33寻找字符串中最大的整数序列

# include <stdio.h># include <string.h>void find(char*a);int main(){ char a[30]; strcpy(a,"abcd12345ed125ss123456789"); puts(a); find(a);}void find(char*a){ int MAX=-1,MAXI=-1,MAXJ,max=0,m...

原创 flag32整体移动数组或者字符串

# include <stdio.h>void circal(int *a,int i,int j);void xianshi(int *a);int main(){ int a[10]={1,2,3,4,5,6,7,8,9,10}; xianshi(a); //circal(a,1,10); //xianshi(a); circal(a,9,10); xianshi(a); circ...

原创 flag31删除a字符串含有的b元素

# include <stdio.h># include <string.h>int main(){ char a[256]; char b[256]; char c[256]={'0'}; strcpy(a,"They are students"); strcpy(b,"aeiou"); puts(a); puts(b); for(int i=0;i<strlen(...

原创 flag30成绩排序列

# include <stdio.h># include <malloc.h>struct node{ long long id; int range; int score; int locate;}base[1024];void sort(struct node* base,int size);void xianshi(struct node* base,int T);v...

原创 flag29话费计算

# include <stdio.h># include <malloc.h># include <string.h>typedef struct node{ char c[15]; int a[4]; bool cf;}Node,*Pnode;typedef struct data{ int sum; int begin[10],end[10]; int t;...

原创 flag28 成绩排序，输出单科最排名以及每个学生每科排名以及总分排名

# include <stdio.h># include <malloc.h>typedef struct num{ int data; int vak;}Val,*Pval;typedef struct node{ int id; int gread[4]; int rank[4]; int max1; int max2;}Node,*Pnode;void sort(Pn...

原创 flag27签到问题

# include <stdio.h># include <malloc.h>typedef struct node{ char a[20]; int in1,in2,in3; int out1,out2,out3;}Node,*Pnode;int main(){ int T=3; double min=955350,max=-1,t; Pnode tmp=(Pnode)m...

原创 flag26赔率问题

# include <stdio.h>double maxn(double a, double b,double c);int main(){ char a[3]={'W','T','L'}; double c[3]={0}; double b[3]={0}; for(int i=0;i<3;i++) { scanf("%lf%lf%lf",&b[0],&b[1]...

原创 flag25成绩分类

# include <stdio.h># include <malloc.h>typedef struct node{ char a[15]; long long b; int data;}Node,*Pnode;int main(){ int T; scanf("%d",&T); Pnode S=(Pnode)malloc(sizeof(Node)*T); int...

原创 flag24 求PAT编号

# include <stdio.h># include <malloc.h># define N 100struct node//切记 不可加typedef { long long id; int seat;}Node[100];int main(){int T,t;scanf("%d",&T);printf("T=%d\n",T);int seat1,seat2...

原创 flag23多项式求和

必须指出的问题是对于double类型 输入时用%lf（那是L不是一）输出用%.1f（这是1不是L）（如果保留一位小数的话）# include <stdio.h>int main(){ int i,j,T,count=0; double  k=0.0; double  a[100]={0.0};//T=2; scanf("%d",&T); for(i=0;i<T;i++) ...

转载 flag22求导

# include <stdio.h>int main(){int a[100];int val,valc,i,count=0;while(scanf("%d%d",&val,&valc)!=EOF)a[valc]=val;a[0]=0;for(i=1;i<100;i++){ a[i-1]=i*a[i]; a[i]=0; if(a[i-1]!=00) count+...

原创 flag21最短距离

# include <stdio.h># include <malloc.h>int shortenest(int*a,int i,int j,int T);void travel(int*a,int i);int main(){int i,j,k,f,T;int*a;scanf("%d",&i);a=(int*)malloc(sizeof(int)*i);for(...

原创 flag20牌面排序

# include <stdio.h># include <string.h>void change(int* a,int* b);void travel(int*a);int main (){int start[55];char st[5]={'S','H','C','D','J'};int i,j,k,T=2;for (i=0;i<=54;i++)start[i]...

原创 flag19石头剪子布

原创 flag18 数据分类

# include void main(){int i,j,en=1;int count=0;int b[5]={0};int a[5]={0};double average=0.0;scanf("%d",&i);int val=i;while(i--){scanf("%d",&j);if(j%10==0){a[0]=a[0]+j;b

原创 flag17循环右移

# includevoid move(int*a,int k);void main(){int i,j,k,T;//含有K个元素的数组循环右移T个单位scanf("%d%d",&j,&T);int a[110];for(k=0;k{scanf("%d",&a[k]);}while(T--){move(a,j);}for(i=0;i{

原创 flag16四舍五入以及时分秒的划分

# include void main(){int c1,c2;scanf("%d%d",&c1,&c2);int a=c2-c1;if(a%100>=50)a=a/100+1;else a=a/100;printf("%2d:%2d:%2d",a/3600,a%3600/60,a%60);}

原创 flag15,利用枚举B1016

# include void main(){int A,Da,B,Db;int i,j;int pa=0;int pb=0;scanf("%d %d %d %d",&A,&Da,&B,&Db);while(A!=0){i=A%10;if(i==Da)pa=pa*10+Da;A=A/10;}while(B!=0){j=B%10;

转载 关于使程序循环执行N次的技巧

如果要执行N次循环，除了使用for意外，更简介的用法是while（N--），比如int N=6;while(N--)printf("%d\n",T);

转载 flag14卡拉兹猜想

# include void main(){int a,i=0;scanf("%d",&a);while(a!=1){if(a%2==0)a=a/2;elsea=(3*a+1)/2;i++;}printf("\n%d\n",i);}

原创 今天开始学算法笔记，想去考一下PAT

2018年二月二日，今晚12点出考研成绩，想想看来，这一路都不知道自己想要啥，以为看了两三个月的数据结构就真的懂算法了，真是太可笑了，已经预感到这次考研成绩不会怎么样了，看看这次是否死的惨吧，如果不行的话，收拾一下东西，就该滚回去看书了，不过，在走之前，要把《算法笔记》这本书看完，还是老规矩，每天一个算法，每天学习不少于8小时，沉沦太久了，该醒醒了，愿归来时，还是少年。

原创 flag12每次从这个圆圈中删除第m个数字(第一个为当前数字本身,第二个为当前数字的下一个

# include //最笨的方法，创建一个单循环链表，然后找到，删除，返回即可# include typedef struct node{int data;struct node* next;}Node,*Pnode;Pnode creatnode();void travel(Pnode head);Pnode delect(Pnode head,int po