寒假限时训练（2）G、H、I

HuiPuKui · 2022-01-17 18:39:19 · 个人记录

G - Vasily the Bear and Triangle

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1000000;
ll x, y;
int main()
{
    scanf("%lld%lld", &x, &y);
    ll sum;
    sum = abs(x) + abs(y);
    if (x > 0 && y > 0) //四个象限
        printf("0 %lld %lld 0\n", sum, sum);
    else if (x < 0 && y > 0)
        printf("%lld 0 0 %lld\n", -1 * sum, sum);
    else if (x < 0 && y < 0)
        printf("%lld 0 0 %lld\n", -1 * sum, -1 * sum);
    else
        printf("0 %lld %lld 0\n", -1 * sum, sum);
    return 0;
}

H - Do Not Be Distracted!

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
#include<queue>
using namespace std;
const int N=1e4+10;
int a[N],b[N],c[N],d[N];
int biao[N];
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        string s;
        cin>>s;
        memset(biao,0,sizeof(biao));
        int flag=0;
        for(int i=0;i<s.size();i++)
        {
            if(biao[s[i]]==0)//该事件未被标记，即这件事之前没有做过
            {
                if(s[i]!=s[i+1])//遇到下一件的事，把刚才的事标记
             {
                biao[s[i]]=1;
             }
            }
            else
            {
                cout<<"NO"<<endl;
                flag=1;
                break;
            }
        }
        if(flag==0)
        cout<<"YES"<<endl;
    }
    return 0;
}

I - Hungry Sequence

#include <bits/stdc++.h>
using namespace std;
int n, m;
int main()
{
    int n;
    cin >> n;
    for (int i = 100000; i < 100000 + n; i++) //中间有n个数
    {
        cout << i << " ";
    }
    puts("");
    return 0;
}