#236
Sort2
Fişierul text sort2.in
conţine, dispuse pe mai multe linii, cel mult 100
de numere naturale, cu cel mult 4
cifre fiecare. Să se afişeze în fişierul sort2.out
, în ordine crescătoare, toate numerele din fişierul sort2.in
care au cel mult 2
cifre.
Variante Bacalaureat 2009
Problema | Sort2 | Operații I/O |
sort2.in /sort2.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #50372602 | Utilizator | |
Fișier | sort2.cpp | Dimensiune | 1.11 KB |
Data încărcării | 06 Aprilie 2024, 21:41 | Scor / rezultat | 80 puncte |
sort2.cpp: In function 'int main()': sort2.cpp:25:9: warning: unused variable 'a' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:11: warning: unused variable 'd' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:13: warning: unused variable 'c' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:17: warning: unused variable 'b' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:19: warning: unused variable 'x' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:25: warning: unused variable 'l' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:29: warning: unused variable 'po' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:34: warning: unused variable 'ca' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:37: warning: unused variable 'cm' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:40: warning: variable 'n' set but not used [-Wunused-but-set-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:42: warning: unused variable 'r' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:44: warning: unused variable 'ok' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:53: warning: unused variable 'j' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:55: warning: unused variable 'k' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:57: warning: unused variable 'oglindit' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:68: warning: unused variable 'max' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:81: warning: unused variable 'min' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:94: warning: unused variable 'u' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:96: warning: unused variable 's' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^ sort2.cpp:25:101: warning: unused variable 'p' [-Wunused-variable] int a,d,c=0,b,x=1,m,l=1,po=0,ca,cm,n,r,ok=0,i=0,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0, p[1001]; ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 20 | 20 | Exemplu | |
2 | 0 secunde | Raspuns gresit. | 20 | 0 | ||
3 | 0 secunde | OK. | 60 | 60 | ||
Punctaj total | 80 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Sort2 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ă.