Submission #322536
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> PII;
typedef long long LL;
typedef unsigned long long ULL;
template<class T> inline bool amax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool amin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> ostream& operator << (ostream &os, const vector<T> &v) { os << "["; for (typename vector<T>::const_iterator it = v.begin(); it != v.end(); it++) { os << (it != v.begin() ? ", " : "") << *it; } os << "]"; return os; }
template<class T> ostream& operator << (ostream &os, const set<T> &s) { os << "["; for (typename set<T>::const_iterator it = s.begin(); it != s.end(); it++) { os << (it != s.begin() ? ", " : "") << *it; } os << "]"; return os; }
template<class Key, class Val> ostream& operator << (ostream &os, const map<Key, Val> &m) { os << "{"; for (typename map<Key, Val>::const_iterator it = m.begin(); it != m.end(); it++) { os << (it != m.begin() ? ", " : "") << it->first << ":" << it->second; } os << "}"; return os; }
template<class T, class S> ostream& operator << (ostream &os, const pair<T, S> &p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <class Target, class Source> inline Target lexical_cast (const Source &s) { Target t; stringstream ss; ss << s; ss >> t; return t; }
//> v < ^ (clock wise)
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
const int INFI = 1<<28;
const long long int INFL = 1LL<<60;
const double INFD = 1e+300;
const float INFF = 1e+100;
const double EPS = 1e-8;
int main(){
cout.setf(ios::fixed); cout.precision(10);
ios_base::sync_with_stdio(false);
int n, x;
cin >> n >> x;
cout << x*540 + (n-x)*525 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - プレミアム会員 |
User |
inuhiroshi |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1791 Byte |
Status |
AC |
Exec Time |
25 ms |
Memory |
932 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 |
24 ms |
928 KB |
subtask0_sample_02.txt |
AC |
23 ms |
924 KB |
subtask0_sample_03.txt |
AC |
25 ms |
920 KB |
subtask0_sample_04.txt |
AC |
23 ms |
928 KB |
subtask1_random01.txt |
AC |
23 ms |
804 KB |
subtask1_random02.txt |
AC |
23 ms |
932 KB |
subtask1_random03.txt |
AC |
23 ms |
928 KB |
subtask1_random04.txt |
AC |
24 ms |
932 KB |
subtask1_random05.txt |
AC |
23 ms |
808 KB |
subtask1_random06.txt |
AC |
24 ms |
808 KB |
subtask1_random07.txt |
AC |
23 ms |
804 KB |
subtask1_random08.txt |
AC |
24 ms |
932 KB |
subtask1_random09.txt |
AC |
23 ms |
804 KB |
subtask1_random10.txt |
AC |
24 ms |
932 KB |
subtask1_random11.txt |
AC |
24 ms |
920 KB |
subtask1_random12.txt |
AC |
23 ms |
800 KB |
subtask1_random13.txt |
AC |
24 ms |
808 KB |
subtask1_random14.txt |
AC |
24 ms |
932 KB |
subtask1_random15.txt |
AC |
22 ms |
800 KB |
subtask1_random16.txt |
AC |
23 ms |
804 KB |
subtask1_random17.txt |
AC |
23 ms |
928 KB |
subtask1_random18.txt |
AC |
23 ms |
916 KB |