#515
SortSD
Se dau n
numere naturale. Afișați aceste numere ordonate crescător după suma divizorilor. Dacă două numere au aceeași sumă a divizorilor, se va afișa mai întâi cel mai mic.
Problema | SortSD | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #50372244 | Utilizator | |
Fișier | sortsd.cpp | Dimensiune | 1.54 KB |
Data încărcării | 06 Aprilie 2024, 21:08 | Scor / rezultat | 0 puncte |
sortsd.cpp: In function 'int main()': sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24: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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24:53: 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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24:55: 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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24:66: 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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24:79: 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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^ sortsd.cpp:24:92: 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,j,k,oglindit=0,max=-1000000,min=10000000,u,s=0,v[1001], p[1001]; ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | Raspuns gresit. | 20 | 0 | Exemplu | |
2 | 0 secunde | Raspuns gresit. | 40 | 0 | ||
3 | 0.024 secunde | Raspuns gresit. | 40 | 0 | ||
Punctaj total | 0 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema SortSD 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ă.