#636
Se dau cele n-1 muchii ale unui arbore cu n noduri și un nod k . Afișați vectorul de tați al arborelui cu rădăcina în k.
| Problema | Arbore | Operații I/O |
arbore.in/arbore.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #61136896 | Utilizator | |
| Fișier | arbore.cpp | Dimensiune | 590 B |
| Data încărcării | 20 Noiembrie 2025, 09:45 | Scor/rezultat | Eroare de compilare |
arbore.cpp:9:12: warning: missing terminating ' character [enabled by default] int x,y'; ^ arbore.cpp:9:5: error: missing terminating ' character int x,y'; ^ arbore.cpp:3:1: error: 'ifstream' does not name a type ifstream fin("arbore.in"); ^ arbore.cpp:4:1: error: 'ofstream' does not name a type ofstream fout("arbore.out"); ^ arbore.cpp: In function 'void citire()': arbore.cpp:8:5: error: 'fin' was not declared in this scope fin>>n>>m; ^ arbore.cpp:8:13: error: 'm' was not declared in this scope fin>>n>>m; ^ arbore.cpp:10:5: error: expected initializer before 'for' for(int I=1;i<=n;i++) ^ arbore.cpp:10:17: error: 'i' was not declared in this scope for(int I=1;i<=n;i++) ^ arbore.cpp:10:25: error: expected ';' before ')' token for(int I=1;i<=n;i++) ^ arbore.cpp:9:9: warning: unused variable 'x' [-Wunused-variable] int x,y'; ^ arbore.cpp: In function 'void df(int)': arbore.cpp:18:11: warning: statement has no effect [-Wunused-value] viz[x]==1; ^ arbore.cpp:20:12: error: 'a' was not declared in this scope if(a[x][i]==1 amd viz[i]==0) ^ arbore.cpp:20:23: error: expected ')' before 'amd' if(a[x][i]==1 amd viz[i]==0) ^ arbore.cpp:23:19: error: 'dfs' was not declared in this scope dfs(i); ^ arbore.cpp: In function 'int main()': arbore.cpp:30:10: error: 'dfs' was not declared in this scope dfs(k); ^ arbore.cpp:33:9: error: 'fout' was not declared in this scope fout<<t[i]<<" "; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Arbore face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.