Submission #1143338

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143338		catshavefeet	Triumphal arch (POI13_luk)	C++20	0 / 100	103 ms	1588 KiB

luk

#include <iostream>

using namespace std;

int n, C[300005], cmax, a, b;

int main()
{
    cin >> n;
    for (int i = 1; i < n; i++) {
        cin >> a >> b;
        C[a]++;
        C[b]++;
    }
    for (int i = 1; i <= n; i++) {
        if(C[i] > cmax) {
            if (i == 1) {
                cmax = C[i];
            }
            else {
                cmax = C[i] - 1;
            }
        }
    }
    cout << cmax;

    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