题目在这里,可以超市购买,之后应该会放到题库里边
7-1 Prime Day (20分)
#include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
using namespace std;
string date;
bool isPrime(int num){
if(num<=1) return false;
for(int i=2;i*i<=num;++i){
if(num%i==0) return false;
}
return true;
}
int getNum(string str){
int len=str.length(),ans=0;
for(int i=0;i<len;++i){
ans=ans*10+(str[i]-'0');
}
return ans;
}
int main(){
cin>>date;
int flag=1;
while(1){
printf("%s ",date.c_str());
int temp=getNum(date);
if(isPrime(temp)==true) printf("Yes\n");
else{
printf("No\n");
flag=0;
}
if(date.length()==1) break;
date=date.substr(1,date.length());
}
if(flag==1) printf("All Prime!\n");
return 0;
}
7-2 The Judger (25分)
#include<stdio.h>
#include<vector>
#include<string.h>
#include<algorithm>
#include<math.h>
#include<unordered_set>
using namespace std;
const int Maxn=100010;
int N,M;
int isExisted[Maxn],st_differences[Maxn];
int isOut[15];
vector<int> players[15],