天梯赛 2.1

L1-061 新胖子公式

#include<stdio.h>
int main()
{
	double w,h,c;
	scanf("%lf %lf",&w,&h);
	c=w/(h*h);
	printf("%.1lf\n",c);
	if(c>25)
	printf("PANG");
	else
	printf("Hai Xing");
	return 0;
 } 

L1-062 幸运彩票

#include<stdio.h>
int main(){
    int n,a=0,b=0;
    char s[7];
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%s",s);
        a=0;
        b=0;
        for(int j=0;j<3;j++){
            s[j]-='0';
            a+=s[j];
        }
        for(int j=3;j<6;j++){
            s[j]-='0';
            b+=s[j];
    }
        if(a==b)printf("You are lucky!\n");
        else printf("Wish you good luck.\n");
        }
    return 0;
}

L1-063 吃鱼还是吃肉 

#include<stdio.h>
int main()
{
  int n,s,t,a;
  scanf("%d",&n);
  while(n--)
  {
    scanf("%d %d %d",&a,&s,&t);
    if(a==1)//判断是不是男孩
    {
      if(s<130) printf("duo chi yu! ");
      if(s==130) printf("wan mei! ");
      if(s>130) printf("ni li hai! ");
      if(t<27) printf("duo chi rou!\n");
      if(t==27) printf("wan mei!\n");
      if(t>27) printf("shao chi rou!\n");
    }
    if(a==0)//判断是不是女孩
    {
      if(s<129) printf("duo chi yu! ");
      if(s==129) printf("wan mei! ");
      if(s>129) printf("ni li hai! ");
      if(t<25) printf("duo chi rou!\n");
      if(t==25) printf("wan mei!\n");
      if(t>25) printf("shao chi rou!\n");
    }
  }
  return 0;
}

 L1-064 估值一亿的AI核心代码

