Submission #2196493

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <functional>
#define REP(i, n) for(int i=0;i<n;++i)
#define INF 100000000
#define ll long long

using namespace std;

typedef pair<int, int> P;

int n;
int a[10];
int b[9] = {0, 1, 0, 1, 2, 3, 0, 1, 0};

int f(int k){
  return b[k-1];
}

int main(){
  cin >> n;
  int tmp=0;

  REP(i, n){
    int k;
    cin >> k;
    tmp += f(k);
  }
  
  cout << tmp << endl;

  return 0;
}

Submission Info

Judge Result