EMF SUMS

Comments

Post a Comment

Popular posts from this blog

tcs1dsu

 #include <stdio.h> int main() { int n, s = 0, t, i, j; scanf("%d", &n); int arr[n]; for (i = 0; i < n; i++) scanf("%d", &arr[i]); for (i = 0; i < n; i++) for (j = 0; j < n - i - 1 && (s++, arr[j] > arr[j + 1]); j++) t = arr[j], arr[j] = arr[j + 1], arr[j + 1] = t; printf("%d\n", s); return 0; }
Read more

tcs1b

 #include <stdio.h> // Function to find minimum swaps for beautiful array int min_swaps_to_beautiful(int arr[], int n) {     int swaps_asc = 0, swaps_desc = 0;     for (int i = 0; i < n - 1; i++) {         for (int j = 0; j < n - i - 1; j++) {             if (arr[j] > arr[j + 1]) {                 // Swap for ascending order                 int temp = arr[j];                 arr[j] = arr[j + 1];                 arr[j + 1] = temp;                 swaps_asc++;             }         }         if (arr[i] < arr[i + 1]) {             // Swap for descending order             int...
Read more