Submission #1520144
Source Code Expand
#include <map> #include <set> #include <list> #include <cmath> #include <deque> #include <queue> #include <stack> #include <cstdio> #include <string> #include <vector> #include <complex> #include <cstdlib> #include <cstring> #include <numeric> #include <utility> #include <iostream> #include <algorithm> #include <functional> #include <unordered_map> #include <unordered_set> using namespace std; #define ll long long #define ull unsigned long long #define INF (1 << 29) #define LLINF (1LL << 61) #define MOD7 1000000007 #define MOD9 1000000009 #define eps 1e-9 #define P pair<int, int> #define pii pair<int, int> #define pll pair<ll, ll> #define pul pair<ull, ull> #define all(a) (a).begin(), (a).end() #define FOR(i,a,b) for (int i=(a);i<(b);++i) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);--i) #define REP(i,n) for (int i=0;i<(n);++i) #define RREP(i,n) for (int i=(n)-1;i>=0;--i) void YES() { cout << "YES" << endl; } void NO() { cout << "NO" << endl; } void Yes() { cout << "Yes" << endl; } void No() { cout << "No" << endl; } void yes() { cout << "yes" << endl; } void no() { cout << "no" << endl; } int main() { int n, a, ans = 0; cin >> n; while (n--) { cin >> a; while (a % 2 != 1 || a % 3 == 2) { a--; ans++; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 花占い |
User | temple |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1340 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 |