Submission #322573

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <vector>
#include <deque>
#include <cstdlib>
#include <numeric>
#include <cstring>
#include <ctime>
#include <climits>
#include <sstream>
#include <complex>
#define Mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define Rep(__i,__n) for(int __i = 0 ; __i < (__n);__i++)
#define Range(_ind,_a,_b) for(int _ind = (_a) ; _ind <(int)(_b);_ind++) 
#define ForEach(__itr,__cont) for(typeof((__cont).begin()) __itr = (__cont).begin(); __itr != (__cont).end();__itr++ )
#define All(__cont)  (__cont).begin(),(__cont).end()

using namespace std;
typedef complex<double> P;
typedef long long ll;
typedef vector<int> vi ;
typedef vector<double> vd;
typedef vector<vector <int> > vvi;
typedef vector<vector<double> > vvd;
typedef pair<int,int> pii;
const int inf = INT_MAX / 3;
const double eps = 1e-9;
template <typename T>

void debugvec(vector<T> &vec){
#ifdef DEBUG
  cout << "[";
  ForEach(itr,vec){
    if(itr != vec.begin())cout << ",";
    cout << *itr;
  }
  cout << "]"<<endl;;
#endif
}
int main(){
  int n , k ;
  cin >> n >> k;
  cout << k*540 + (n-k)*525 << endl;

}

Submission Info

Judge Result