CCF真题201709

第一题：打酱油

#include<iostream>
using namespace::std;

int main() {
    int x;
    cin >> x;
    int fives = x / 50;
    int threes = (x - 50 * fives) / 30;
    cout<< fives * 7 + threes * 4 + (x - 50 *fives - 30 * threes)/10<<endl;
}

第二题：公共钥匙盒

#include <iostream>
#include <vector>
#include <algorithm>
using namespace::std;
struct action {
    bool is_return;
    int num;
    int time;
    action(const bool &x, const int &n, const int &y) : is_return(x), num(n), time(y){};
};

class publicKeys {
public:
    vector<int>allkeys;

    publicKeys(int n) {
        for (int i = 1; i <= n; i++) {
            allkeys.push_back(i);
        }
    }

    void take(action a) {
        for (int i = 0; i < allkeys.size(); i++) {
            if (allkeys[i] == a.num) {
                allkeys[i] = 0;
                break;
            }
        }
    }

    void return_key(action b) {
        for (int i = 0; i < allkeys.size(); i++) {
            if (allkeys[i] == 0) {
                allkeys[i] = b.num;
                break;
            }
        }
    }

    void print() {
        for(int i = 0; i < allkeys.size(); i++) {
            cout<<allkeys[i]<< " ";
        }
        cout<<endl;
    }

};

bool sortFun(const action &a1, const action &a2)
{
    if (a1.time == a2.time) {
        if (a1.is_return && !a2.is_return) {
            return true;
        }
        if (!a1.is_return && a2.is_return) {
            return false;
        }

        if (a1.is_return && a2.is_return) {
            return a1.num < a2.num;
        }
    }
	return a1.time < a2.time;//升序排列  
}

int main() {
    int N, K;
    cin >> N >> K;
    publicKeys p = publicKeys(N);
    vector<action>actions;
    for (int i = 0; i < K; i++) {
        int num, start, duration;
        cin >> num >> start >> duration;
        action a = action(false, num, start);
        action b = action(true, num, start + duration);
        actions.push_back(a);
        actions.push_back(b);
    }
    
    sort(actions.begin(), actions.end(), sortFun);

    // for (int i = 0; i < actions.size(); i++) {
    //     cout<<actions[i].num<< " " << actions[i].is_return<< " " << actions[i].time<<endl;
    // }

    for (int i = 0; i < K*2; i++) {
        if (actions[i].is_return) {
            //cout<<"ready to return "<<endl;
            p.return_key(actions[i]);
            //p.print();
        }
        else {
            //cout << "ready to take"<<endl;
            p.take(actions[i]);
            //p.print();
        }
    }
    p.print();
    return 0;
}

第四题：通信网络

#include <iostream>
#include <vector>
#include <stdlib.h>
#include <string.h>
using namespace::std;

int M,N;
vector<int>Graph[1005];
int visit[1005];
bool reach[1005][1005] = {0};

void dfs(int v, int start) {
    visit[v] = 1;
    reach[v][start] = reach[start][v] = true;
    for (int i = 0; i < Graph[v].size(); i++) {
        if (!visit[Graph[v][i]]){
            dfs(Graph[v][i], start);
        }
    }
}

int main() {
    cin >> N >> M;
    for (int i = 0; i < M; i++) {
        int u, v;
        cin >> u >> v;
        Graph[u].push_back(v);
    }

    for (int i = 1;  i <= N; i++) {
        memset(visit, 0, sizeof(visit));
        dfs(i, i);
    }

    int res = 0;
    
    

    for (int i = 1; i <= N; i++) {
        int  j;
        for (j = 1; j <= N; j++) {
            if (!reach[i][j])break;
        }
        //cout<<"J is : " << j << " "<<endl;
        if (j == N + 1)res++;
    }
    cout << res<<endl;
}

第五题：除法

#include <iostream>
#include <vector>

using namespace::std;

int main() {
    int N, M;
    cin >> N >> M;
    vector<int>numbers;
    for (int i = 0; i < N; i++) {
        int k;
        cin >> k;
        numbers.push_back(k);
    }
    for (int i = 0; i < M; i++) {
        int opt;
        cin >> opt;
        if (opt == 2) {
            int l, r;
            cin >> l >> r;
            int res = 0;
            for (int j = l - 1; j < r; j++){
                res += numbers[j];
            }
            cout << res<<endl;
        }

        if (opt == 1) {
            int l, r, v;
            cin >> l >> r >> v;
            for (int j = l - 1; j < r; j++) {
                if (numbers[j] % v == 0) {
                    numbers[j] = numbers[j]/v;
                }
            }
        }
    }
    return 0;
}