Submission #322578
Source Code Expand
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define mp1(a,b,c) P1(a,P(b,c))
#define pque(a) priority_queue<a>
#define rpque(a) priority_queue<a,vector<a>,greater<a>>
const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
const int kaijou[10]={1,1,2,6,24,120,720,5040,40320,362880};
int main(){
int n,m;
cin >> n >> m;
cout << n*525 + m*15 << endl;
}
Submission Info
Submission Time |
|
Task |
A - プレミアム会員 |
User |
yokozuna57 |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
1313 Byte |
Status |
AC |
Exec Time |
25 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 |
24 ms |
800 KB |
subtask0_sample_02.txt |
AC |
22 ms |
800 KB |
subtask0_sample_03.txt |
AC |
24 ms |
796 KB |
subtask0_sample_04.txt |
AC |
23 ms |
920 KB |
subtask1_random01.txt |
AC |
22 ms |
700 KB |
subtask1_random02.txt |
AC |
24 ms |
796 KB |
subtask1_random03.txt |
AC |
23 ms |
804 KB |
subtask1_random04.txt |
AC |
24 ms |
804 KB |
subtask1_random05.txt |
AC |
21 ms |
920 KB |
subtask1_random06.txt |
AC |
25 ms |
800 KB |
subtask1_random07.txt |
AC |
24 ms |
924 KB |
subtask1_random08.txt |
AC |
24 ms |
796 KB |
subtask1_random09.txt |
AC |
24 ms |
796 KB |
subtask1_random10.txt |
AC |
24 ms |
736 KB |
subtask1_random11.txt |
AC |
24 ms |
732 KB |
subtask1_random12.txt |
AC |
22 ms |
668 KB |
subtask1_random13.txt |
AC |
24 ms |
804 KB |
subtask1_random14.txt |
AC |
23 ms |
788 KB |
subtask1_random15.txt |
AC |
24 ms |
676 KB |
subtask1_random16.txt |
AC |
23 ms |
800 KB |
subtask1_random17.txt |
AC |
24 ms |
804 KB |
subtask1_random18.txt |
AC |
23 ms |
912 KB |