Submission #1025784
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++) #define REP(i,n) FOR(i,0,n) #define ALL(a) a.begin(), a.end() #define MS(m,v) memset(m,v,sizeof(m)) typedef long long ll; typedef long double ld; typedef vector<int> vi; typedef vector<string> vs; typedef pair<int, int> pii; const int MOD = 1000000007; const int INF = MOD + 1; const ld EPS = 1e-12; template<class T> T &chmin(T &a, const T &b) { return a = min(a, b); } template<class T> T &chmax(T &a, const T &b) { return a = max(a, b); } /*--------------------template--------------------*/ int main() { cin.sync_with_stdio(false); cout << fixed << setprecision(10); int n, x; cin >> n >> x; cout << n * 525 + x * 15 << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | amano |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 780 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 928 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 | 19 ms | 924 KB |
subtask0_sample_02.txt | AC | 18 ms | 796 KB |
subtask0_sample_03.txt | AC | 19 ms | 796 KB |
subtask0_sample_04.txt | AC | 19 ms | 796 KB |
subtask1_random01.txt | AC | 19 ms | 796 KB |
subtask1_random02.txt | AC | 19 ms | 844 KB |
subtask1_random03.txt | AC | 19 ms | 796 KB |
subtask1_random04.txt | AC | 19 ms | 800 KB |
subtask1_random05.txt | AC | 19 ms | 800 KB |
subtask1_random06.txt | AC | 19 ms | 928 KB |
subtask1_random07.txt | AC | 19 ms | 792 KB |
subtask1_random08.txt | AC | 18 ms | 920 KB |
subtask1_random09.txt | AC | 19 ms | 924 KB |
subtask1_random10.txt | AC | 18 ms | 796 KB |
subtask1_random11.txt | AC | 18 ms | 924 KB |
subtask1_random12.txt | AC | 18 ms | 800 KB |
subtask1_random13.txt | AC | 16 ms | 924 KB |
subtask1_random14.txt | AC | 18 ms | 888 KB |
subtask1_random15.txt | AC | 17 ms | 796 KB |
subtask1_random16.txt | AC | 16 ms | 800 KB |
subtask1_random17.txt | AC | 19 ms | 796 KB |
subtask1_random18.txt | AC | 16 ms | 796 KB |