糖糖的博客

//鹅鹅鹅，太粗鲁了//别看了，我都看不下去，请绕路#include<stdio.h>#include<math.h>print(int a1,int b1,int f);//输出=号后面的结果void yuefen(int *p1,int *p2);//将m,n进行约分void judge(int *p1,int *p2);//判断m,n不同正负时的情况void main(){ int a1,b1,a2,b2; int m,n,t; sc..

//测试点2坏掉的键可能是空格键或者什么都没有，不能用%s,还需要注意'_'表示空格。。。过不了，嘤嘤嘤。。。//测试点4#include<stdio.h>#include<string.h>#define N 100001void main(){ int i,j,f1=0,f2=0,t;//f1用来判断是否存在'+',f2判断是否存在'_' int len1,len2; char str[N]; char a[N]; gets.

#include<stdio.h>struct sch{ int school; int score;};void main(){ struct sch stu[100000]; int i,N,sum[100000]={0}; scanf("%d",&N); for(i=0;i<N;i++){ scanf("%d%d",&stu[i].school,&stu[i].score); .

#include<stdio.h>void main(){ int i,j,z,N; int t=0,sum,cnt=0; char a[20]; int power[]={7,9,10,5,8,4,2,1,6,3,7,9,10,5,8,4,2}; char M[]={'1','0','X','9','8','7','6','5','4','3','2'}; scanf("%d",&N); for(i=0;i<N;i+..

#include<stdio.h>#include<stdlib.h>#define N 100000int compare(const void *a,const void *b){ return *(long long*)a-*(long long*)b;}void main(){ int n,p; int i,j; long long a[N],max; scanf("%d%d",&n,&p); f.

#include<stdio.h>void main(){ int count=0,i,j; char a[81]={0},b[81]={0},c[81]={0}; scanf("%s%s",a,b); for(i=0;a[i]!='\0';i++){ if(a[i]==b[i-count]){ continue; }else{ count++; if(a[i.

//测试点3,合理的年龄为0时，不加空格//测试点4，比较年龄时，可能会导致超时，将数据存储为string类型直接比较//测试点2测边界值的又出了问题，不晓得。。。#include<stdio.h>#define N 100000struct people{ char name[6]; int year; int month; int day;};void swap(struct people *a,struct people *b);void.

//注意输入6的时候测试点2不通过#include<stdio.h>void main(){ int i,n,sum=0,t=1,j; int m; char c; scanf("%d %c",&n,&c); for(i=3;(n-2*sum-1)>2*i;i+=2){ sum=sum+i; t++; } for(i=1;i<=t-1;i++){ for..

#include<stdio.h>#define CLK_TCK 100void main(){ int t1,t2; int s,h,m; scanf("%d%d",&t1,&t2); s=(int)((double)(t2-t1)/CLK_TCK+0.5); h=(s/60)/60; m=(s/60)-h*60; s=s%60; printf("%02d:%02d:%02d",h,m,s);}

#include<stdio.h>struct node{ int add; int num; int next;}a[100000],b[100000],c[100000];void main(){ int beginadd,N,K; int index,s,y,j,i; int number=0; int pos=0; scanf("%d%d%d",&beginadd,&N,&K); ..

#include<stdio.h>#define N 10000void main(){ int i,t,m=0,n;//m代表小数点所在的位置 char f1,f2,p;//n代表E的位置 char a[N]={0}; scanf("%c",&f1); for(i=0;scanf("%c",&a[i]);i++){ if(a[i]=='.')m=i; if(a[i]=='E'){ ..

#include<stdio.h>int main(){ int i; int a[10]; for(i=0;i<10;i++){ scanf("%d",&a[i]); } for(i=1;i<10;i++){ if(a[i]!=0){ a[i]--; printf("%d",i); break; } } for(i=0;i<10;i++){ while(a[i]--){ printf("%d",i); .

#include<stdio.h>void main(){ int A,B,S; int D,a[300],i=0; scanf("%d%d%d",&A,&B,&D); S=A+B; for(i=0;S>=D;i++){ a[i]=S%D; S=S/D; } a[i]=S; for(;i>=0;i--){ printf("%d",a[i]);.

#include<stdio.h>int main(){ int i; char N[1001]; int D[10]={0}; for(i=0;~scanf("%c",&N[i]);i++){ switch(N[i]) { case '0':D[0]++;continue; case '1':D[1]++;continue; case '2':.

//测试点3所有库存总和小于我的需求量#include<stdio.h>#include<stdlib.h>typedef struct { double s,a,b;}thing;thing it[1001];int cmp(const void *a,const void *b){ return ((thing *)b)->s>((thing *)a)->s;}void main(){ int i; in.

