Submission #8214601
Source Code Expand
#include <iostream> #include <cstdlib> #include <cmath> #include <vector> #include <map> #include <set> #include <algorithm> #include <queue> #include <stack> using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef pair<ll,ll> P; typedef vector<P> vpl; #define rep(i,n) for(ll i=0; i<(n); i++) #define REP(i,a,b) for(ll i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = 1<<30; const ll linf = 1LL<<62; const int mod = 1e9 + 7; const int MAX = 510000; const int V = 100005; ll dy[8] = {1,0,-1,0,1,-1,1,-1}; ll dx[8] = {0,1,0,-1,1,-1,-1,1}; int main(){ ll n,x; cin >> n >> x; cout << x*540 + (n-x)*525 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | suta |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 759 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 |