Submission #1231875

#TimeUsernameProblemLanguageResultExecution timeMemory
1231875AishaFootball (info1cup20_football)C++20
0 / 100
88 ms580 KiB
#include "bits/stdc++.h" using namespace std; #define int long long signed main() { int N = 100, K = 100; vector <vector <int>> dp(N + 1, vector <int> (K + 1)); for (int i = 1; i <= N; i ++) { for (int j = 1; j <= K; j ++) { if (i == j) dp[i][j] = 1; if (i - j < 0) break; // i - j ta olindi // j ta olmoqchi // oxirida x ta olgan // lekin j <= x bo'lishi kerak (shartga ko'ra) for (int x = j; x <= K; x ++) { dp[i][j] = max(dp[i][j], dp[i - j][x]); } } } int t; cin >> t; while (t --) { int n, k; cin >> n >> k; int x; cin >> x; int ans = 0; for (int i = 1; i <= k; i ++) ans = max(ans, dp[x][i]); cout << ans << endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...