Submission #1025915
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;
namespace std {
bool operator<(const P& a, const P& b) {
return a.X != b.X ? a.X < b.X : a.Y < b.Y;
}
}
signed main() {
int n, x; cin >> n >> x;
cout << x * 540 + (n-x) * 525 << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - プレミアム会員 |
User |
tsutaj |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
1522 Byte |
Status |
AC |
Exec Time |
19 ms |
Memory |
800 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 |
18 ms |
672 KB |
subtask0_sample_02.txt |
AC |
17 ms |
800 KB |
subtask0_sample_03.txt |
AC |
18 ms |
792 KB |
subtask0_sample_04.txt |
AC |
19 ms |
800 KB |
subtask1_random01.txt |
AC |
18 ms |
672 KB |
subtask1_random02.txt |
AC |
19 ms |
792 KB |
subtask1_random03.txt |
AC |
18 ms |
800 KB |
subtask1_random04.txt |
AC |
17 ms |
796 KB |
subtask1_random05.txt |
AC |
16 ms |
796 KB |
subtask1_random06.txt |
AC |
19 ms |
712 KB |
subtask1_random07.txt |
AC |
17 ms |
800 KB |
subtask1_random08.txt |
AC |
18 ms |
672 KB |
subtask1_random09.txt |
AC |
18 ms |
788 KB |
subtask1_random10.txt |
AC |
17 ms |
792 KB |
subtask1_random11.txt |
AC |
18 ms |
800 KB |
subtask1_random12.txt |
AC |
18 ms |
800 KB |
subtask1_random13.txt |
AC |
18 ms |
800 KB |
subtask1_random14.txt |
AC |
19 ms |
792 KB |
subtask1_random15.txt |
AC |
18 ms |
796 KB |
subtask1_random16.txt |
AC |
18 ms |
800 KB |
subtask1_random17.txt |
AC |
17 ms |
800 KB |
subtask1_random18.txt |
AC |
17 ms |
792 KB |