Submission #1364959
Source Code Expand
#include "bits/stdc++.h" #include <regex> #define _USE_MATH_DEFINES #include <math.h> using namespace std; #ifndef _DEBUG #define main_ main #endif #define FOR(i,s,e) for (int i = int(s); i < int(e); ++i) #define REP(i,e) FOR(i,0,e) #define INF (INT_MAX/2) #define EPS (1.0e-8) #define LINF (LONG_MAX/2) typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<ll> vl; typedef vector<vl> vvl; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<bool> vb; typedef vector<string> vs; template <typename T> using keyVal = pair<string, T>; template<typename T> bool val_greater(const keyVal<T>& left, const keyVal<T>& right) { return left.second > right.second; } vs split(string str, char sep) { vs v; stringstream ss(str); string t; while (getline(ss, t, sep)) v.push_back(t); return v; } void init_global() {} const ll MOD = 1e9 + 7; const int N_MAX = 604; ll dp[N_MAX][N_MAX]; int main_() { cin.tie(0); ios::sync_with_stdio(false); ll N, K; cin >> N >> K; FOR(i, 1, N + K) { dp[i][0] = 1; dp[i][i] = 1; } FOR(i, 2, N + K) { FOR(j, 1, i) { dp[i][j] = dp[i - 1][j - 1] + dp[i - 1][j]; dp[i][j] %= MOD; } } ll ans = 0; if (N > K) { ans = dp[N + K - 1][K]; } else { ll m = K%N; if (m == 0) { ans = 1; } else { ans = dp[N][m]; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - 高橋幼稚園 |
User | apprec |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1478 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 2944 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 80 / 80 | 20 / 20 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt |
Subtask2 | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 256 KB |
subtask0_sample_02.txt | AC | 3 ms | 2816 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 2 ms | 2432 KB |
subtask1_02.txt | AC | 2 ms | 1664 KB |
subtask1_03.txt | AC | 2 ms | 1792 KB |
subtask1_04.txt | AC | 2 ms | 1920 KB |
subtask1_05.txt | AC | 2 ms | 1152 KB |
subtask1_06.txt | AC | 2 ms | 2048 KB |
subtask1_07.txt | AC | 3 ms | 2944 KB |
subtask1_08.txt | AC | 2 ms | 2176 KB |
subtask1_09.txt | AC | 2 ms | 2176 KB |
subtask1_10.txt | AC | 2 ms | 2304 KB |
subtask1_11.txt | AC | 2 ms | 2176 KB |
subtask1_12.txt | AC | 2 ms | 1408 KB |
subtask1_13.txt | AC | 2 ms | 2048 KB |
subtask1_14.txt | AC | 2 ms | 1536 KB |
subtask1_15.txt | AC | 2 ms | 2304 KB |
subtask1_16.txt | AC | 2 ms | 1152 KB |
subtask1_17.txt | AC | 2 ms | 2560 KB |
subtask1_18.txt | AC | 1 ms | 256 KB |
subtask1_19.txt | AC | 2 ms | 2560 KB |
subtask2_01.txt | AC | 1 ms | 384 KB |
subtask2_02.txt | AC | 1 ms | 512 KB |
subtask2_03.txt | AC | 2 ms | 896 KB |
subtask2_04.txt | AC | 1 ms | 768 KB |
subtask2_05.txt | AC | 1 ms | 768 KB |
subtask2_06.txt | AC | 1 ms | 512 KB |
subtask2_07.txt | AC | 1 ms | 384 KB |
subtask2_08.txt | AC | 1 ms | 768 KB |
subtask2_09.txt | AC | 1 ms | 384 KB |
subtask2_10.txt | AC | 2 ms | 896 KB |
subtask2_11.txt | AC | 1 ms | 640 KB |