Dbhardwaj99

#include<stdio.h>
void main()
{
    int i,j,temp,p,n;
    int ar[50];
    printf("Enter the size of an array");
    scanf("%d",&n);
    printf("Enter the array elements: "); 
    for(i=0;i<n;++i)
    {

Dbhardwaj99

#include <stdio.h>
int main() {
    
    char s1[100];
    scanf("%[^\n]%*c", s1);
    char s2[100];
    scanf("%[^\n]%*c", s2);
    int length, j;

    length = 0;

Dbhardwaj99

FROM ubuntu:20.04
ENV DEBIAN_FRONTEND=noninteractive
EXPOSE 6200
EXPOSE 5009

LABEL ranchimall="[email protected]"

# CMD { "echo", "Ranchi Mall" }

# for apt to be noninteractive

Dbhardwaj99

FROM ubuntu:20.04
ENV DEBIAN_FRONTEND=noninteractive
SHELL ["/bin/bash", "-c"]

LABEL ranchimall="[email protected]"

CMD { "echo", "Ranchi Mall" }

## for apt to be noninteractive
ENV DEBIAN_FRONTEND noninteractive

Dbhardwaj99

def sumNdifference(array):
    j = 1
    array = sorted(array)
    array = array[::-1]
    while (true)):
        diff = array[len(array)-1]
        other = sum(array[j:])
        if array[0]-other > 0:
            diff = array[0]-other
            break

Dbhardwaj99

#include<stdio.h>
int i,l;
int search(int ,int *,int);
int main(){
   int n,m;
   printf("enter the size of array:");
   scanf("%d",&n);
   int a[n];
   printf("enter the elements:\n");
   for(i=0;i<n;i++){

Dbhardwaj99

def flo_sorting(list):
    length = len(list)
    i = a = b = c = d = e = 0

    list2 = []
    newlist = []

    while i != length:
        if list[i][-1] == ':':
            e = list[i]