#677
NiveleBin
Se dă un arbore binar care conține valori numere naturale. În acest arbore rădăcina este considerată pe nivelul 0
, descendenții direcți ai rădăcinii pe nivelul 1
, etc. Să se determine numărul de nivele k
din arbore și, pentru fiecare nivel i
de la 0
la k
, numărul de noduri situate pe acel nivel.
Problema | NiveleBin | Operații I/O |
nivelebin.in /nivelebin.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #50219294 | Utilizator | |
Fișier | nivelebin.cpp | Dimensiune | 1.04 KB |
Data încărcării | 01 Aprilie 2024, 11:02 | Scor / rezultat | Eroare de compilare |
nivelebin.cpp:1:327: warning: extra tokens at end of #include directive [enabled by default] /******************************************************************************Online C++ Compiler.Code, Compile, Run and Debug C++ program online.Write your code in this editor and press "Run" button to compile and execute it.*******************************************************************************/#include <iostream>#include <fstream>using namespace std;ifstream fin("nivelebin.in");ofstream fout("nivelebin.out");int val[1001],st[1001],dr[1001];int t[1001];int niv[1001],f[1001];int nivel(int x) ^ nivelebin.cpp:1:336: warning: invalid suffix on literal; C++11 requires a space between literal and identifier [-Wliteral-suffix] /******************************************************************************Online C++ Compiler.Code, Compile, Run and Debug C++ program online.Write your code in this editor and press "Run" button to compile and execute it.*******************************************************************************/#include <iostream>#include <fstream>using namespace std;ifstream fin("nivelebin.in");ofstream fout("nivelebin.out");int val[1001],st[1001],dr[1001];int t[1001];int niv[1001],f[1001];int nivel(int x) ^ nivelebin.cpp:2:1: error: expected unqualified-id before '{' token { ^ nivelebin.cpp: In function 'int main()': nivelebin.cpp:10:5: error: 'fin' was not declared in this scope fin>>n; ^ nivelebin.cpp:12:19: error: 'val' was not declared in this scope { fin>>val[i]>>st[i]>>dr[i]; ^ nivelebin.cpp:12:27: error: 'st' was not declared in this scope { fin>>val[i]>>st[i]>>dr[i]; ^ nivelebin.cpp:12:34: error: 'dr' was not declared in this scope { fin>>val[i]>>st[i]>>dr[i]; ^ nivelebin.cpp:13:9: error: 't' was not declared in this scope t[st[i]]=t[dr[i]]=i; ^ nivelebin.cpp:16:12: error: 't' was not declared in this scope if(t[i]==0) ^ nivelebin.cpp:20:27: error: 'nivel' was not declared in this scope { int q=nivel(i); ^ nivelebin.cpp:23:9: error: 'f' was not declared in this scope f[q]++; ^ nivelebin.cpp:24:10: error: 'fout' was not declared in this scope } fout<<max1+1<<'\n'; ^ nivelebin.cpp:26:15: error: 'f' was not declared in this scope fout<<f[i]<<' '; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema NiveleBin 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ă.