| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1286140 | tuncay_pasha | Bank (IZhO14_bank) | C++20 | 1 ms | 572 KiB |
// Try to be as positive as natural numbers :)
#include "bits/stdc++.h"
#define int long long
const int N = 25;
int a[N];
int n, m;
bool ok;
void clc(int i, int sum) {
if (i > m) {
if (sum == n) {
ok = true;
}
return ;
}
clc(i + 1, sum);
clc(i + 1, sum + a[i]);
}
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cin >> n >> m;
for (int i = 1; i <= m; ++i) {
std::cin >> a[i];
}
clc(1, 0);
std::cout << (ok ? "YES" : "NO");
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
