Submission #1746495
Source Code Expand
#include <algorithm> #include <cstdio> #include <cstring> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <math.h> #include <queue> #include <set> #include <stack> #include <string> #include <type_traits> #include <vector> typedef int ll; #define FOR(i, a, b) for (ll i = (a); i < (b); ++i) #define REP(i, n) FOR(i, 0, n) #define EREP(i, n) for (int i = (n); i >= 0; --i) #define mod 100000 #define INF 93193111451418101 #define MIN -933111451418101 using namespace std; typedef pair<ll, ll> P; template <typename T, typename U> typename std::enable_if<std::rank<T>::value == 0>::type fill_all(T &arr, const U &v) { arr = v; } template <typename ARR, typename U> typename std::enable_if<std::rank<ARR>::value != 0>::type fill_all(ARR &arr, const U &v) { for (auto &i : arr) { fill_all(i, v); } } //------------------?????°-----------------------// ll n, m, s; ll dp[50][4005]; //何番目、合計,max std::vector<int> v[2][3000]; //-------------------??¢??°----------------------// int main() { cin >> n >> m >> s; n *= n; dp[0][0] = 1; FOR(i, 1, m + 1) { for (ll j = n; j >= 1; j--) { FOR(k, i, s + 1) { (dp[j][k] += dp[j - 1][k - i]) %= mod; } } } cout << dp[n][s] << endl; }
Submission Info
Submission Time | |
---|---|
Task | F - ビンゴ |
User | keidaroo |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1440 Byte |
Status | AC |
Exec Time | 416 ms |
Memory | 1152 KB |
Judge Result
Set Name | set01 | set02 | set03 | set04 | set05 | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 20 / 20 | 20 / 20 | 20 / 20 | 20 / 20 | 20 / 20 | ||||||||
Status |
|
AC |
|
|
|
Set Name | Test Cases |
---|---|
set01 | data1 |
set02 | data2 |
set03 | data3 |
set04 | data4 |
set05 | data5 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
data1 | AC | 1 ms | 384 KB |
data3 | AC | 1 ms | 384 KB |
data4 | AC | 11 ms | 640 KB |
data5 | AC | 416 ms | 1152 KB |