Submission #5826516
Source Code Expand
/*
_ _ _ _ _ _ _ _ _ _ _
/ /\ / /\ / /\ / /\ / /\ /\ \ /\_\/\_\ _ /\ \ /\ \ _ /\ \
/ / \ / / \ / / \ / / / / / / \ \ \ / / / / //\_\ \ \ \ / \ \ /\_\ / \ \
/ / /\ \__ / / /\ \ / / /\ \__ / /_/ / / / /\ \_\ /\ \/ \ \/ / / /\ \_\ / /\ \ \_/ / // /\ \_\
/ / /\ \___\ / / /\ \ \ / / /\ \___\ / /\ \__/ / / / /\/_/ / \____\__/ / / /\/_/ / / /\ \___/ // / /\/_/
\ \ \ \/___// / / \ \ \ \ \ \ \/___// /\ \___\/ / / / / / /\/________/ / / / / / / \/____// / / ______
\ \ \ / / /___/ /\ \ \ \ \ / / /\/___/ / / / / / / /\/_// / / / / / / / / / / // / / /\_____\
_ \ \ \ / / /_____/ /\ \ _ \ \ \ / / / / / / / / / / / / / / / / / / / / / / / // / / \/____ /
/_/\__/ / / / /_________/\ \ \ /_/\__/ / / / / / / / /___/ / /__ / / / / / /___/ / /__ / / / / / // / /_____/ / /
\ \/___/ / / / /_ __\ \_\\ \/___/ / / / / / / //\__\/_/___\\/_/ / / //\__\/_/___\/ / / / / // / /______\/ /
\_____\/ \_\___\ /____/_/ \_____\/ \/_/ \/_/ \/_________/ \/_/ \/_________/\/_/ \/_/ \/___________/
*/
#include<bits/stdc++.h>
using namespace std;
#define ALL(obj) (obj).begin(), (obj).end()
#define REP(i, n) for(int i = 0;i < (n);++i)
#define endl '\n'
#define pb emplace_back
#define mkp make_pair
#define p_q priority_queue
#define INF 2000000000
#define PI 3.1415926
#define coutdb cout << fixed << setprecision(10)
const int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};
const int dx_8[]={1,1,0,-1,-1,-1,0,1}, dy_8[]={0,-1,-1,-1,0,1,1,1};
const long long MOD = 1e9+7;
// typedef long long ll;
#define int long long
template <typename T> inline T GCD(T a,T b){T c;while(b!=0){c=a%b;a=b;b=c;}return a;}
template <typename T> inline T LCM(T a,T b){T c=GCD(a,b);a/=c;return a*b;}
template <typename T> inline T nCr(T a,T b){T i,r=1;for(i=1;i<=b;i++){r*=(a+1-i);r/=i;}return r;}
template <typename T> inline T nHr(T a,T b){return nCr(a+b-1,b);}
signed main(void){
cin.tie(0);
ios::sync_with_stdio(false);
int point[] = {25,39,51,76,163,111,128,133,138};
vector<int> vec;
REP(i, 1<<9){
int bit = i;
int pts = 0;
REP(j, 9){
if(bit % 2) pts += point[j];
bit /= 2;
}
vec.pb(pts); vec.pb(pts+58); vec.pb(pts+136);
}
sort(ALL(vec));
vec.erase(unique(ALL(vec)), vec.end());
for(int x : vec) cout << x << endl;
}
Submission Info
Submission Time |
|
Task |
A - 得点 |
User |
Sashiming |
Language |
C++14 (GCC 5.4.1) |
Score |
25 |
Code Size |
2833 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
25 / 25 |
Status |
AC
|
|
Set Name |
Test Cases |
Sample |
|
All |
1.txt |
Case Name |
Status |
Exec Time |
Memory |
1.txt |
AC |
1 ms |
256 KB |