Submission #1585553
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define each(i,a) for (auto&& i : a)
#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)
#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define chmin(x,v) x = min(x, v)
#define chmax(x,v) x = max(x, v)
const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);
template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
each(x,vec) is >> x;
return is;
}
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
rep(i,vec.size()) {
if (i) os << " ";
os << vec[i];
}
return os;
}
template<typename T>
ostream& operator<<(ostream& os, const vector< vector<T> >& vec) {
rep(i,vec.size()) {
if (i) os << endl;
os << vec[i];
}
return os;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n; cin >> n;
ll ans = 0;
vector<ll> f{
0, 1, 0, 1, 2, 3
};
rep(i, n) {
ll x; cin >> x;
ans += f[(x-1) % 6];
}
cout << ans << endl;
}
Submission Info
Submission Time |
|
Task |
B - 花占い |
User |
drafear |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1516 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, test_1.txt, test_112358.txt, test_1379137913.txt, test_1414213562.txt, test_1732151817.txt, test_2.txt, test_2236167977.txt, test_2645751311.txt, test_3.txt, test_3141592653.txt, test_4.txt, test_5.txt, test_6.txt, test_6666666666.txt, test_7.txt, test_73.txt, test_8.txt, test_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
test_1.txt |
AC |
1 ms |
256 KB |
test_112358.txt |
AC |
1 ms |
256 KB |
test_1379137913.txt |
AC |
1 ms |
256 KB |
test_1414213562.txt |
AC |
1 ms |
256 KB |
test_1732151817.txt |
AC |
1 ms |
256 KB |
test_2.txt |
AC |
1 ms |
256 KB |
test_2236167977.txt |
AC |
1 ms |
256 KB |
test_2645751311.txt |
AC |
1 ms |
256 KB |
test_3.txt |
AC |
1 ms |
256 KB |
test_3141592653.txt |
AC |
1 ms |
256 KB |
test_4.txt |
AC |
1 ms |
256 KB |
test_5.txt |
AC |
1 ms |
256 KB |
test_6.txt |
AC |
1 ms |
256 KB |
test_6666666666.txt |
AC |
1 ms |
256 KB |
test_7.txt |
AC |
1 ms |
256 KB |
test_73.txt |
AC |
1 ms |
256 KB |
test_8.txt |
AC |
1 ms |
256 KB |
test_9.txt |
AC |
1 ms |
256 KB |