上海iai2020年3月月赛丙组

上海iai2020年3月月赛

打渔还是晒网

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fst ios::sync_with_stdio();cin.tie(0);cout.tie(0);
int main()
{
    fst
    int n;
    cin>>n;
    if(n%5==0||n%5==4)cout<<"Lying";
    else cout<<"Fishing";
    return 0;
}

数字加密

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fst ios::sync_with_stdio();cin.tie(0);cout.tie(0);
char work(char x)
{
    return (9-x+'0')+'0';
}
int main()
{
    string s;
    cin>>s;
    for(int i=0;i<s.size();i++)
    {
        s[i]=work(s[i]); 
    }
    swap(s[0],s[3]);
    swap(s[1],s[2]);
    cout<<s;
    return 0;
}

双质数

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fst ios::sync_with_stdio();cin.tie(0);cout.tie(0);
const int N = 1e6+500;
int prime[N];
bool vis[N];
int c=0;
void work()
{
    int n=1e6;
    for(int i=2;i<=n;i++)
    {
        if(!vis[i])prime[++c]=i;
        for(int j=1;prime[j]<=n/i;j++)
        {
            vis[prime[j]*i]=1;
            if(i%prime[j]==0)break;
        }
    }
}
bool isp(int n)
{
    if(n<2)return 0;
    for(int i=2;i<=n/i;i++)
    {
        if(n%i==0)return 0;
    }
    return 1;
    
}
int main()
{
    fst
    work();
//  cout<<isp(1);
    int l,r;
    cin>>l>>r;
    int id1=lower_bound(prime+1,prime+c+1,l)-prime;
    int id2=upper_bound(prime+1,prime+c+1,r)-prime-1;
    bool f=0;
    for(int i=id1;i<=id2;i++)
    {
        if(isp(prime[i]/10))
        {
            f=1;
            cout<<prime[i]<<endl;
        }
    }
    if(f==0)cout<<"None";
    return 0;
}

连乘问题

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fst ios::sync_with_stdio();cin.tie(0);cout.tie(0);
const int N = 1e6+500;
const int mod = 10000;
ll l[N],r[N],k[N];
int main()
{
    fst
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>k[i];
    l[0]=1;
    r[n+1]=1;
    for(int i=1;i<n;i++)l[i]=l[i-1]*k[i]%mod;
    for(int i=n;i>1;i--)r[i]=r[i+1]*k[i]%mod;
    for(int i=1;i<=n;i++)
    {
        cout<<l[i-1]*r[i+1]%mod<<endl;
    }
    return 0;
}

救援争先

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fst ios::sync_with_stdio();cin.tie(0);cout.tie(0);
const int N = 1e6+500;
const int mod = 10000;
struct point 
{
    string kk;
    int id;
    string arrive;
}s[N];
bool cmp(point a,point b)
{
    if(a.arrive==b.arrive)
    {
        if(a.kk==b.kk)return a.id<b.id;
        else return a.kk<b.kk;
    }
    else return a.arrive<b.arrive;
}
int main()
{
    fst
    int n;
    cin>>n;
    string bg,al;
    for(int i=1;i<=n;i++)
    {
        cin>>bg>>al;
        s[i].kk=bg;
        int h,m;
        h=bg[0]*10+bg[1]+al[0]*10+al[1]-22*'0';
        m=bg[3]*10+bg[4]+al[3]*10+al[4]-22*'0';
        h+=m/60;
        m%=60;
        string hh;
        string mm;
        while(h)hh+=h%10+'0',h/=10;
        while(m)mm+=m%10+'0',m/=10;
        reverse(hh.begin(),hh.end());
        reverse(mm.begin(),mm.end());
        while(hh.size()<2)hh='0'+hh;
        while(mm.size()<2)mm='0'+mm;
        s[i].arrive=hh+':'+mm;
        s[i].id=i;
    }
    sort(s+1,s+n+1,cmp);
    for(int i=1;i<=n;i++)cout<<s[i].id<<endl;
    
    return 0;
}