csp201912

报数

实现

 #include<bits/stdc++.h>
using namespace std;

int ans[4];

int main()
{
    
    
    int n;
    cin >> n;
    int k = 0, i = -1;
    while (n)
    {
    
    
        i ++ ;
        k ++ ;
        if (k % 7 == 0 || to_string(k).find('7') != -1) ans[i % 4] ++ ;
        else n -- ;
    }
    for (int i = 0; i < 4; i ++ ) cout << ans[i] << endl;
    return 0;
}

回收站选址

实现

#include<bits/stdc++.h>
#define x first
#define y second

using namespace std;

typedef pair<int, int> PII;
const int N = 1010;

int n;
PII q[N];
int ans[5];
int dx[8] = {
    
    -1, -1, -1, 0, 1, 1, 1, 0};
int dy[8] = {
    
    -1, 0, 1, 1, 1, 0, -1, -1};

int main()
{
    
    
    cin >> n;
    for (int i = 0; i < n; i ++ ) cin >> q[i].x >> q[i].y;
    for (int i = 0; i < n; i ++ )
    {
    
    
        int s[8] = {
    
    0};
        for (int j = 0; j < n; j ++ )
            for (int k = 0; k < 8; k ++ )
                if (q[i].x + dx[k] == q[j].x && q[i].y + dy[k] == q[j].y)
                    s[k] ++ ;
        if (s[1] && s[3] && s[5] && s[7])
            ans[s[0] + s[2] + s[4] + s[6]] ++ ;
    }

    for (int i = 0; i < 5; i ++ ) cout << ans[i] << endl;
    return 0;
}