Submission #33509

---

Source Code Expand

/**
 *
 *  Time-stamp:<2012/07/21 20:20:45>
 **/

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
 
using namespace std;
 
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
 
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define Debug cout << "LINE: " << __LINE__ << endl

#define NUM 6

int e[NUM];
int b;
int l[NUM];

int solve() {
  bool bo = false;
  int count = 0;
  
  REP(i, NUM) {
    REP(j, NUM) {
//      cout << l[i] << "  " << e[j] << endl;
      if(l[i]==e[j]) count++;
      if(l[i]==b) bo = true;
    }
  }

  if(count == 6) {
    return 1;
  } else if (count == 5) {
    if(bo) {
      return 2;
    } else {
      return 3;
    }        
  } else if (count == 4) {
    return 4;
  } else if (count == 3) {
    return 5;
  } else {
    return 0;
  }
}

int main()
{
  REP(i, NUM) {
    cin >> e[i];
  }
  cin  >> b;
  REP(i, NUM) {
    cin >> l[i];
  }
  
  cout << solve() << endl;

  return 0;
}

Submission Info

Judge Result