Submission #322541
Source Code Expand
#include<bits/stdc++.h> using namespace std; template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1,T2>& a){ return is >> a.first >> a.second; } template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1,T2>& a){ return os << a.first << " "<<a.second; } template<typename T> istream& operator>>(istream& is, vector< T >& vc){ for(int i = 0; i < vc.size(); i++) is >> vc[i]; return is; } template<typename T> ostream& operator<<(ostream& os, vector< T >& vc){ for(int i = 0; i < vc.size(); i++) os << vc[i] << endl; return os; } #define ForEach(it,c) for(__typeof (c).begin() it = (c).begin(); it != (c).end(); it++) #define ALL(v) (v).begin(), (v).end() #define UNQ(s) { sort(ALL(s)); (s).erase( unique( ALL(s)), (s).end());} #define fr first #define sc second typedef pair< int , int > Pi; typedef pair< int , Pi > Pii; typedef long long int64; const int INF = 1 << 30; int main(){ int n, x; cin >> n >> x; cout << (n - x) * 525 + x * 540 << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | ei13333 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1029 Byte |
Status | AC |
Exec Time | 35 ms |
Memory | 924 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 | 25 ms | 792 KB |
subtask0_sample_02.txt | AC | 25 ms | 832 KB |
subtask0_sample_03.txt | AC | 31 ms | 784 KB |
subtask0_sample_04.txt | AC | 32 ms | 792 KB |
subtask1_random01.txt | AC | 25 ms | 672 KB |
subtask1_random02.txt | AC | 26 ms | 672 KB |
subtask1_random03.txt | AC | 27 ms | 800 KB |
subtask1_random04.txt | AC | 27 ms | 792 KB |
subtask1_random05.txt | AC | 25 ms | 920 KB |
subtask1_random06.txt | AC | 25 ms | 668 KB |
subtask1_random07.txt | AC | 25 ms | 792 KB |
subtask1_random08.txt | AC | 35 ms | 804 KB |
subtask1_random09.txt | AC | 24 ms | 672 KB |
subtask1_random10.txt | AC | 25 ms | 924 KB |
subtask1_random11.txt | AC | 25 ms | 796 KB |
subtask1_random12.txt | AC | 24 ms | 796 KB |
subtask1_random13.txt | AC | 25 ms | 796 KB |
subtask1_random14.txt | AC | 25 ms | 672 KB |
subtask1_random15.txt | AC | 23 ms | 796 KB |
subtask1_random16.txt | AC | 23 ms | 800 KB |
subtask1_random17.txt | AC | 24 ms | 800 KB |
subtask1_random18.txt | AC | 24 ms | 800 KB |