Pagini recente » Cod sursa (job #826222) | Cod sursa (job #326991) | Cod sursa (job #1564374) | Cod sursa (job #646295) | Cod sursa (job #2395194)
#include <fstream>
using namespace std;
ifstream f("cerere.in");
ofstream g("cerere.out");
int grad[100005],tata[100005],n;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>grad[i];
for(int i=1;i<n;i++)
{
int a,b;
f>>a>>b;
tata[b]=a;
}
for(int k=1;k<=n;k++)
{
int p=k;
int nr=0;
while(grad[p]!=0)
{
int x=grad[p];
for(int i=1;i<=x;i++)
{
p=tata[p];
}
nr++;
}
g<<nr<<" ";
}
return 0;
}