Submission #1143281

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143281		marinescupaul	Triumphal arch (POI13_luk)	C++20	0 / 100	95 ms	1584 KiB

luk

#include <iostream>
using namespace std;

int main()
{
    int n,i,j,a,b;
    cin>>n;
    int v[n+1];
    for(i=1;i<n+1;i++){
		v[i]=0;
    }
    for(i=1;i<n;i++){
		cin>>a>>b;
		if(a<b){
			v[a]++;
		} else {
			v[b]++;
		}
    }
    int max=0;
    for(i=1;i<n+1;i++){
		if(v[i]>max) max=v[i];
    }

    cout<<max;
    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