#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 loopn(i,n) for(int i=1;i<n;i++)
#define loop1(i,n) for(int i=1;i<=n;i++)
#define loopi(i,n) for(int i=0;i<n-1;i++)
#define loopab(i,a,b) for(int i=a;i<=b;i++)
#define loopba(i,b,a) for(int i=b;i>=a;i--)
#define REV(i,n) for(i=n; i>=0; 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<row && ty>=0 && ty<col
#define intlim 2147483648
#define MAX 1000000
#define inf 100000000
/*------------------------------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[10005];
int main()
{
//CIN;
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int n;
while (sf(n)==1 && n!=0 )
{
loop0(i,n) sf(a[i]);
a[n]=a[0];
a[n+1]=a[1];
bool down =0;
bool up =0;
if (a[0]<a[1]) up =1;
else down =1;
int c = 1;
for(int i=2; i<=n;i++)
{
if(up && a [i-1]>a[i])
{
c++;
up = 0;
down = 1;
}
else if(down && a[i-1]<a[i])
{
c++;
up = 1;
down = 0;
}
}
if (up && a [n]<a[n+1]) c--;
else if (down && a[n]>a[n+1] ) c--;
pf("%d\n",c);
}
return 0;
}
Category Uncategorized
UVa – 10487 – Closest Sums
#include <iostream>
using namespace std;
int main()
{
long long int n,q,i,j,k,m,d,p,x,f,c,h;
for(m=1;;m++)
{
cin>>n;
if(n==0)
{
break;
}
long long int a[n];
for(i=0;i<n;i++)
{
cin>>a[i];
}
cin>>q;
cout<<"Case "<<m<<":"<<endl;
for(k=0;k<q;k++)
{
cin>>x;
d=10000000000;
c=0;
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
p=a[i]+a[j];
if(p==x)
{
h=p;
c=1;
break;
}
else if(p>x)
{
f=p-x;
if(f<d)
{
d=f;
h=p;
}
}
else if(p<x)
{
f=x-p;
if(f<d)
{
d=f;
h=p;
}
}
}
if(c==1)
{
break;
}
}
cout<<"Closest sum to "<<x<<" is "<<h<<"."<<endl;
}
}
return 0;
}
UVa – 10370 – Above Average
#include <stdio.h>
#include <stdlib.h>
int main()
{
int i,j,s,T;
double sum,p,avrg,d,c;
scanf("%d",&T);
for(j=0;j<T;j++)
{
scanf("%d",&s);
int A[s];
for(i=0;i<s;i++)
{
scanf("%d",&A[i]);
}
sum=0;
for(i=0;i<s;i++)
{
sum=sum+A[i];
}
d=s;
avrg=(sum*1.0/d*1.0);
c=0;
for(i=0;i<s;i++)
{
if(A[i]>avrg)
{
c++;
}
}
p=(c*1.0/s*1.0)*100;
printf("%.3lf%%\n",p);
}
return 0;
}
UVa – 10300 – Ecological Premium
#include <iostream>
using namespace std;
int main()
{
long long int t,m,n,i,j,sum;
cin>>t;
for(i=0;i<t;i++)
{
cin>>n;
m=n*3;
long long int A[m];
for(j=0;j<m;j++)
{
cin>>A[j];
}
sum=0;
for(j=0;j<m-2;)
{
sum=sum+(A[j]*A[j+2]);
j=j+3;
}
cout<<sum<<endl;
}
return 0;
}
UVa – 10038 – Jolly Jumpers
Note:
I don’t remember why but I marked this problem as a “Tricky” problem when I solved this !!
#include <bits/stdc++.h>
using namespace std;
bool visit[3001];
int a[111111];
int main()
{
// freopen("in.txt","r",stdin);
int n,i,x,c,d;
while(cin>>n)
{
memset(visit,0,sizeof(visit));
for(i=0; i<n; i++)
{
cin>>a[i];
}
d=n-1;
c=0;
for(i=0; i<n-1; i++)
{
x=abs(a[i]-a[i+1]);
if(visit[x])
{
c=1;
break;
}
visit[x]=1;
}
if(c==0)
{
for(int i=1; i<n; i++)
if(visit[i]==0)
{
c=1;
break;
}
}
if(c==0)
{
cout<<"Jolly"<<endl;
}
else
{
cout<<"Not jolly"<<endl;
}
}
return 0;
}
Fall out, Codes! 