Submission #322582
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cmath> #include <cstring> #include <vector> #include <algorithm> #include <set> #include <queue> #include <map> #include <climits> using namespace std; #define REP(i,n) for(int i=0; i<(int)(n); i++) #define RREP(i,n) for(int i=(int)n-1; i>=0; i--) #define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i) #define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();++i) #define ALL(c) (c).begin(), (c).end() typedef long long int ll; typedef pair<int, int> pii; typedef pair<int, pair<int, int> > pipii; typedef vector<int> vi; const int INF = 1e9; const int MOD = 1e9+7; int main(void){ int n, x; cin >> n >> x; cout << 525 * (n - x) + 540 * x << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | no15_renne |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 818 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 920 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 | 27 ms | 672 KB |
subtask0_sample_02.txt | AC | 25 ms | 800 KB |
subtask0_sample_03.txt | AC | 25 ms | 920 KB |
subtask0_sample_04.txt | AC | 26 ms | 800 KB |
subtask1_random01.txt | AC | 25 ms | 796 KB |
subtask1_random02.txt | AC | 24 ms | 916 KB |
subtask1_random03.txt | AC | 24 ms | 668 KB |
subtask1_random04.txt | AC | 25 ms | 736 KB |
subtask1_random05.txt | AC | 25 ms | 796 KB |
subtask1_random06.txt | AC | 26 ms | 796 KB |
subtask1_random07.txt | AC | 26 ms | 796 KB |
subtask1_random08.txt | AC | 25 ms | 732 KB |
subtask1_random09.txt | AC | 26 ms | 672 KB |
subtask1_random10.txt | AC | 26 ms | 792 KB |
subtask1_random11.txt | AC | 24 ms | 796 KB |
subtask1_random12.txt | AC | 26 ms | 672 KB |
subtask1_random13.txt | AC | 26 ms | 792 KB |
subtask1_random14.txt | AC | 24 ms | 800 KB |
subtask1_random15.txt | AC | 26 ms | 668 KB |
subtask1_random16.txt | AC | 26 ms | 796 KB |
subtask1_random17.txt | AC | 26 ms | 800 KB |
subtask1_random18.txt | AC | 26 ms | 676 KB |