Submission #322570
Source Code Expand
//include //------------------------------------------ #include <vector> #include <list> #include <map> #include <set> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> #include <fstream> #include <complex> #include <math.h> using namespace std; //conversion //------------------------------------------ inline long toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} inline long toLong(string s) {long v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} //math //------------------------------------------- template<class T> inline T sqr(T x) {return x*x;} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef pair<long, long> PLL; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,a,b) for(long i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //constant //-------------------------------------------- //clear memory #define CLR(a) memset((a), 0 ,sizeof(a)) const long double EPS = 1e-12; const int INF = 10000; int main(){ int n,x; cin>>n>>x; cout<<540*x+525*(n-x)<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - プレミアム会員 |
User | blue0620 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1973 Byte |
Status | AC |
Exec Time | 26 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 | 26 ms | 728 KB |
subtask0_sample_02.txt | AC | 22 ms | 800 KB |
subtask0_sample_03.txt | AC | 23 ms | 796 KB |
subtask0_sample_04.txt | AC | 22 ms | 924 KB |
subtask1_random01.txt | AC | 23 ms | 736 KB |
subtask1_random02.txt | AC | 23 ms | 800 KB |
subtask1_random03.txt | AC | 23 ms | 672 KB |
subtask1_random04.txt | AC | 23 ms | 672 KB |
subtask1_random05.txt | AC | 23 ms | 800 KB |
subtask1_random06.txt | AC | 23 ms | 800 KB |
subtask1_random07.txt | AC | 22 ms | 800 KB |
subtask1_random08.txt | AC | 23 ms | 796 KB |
subtask1_random09.txt | AC | 23 ms | 748 KB |
subtask1_random10.txt | AC | 22 ms | 800 KB |
subtask1_random11.txt | AC | 23 ms | 804 KB |
subtask1_random12.txt | AC | 22 ms | 704 KB |
subtask1_random13.txt | AC | 23 ms | 672 KB |
subtask1_random14.txt | AC | 23 ms | 796 KB |
subtask1_random15.txt | AC | 23 ms | 672 KB |
subtask1_random16.txt | AC | 22 ms | 796 KB |
subtask1_random17.txt | AC | 23 ms | 804 KB |
subtask1_random18.txt | AC | 23 ms | 800 KB |