Posts

Showing posts from November, 2023

tcs1f

 #include <stdio.h> void bubble_sort(int arr[], int n, int *swaps) {     *swaps = 0;     for (int i = 0; i < n; i++)         for (int j = 0; j < n - i - 1 && ((*swaps)++, arr[j] > arr[j + 1]); j++) {             int temp = arr[j];             arr[j] = arr[j + 1];             arr[j + 1] = temp;         } } int main() {     int n, swaps = 0;     scanf("%d", &n);          int arr[n];     for (int i = 0; i < n; i++) scanf("%d", &arr[i]);     bubble_sort(arr, n, &swaps);     printf("%d\n", swaps);     return 0; }

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; }

tcs1c

 #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; j++) if (arr[j] > arr[j + 1]) s++, t = arr[j], arr[j] = arr[j + 1], arr[j + 1] = t;     printf("%d\n", s);     return 0; }

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...

tcs1a

 #include <stdio.h> #include <stdlib.h> int beautiful_array(int arr[], int n) {     int asc = 1, desc = 1, patternDetected = 0;     for (int i = 1; i < n && !patternDetected; i++) {         if (arr[i] < arr[i - 1]) {             asc = 0;             patternDetected = 1;         }         if (arr[i] > arr[i - 1]) {             desc = 0;             patternDetected = 1;         }     }     if (asc || desc) {         return 0;     } else {         return n - 1;     } } int main() {     int n;     printf("Enter the number of elements: ");     scanf("%d", &n);     int arr[n];     for (int i = 0; i < n; i++) ...

Contest

Each and Every contest will focuses mainly on  1) Communication  2) Healthcare  3) EV Charging. In meta material wave propagation can be changed in all aspects. For instance efficiency of wireless power transfer can be improved using Metamaterial. In Healthcare Sector Mini Sensors which is made up of meta material can be used to detect blood Sugar.