UVA 591 Solution

Solve in C:


#include<stdio.h>
int main()
{

    int n,i,sum=0,mov=0,count=1,avg,ar[100];
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
            break;
        {
            sum=0;
            mov=0;
            for(i=0; i<n; i++)
            {
                scanf("%d",&ar[i]);
            }
            for(i=0; i<n; i++)
            {
                sum=sum+ar[i];
            }
                avg=sum/n;

            for(i=0; i<n; i++)
                if(ar[i]>avg)
                    mov=mov+(ar[i]-avg);

        }
        printf("Set #%d\nThe minimum number of moves is %d.\n",count,mov);
        count++;
        printf("\n");

    }
    return 0;
}

No comments

Most View Post

Recent post

RESTful APIs with CRUD Operations in Laravel 12| (2025)

  RESTful APIs serve as the foundation of modern web development. They follow a set of rules called Representational State Transfer (REST) t...

Powered by Blogger.