Timus Problem 1290 Solution

Timus Problem Solution

Timus Problem 1290 Solution.

#include <stdio.h>

#include <stdlib.h>

int a[25001];

int cmp (const void *a, const void *b)

{

    return (*(int*)a - *(int*)b);

}

int main ()

{

    int N,i;

    scanf("%d",&N);

    for(i=0;i<N;i++)

        scanf("%d",&a[i]);

    qsort(a,N,sizeof(int),cmp);

    for(i=N-1;i>-1;i--)

        printf("%d",a[i]);

return 0;

}

 

0 Comments

You may find interest following article

Complete Guide: Create Laravel Project in Docker Without Local Dependencies

, , , | 0 Comments

Create Laravel Project Through Docker — No Need to Install PHP, MySQL, or Apache on Your Local Machine In this tutorial, I’ll show you how to create and run a full Laravel project using Docker containers. That means you won’t have to install PHP, MySQL, or Apache locally on your computer. By the end of this guide, you’ll have a fully functional Laravel development...