天梯+个人

7-1 判断素数 (10分)

注意：特判一

#include<bits/stdc++.h>
using namespace std;
#define N 10000
#define ll long long
int prime(int n){
if(n==1)return 0;
if(n==2||n==3)return 1;
if(n%6!=1&&n%6!=5)return 0;
for(int i=5;i<=sqrt(n+0.5);i+=6){
if(n%i==0||n%(i+2)==0)
return 0;
}
return 1;
}
int main(){
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--){
int n;
cin>>n;
if(prime(n))cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}

7-4 出生年 (15分)

当时忘特判0010这种情况了

#include<bits/stdc++.h>
using namespace std;
const int N=1e4+7;
#define ll long long
int main(){
int b,k;
cin>>b>>k;
int l=0;
set<char> a;
int count1=0;

while(l!=k){
int o=0,o1=1;
l=0;
//string s="";
a.clear();
//std::
string s=to_string(b);
//stringstream ss;
//ss<<b;
//ss>>s;
if(s.size()<4)o=1;
for(int i=0;i<s.size();i++){
if(s[i]=='0')o1=0;
a.insert(s[i]);}
//for(set<char>::iterator it=a.begin();it!=a.end();it++){
//cout<<*it<<" ";
//}
if(a.size()<4&&o&&o1){
l=a.size()+1;
// cout<<"l1="<<l<<endl;
}
else {l=a.size();
//cout<<"l2="<<l<<endl;
}
b++;
// cout<<"b="<<b<<endl;
count1++;
}
cout<<count1-1<<" ";
printf("%04d\n",b-1);
}

 7-11 互评成绩 (25分)

看了别人的

#include<bits/stdc++.h>
using namespace std;
int main()
{
int N, K,M;
cin >> N >> K >> M;
vector<double>s;
for (int i = 0; i < N; i++)
{
double sum = 0, Max = -1, Min = 101;
for (int j = 0; j < K; j++)
{
double a;
cin >> a;
sum += a;
Max = Max > a ? Max : a;
Min = Min < a ? Min : a;
}
s.push_back(sum - Max - Min);
}
sort(s.begin(), s.end());
for (int k = s.size() - M; k < s.size(); k++)
{
if (k != s.size() - M)cout << " ";
double t = K - 2;
printf("%.3f", s[k] / t);
}
return 0;
}

D - Drinks Choosing

看了别人的

 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1005;
int n, k, a[maxn], vis[maxn];
int main()
{
while (cin >> n >> k) {
int t = (n+1) / 2, res = 0;
memset(vis, 0, sizeof(vis));
for (int i = 0; i < n; i++) {
cin >> a[i];
if (vis[a[i]] && t >= 1) {
res += 2;
vis[a[i]] = 0;
t--;
}
else
vis[a[i]] = 1;
}
for (int i = 0; i <= k; i++)
if (vis[i] && t >= 1) {
res++;
t--;
}
cout << res << endl;
}
}