Submission #7634801

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(int i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define uniq(x) (x).erase(unique((x).begin(), (x).end()), (x).end())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int n;
    int a[10];
    cin >> n;
    rep(i, n) cin >> a[i];
    int ans = 0;
    
    rep(i, n) {
        int mod = (a[i] - 1) % 6;
        
        if ((mod >= 3) && (mod <= 5)) {
            ans += mod - 2;
        }
        else if (mod == 1) {
            ans++;
        }
    }
    
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result