天梯赛76-80

#include<stdio.h>
int main()
{
    int n,m;
    scanf("%d %d",&n,&m);
    for(int i=0;i<n;i++)
    {
        double k;
        scanf("%lf",&k);
        if(k<m)
            printf("On Sale! %.1lf\n",k);
    }
    return 0;
}

#include<stdio.h>
int main()
{
    int a[25];
    for(int i=0;i<24;i++)
        scanf("%d",&a[i]);
    while(1)
    {
        int n;
        scanf("%d",&n);
        if(n<0||n>23)
            break;
        printf("%d",a[n]);
        if(a[n]>50)
            printf(" Yes\n");
        else
            printf(" No\n");
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
	cin>>n>>m;
	getchar();
	int k=0;
	int f=1;
	string s;
	while(n--)
	{	
		getline(cin,s);
		if(s.find("qiandao")==-1&&s.find("easy")==-1)
			k++;
		if(k>m&&f==1)
		{
			cout<<s<<endl;
				f=0;
		}
		
	}
	if(k<=m&&f==1)
	cout<<"Wo AK le\n";
	return 0;
}

#include<stdio.h>
int main()
{
    int n,a[20005],min=1000000,max=-1,t1=0,t2=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
        if(a[i]>max)
        {
            max=a[i];
            t1=0;
        }
        if(a[i]==max)
        {
            t1++;
        }
        if(a[i]<min)
        {
            min=a[i];
            t2=0;
        }
        if(a[i]==min)
            t2++;
    }
    printf("%d %d\n%d %d",min,t2,max,t1);
    return 0;
}

#include <stdio.h>
int main()
{
    int a1 = 0,a2 = 0,n = 0,k = 0;
    int arr[10006]={0};
    scanf("%d%d%d",&a1,&a2,&n);
    int count = 2;
    if(n==0)
        return 0;
    arr[k++]=a1;
    arr[k++]=a2;
    while(k<=n)
    {
        int a3 = a1*a2;
        if(a3>9)
        {
            arr[k++] = a3/10;
            arr[k++] = a3%10;
            //a3/=10;
        }
        else
            arr[k++] = a3;
        a1 = a2;
        a2 = arr[count++];
    }
    int flag = 0;
    for(int i = 0;i<n;i++)
    {
        if(flag)
            printf(" ");
        printf("%d",arr[i]);
        flag  =1;
    }
    return 0;
}