Cod sursa(job #2932251)
Utilizator | Data | 2 noiembrie 2022 13:07:56 | |
---|---|---|---|
Problema | Problema rucsacului | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int v[50 + 5] , con = 0;
int main() {
for (int i = 50; i >= 1; i--) v[i] = i;
for (int i = 1; i <= 50; i++)
for (int j = i + 1; j <= 50; j++) {
con++;
if (v[i] > v[j]) swap(v[i], v[j]);
}
cout << con;
return 0;
}