csp每日习题

欢迎加入：qq群号：1054587486

做题链接：https://csp.ccf.org.cn/csp/index.action?_access_code=1584494752035

点击模拟考试进入

1：201912-1      

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

int n;

bool in(int x){
    while(x){
        int t = x % 10;
        x /= 10;
        if(t == 7) return true;
    }
    return false;
}

int main(){
    cin >> n;
    int a = 0, b = 0, c = 0, d = 0;
    for(int i = 1;i <= n;++i){
        int t = i / 7;
        int m = i % 4;
        bool flag = in(i);
        if(t * 7 == i || flag){
            ++n;
            switch(m){
                case 0: {++d; break;}
                case 1: {++a; break;}
                case 2: {++b; break;}
                case 3: {++c; break;}
                default: break;        
            }
        }
    }
    cout << a << endl;
    cout << b << endl;
    cout << c << endl;
    cout << d << endl;
    return 0;
}

2：201912-2

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

const int N = 1e3+10;

struct Node{
    int x, y;
    Node(int a, int b){
        x = a, y = b;
    }
};
int n;

struct HashFunc
{
    std::size_t operator()(const Node &key) const 
    {
        using std::size_t;
        using std::hash;

        return ((hash<int>()(key.x) ^ (hash<int>()(key.y) << 1)) >> 1);
    }
};

struct EqualKey
{
    bool operator () (const Node &lhs, const Node &rhs) const
    {
        return lhs.x == rhs.x && lhs.y == rhs.y;
    }
};

int main(){
    unordered_map<Node, bool, HashFunc, EqualKey> hash;
    vector<Node> v;
    cin >> n;
    for(int i = 0;i < n;++i){
        int x, y;
        cin >> x >> y;
        v.push_back({x, y});
        hash[v[i]] = true;
    }
    int res[5] = {0};
    for(auto t : v){
        int x = t.x, y = t.y;
        if(hash[Node(x-1, y)] && hash[Node(x+1, y)] && hash[Node(x, y+1)] && hash[Node(x, y-1)]){
            int ans = 0;
            if(hash[Node(x-1, y-1)]) ++ans;
            if(hash[Node(x+1, y-1)]) ++ans;
            if(hash[Node(x-1, y+1)]) ++ans;
            if(hash[Node(x+1, y+1)]) ++ans;
            res[ans] ++;
        }
    }
    for(int i = 0;i < 5;++i)cout << res[i] << endl;
    return 0;
}

持续更新中...