#include<stdio.h>
#include<string.h>
#define N 1005
int main(){
    int i,j,k,n,x;
    char a[N],b[N];
    char arr1[]="can you",arr2[]="could you";
    scanf("%d",&n);
    getchar();
    for(i=0;i<n;i++){
        gets(a);
        puts(a);
        printf("AI: ");
        j=0,k=0;
        while(a[j]!='\0'){
            if(a[j]!=' '){
                if(a[j]>='A'&&a[j]<='Z'&&a[j]!='I'){
                    b[k]=a[j]+32,k++;
                }else if(a[j]=='?'){
                    b[k]='!',k++;
                }else{
                    b[k]=a[j],k++;
                }
                j++;
            }else{
                if(j==0){
                    while(a[++j]==' ');
                }else{
                    while(a[++j]==' ');
                    if((a[j]>='a'&&a[j]<='z')||(a[j]>='A'&&a[j]<='Z')||(a[j]>='0'&&a[j]<='9')){
                        b[k]=' ';
                        k++;
                    }else continue;
                }
            }
        }
        b[k]='\0';
        x=0;
        while(b[x]!='\0'){
            if(b[x]!='c'&&b[x]!='I'&&b[x]!='m'){ 
                printf("%c",b[x]);
                x++;
            }else{
                if(b[x]=='I'){
                    if(x!=0){
                        if((b[x-1]>='0'&&b[x-1]<='9')||(b[x-1]>='A'&&b[x-1]<='Z')||(b[x-1]>='a'&&b[x-1]<='z')||(b[x+1]>='0'&&b[x+1]<='9')||(b[x+1]>='A'&&b[x+1]<='Z')||(b[x+1]>='a'&&b[x+1]<='z'))
                            printf("%c",b[x]),x++;
                        else
                        printf("you"),x++;
                        
                    }else{
                        if((b[x+1]>='0'&&b[x+1]<='9')||(b[x+1]>='A'&&b[x+1]<='Z')||(b[x+1]>='a'&&b[x+1]<='z'))
                            printf("%c",b[x]),x++;
                        else
                            printf("you"),x++;
                    }
                }else if(b[x]=='m'){
                    if(b[x+1]=='e'){
                        if(x!=0){
                            if((b[x-1]>='0'&&b[x-1]<='9')||(b[x-1]>='A'&&b[x-1]<='Z')||(b[x-1]>='a'&&b[x-1]<='z')||(b[x+2]>='0'&&b[x+2]<='9')||(b[x+2]>='A'&&b[x+2]<='Z')||(b[x+2]>='a'&&b[x+2]<='z'))
                                printf("%c",b[x]),x++;
                            else
                            printf("you"),x+=2;
                        }else{
                            if((b[x+2]>='0'&&b[x+2]<='9')||(b[x+2]>='A'&&b[x+2]<='Z')||(b[x+2]>='a'&&b[x+2]<='z')){
                                printf("%c",b[x]);
                                x++;
                            }else{
                                printf("you");
                                x=x+2;
                            }
                        }
                    }else{
                        printf("%c",b[x]);
                        x++;
                    }
                }else if(b[x]=='c'){
                    if(strstr(b+x,arr1)-(b+x)==0){
                        if(x!=0){
                            if((b[x-1]>='0'&&b[x-1]<='9')||(b[x-1]>='A'&&b[x-1]<='Z')||(b[x-1]>='a'&&b[x-1]<='z')||(b[x+7]>='0'&&b[x+7]<='9')||(b[x+7]>='A'&&b[x+7]<='Z')||(b[x+7]>='a'&&b[x+7]<='z'))
                            printf("%c",b[x]),x++;
                            else
                            printf("I can"),x=x+7;
                        }else{
                            if((b[x+7]>='0'&&b[x+7]<='9')||(b[x+7]>='A'&&b[x+7]<='Z')||(b[x+7]>='a'&&b[x+7]<='z'))
                            printf("%c",b[x]),x++;
                            else
                            printf("I can"),x=x+7;
                        }
                    }else if(strstr(b+x,arr2)-(b+x)==0){
                        if(x!=0){
                            if((b[x-1]>='0'&&b[x-1]<='9')||(b[x-1]>='A'&&b[x-1]<='Z')||(b[x-1]>='a'&&b[x-1]<='z')||(b[x+9]>='0'&&b[x+9]<='9')||(b[x+9]>='A'&&b[x+9]<='Z')||(b[x+9]>='a'&&b[x+9]<='z'))
                            printf("%c",b[x]),x++;
                            else
                            printf("I could"),x=x+9;
                        }else{
                            if((b[x+9]>='0'&&b[x+9]<='9')||(b[x+9]>='A'&&b[x+9]<='Z')||(b[x+9]>='a'&&b[x+9]<='z')){
                                printf("%c",b[x]),x++;
                            }else{
                                printf("I could");
                                x=x+9;
                            }
                        }
                    }else{
                        printf("%c",b[x]);
                        x++;
                    }
                }
            }
        }
        printf("\n");
    }
    return 0;
}

L1-065 嫑废话上代码 

 

#include <stdio.h>
int main()
{
    printf("Talk is cheap. Show me the code.");
    return 0;
}

 蓝桥杯 日期统计

 

#include <stdio.h>

int main() {
    int y, m, d, i, j, k, h, sum = 0;
    int a[100] = {
        5, 6, 8, 6, 9, 1, 6, 1, 2, 4,
        9, 1, 9, 8, 2, 3, 6, 4, 7, 7,
        5, 9, 5, 0, 3, 8, 7, 5, 8, 1,
        5, 8, 6, 1, 8, 3, 0, 3, 7, 9,
        2, 7, 0, 5, 8, 8, 5, 7, 0, 9,
        9, 1, 9, 4, 4, 6, 8, 6, 3, 3,
        8, 5, 1, 6, 3, 4, 6, 7, 0, 7,
        8, 2, 7, 6, 8, 9, 5, 6, 5, 6,
        1, 4, 0, 1, 0, 0, 9, 4, 8, 0,
        9, 1, 2, 8, 5, 0, 2, 5, 3, 3
    };

    int calendar[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
    for ( m = 1; m <= 12; m++) {
        for (d = 1; d <= calendar[m]; d++) {
            int data[8] = {2, 0, 2, 3, m / 10, m % 10, d / 10, d % 10};
            int k = 0;
            for (i = 0; i < 100; i++) {
                if (a[i] == data[k]) {
                    k++;
                }
                if (k == 8) {
                    sum++;
                    break;
                }
            }
        }
    }
    printf("%d", sum);
    return 0;

}

  • 2
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值