제출 #122476

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
122476		popovicirobert	새로운 문제 (POI13_luk)	C++14	0 / 100	77 ms	5444 KiB

luk

#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

/*
const int MOD = ;

inline void mod(int &x) {
    if(x >= MOD)
        x -= MOD;
}

inline void add(int &x, int y) {
    x += y;
    mod(x);
}

inline void sub(int &x, int y) {
    x += MOD - y;
    mod(x);
}


inline void mul(int &x, int y) {
    x = (1LL * x * y) % MOD;
}
*/

using namespace std;


int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin >> n;

    vector <int> deg(n + 1);
    for(i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        deg[x]++, deg[y]++;
    }

    int ans = 0;
    for(i = 1; i <= n; i++) {
        ans = max(ans, deg[i] - (i != 1));
    }

    cout << ans;

    //cin.close();
    //cout.close();
    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10