UVA Contest from BUBT, Bangladesh June 29, 2010

LINK

Solved 2 problems A and B during the contest.

Problem A Argentina

#include<cstdlib>

#include <cstdio>

#include <iostream>

#include <vector>

#include <cmath>

#include <algorithm>

#include <string>

#include <set>

#include <map>

#include <ctime>

#include <cstring>

#include <cassert>

#include <iomanip>

#include <complex>

#include <queue>

#include <functional>

using namespace std;

#define forn(i, n) for(int i = 0; i < (int)(n); i++)

#define ford(i, n) for(int i = (int)(n) - 1; i >= 0; i--)

#define pb push_back

#define mp make_pair

#define fs first

#define sc second

#define last(a) int(a.size() - 1)

#define all(a) a.begin(), a.end()

#define seta(a,x) memset (a, x, sizeof (a))

#define I (int)

#define SZ(x) ((int) (x).size())

//#define FE(i,x) for(typedef(x).begin() i=(x).begin();i!=(x).end();i++)

typedef long long int  int64;

typedef unsigned long long int uint64;

typedef long double ldb;

typedef pair <int, int> pii;

typedef vector<int>vi;

typedef vector<string> vs;

template <class T> T sqr (T x) {return x * x;}

int main()

{

  int cases;

  cin>>cases;

  char s[100];

  vector<string>vs;

  int a[11],b[11];

  int c=0;

  while(cases--)

  {

  vs.clear();

  for(int i=0;i<10;i++)

  {

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

    string str=(string)(s);

    vs.pb(str);

  }

  for(int i=0;i<10;i++)

  {

    for(int j=0;j<10;j++)

    {

      if(a[i]<a[j])

      {

        swap(a[i],a[j]);swap(vs[i],vs[j]);swap(b[i],b[j]);

      }

      else if(a[i]==a[j])

      {

        if(b[i]>b[j])

        {

          swap(b[i],b[j]);swap(vs[i],vs[j]);swap(a[i],a[j]);

        }

        else if(b[i]==b[j])

        {

           if(vs[i]>vs[j])

           {

             swap(b[i],b[j]);swap(vs[i],vs[j]);swap(a[i],a[j]);

           }

        }//else

      }//else

    }//for

  }//for

   sort(vs.begin(),vs.begin()+5);

   sort(vs.begin()+5,vs.end());

  printf("Case %d:\n",++c);

  printf("(");

  for(int i=5;i<9;i++)

    cout<<vs[i]<<", ";

  cout<<vs[9]<<")\n";

  printf("(");

  for(int i=0;i<4;i++)

    cout<<vs[i]<<", ";

  cout<<vs[4]<<")\n";

  }

return 0;

}</pre>
<pre>

Problem B Bafana Bafana

#include<cstdlib>
#include <cstdio>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <ctime>
#include <cstring>
#include <cassert>
#include <iomanip>
#include <complex>
#include <queue>
#include <functional>

using namespace std;

#define forn(i, n) for(int i = 0; i < (int)(n); i++)
#define ford(i, n) for(int i = (int)(n) - 1; i >= 0; i--)
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define last(a) int(a.size() - 1)
#define all(a) a.begin(), a.end()
#define seta(a,x) memset (a, x, sizeof (a))
#define I (int)
#define SZ(x) ((int) (x).size())
#define FE(i,x) for(typedef(x).begin() i=(x).begin();i!=(x).end();i++)

typedef long long int  int64;
typedef unsigned long long int uint64;
typedef long double ldb;
typedef pair <int, int> pii;
typedef vector<int>vi;
typedef vector<string>vs;



template <class T> T sqr (T x) {return x * x;}

int main()
{
 int cases;
 cin>>cases;
 int N,K,P;
 int i=0;
 while(cases--)
 {
 cin>>N>>K>>P;
 int tmp=(K+P)%N;
 printf("Case %d: ",++i);
 if(tmp==0) cout<<N<<endl;
 else cout<<tmp<<endl;
 }


return 0;
}

UVA Contest from Dinajpur, Bangladesh June 29, 2010

LINK
I solved a single problem during this UVA contest
F Horror Dash

#include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
using namespace std;

int main()
{
  int cases;
  cin>>cases;
  int i=0;
  while(cases--)
  {
     int n;
     cin>>n;
     cout<<"Case "<<++i<<": ";
     int max=-1;
     while(n--){
      int item;
      cin>>item;
      if(item>max) max=item;
      }
    cout<<max;
    if(cases!=0) printf("\n");
  }


return 0;
}