#include<stdio.h>int sort(int a[],int b);void main(){ int n,t1,t2; int a[4]; scanf("%d",&n); while(1) { a[0]=n/1000; a[1]=(n%1000)/100; a[2]=(n%100)/10; a[3]=n%10; t1=sort(a,1); ..

#include<stdio.h>char max(int a,int b,int c);void main(){ int AwinJ=0,AwinB=0,AwinC=0; int BwinJ=0,BwinB=0,BwinC=0; int n,i,Awin,Bwin,Ping; char a,b; scanf("%d",&n); for(i=0;i<n;i++){ scanf(" %c %c",&a..

#include<stdio.h>#include<string.h>#define N 1001//注意只有一位数的时候记得讨论void main(){ char arr[N]={0}; int i; int div=0; int len=0; int ret=0; scanf("%s",arr); scanf("%d",&div); len=(int)strlen(arr); for(i=0.

#include<stdio.h>#define N 10int item(char s,int n);void main(){ char a[N]={0},b[N]={0}; char da,db; int i,count1=0,count2=0; scanf("%s %c %s %c",a,&da,b,&db); for(i=0;a[i]!='\0'||b[i]!='\0';i++){ if(a[i]==da..

#include<stdio.h>#include<stdlib.h>#define max 100000typedef struct student{ int num; int de; int cai;}stu;int compare(const void *a,const void *b);void printtype(stu s[],int j);void main(){ int N,L,H; int i,i1,i..

#include<stdio.h>始终有一个测试点错误 #include<string.h>void main(){ int i,j,t=0; char c; char a[4][64]; for(i=0;i<4;i++){ scanf("%s",a[i]); } i=0; for(j=0;j<strlen(a[0]);j++){ if(a[i][j]==a[i+1][j]).

#include<stdio.h>#include<math.h>void main(){ int i,j,t=0;//注意初始值已经有一个，后面需要剪掉 int m,n; int a[110001]; int b[100000]; scanf("%d%d",&m,&n); for(i=0;i<110000;i++){ a[i]=i; } a[1]=0; for(i=.

#include<stdio.h>void main()//sum2可能是0，所以测试点8通不过{ int n,max=0; int i,a,t=1,f=0; int sum1=0,sum2=0,sum3=0; int count1=0,count2=0; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%d",&a); switch(a%5) ..

#include<stdio.h>void main(){ long a,b,c; int t,i; scanf("%d",&t); for(i=0;i<t;i++){ scanf("%ld%ld%ld",&a,&b,&c); if((a+b)>c){ printf("Case #%d: true\n",i+1); }else{ .

#include<stdio.h>void main(){ int a[100][2]; int i,m,t=1; for(i=0;i<100;i++){ if(scanf("%d%d",&a[i][0],&a[i][1])!=EOF){ t=1; }else{ t=0; } if(t==0)break; } m=i;.

#include<stdio.h>void main(){ char a[80][85]; int i=0; for(i=0;scanf("%s",a[i])!=EOF;i++); printf("%s",a[--i]); for(--i;i>=0;i--){ printf(" %s",a[i]); } printf("\n");}

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

方法一#include<stdio.h>#include<math.h>int judge(int i);void main(){ int n,i,j=2,count=0; scanf("%d",&n); for(i=3;i<=n;i++){ if(judge(i)){ if((i-j)==2){ count++; } .

#include<stdio.h>#include<string.h>void main(){ int i,a,b,c; int n; scanf("%d",&n); a=n%10; b=(n/10)%10; c=n/100; for(i=0;i<c;i++){ printf("B"); } for(i=0;i<b;i++){ printf("S");.

#include<stdio.h>#include<string.h>struct{ char name[15]; char num[15]; float score;}student[10];void main(){ int i,j,n; float item; char a[15],b[15]; scanf("%d\n",&n); for(i=0;i<n;i++){ s.

#include<stdio.h>#include<string.h>int judge(char *p);void main(){ int i,n; char a[10][110]; scanf("%d",&n); for(i=0;i<n;i++){ scanf("%s",a[i]); if(judge(a[i])==1) printf("YES\n"); ..

#include<stdio.h>#include<string.h>void main(){ int i,sum=0,t; char a[105],b[5],pinying[][10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"}; gets(a); for(i=0;i<strlen(a);i++){ sum=sum+a[i]-'0'; } .

#include<stdio.h>int main(){ int n; int count=0; scanf("%d",&n); while(n!=1){ if(n%2==0){ n=n/2; }else{ n=(3*n+1)/2; } count++; } printf("%d",count);}