天梯赛61-65

#include<stdio.h>
int main()
{
    double h,w,t;
    scanf("%lf %lf",&w,&h);
    t=w/(h*h);
    if(t>25)
        printf("%.1lf\nPANG",t);
    else
        printf("%.1lf\nHai Xing",t);
    return 0;
}
#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int t,x=0,y=0;
        scanf("%d",&t);
        x+=t/100000;
        x+=(t%100000)/10000;
        x+=(t%10000)/1000;
        y+=(t%1000)/100;
        y+=(t%100)/10;
        y+=t%10;
        if(x==y)
            printf("You are lucky!\n");
        else
            printf("Wish you good luck.\n");
    }
    return 0;
}
#include<stdio.h>
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
        int t,h,w;
        scanf("%d %d %d",&t,&h,&w);
        if(t==0)
        {
            if(h<129)
                printf("duo chi yu! ");
            else if(h==129)
                printf("wan mei! ");
            else
                printf("ni li hai! ");
            if(w<25)
                printf("duo chi rou!\n");
            else if(w==25)
                printf("wan mei!\n");
            else
                printf("shao chi rou!\n");
        }
        else
        {
            if(h<130)
                printf("duo chi yu! ");
            else if(h==130)
                printf("wan mei! ");
            else
                printf("ni li hai! ");
            if(w<27)
                printf("duo chi rou!\n");
            else if(w==27)
                printf("wan mei!\n");
            else
                printf("shao chi rou!\n");
        }
    }
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)
    {
        char s[1005];
        getchar();
        scanf("%[^\n]",s);
        printf("%s\n",s);
        int len=strlen(s);
        for(int i=0;i<len;i++)
        {
            if(s[i]==' '&&(s[i+1]==' '||s[i+1]==','||s[i+1]=='?'||s[i+1]=='!'||s[i+1]=='.'||s[i+1]==39||i==0))
            {
                len--;
                for(int j=i;j<len;j++)
                {
                    s[j]=s[j+1];
                }
                i--;
            }
        }
        printf("AI: ");
        for(int i=0;i<len;i++)
        {
            int f=1;
            if(s[i]>='A'&&s[i]<='Z'&&s[i]!='I')
                s[i]+=32;
            if((i==0||s[i-1]==' '||s[i-1]==','||s[i-1]=='?'||s[i-1]=='!'||s[i-1]=='.')&&s[i]=='c'&&s[i+1]=='a'&&s[i+2]=='n'&&s[i+3]==' '&&s[i+4]=='y'&&s[i+5]=='o'&&s[i+6]=='u'&&(s[i+7]==' '||s[i+7]==','||s[i+7]=='?'||s[i+7]=='!'||s[i+7]=='.'))
            {
                f=0;
                printf("I can");
                i+=6;
            }
            if((i==0||s[i-1]==' '||s[i-1]==','||s[i-1]=='?'||s[i-1]=='!'||s[i-1]=='.')&&s[i]=='c'&&s[i+1]=='o'&&s[i+2]=='u'&&s[i+3]=='l'&&s[i+4]=='d'&&s[i+5]==' '&&s[i+6]=='y'&&s[i+7]=='o'&&s[i+8]=='u'&&(s[i+9]==' '||s[i+9]==','||s[i+9]=='?'||s[i+9]=='!'||s[i+9]=='.'))
            {
                f=0;
                printf("I could");
                i+=8;
            }
            if((i==0||s[i-1]==' '||s[i-1]==','||s[i-1]=='?'||s[i-1]=='!'||s[i-1]=='.')&&s[i]=='I'&&(s[i+1]==' '||s[i+1]==','||s[i+1]=='?'||s[i+1]=='!'||s[i+1]=='.'))
            {
                f=0;
                printf("you");
            }
            if((i==0||s[i-1]==' '||s[i-1]==','||s[i-1]=='?'||s[i-1]=='!'||s[i-1]=='.')&&s[i]=='m'&&s[i+1]=='e'&&(s[i+2]==' '||s[i+2]==','||s[i+2]=='?'||s[i+2]=='!'||s[i+2]=='.'))
            {
                f=0;
                printf("you");
                i+=1;
            }
            if(s[i]=='?')
            {
                f=0;
                printf("!");
            }
            if(f==1)
                printf("%c",s[i]);
        }
        printf("\n");
    }
    return 0;
}
#include<bits/stdc++.h>
using namespace std;
int main()
{
    printf("Talk is cheap. Show me the code.");
    return 0;
}

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值