Submission #8128170
Source Code Expand
#include <algorithm> #include <cmath> #include <cstdio> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <unordered_set> #include <vector> using namespace std; #define FOR(i, N) for (int i = 0; i < (int)N; i++) #define FORIN(i, a, b) for (int i = a; i < (int)b; i++) #define ALL(x) (x).begin(), (x).end() #define MOD 1000000007 #define INF (1 << 29) #define LLINF (1LL << 60) #define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__) using Pi = pair<int, int>; using ll = long long; string to_string(string s) { return s; } template <class S, class T> string to_string(pair<S, T> p) { return "{" + to_string(p.first) + "," + to_string(p.second) + "}"; } template <class S> string to_string(unordered_set<S> s) { string ret = "{"; for (S x : s) ret += to_string(x) + ","; return ret + "}"; } template <class S, class T> string to_string(map<S, T> m) { string ret = "{"; for (pair<S, T> x : m) ret += to_string(x) + ","; return ret + "}"; } template <class T> string to_string(vector<T> v) { string ret = "{"; for (int i = 0; i < (int)v.size() - 1; ++i) { ret += to_string(v[i]) + ","; } if (v.size() > 0) { ret += to_string(v.back()); } ret += "}"; return ret; } void debug() { cerr << endl; } template <class Head, class... Tail> void debug(Head head, Tail... tail) { cerr << to_string(head) << " "; debug(tail...); } void print() { cout << endl; } template <class Head, class... Tail> void print(Head head, Tail... tail) { cout << to_string(head); print(tail...); } int main() { cin.tie(0); int n, x; cin >> n >> x; print(n * 525 + 15 * x); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | phocom |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1714 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_random01.txt, subtask1_random02.txt, subtask1_random03.txt, subtask1_random04.txt, subtask1_random05.txt, subtask1_random06.txt, subtask1_random07.txt, subtask1_random08.txt, subtask1_random09.txt, subtask1_random10.txt, subtask1_random11.txt, subtask1_random12.txt, subtask1_random13.txt, subtask1_random14.txt, subtask1_random15.txt, subtask1_random16.txt, subtask1_random17.txt, subtask1_random18.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask0_sample_04.txt | AC | 1 ms | 256 KB |
subtask1_random01.txt | AC | 1 ms | 256 KB |
subtask1_random02.txt | AC | 1 ms | 256 KB |
subtask1_random03.txt | AC | 1 ms | 256 KB |
subtask1_random04.txt | AC | 1 ms | 256 KB |
subtask1_random05.txt | AC | 1 ms | 256 KB |
subtask1_random06.txt | AC | 1 ms | 256 KB |
subtask1_random07.txt | AC | 1 ms | 256 KB |
subtask1_random08.txt | AC | 1 ms | 256 KB |
subtask1_random09.txt | AC | 1 ms | 256 KB |
subtask1_random10.txt | AC | 1 ms | 256 KB |
subtask1_random11.txt | AC | 1 ms | 256 KB |
subtask1_random12.txt | AC | 1 ms | 256 KB |
subtask1_random13.txt | AC | 1 ms | 256 KB |
subtask1_random14.txt | AC | 1 ms | 256 KB |
subtask1_random15.txt | AC | 1 ms | 256 KB |
subtask1_random16.txt | AC | 1 ms | 256 KB |
subtask1_random17.txt | AC | 1 ms | 256 KB |
subtask1_random18.txt | AC | 1 ms | 256 KB |