上海市计算机学会竞赛平台 | YACS
T1打渔还是晒网
#include <bits/stdc++.h>
using namespace std;int main() {
int n;
cin >> n;
if (n % 5 < 4 && n % 5 > 0) {
cout << "Fishing";
} else {cout << "Lying";
}
T2数字加密
#include <bits/stdc++.h>
using namespace std;int main() {
int a;
cin >> a;
cout << (9999 - a) % 10 << (9999 - a) % 100 / 10 << (9999 - a) % 1000 / 100 << (9999 - a) / 1000 ;return 0;
}
T3双质数
#include <bits/stdc++.h>
using namespace std;int f(int k){
if (k==0||k==1)return 1;
for (int i=2;i<=sqrt(k);i++){
if (k%i==0)return 1;
}
return 0;
}int main() {
int n,m;
bool flag=false;
cin>>n>>m;
for (int i=n;i<=m;i++){
if (f(i)==0&&f(i/10)==0){
cout<<i<<endl;
flag=true;
}
}
if (flag==false)cout<<"None";
return 0;
}
T4连乘问题
#include <bits/stdc++.h>
using namespace std;
long long q[100100],h[100100];
int a[100100];int main() {
int n;
cin>>n;
q[0]=1,h[n+1]=1;
for (int i=1;i<=n;i++){
cin>>a[i];
q[i]=q[i-1]*a[i]%10000;
}
for (int i=n;i>=1;i--){
h[i]=h[i+1]*a[i]%10000;
}
for (int i=1;i<=n;i++){
cout<<q[i-1]*h[i+1]%10000<<endl;
}
return 0;
}
T5救援争先
#include <bits/stdc++.h>
using namespace std;struct qq{
int num,start,end;
}sum[1010];bool cmp(qq a1,qq a2){
if (a1.end!=a2.end)return a1.end<a2.end;
else {
if(a1.start!=a2.start)return a1.start<a2.start;
else return a1.num<a2.num;
}
}int main() {
int n;
cin>>n;
for (int i=1;i<=n;i++){
int a,b,c,d;
scanf("%d:%d %d:%d",&a,&b,&c,&d);
sum[i].num=i;
sum[i].end=a*60+b+c*60+d;
sum[i].start=a*60+b;
}
sort(sum+1,sum+1+n,cmp);
for (int i=1;i<=n;i++){
cout<<sum[i].num<<endl;
}
return 0;
}