#include <stdio.h>
#include <stdlib.h>
int main()
{
int n,i,j,k,sum,a,d,c;
for(k=1;;k++)
{
scanf("%d",&n);
if(n==0)
{
break;
}
int N[n];
for(i=0;i<n;i++)
{
scanf("%d",&N[i]);
}
sum=0;
for(i=0;i<n;i++)
{
sum=sum+N[i];
}
a=sum/n;
d=0;
for(i=0;i<n;i++)
{
if(N[i]>a)
{
c=N[i]-a;
d=d+c;
}
}
printf("Set #%d\nThe minimum number of moves is %d.\n\n",k,d);
}
return 0;
}
Category Array
UVa – 488 – Triangle wave
#include <bits/stdc++.h>
using namespace std;
int main()
{
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int t,i,j,k,l,amp,fre;
int a[9];
cin>>t;
for(i=1;i<=t;i++)
{
cin>>amp>>fre;
for(j=1;j<=fre;j++)
{
for(k=1;k<=amp;k++)
{
for(l=0;l<k;l++)
{
a[l]=k;
cout<<a[l];
}
cout<<endl;
}
for(k=amp-1;k>=1;k--)
{
for(l=0;l<k;l++)
{
a[l]=k;
cout<<a[l];
}
cout<<endl;
}
if(j!=fre) cout<<endl;
}
if(i!=t) cout<<endl;
}
return 0;
}
UVa – 11057 – Exact sum
#include <bits/stdc++.h>
#define pf printf
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sffff(a,b,c,d) scanf("%d %d %d %d",&a,&b,&c,&d)
#define sffffl(a,b,c,d) scanf("%lld %lld %lld %lld",&a,&b,&c,&d)
#define sfffff(a,b,c,d,e) scanf("%d %d %d %d %d",&a,&b,&c,&d,&e)
#define sfffffl(a,b,c,d,e) scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e)
#define sfc(a) scanf("%c",&a)
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define pbp(a,b) push_back({a,b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define sz(x) x.size()
#define qu queue
#define pqu priority_queue
#define vc vector
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define loop0(i,n) for(int i=0;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define loopab(i,a,b) for(int i=a;i<=b;i++)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case1(z) cout<<"Case "<<z<<": "
#define case2(z) printf("Case %d: ",z)
#define PI 3.14159265358979323846264338328
#define valid(tx,ty) tx>=0 && tx<r && ty>=0 && ty<c
#define intlim 2147483648
#define MAX 1000000
#define inf 10000000
/*------------------------------Graph Moves----------------------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*---------------------------------------------------------------------*/
using namespace std;
int a[10004];
int main()
{
//CIN;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n,k=1;
while(sf(n)==1)
{
int m;
loop0(i,n)
{
sf(a[i]);
}
sort(a,a+n);
int sum,ans=inf;
sf(sum);
int y,z;
for(int i=0; a[i]<=sum/2; i++)
{
int x=sum-a[i];
if(binary_search(a+(i+1),a+n,x))
{
int d=abs(x-a[i]);
if(d<ans)
{
ans=d;
y=a[i];
z=x;
}
}
}
if(k>1) pf("\n");
pf("Peter should buy books whose prices are %d and %d.\n",y,z);
k++;
}
pf("\n");
return 0;
}
UVa – 10931 – Parity
Solution 1: Using Array
#include <bits/stdc++.h>
using namespace std;
long long A[220000000];
int main()
{
long long n,a,c,d,x,i,m,j,k;
while(cin>>a)
{
if(a==0)
{
break;
}
n=a;
i=0;
while(n!=0)
{
d=n%2;
A[i]=d;
n=n/2;
i++;
}
reverse(A,A+i);
c=0;
for(j=0; j<i; j++)
{
if(A[j]==1)
{
c++;
}
}
cout<<"The parity of ";
for(j=0; j<i; j++)
{
cout<<A[j];
}
cout<<" is "<<c<<" (mod 2)."<<endl;
}
return 0;
}
Solution 2: Using String
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,a,c,d,i;
while(cin>>a)
{
string s;
if(a==0)
{
break;
}
n=a;
i=0;
while(n!=0)
{
d=n%2;
s+=d+'0'; /// s+=d+48 can be written...same thing.
n=n/2;
i++;
}
reverse(s.begin(),s.end());
c=0;
for(i=0; i<s.size(); i++)
{
if(s[i]=='1')
{
c++;
}
}
cout<<"The parity of "<<s<<" is "<<c<<" (mod 2)."<<endl;
}
return 0;
}
UVa – 11364 – Parking
#include <bits/stdc++.h>
#define pf printf
#define sf(a) scanf("%d",&a)
#define sfl(a) scanf("%lld",&a)
#define sff(a,b) scanf("%d %d",&a,&b)
#define sffl(a,b) scanf("%lld %lld",&a,&b)
#define sfff(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define sffff(a,b,c,d) scanf("%d %d %d %d",&a,&b,&c,&d)
#define sffffl(a,b,c,d) scanf("%lld %lld %lld %lld",&a,&b,&c,&d)
#define sfffff(a,b,c,d,e) scanf("%d %d %d %d %d",&a,&b,&c,&d,&e)
#define sfffffl(a,b,c,d,e) scanf("%lld %lld %lld %lld %lld",&a,&b,&c,&d,&e)
#define sfc(a) scanf("%c",&a)
#define pii pair<int,int>
#define ms(a,b) memset(a,b,sizeof(a))
#define pb(a) push_back(a)
#define pbp(a,b) push_back({a,b})
#define db double
#define ft float
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sz(x) x.size()
#define all(x) x.begin(),x.end()
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define max3(a, b, c) max(a, b) > max(b, c) ? max(a, b) : max(b, c)
#define min3(a, b, c) min(a, b) < min(b, c) ? min(a, b) : min(b, c)
#define for0(i,n) for(int i=0;i<n;i++)
#define for1(i,n) for(int i=1;i<=n;i++)
#define forrev(i,n) for(int i=n-1; i>=0; i--)
#define forab(i,a,b) for(int i=a;i<=b;i++)
#define forba(i,b,a) for(int i=b;i>=a;i--)
#define stlloop(x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a)*((b)/gcd(a,b)))
#define case1(z) cout<<"Case "<<z<<": "
#define case2(z) printf("Case %d: ",z)
#define PI acos(-1) //3.14159265358979323846264338328
#define valid(tx,ty) tx>=0 && tx<n && ty>=0 && ty<m
#define intlim 2147483648
#define MAX 100005
#define inf 100000008
/*------------------------------Graph Moves----------------------------*/
//const int fx[]= {+1,-1,+0,+0};
//const int fy[]= {+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1}; // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
//const int fx[]={-2, -2, -1, -1, 1, 1, 2, 2}; // Knights Move
//const int fy[]={-1, 1, -2, 2, -2, 2, -1, 1}; // Knights Move
/*---------------------------------------------------------------------*/
using namespace std;
int a[22];
int main()
{
//CIN;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int t;
sf(t);
for0(z,t)
{
int n;
sf(n);
for0(i,n) sf(a[i]);
sort(a,a+n);
cout<<(a[n-1]-a[0])*2<<endl;
}
return 0;
}
Fall out, Codes! 