L1-1 今天我要赢 (5 分)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    printf("I'm gonna win! Today!\n");
    printf("2022-04-23");
}

L1-2 种钻石 (5 分)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    cout<<a/b<<endl;
}

L1-3 谁能进图书馆 (10 分)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a,b,c,d;
    cin>>a>>b>>c>>d;
    bool f=false;
    if(c>d)
    {
        f=true;
        swap(c,d);
    }
    if(c<a)
    {
        if(d>=b)
        {
            if(f)printf("%d-Y %d-Y\n",d,c);
            else printf("%d-Y %d-Y\n",c,d);
            if(f)printf("qing 1 zhao gu hao 2\n");
            else printf("qing 2 zhao gu hao 1\n");
        }
        else if(d>=a)
        {
            if(f)printf("%d-Y %d-N\n",d,c);
            else printf("%d-N %d-Y\n",c,d);
            if(f)
            printf("1: huan ying ru guan\n");
            else printf("2: huan ying ru guan\n");
        }
        else
        {
            if(f)printf("%d-N %d-N\n",d,c);
            else printf("%d-N %d-N\n",c,d);
            printf("zhang da zai lai ba\n");
        }
    }
    else
    {
        if(f)printf("%d-Y %d-Y\n",d,c);
        else printf("%d-Y %d-Y\n",c,d);
        printf("huan ying ru guan\n");
    }
    return 0;
}

L1-4 拯救外星人 (10 分)

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int sum=1;
    int a,b;
    cin>>a>>b;
    for(int i=1;i<=(a+b);i++)sum*=i;
    cout<<sum<<endl;
    return 0;
}

L1-5 试试手气 (15 分)

#include <bits/stdc++.h>
using namespace std;
const int N=10;
bool a[N][N];
int main()
{
    for(int i=1;i<=6;i++)
    {
        int x;
        cin>>x;
        a[i][x]=true;
    }
    int k;
    cin>>k;
    vector<int>v;
    while(k--)
    {
        v.clear();
         for(int i=1;i<=6;i++)
        {
            for(int j=6;j;j--)
            {
                if(!a[i][j])
                {
                    v.push_back(j);
                    a[i][j]=true;
                    break;
                }
            }
        }
    }
    bool f=false;
    for(auto x:v)
    {
        if(f)cout<<' ';
        f=true;
        cout<<x;
    }
    return 0;
}

L1-6 斯德哥尔摩火车上的题 (15 分)

#include <bits/stdc++.h>
using namespace std;
string get(string a)
{
    string s;
    for(int i=1;i<a.size();i++)
    {
        if(a[i]%2==a[i-1]%2)
        s+=max(a[i]-'0',a[i-1]-'0')+'0';
    }
    return s;
}
int main()
{
    string a,b;
    cin>>a>>b;
    string c=get(a);
    string d=get(b);
    if(c==d)cout<<c<<endl;
    else 
    {
        cout<<c<<endl;
        cout<<d<<endl;
    }
    return 0;
}

L1-7 机工士姆斯塔迪奥 (20 分)

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int col[N],row[N];
int main()
{
    int n,m,q;
    cin>>n>>m>>q;
    int a=0,b=0;
    while(q--)
    {
        int x,y;
        cin>>x>>y;
        if(x)row[y]++;
        else col[y]++;
    }
    for(int i=0;i<N;i++)
    {
        if(row[i])b++;
        if(col[i])a++;
    }
    int sum=(n-a)*(m-b);
    cout<<sum<<endl;
    return 0;
}

L1-8 静静的推荐 (20 分)

#include <bits/stdc++.h>
using namespace std;
int n,k,s;
int main()
{
    cin>>n>>k>>s;
    int sum=0;
    vector<int>v[310];
    for(int i=0;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        v[x].push_back(y);
    }
    for(int i=175;i<=290;i++)
    {
        if(v[i].size())
        {
            int cnt=0;
            for(int j=0;j<v[i].size();j++)
            {
                if(v[i][j]>=s)sum++;
                else cnt++;
            }
            sum+=min(cnt,k);
        }
    }
    cout<<sum<<endl;
    return 0;
}

L2-1 插松枝 (25 分)

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int a[N];
int n,m,k;
vector<int>v;
stack<int>stk;
void print()
{
    bool f=false;
    for(auto x:v)
    {
        if(f)cout<<' ';
        f=true;
        cout<<x;
    }
    if(v.size())cout<<endl;
    v.clear();
}
int main()
{
    cin>>n>>m>>k;
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<n;)
    {
        if(v.size()==k)print();
        if(!v.size())
        {
            if(!stk.size())v.push_back(a[i++]);
            else
            {
                v.push_back(stk.top());
                stk.pop();
            }
        }
        else
        {
            if(!stk.size())
            {
                if(a[i]<=v.back())v.push_back(a[i++]);
                else stk.push(a[i++]);
            }
            else
            {
                if(stk.top()<=v.back())v.push_back(stk.top()),stk.pop();
                else
                {
                    if(a[i]<=v.back())v.push_back(a[i++]);
                    else
                    {
                        if(stk.size()>=m)print();
                        else stk.push(a[i++]);
                    }
                }
            }
        }
    }
    while(stk.size())
    {
        if(!v.size())v.push_back(stk.top()),stk.pop();
        else
        {
            if(stk.top()>v.back())
            {
                print();
            }
            else v.push_back(stk.top()),stk.pop();
        }
    }
    print();
    return 0;
}

L2-2 老板的作息表 (25 分)

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n;
struct node
{
    int h1,m1,s1;
    int h2,m2,s2;
    int start,ed;
}a[N];
bool cmp(node a,node b)
{
    return a.start<b.start;
}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++)
    {
        scanf("%d:%d:%d - %d:%d:%d",&a[i].h1,&a[i].m1,&a[i].s1,&a[i].h2,&a[i].m2,&a[i].s2);
        a[i].start=a[i].h1*60*60+a[i].m1*60+a[i].s1;
        a[i].ed=a[i].h2*60*60+a[i].m2*60+a[i].s2;
    }
    sort(a,a+n,cmp);
    if(a[0].start)
    {
        printf("00:00:00 - %02d:%02d:%02d\n",a[0].h1,a[0].m1,a[0].s1);
    }
    for(int i=0;i<n-1;i++)
    {
        if(a[i].ed!=a[i+1].start)
        {
            printf("%02d:%02d:%02d - %02d:%02d:%02d\n",a[i].h2,a[i].m2,a[i].s2,a[i+1].h1,a[i+1].m1,a[i+1].s1);
        }
    }
    if(a[n-1].ed!=23*60*60+59*60+59)
    {
        printf("%02d:%02d:%02d - 23:59:59\n",a[n-1].h2,a[n-1].m2,a[n-1].s2);
    }
}