zisu 1001 1002 1003

#include<iostream>//1001 by zisu123
#include<algorithm>
using namespace std;
int isPrime(int i)
{   /*判断o是否是素数*/
    int n,flag=1;
    if(i<2)flag=0;                 /*1不是素数，素数都要大于1*/
    for(n=2;n<i;n++)
        if(i%n==0){flag=0;break;}  /*如果在2~i-1之间i有其他因子，则i不是素数,flag置0*/
    if(flag==1)
        return 1;           /*i是素数返回1*/
    else
        return 0;          /*i不是素返回0*/
} 
 
int main()
{
    int n,k; 
    int a[10005];
    cin>>n>>k;
     
         for (int i=1;i<=n;++i)
         {
           cin>>a[i]; 
         }
        sort(a+1,a+n+1);
        int ans=a[n-k+1]-a[k];
        if(isPrime(ans))
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
        cout<<ans;
     
    return 0;
}
 

#include<iostream>//1002
#include<cstdio>
#include<cstring>
using namespace std;
typedef struct stu{
    char name[55];
    int score;
    int value;
    char leader;
    char west;
    int paper;
}stu;
int main()
{
    int n;
    stu ss[105];
    int sum;
    int max,temp;
    char maxname[55];
    int i,j,k;
    while(cin>>n)
    {
        max=0;
        sum=0;
        memset(maxname,0,sizeof(maxname));
        for(i=0;i<n;i++)
        {
            temp=0;
            cin>>ss[i].name>>ss[i].score>>ss[i].value>>ss[i].leader>>ss[i].west>>ss[i].paper;
            if(ss[i].score>80&&ss[i].paper>=1)    {temp+=8000;}
            if(ss[i].score>85&&ss[i].value>80){temp+=4000;}
            if(ss[i].score>90) temp+=2000;
            if(ss[i].score>85&&ss[i].west=='Y') temp+=1000;
            if(ss[i].value>80&&ss[i].leader=='Y') temp+=850;
            if(temp>max){max=temp,strcpy(maxname,ss[i].name);}
            sum+=temp;
        }
        printf("%s\n",maxname);
        printf("%d\n",max);
        printf("%d\n",sum);
    }
     
}

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int M,T,U,F,D;
    int i;
    char ch;
    int time,num;
    while(~scanf("%d%d%d%d%d",&M,&T,&U,&F,&D))
    {
        time=0;
        int ff=1;
        for(i=0;i<T;i++)
        {
            cin>>ch;
            if(ch=='u'||ch=='d')
                time=time+U+D;
            else
                time=time+F+F;
            if(time>M&&ff==1){num=i;ff=0;}
        }
        cout<<num<<endl;
    }
    return 0;
}