buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INT_MAX 2147483647
#de... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INT_MAX 2147483647
#de... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 40], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 22]] | 1 | 272 | 5 |
#include <iostream>
using namespace std;
int w[100000];
int n, k;
int count(long long P) {
int count = 0, i;
long long Pn;
for (i = k; i > 0; i--) {
Pn = P;
while (Pn - w[count] >= 0) {
Pn -= w[count];
count++;
if (count == n)
break;
}
}
return count;
}
int main() {
... | #include <iostream>
using namespace std;
int w[100000];
int n, k;
int count(long long P) {
int count = 0, i;
long long Pn;
for (i = k; i > 0; i--) {
Pn = P;
while (Pn - w[count] >= 0) {
Pn -= w[count];
count++;
if (count == n)
return count;
}
}
return count;
}
int mai... | [["-", 0, 52, 8, 9, 0, 57, 64, 93, 0, 94], ["+", 0, 52, 8, 9, 0, 57, 64, 37, 0, 38], ["+", 0, 52, 8, 9, 0, 57, 64, 37, 0, 22]] | 1 | 241 | 3 |
#include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return 0;
}
}
return i;
}
int solve(... | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve(... | [["-", 0, 52, 8, 9, 0, 57, 64, 37, 0, 13], ["+", 0, 52, 8, 9, 0, 57, 64, 37, 0, 22]] | 1 | 212 | 2 |
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
vector<int> Input(const int n) {
vector<int> W;
for (int i = 0; i < n; i++) {
int w;
cin >> w;
W.push_back(w);
}
return W;
}
bool IsAllLoaded(int P, vector<int> &W, int k) {
int TrackIndex = 0;
int CurrentSum = 0;
... | #include <iostream>
#include <numeric>
#include <vector>
using namespace std;
vector<int> Input(const int n) {
vector<int> W;
for (int i = 0; i < n; i++) {
int w;
cin >> w;
W.push_back(w);
}
return W;
}
bool IsAllLoaded(int P, vector<int> &W, int k) {
int TrackIndex = 0;
int CurrentSum = 0;
... | [["-", 64, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 379 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int contena[100000];
int n, k;
bool search(int);
int main() {
int linemax = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> contena[i];
linemax = max(linemax, contena[i]);
}
int ip, ap;
ip = 0;
ap = 1 << 31;
while (ap - ip > 0)... | #include <algorithm>
#include <iostream>
using namespace std;
int contena[100000];
int n, k;
bool search(int);
int main() {
int linemax = 0;
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> contena[i];
linemax = max(linemax, contena[i]);
}
int ip, ap;
ip = 0;
ap = (1 << 31) - 1;
while (ap - i... | [["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 24], ["+", 0, 1, 0, 11, 12, 16, 31, 23, 0, 25], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 226 | 4 |
#include <iostream>
using namespace std;
int stuff[100005];
int n, k;
bool allocation(int p) {
int sum = 0;
int i = 0;
int truck = 1;
while (i < n) {
if (p < stuff[i]) {
return false;
}
sum += stuff[i];
if (sum > p) {
truck++;
sum = 0;
if (truck > k)
return fals... | #include <iostream>
using namespace std;
int stuff[100005];
int n, k;
bool allocation(int p) {
int sum = 0;
int i = 0;
int truck = 1;
while (i < n) {
if (p < stuff[i]) {
return false;
}
sum += stuff[i];
if (sum > p) {
truck++;
sum = 0;
if (truck > k)
return fals... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 207 | 2 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//-------------------------------------------... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <istream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
//-------------------------------------------... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 52, 8, 9, 0, 43, 39, 78]] | 1 | 253 | 3 |
#include <algorithm>
#include <iostream>
using namespace std;
int n, k;
int w[100100];
bool calc(int m) {
int cnt = 1, now = 0;
for (int i = 0; i < n; i++) {
if (now + w[i] <= m) {
now += w[i];
} else if (w[i] <= m) {
now = w[i];
cnt++;
} else {
return false;
}
}
return... | #include <algorithm>
#include <iostream>
using namespace std;
int n, k;
int w[100100];
// calc??????????????????????????????????????????????????????p????¶???????????????????
//????????????????????¨?????§???????????????????????????????????¢??°
bool calc(int p) {
int cnt = 1, now = 0;
for (int i = 0; i < n; i++) {
... | [["-", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 49, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+... | 1 | 197 | 8 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using na... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using na... | [["-", 8, 9, 0, 52, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 20]] | 1 | 321 | 2 |
#include <algorithm>
#include <stdio.h>
int n, k;
int w[100000];
int check(int p) {
int weight = p;
int num = 0;
for (int j = 0; j < n; ++j) {
if (weight - w[j] < 0) {
++num;
weight = p;
}
if (num > k) {
return j;
}
weight -= w[j];
}
return n;
}
int binarySearch(int w... | #include <algorithm>
#include <stdio.h>
int n, k;
int w[100000];
int check(int p) {
int weight = p;
int num = 1;
for (int j = 0; j < n; ++j) {
if (weight - w[j] < 0) {
++num;
weight = p;
}
if (num > k) {
return j;
}
weight -= w[j];
}
return n;
}
int binarySearch(int w... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 288 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int w[n];
int m = 0;
for (int i = 0; i < n; ++i) {
cin >> w[i];
m += w[i];
}
int P = 0;
int j = 0;
int t = 0;
int l = 0;
int r = m;
while (l < r) {
P = (l + r) / 2;
while (true) {
int s = 0;
... | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int w[n];
int m = 0;
for (int i = 0; i < n; ++i) {
cin >> w[i];
m += w[i];
}
int P = 0;
int j = 0;
int t = 0;
int l = 0;
int r = m;
while (l < r) {
P = (l + r) / 2;
while (true) {
int s = 0;
... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 209 | 2 |
#include <iostream>
using namespace std;
#define MAX 100000
int n, k;
long long T[MAX];
int check(long long P) {
int i = 0;
for (int j = 0; j < k; j++) {
long long s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve() {
long l... | #include <iostream>
using namespace std;
#define MAX 100000
int n, k;
long long T[MAX];
int check(long long P) {
int i = 0;
for (int j = 0; j < k; j++) {
long long s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve() {
long l... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22]] | 1 | 212 | 2 |
#include <iostream>
using namespace std;
#define MAX 19960328
typedef long long LL;
int n, k;
LL T[MAX];
int check(LL P) {
int i = 0;
for (int j = 0; j < k; i++) {
LL s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n) {
return n;
}
}
}
return i;
}
int solve... | #include <iostream>
using namespace std;
#define MAX 19980328
typedef long long LL;
int n, k;
LL T[MAX];
int check(LL P) {
int i = 0;
for (int j = 0; j < k; j++) {
LL s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n) {
return n;
}
}
}
return i;
}
int solve... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22]] | 1 | 214 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
using namespace std;
bool judge(const int w[], int n, int k, int p);
int main(void) {
int n, k;
cin >> n >> k;
int *w = new int[n], sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
int p = sum / k;
while ... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <stdio.h>
using namespace std;
bool judge(const int w[], int n, int k, int p);
int main(void) {
int n, k;
cin >> n >> k;
int w[100000], sum = 0;
for (int i = 0; i < n; i++) {
cin >> w[i];
sum += w[i];
}
int p = sum / k;
while (!judg... | [["-", 8, 9, 0, 43, 49, 50, 49, 84, 0, 48], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["-", 8, 9, 0, 43, 49, 50, 51, 350, 0, 228], ["-", 8, 9, 0, 43, 49, 50, 51, 350, 39, 40], ["-", 0, 43, 49, 50, 51, 350, 49, 367, 368, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 8, 9, 0, 57, 0, 121], ["+", 8, 9, ... | 1 | 214 | 8 |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; ++i) {
int w;
cin >> w;
v.push_back(w);
}
auto sum_ = accumulate(begin(v), end(v), 0);
auto max_ =
accum... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int n;
int k;
cin >> n >> k;
vector<int> v;
for (int i = 0; i < n; ++i) {
int w;
cin >> w;
v.push_back(w);
}
auto sum_ = accumulate(begin(v), end(v), 0);
auto max_ =
accum... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 110], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["-", 0, 338, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 57, 64, 9, 0, 57, 64, 9, 0, 46]] | 1 | 260 | 6 |
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
// k????????§????????????p?????????????£?????°??´§???
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
// k????????§????????????p?????????????£?????°??´§???
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 31, 13], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 1 | 222 | 4 |
#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
// k????????§????????????p?????????????£?????°??´§???
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
... | #include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
// k????????§????????????p?????????????£?????°??´§???
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 72], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 222 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
ll w[100000];
ll n, k;
ll f(ll P) {
vector<ll> track;
for (int i = 0; i < k; i++)
track.p... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
ll w[100000];
ll n, k;
ll f(ll P) {
vector<ll> track;
for (int i = 0; i < k; i++)
track.p... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 232 | 5 |
#include <cstdio>
using namespace std;
int w[100000], n, k;
int cntp(int p) {
int cnt = 1, wgh = 0;
for (int i = 0; i < n;) {
if (wgh + w[i] <= p) {
wgh += w[i++];
} else {
if (wgh > 0)
cnt++;
else
return k + 1;
wgh = 0;
}
}
return cnt;
}
int main() {
scanf... | #include <cstdio>
using namespace std;
int w[100000], n, k;
int cntp(int p) {
int cnt = 1, wgh = 0;
for (int i = 0; i < n;) {
if (wgh + w[i] <= p) {
wgh += w[i++];
} else {
if (wgh > 0)
cnt++;
else
return k + 1;
wgh = 0;
}
}
return cnt;
}
int main() {
scanf... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 226 | 5 |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define min(a, b) (a) > (b) ? (b) : (a)
... | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define min(a, b) (a) > (b) ? (b) : (a)
... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 31, 22], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 12, 22]] | 1 | 274 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
int truck[100000 + 10], A[100000 + 10];
int n, k, sum = 0;
int check(int load, int k, int tot) {
int j = 0;
for (int i = 0; i < k; i++) {
truck[i] = 0;
while (j < n) {
int temp = truck[i] + A[j];
if (temp <= load && temp <= tot) {
... | #include <cstdio>
#include <iostream>
using namespace std;
int truck[100000 + 10], A[100000 + 10];
int n, k, sum = 0;
int check(int load, int k, int tot) {
int j = 0;
for (int i = 0; i < k; i++) {
truck[i] = 0;
while (j < n) {
int temp = truck[i] + A[j];
if (temp <= load) {
truck[i] =... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 98], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 31, 22], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22]] | 1 | 282 | 4 |
#include <iostream>
using namespace std;
using llong = long long;
constexpr int MAX = 100000;
int n, k;
llong T[MAX];
bool check(int x) {
llong cost = 0;
int count = 0;
for (int i = 0; i < n; i++) {
cost += T[i];
while (cost > x) {
cost = T[i];
count++;
if (count == k)
return... | #include <iostream>
using namespace std;
using llong = long long;
constexpr int MAX = 100000;
int n, k;
llong T[MAX];
bool check(int x) {
llong cost = 0;
int count = 0;
for (int i = 0; i < n; i++) {
cost += T[i];
while (cost > x) {
cost = T[i];
count++;
if (count == k)
return... | [["-", 0, 52, 15, 339, 51, 16, 31, 16, 17, 72], ["-", 0, 52, 15, 339, 51, 16, 31, 16, 12, 13]] | 1 | 209 | 2 |
#include <iostream>
#define MAX_NUM 100000
bool test(int p, int n, int k, int w[]) {
int track = p;
int i = 0, j = 0;
while (j != n) {
if (track >= w[j]) {
track -= w[j];
j++;
} else {
track = p;
i++;
if (i == k)
return false;
}
}
return true;
}
int main() {... | #include <iostream>
#define MAX_NUM 100000
bool test(int p, int n, int k, int w[]) {
int track = p;
int i = 0, j = 0;
while (j != n) {
if (track >= w[j]) {
track -= w[j];
j++;
} else {
track = p;
i++;
if (i == k)
return false;
}
}
return true;
}
int main() {... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 283 | 2 |
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int n, k;
vector<int> w;
bool ok(int P);
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
int wi;
cin >> wi;
w.push_back(wi);
}
int l = 0, h = 10;
while (l + 1 < h) {
int m = (l + h) / 2;
if (ok(m))
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int n, k;
vector<int> w;
bool ok(int P);
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
int wi;
cin >> wi;
w.push_back(wi);
}
int l = 0, h = 1000000000;
while (l + 1 < h) {
int m = (l + h) / 2;
if (... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 193 | 2 |
#include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve... | #include <iostream>
using namespace std;
#define MAX 100000
typedef long long llong;
int n, k;
llong T[MAX];
int check(llong P) {
int i = 0;
for (int j = 0; j < k; j++) {
llong s = 0;
while (s + T[i] <= P) {
s += T[i];
i++;
if (i == n)
return n;
}
}
return i;
}
int solve... | [["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22]] | 1 | 212 | 4 |
n = int(input())
dic = set()
for i in range(n):
o = input().split()
if o[0] == 'insert':
dic.add(o[1])
elif o[1] in dic:
print('yes\n')
else:
print('no\n') | n = int(input())
dic = set()
for i in range(n):
o = input().split()
if o[0] == 'insert':
dic.add(o[1])
elif o[1] in dic:
print('yes')
else:
print('no') | [["-", 0, 652, 3, 4, 0, 557, 0, 6, 0, 44]] | 5 | 73 | 2 |
t = set()
m = int(input())
for i in range(m):
cmd, key = input().split()
if cmd == "insert":
t.add(key)
else:
if key in t:
print("yes")
else:
print("no")
print(t) | t = set()
m = int(input())
for i in range(m):
cmd, key = input().split()
if cmd == "insert":
t.add(key)
else:
if key in t:
print("yes")
else:
print("no") | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 70 | 4 |
from collections import deque
D = set()
N = int(input())
for i in range(N):
c, s = input().split()
if c == "insert":
D.append(s)
elif c == "find":
if (s in D):
print("yes")
else:
print("no") | from collections import deque
D = set()
N = int(input())
for i in range(N):
c, s = input().split()
if c == "insert":
D.add(s)
elif c == "find":
if (s in D):
print("yes")
else:
print("no") | [["-", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 77 | 2 |
import sys
def main():
_ = int(input())
imps = sys.stdin.readlines()
db = {}
for imp in imps:
c, k = imp.split(' ')
if c == 'insert':
db[k] = 0
elif db in k:
print('yes')
else:
print('no')
main() | import sys
def main():
_ = int(input())
imps = sys.stdin.readlines()
db = {}
for imp in imps:
c, k = imp.split(' ')
if c == 'insert':
db[k] = 0
elif k in db:
print('yes')
else:
print('no')
main() | [["-", 8, 196, 0, 57, 75, 665, 15, 666, 0, 22], ["-", 8, 196, 0, 57, 75, 665, 15, 666, 667, 267], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 667, 267], ["+", 8, 196, 0, 57, 75, 665, 15, 666, 0, 22]] | 5 | 80 | 4 |
n = int(input())
d = set()
for i in range(n):
x = input()
if x[0] == "i":
d.append(x[7:])
else :
if(x[5:] in d) : print("yes")
else : print("no")
| n = int(input())
d = set()
for i in range(n):
x = input()
if x[0] == "i":
d.add(x[7:])
else :
if(x[5:] in d) : print("yes")
else : print("no")
| [["-", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 73 | 2 |
n = int(input())
s = set()//集合
for _ in range(n):
inst = input().split()
if inst[0] == "insert":
s.add(inst[1])
else:
if inst[1] in s:
print("yes")
else:
print("no")
| n = int(input())
s = set()
for _ in range(n):
inst = input().split()
if inst[0] == "insert":
s.add(inst[1])
else:
if inst[1] in s:
print("yes")
else:
print("no")
| [["-", 0, 656, 0, 1, 0, 662, 12, 657, 17, 676], ["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 22]] | 5 | 75 | 2 |
#16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()
for _ in range(n):
tmp,mozi= input().split()
if tmp == "find":
if word in box:
print("yes")
else:
print("no")
else:
dic.add(mozi)
| #16D8101014F Kurume Ryunosuke 久留米竜之介 2018/5/16 Python3
n = int(input())
box = set()
for _ in range(n):
tmp,mozi= input().split()
if tmp == "find":
if mozi in box:
print("yes")
else:
print("no")
else:
box.add(mozi)
| [["-", 0, 57, 64, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 57, 64, 196, 0, 57, 15, 666, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 500, 22]] | 5 | 67 | 4 |
n = int(input())
d = {}
for i in n:
cmd = input()
if cmd[0] == 'i':
d[cmd[7:]] = 0
else:
print('yes' if cmd[5:] in d else 'no') | n = int(input())
d = {}
for i in range(n):
cmd = input()
if cmd[0] == 'i':
d[cmd[7:]] = 0
else:
print('yes' if cmd[5:] in d else 'no') | [["+", 36, 36, 0, 656, 0, 7, 12, 652, 63, 22], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 25]] | 5 | 62 | 3 |
import java.io.*;
import java.util.*;
import javax.xml.crypto.Data;
public class Main {
static int n;
static int[] A = new int[50];
public static void main(String[] args) throws IOException {
//??\???
/*
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] str = b... |
import java.io.*;
import java.util.*;
import javax.xml.crypto.Data;
public class Main {
static int n;
static int[] A = new int[50];
public static void main(String[] args) throws IOException {
//??\???
/*
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] str = b... | [["-", 0, 57, 15, 15, 0, 492, 3, 4, 0, 22], ["+", 0, 57, 15, 15, 0, 492, 3, 4, 0, 499], ["-", 15, 15, 0, 492, 3, 4, 0, 504, 71, 499], ["+", 15, 15, 0, 492, 3, 4, 0, 504, 71, 22]] | 3 | 260 | 4 |
#include <stdio.h>
#define MAX 2000
int N1, A[MAX];
int Solve(int x, int y) {
int r;
if (y == 0)
return 1;
if (x >= N1)
return 0;
r = Solve(x + 1, y) || (x + 1, y - A[x]);
return r;
}
int main() {
int i, B, N2;
scanf("%d", &N1);
for (i = 0; i < N1; i++) {
scanf("%d", A[i]);
}
scanf... | #include <stdio.h>
#define MAX 2000
int N1, A[MAX];
int Solve(int x, int y) {
int r;
if (y == 0)
return 1;
if (x >= N1)
return 0;
r = Solve(x + 1, y) || Solve(x + 1, y - A[x]);
return r;
}
int main() {
int i, B, N2;
scanf("%d", &N1);
for (i = 0; i < N1; i++) {
scanf("%d", &A[i]);
}
... | [["+", 0, 1, 0, 11, 12, 16, 12, 2, 63, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 190 | 2 |
#include <stdio.h>
#include <stdlib.h>
void makec(int);
void rec(int);
void sold(void);
//組み合わせの配列生成まではできた
// kumiawase no array made ha dekita
// m 最初のDataArrayの個数
// n 二つめのたしてくやつの個数
// qa[] dataarray
// s[] たしてくやつ
// ans[] s[]の組み合わせ
// qaa[]
int m, n, s[200], ans[20], qa[20], de[200];
int main() {
int i, k;
... | #include <stdio.h>
#include <stdlib.h>
void makec(int);
void rec(int);
void sold(void);
//組み合わせの配列生成まではできた
// kumiawase no array made ha dekita
// m 最初のDataArrayの個数
// n 二つめのたしてくやつの個数
// qa[] dataarray
// s[] たしてくやつ
// ans[] s[]の組み合わせ
// qaa[]
int m, n, s[200], ans[20], qa[20], de[200];
int main() {
int i, k;
... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 395 | 2 |
#include <stdio.h>
int solve(int, int);
int A[2000], n;
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < n; i++) {
scanf("%d", &q);
if (solve(0, q))
printf("yes\n");
else
printf("no\n");
}
return 0;
}
int... | #include <stdio.h>
int solve(int, int);
int A[2000], n;
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &m);
for (i = 0; i < m; i++) {
scanf("%d", &q);
if (solve(0, q))
printf("yes\n");
else
printf("no\n");
}
return 0;
}
int... | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 191 | 4 |
#include <stdio.h>
int n, A[50];
int solve(int x, int y);
int main() {
int i, a, b;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
scanf("%d", &a);
}
for (i = 0; i < a; i++) {
scanf("%d", &b);
if (solve(0, b)) {
printf("yes\n");
} else
printf("no\n");
}
retu... | #include <stdio.h>
int n, A[50];
int solve(int x, int y);
int main() {
int i, a, b;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &b);
if (solve(0, b)) {
printf("yes\n");
} else
printf("no\n");
}
return... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 195 | 2 |
#include <stdio.h>
int solve(int, int, int *, int);
int main() {
int i, n, A[20], q, m;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 1; i <= q; i++) {
scanf("%d", &m);
if (solve(0, m, A, n))
printf("yes\n");
else
printf("no\n");
... | #include <stdio.h>
int solve(int, int, int *, int);
int main() {
int i, n, A[21], q, m;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 1; i <= q; i++) {
scanf("%d", &m);
if (solve(1, m, A, n))
printf("yes\n");
else
printf("no\n");
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 57, 15, 23, 0, 2, 3, 4, 0, 13], ["+", 0, 57, 15, 23, 0, 2, 3, 4, 0, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 217 | 6 |
#include <stdio.h>
int func(int, int);
int c, n, a[200];
int main() {
int q, i, j;
int mi[200];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &mi[j]);
}
for (i = 0; i < n; i++) {
c = func(0, mi[i]);
if (c)
... | #include <stdio.h>
int func(int, int);
int c, n, a[200];
int main() {
int q, i, j;
int mi[200];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &mi[j]);
}
for (i = 0; i < q; i++) {
c = func(0, mi[i]);
if (c)
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35]] | 0 | 230 | 5 |
#include <stdio.h>
#include <stdlib.h>
int *A, num1;
int solve(int i, int m);
int main(void) {
int num2, m, i;
scanf("%d", &num1);
A = calloc(num1, sizeof(int));
for (i = 0; i < num1; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &num2);
for (i = 0; i < num2; i++) {
scanf("%d", &m);
if (so... | #include <stdio.h>
#include <stdlib.h>
int *A, num1;
int solve(int i, int m);
int main(void) {
int num2, m, i;
scanf("%d", &num1);
A = calloc(num1, sizeof(int));
for (i = 0; i < num1; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &num2);
for (i = 0; i < num2; i++) {
scanf("%d", &m);
if (so... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 22], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13]] | 0 | 212 | 2 |
#include <stdio.h>
#define true 1
#define false -1
int A(int x, int y);
int a[2000], b[2000], c;
int main() {
int d, e, i;
char f[2][4] = {"yes", "no"};
scanf("%d", &c);
for (i = 0; i < c; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &d);
for (i = 0; i < d; i++) {
scanf("%d", &b[i]);
if (A(0,... | #include <stdio.h>
#define true 1
#define false -1
int A(int x, int y);
int a[2000], b[2000], c;
int main() {
int d, e, i;
char f[2][4] = {"yes", "no"};
scanf("%d", &c);
for (i = 0; i < c; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &d);
for (i = 0; i < d; i++) {
scanf("%d", &b[i]);
if (A(0,... | [["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 146], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 147]] | 0 | 277 | 2 |
#include <stdio.h>
#define true 1
#define false -1
#define M 2000
int x[M], y[200], n;
int solve(int i, int j) {
int res;
if (j == 0)
return true;
if (i >= n)
return false;
if (solve(i + 1, j) == true)
res = true;
else if (solve(i + 1, j - x[i]) == true)
res = true;
else
res = false;
... | #include <stdio.h>
#define true 1
#define false -1
#define M 2000
int x[M], y[200], n;
int solve(int i, int j) {
int res;
if (j == 0)
return true;
if (i >= n)
return false;
if (solve(i + 1, j) == true)
res = true;
else if (solve(i + 1, j - x[i]) == true)
res = true;
else
res = false;
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 258 | 2 |
#include <stdio.h>
int search(int, int);
int n, a[50];
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i = 0; i < n; i++) {
scanf("%d", &m);
if (search(0, m) == 1)
printf("yes\n");
else
printf("no\n");
}
r... | #include <stdio.h>
int search(int, int);
int n, a[50];
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m);
if (search(0, m) == 1)
printf("yes\n");
else
printf("no\n");
}
r... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 188 | 2 |
#include <stdio.h>
int n;
int A[2000];
int solve(int, int);
int main() {
int i, j, m, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m);
if (solve(0, m) == 0) {
printf("yes\n");
} else
printf("no\... | #include <stdio.h>
int n;
int A[2000];
int solve(int, int);
int main() {
int i, j, m, q;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m);
if (solve(0, m) == 1) {
printf("yes\n");
} else
printf("no\... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13]] | 0 | 204 | 6 |
#include <stdio.h>
int solve(int, int);
int a[2014], n, m, f;
int main() {
int b[2014], i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &m);
for (i = 0; i < m; i++)
scanf("%d", &b[i]);
for (i = 0; i < m; i++) {
if (solve(0, b[i]))
printf("yes\n");
else
... | #include <stdio.h>
int solve(int, int);
int a[2014], n, m;
int main() {
int b[2014], i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &m);
for (i = 0; i < m; i++)
scanf("%d", &b[i]);
for (i = 0; i < m; i++) {
if (solve(0, b[i]))
printf("yes\n");
else
p... | [["-", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["-", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 224 | 4 |
#include <stdio.h>
#define AMAX 20
#define MMAX 200
int A[AMAX + 1];
int n, q;
int solve_loop(int p, int t, int res) {
return res || (n == p) ? res
: solve_loop(p + 1, t - A[p], res == t) ||
solve_loop(p + 1, t, res == t);
}
int solve(int p, int t) { return s... | #include <stdio.h>
#define AMAX 20
#define MMAX 200
int A[AMAX + 1];
int n, q;
int solve_loop(int p, int t, int res) {
return res || (n < p) ? res
: solve_loop(p + 1, t - A[p], res == t) ||
solve_loop(p + 1, t, res == t);
}
int solve(int p, int t) { return solv... | [["-", 0, 41, 15, 16, 12, 23, 0, 16, 17, 60], ["+", 0, 41, 15, 16, 12, 23, 0, 16, 17, 18]] | 0 | 217 | 16 |
#include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE -1
int solve(int, int);
int n;
int *a;
int main() {
int q, i;
int *m;
scanf("%d", &n);
a = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
m = (int *)malloc(q * sizeof(int));
for... | #include <stdio.h>
#include <stdlib.h>
#define TRUE 1
#define FALSE 0
int solve(int, int);
int n;
int *a;
int main() {
int q, i;
int *m;
scanf("%d", &n);
a = (int *)malloc(n * sizeof(int));
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
m = (int *)malloc(q * sizeof(int));
for... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 251 | 2 |
#include <stdio.h>
#define TRUE 1
#define FALSE 0
int solve(int, int);
int n, A[2000], q, m[2000];
int main() {
int i, j, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
flag =... | #include <stdio.h>
#define TRUE 1
#define FALSE 0
int solve(int, int);
int n, A[2000], q, m[2000];
int main() {
int i, flag;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
flag = so... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 0 | 241 | 4 |
#include <stdio.h>
#define N 2000
#define M 2000
int solve(int, int);
int n, q, A[N], m[M];
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
j = 0;
... | #include <stdio.h>
#define N 2000
#define M 2000
int solve(int, int);
int n, q, A[N], m[M];
int main() {
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
j = 0;
... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 243 | 2 |
n, k = map(int, input().split())
l = list(int(input()) for i in range(n))
left = max(l); right = sum(l)
while left+1 < right: #最大値と合計値の間のどこかに考えるべき値が存在する
mid = (left + right) // 2
cnt = 1; cur = 0 #初期化
for a in l:
if mid < cur + a:
cur = a
cnt += 1
else:
... | n, k = map(int, input().split())
l = list(int(input()) for i in range(n))
left = max(l)-1; right = sum(l)
while left+1 < right: #最大値と合計値の間のどこかに考えるべき値が存在する
mid = (left + right) // 2
cnt = 1; cur = 0 #初期化
for a in l:
if mid < cur + a:
cur = a
cnt += 1
else:
... | [["+", 0, 656, 0, 1, 0, 662, 12, 657, 17, 33], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 112 | 2 |
def check(p):
i = 0
for _ in range(k):
total = 0
while total+n_list[i] <=p:
total += n_list[i]
i += 1
if i == n:
return n
return i
def solve():
left = 0
right = 10**5 * 10**4
middle = 0
while left-right > 1:
midd... | def check(p):
i = 0
for _ in range(k):
total = 0
while total+n_list[i] <=p:
total += n_list[i]
i += 1
if i == n:
return n
return i
def solve():
left = 0
right = 10**5 * 10**4
middle = 0
while right - left > 1:
mi... | [["-", 8, 196, 0, 52, 15, 666, 0, 657, 31, 22], ["-", 8, 196, 0, 52, 15, 666, 0, 657, 17, 33], ["+", 8, 196, 0, 52, 15, 666, 0, 657, 17, 33], ["+", 8, 196, 0, 52, 15, 666, 0, 657, 12, 22]] | 5 | 147 | 4 |
n, k = [ int( val ) for val in input( ).split( " " ) ]
w = []
maxW = sumW = 0
for i in range( n ):
num = int( input( ) )
sumW += num
w.append( num )
if maxW < num:
maxW = num
minP = 0
if 1 == k:
minP = sumW
elif n == k:
minP = maxW
else:
left = maxW
right = 100000*10000
while left <= right:
middle = ( lef... | n, k = [ int( val ) for val in input( ).split( " " ) ]
w = []
maxW = sumW = 0
for i in range( n ):
num = int( input( ) )
sumW += num
w.append( num )
if maxW < num:
maxW = num
minP = 0
if 1 == k:
minP = sumW
elif n == k:
minP = maxW
else:
left = maxW
right = 100000*10000
while left <= right:
middle = ( lef... | [["+", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 180 | 4 |
n, k = [ int( val ) for val in raw_input( ).split( " " ) ]
w = [ int( raw_input( ) ) for val in range( n ) ]
sumW = sum( w )
maxW = max( w )
minP = 0
if 1 == k:
minP = sumW
elif n == k:
minP = maxW
else:
left = maxW
right = 100000*10000
while left <= right:
middle = ( left+right )//2
truckCnt = i = loadings =... | n, k = [ int( val ) for val in input( ).split( " " ) ]
w = [ int( input( ) ) for val in range( n ) ]
sumW = sum( w )
maxW = max( w )
minP = 0
if 1 == k:
minP = sumW
elif n == k:
minP = maxW
else:
left = maxW
right = 100000*10000
while left <= right:
middle = ( left+right )//2
truckCnt = i = loadings = 0
whi... | [["-", 0, 659, 12, 652, 63, 319, 500, 652, 63, 22], ["+", 0, 659, 12, 652, 63, 319, 500, 652, 63, 22], ["-", 12, 658, 8, 652, 3, 4, 0, 652, 63, 22], ["+", 12, 658, 8, 652, 3, 4, 0, 652, 63, 22]] | 5 | 171 | 4 |
n, k = map(int, input().split())
w = [int(input()) for i in range(n)]
l = max(w)
r = sum(w)
while l < r:
m = (l + r) // 2
stack = 0
car = 0
for i in w:
stack += i
if stack > m:
stack = i
car += 1
if car < k:
r = m
else:
l =... | n, k = map(int, input().split())
w = [int(input()) for i in range(n)]
l = max(w)
r = sum(w)
while l < r:
m = (l + r) // 2
stack = car = 0
for i in w:
stack += i
if stack > m:
stack = i
car += 1
if car < k:
r = m
else:
l = m + 1
print(l) | [["-", 0, 52, 8, 196, 0, 1, 0, 662, 12, 612]] | 5 | 103 | 9 |
# ?????§?????????P???K??°?????????????????§???????????????????????????????
def check(P):
i = 0
for j in range(k):
s = 0
while s + w[i] <= P:
s += w[i]
i += 1
if i == n:
return n
return i
def solve():
left = 0
right = max(w) + 1 ... |
# ?????§?????????P???K??°?????????????????§???????????????????????????????
def check(P):
i = 0
for j in range(k):
s = 0
while s + w[i] <= P:
s += w[i]
i += 1
if i == n:
return n
return i
def solve():
left = 0
right = sum(w) + 1 #... | [["-", 0, 1, 0, 662, 12, 657, 31, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 652, 63, 22]] | 5 | 153 | 2 |
def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += baggage[l... | def carriable_baggage(baggage, baggage_num, truck_capacity, truck_num):
"""Return the number of baggae which trucks can carry."""
laden_baggage = 0
for i in range(truck_num):
laden_weight = 0
while laden_weight + baggage[laden_baggage] <= truck_capacity:
laden_weight += baggage[l... | [["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 12, 612]] | 5 | 175 | 5 |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_D
#??????????????????
def cal(truck_num, cargos):
p = 0
for i in range(len(cargos) - truck_num + 1):
if not i == 0 and p < sum(cargos[:i + 1]):
continue
if truck_num > 1:
r = max(sum(cargos[:i + 1]), ... | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_4_D
#??????????????????
def cal(truck_num, cargos):
p = 0
for i in range(len(cargos) - truck_num + 1):
if not i == 0 and p < sum(cargos[:i + 1]):
continue
if truck_num > 1:
r = max(sum(cargos[:i + 1]), ... | [["-", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22], ["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 22]] | 5 | 281 | 2 |
n, k = map(int, input().split())
ww = [int(input()) for _ in range(n)]
def chk(p):
c = 1
s = 0
for w in ww:
if w > p:
return False
if s + w <= p:
s += w
else:
c += 1
s = w
if c > k:
return False
return True
def s... | n, k = map(int, input().split())
ww = [int(input()) for _ in range(n)]
def chk(p):
c = 1
s = 0
for w in ww:
if w > p:
return False
if s + w <= p:
s += w
else:
c += 1
s = w
if c > k:
return False
return True
def s... | [["+", 0, 37, 0, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 37, 0, 652, 3, 4, 0, 657, 12, 612]] | 5 | 159 | 2 |
import sys
import math
def is_capable(n, k, w, P):
track = 0
cnt = 0
i = 0
while cnt < k:
if i == n:
return True
if track + w[i] > P:
track = 0
cnt += 1
else:
track += w[i]
i += 1
return False
pass
# ??\????... | import sys
import math
def is_capable(n, k, w, P):
track = 0
cnt = 0
i = 0
while cnt < k:
if i == n:
return True
if track + w[i] > P:
track = 0
cnt += 1
else:
track += w[i]
i += 1
return False
pass
# ??\????... | [["-", 75, 76, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 352 | 4 |
n,k = map(int, input().split())
w = [int(input()) for _ in range(n)]
def check(p):
c = t = 0
for wi in w:
t += wi
if t > p:
t = wi
c += 1
if c >= k:
return False
return True
s = max(w)
l = sum(w)
while s < l:
m = (s+l)//2
if check... | n,k = map(int, input().split())
w = [int(input()) for _ in range(n)]
def check(p):
c = t = 0
for wi in w:
t += wi
if t > p:
t = wi
c += 1
if c >= k:
return False
return True
s = max(w)
l = sum(w)
while s != l:
m = (s+l)//2
if chec... | [["-", 36, 36, 0, 656, 0, 52, 15, 666, 667, 18], ["+", 36, 36, 0, 656, 0, 52, 15, 666, 667, 79], ["+", 75, 76, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 8, 196, 0, 1, 0, 662, 12, 662, 31, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 118 | 6 |
n, k = list(map(int, input().split()))
a = []
for i in range(n):
a.append(int(input()))
def calcNum(p):
i = 0
for j in range(k):
s = 0
while s + a[i] <= p:
s += a[i]
i += 1
if i == n:
return n
return i
max_weight = max(a) * k
left = 0... | n, k = list(map(int, input().split()))
a = []
for i in range(n):
a.append(int(input()))
def calcNum(p):
i = 0
for j in range(k):
s = 0
while s + a[i] <= p:
s += a[i]
i += 1
if i == n:
return n
return i
max_weight = sum(a)
left = 0
rig... | [["-", 0, 1, 0, 662, 12, 657, 31, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 662, 12, 657, 17, 48], ["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 22]] | 5 | 152 | 4 |
n,k = map(int, input().split())
lag = []
for l in range(n):
lag.append(int(input()))
w_max = 100000*100000
w_min = 0
while w_min < w_max:
w_mid = (w_max + w_min) // 2
tracks = 0
current = 0
for i in range(n):
if lag[i] > w_mid:
tracks = k
break
elif lag[i] + c... | n,k = map(int, input().split())
lag = []
for l in range(n):
lag.append(int(input()))
w_max = 100000*100000
w_min = 0
while w_min < w_max:
w_mid = (w_max + w_min) // 2
tracks = 0
current = 0
for i in range(n):
if lag[i] > w_mid:
tracks = k
break
elif lag[i] + c... | [["-", 75, 76, 8, 196, 0, 1, 0, 677, 17, 107], ["+", 75, 76, 8, 196, 0, 1, 0, 662, 0, 32]] | 5 | 133 | 2 |
n,k = map(int,input().split())
w = [int(input()) for i in range(n)]
def binarySearch(left,right):
mid = 0
while right - left > 1:
mid = int(left + (right - left)//2)
if check(mid,w,k):
right = mid
else:
left = mid + 1
return left
def check(p,w,k):
k_tmp ... | n,k = map(int,input().split())
w = [int(input()) for i in range(n)]
def binarySearch(left,right):
mid = 0
while right > left:
mid = int(left + (right - left)//2)
if check(mid,w,k):
right = mid
else:
left = mid + 1
return left
def check(p,w,k):
k_tmp = 1
... | [["-", 8, 196, 0, 52, 15, 666, 0, 657, 17, 33], ["-", 8, 196, 0, 52, 15, 666, 0, 657, 12, 22], ["-", 0, 14, 8, 196, 0, 52, 15, 666, 0, 612], ["+", 0, 14, 8, 196, 0, 52, 15, 666, 0, 22]] | 5 | 146 | 4 |
import sys
readline = sys.stdin.readline
N, K = map(int, input().split())
W = tuple(int(readline()) for _ in range(n))
ma = max(W)
def check(x):
if x < ma:
return False
use = 1
rest = x
for w in W:
if rest >= w:
rest -= w
else:
rest = x - w
use... | import sys
readline = sys.stdin.readline
N, K = map(int, input().split())
W = tuple(int(readline()) for _ in range(N))
ma = max(W)
def check(x):
if x < ma:
return False
use = 1
rest = x
for w in W:
if rest >= w:
rest -= w
else:
rest = x - w
use... | [["-", 3, 668, 0, 659, 12, 652, 3, 4, 0, 22], ["+", 3, 668, 0, 659, 12, 652, 3, 4, 0, 22]] | 5 | 138 | 19 |
def imas(hoge_l, p, track):
s_weights = 0
now_track = 1
for val in hoge_l:
s_weights += val
if s_weights > p:
s_weights = val
now_track += 1
if now_track > track:
return False
return True
num, track = [int(x) for x in input().split()]
hoge_l =... | def imas(hoge_l, p, track):
s_weights = 0
now_track = 1
for val in hoge_l:
s_weights += val
if s_weights > p:
s_weights = val
now_track += 1
if now_track > track:
return False
return True
num, track = [int(x) for x in input().split()]
hoge_l =... | [["-", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22]] | 5 | 148 | 4 |
n,k=map(int,input().split())
W=[int(input()) for i in range(n)]
left = int(sum(W)/k); right = sum(W)
while left+1 < right:
mid = (left + right)//2
cnt = 1
now = 0
for i in W:
if mid<now+i:
now=i
cnt+=1
else:
now+=i
if cnt<=k:
right=mid
... |
n,k=map(int,input().split())
W=[int(input()) for i in range(n)]
left = max(W)-1; right = sum(W)
while left+1 < right:
mid = (left + right)//2
cnt = 1
now = 0
for i in W:
if mid<now+i:
now=i
cnt+=1
else:
now+=i
if cnt<=k:
right=mid
e... | [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 12, 652, 3, 4, 0, 657, 31, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 657, 31, 652, 63, 22], ["-", 0, 662, 12, 652, 3, 4, 0, 657, 17, 85], ["-", 0, 662, 12, 652, 3, 4, 0, 657, 12, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], [... | 5 | 113 | 9 |
def ok(m):
c = 1
tmp = m
for w in W:
if tmp > w:
tmp -= w
else:
c += 1
tmp = m - w
return k >= c
n, k = map(int, input().split())
W = [int(input()) for i in range(n)]
left = max(W)
right = sum(W)
while left+1 < right:
mid = (left+right) // 2
... | def ok(m):
c = 1
tmp = m
for w in W:
if tmp > w:
tmp -= w
else:
c += 1
tmp = m - w
return k >= c
n, k = map(int, input().split())
W = [int(input()) for i in range(n)]
left = max(W)
right = sum(W)+1
while left+1 < right:
mid = (left+right) // 2
... | [["+", 0, 656, 0, 1, 0, 662, 12, 657, 17, 72], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612]] | 5 | 118 | 2 |
(function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n1 = Number(lines.shift());
const arr1 = lines.shift().split(' ').map(Number);
const n2 = Number(lines.shift());
const arr2 = lines.shift().split(' ').map(Number);
const solve = memoization(fun... | (function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n1 = Number(lines.shift());
const arr1 = lines.shift().split(' ').map(Number);
const n2 = Number(lines.shift());
const arr2 = lines.shift().split(' ').map(Number);
const solve = memoization(fun... | [["-", 0, 493, 0, 435, 8, 556, 0, 570, 571, 243], ["+", 0, 493, 0, 435, 8, 556, 0, 198, 0, 217], ["+", 8, 556, 0, 435, 54, 495, 0, 572, 0, 389], ["-", 0, 57, 15, 23, 0, 16, 12, 557, 0, 491], ["+", 0, 57, 15, 23, 0, 16, 12, 557, 0, 491], ["+", 0, 435, 8, 556, 0, 57, 64, 556, 0, 45], ["+", 0, 435, 8, 556, 0, 57, 64, 556,... | 2 | 252 | 33 |
import java.util.Scanner;
public class Main {
public static void main(String[] arg) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] A = new int[n];
for (int i = 0; i < n; i++) {
A[i] = sc.nextInt();
}
int q = sc.nextInt();
int[] M = new int[q];
for (int i = 0;... | import java.util.Scanner;
public class Main {
public static void main(String[] arg) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] A = new int[n];
for (int i = 0; i < n; i++) {
A[i] = sc.nextInt();
}
int q = sc.nextInt();
int[] M = new int[q];
for (int i = 0;... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 12, 22]] | 3 | 316 | 4 |
import java.util.Scanner;
public class Main {
static int n;
static int[] A;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
Main eSearch = new Main();
n = in.nextInt();
A = new int[n];
for (int i = 0; i < n; i++) {
A[i] = in.nextInt();
}
int q = in.... | import java.util.Scanner;
public class Main {
static int n;
static int[] A;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
Main eSearch = new Main();
n = in.nextInt();
A = new int[n];
for (int i = 0; i < n; i++) {
A[i] = in.nextInt();
}
int q = in.... | [["-", 0, 195, 8, 196, 0, 7, 15, 16, 12, 22], ["+", 0, 195, 8, 196, 0, 7, 15, 16, 12, 22]] | 3 | 239 | 2 |
#include <stdio.h>
int solve(int, int);
int n;
int A[20];
int main() {
int i, q;
int mi[200];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < n; i++) {
scanf("%d", &mi[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, mi[i]) == i)
... | #include <stdio.h>
int solve(int, int);
int n;
int A[20];
int main() {
int i, q;
int mi[200];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &mi[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, mi[i]) == 1)
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 12, 16, 31, 2, 3, 4, 0, 16, 12, 22], ["+", 12, 16, 31, 2, 3, 4, 0, 16, 12, 13]] | 0 | 221 | 6 |
#include <stdio.h>
#define N 2000
#define M 2000
int n, A[N];
int solve(int, int);
int main() {
int q, m[M], i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &m[i]);
for (i = 0; i < q; i++) {
if (solve(0, m[i]) == 1)
... | #include <stdio.h>
#define N 2000
#define M 2000
int n, A[N];
int solve(int, int);
int main() {
int q, m[M], i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &m[i]);
for (i = 0; i < q; i++) {
if (solve(0, m[i]) == 1)
... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 234 | 4 |
#include <stdio.h>
int solve(int, int);
int n, q;
int A[20];
int m[200];
int main() {
int i, s;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
s = solve(i, m[i]);
if (s == 1)
... | #include <stdio.h>
int solve(int, int);
int n, q;
int A[20];
int m[200];
int main() {
int i, s;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
s = solve(0, m[i]);
if (s == 1)
... | [["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 13]] | 0 | 241 | 2 |
#include <stdio.h>
#define MAX 10000
int solve(int, int);
int n, A[MAX];
int main() {
int i, j;
int m, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &m);
for (j = 0; j < m; j++) {
scanf("%d", &key);
if (solve(0, key) != 0)
printf("Yes\... | #include <stdio.h>
#define MAX 10000
int solve(int, int);
int n, A[MAX];
int main() {
int i, j;
int m, key, sum = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &m);
for (j = 0; j < m; j++) {
scanf("%d", &key);
if (solve(0, key) != 0)
printf("yes\... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 203 | 4 |
#include <stdio.h>
int n, a[20];
int solve(int i, int m) {
if (m == 0) {
return 1;
}
if (i >= n) {
return 0;
}
int res = solve(i + 1, m) || solve(i + 1, m - a[i]);
return res;
}
int main() {
int i, n, q, m;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d",... | #include <stdio.h>
int n, a[20];
int solve(int i, int m) {
if (m == 0) {
return 1;
}
if (i >= n) {
return 0;
}
int res = solve(i + 1, m) || solve(i + 1, m - a[i]);
return res;
}
int main() {
int i, q, m;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 0 | 189 | 6 |
#include <stdio.h>
int n, A[50];
int solve(int i, int m) {
if (m == 0) {
return 1;
}
if (m == 0) {
return 0;
}
int res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &... | //?????????????????£????????§????§??????????????????????
#include <stdio.h>
int n, A[50];
int solve(int i, int m) {
if (m == 0) {
return 1;
}
if (i >= n) {
return 0;
}
int res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 191 | 6 |
#include <stdio.h>
int n, A[50];
int solve(int i, int m) {
if (m == 0)
return 1;
if (m == 1)
return 0;
int x = solve(i + 1, m) || solve(i + 1, m - A[i]);
return x;
}
int main() {
int q, M, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i ... | #include <stdio.h>
int n, A[50];
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int x = solve(i + 1, m) || solve(i + 1, m - A[i]);
return x;
}
int main() {
int q, M, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 185 | 6 |
#include <stdio.h>
int n, A[50];
int Search(int m, int i) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = Search(m, i + 1) || Search(m - A[i], i + 1);
return res;
}
int main(void) {
int i, q, m;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for ... | #include <stdio.h>
int n, A[50];
int Search(int m, int i) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = Search(m, i + 1) || Search(m - A[i], i + 1);
return res;
}
int main(void) {
int i, q, m;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for ... | [["-", 0, 57, 15, 23, 0, 2, 3, 4, 0, 22], ["+", 0, 57, 15, 23, 0, 2, 3, 4, 0, 13]] | 0 | 182 | 2 |
#include <stdio.h>
int solve(int, int);
int n, a[20], ans = 0;
int main() {
int m[200], i, j, q;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (j = 0; j < q; j++) {
ans = 0;
solve... | #include <stdio.h>
int solve(int, int);
int n, a[20], ans = 0;
int main() {
int m[200], i, j, q;
int count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &m[j]);
}
for (j = 0; j < q; j++) {
ans = 0;
solve... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 14, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22], ["+", 0, 2, 3, 4, 0, 66, ... | 0 | 238 | 10 |
#include <stdbool.h>
#include <stdio.h>
int a[20] = {};
int n;
bool solve(int i, int x) {
bool res;
if (x == 0)
return true;
if (i >= n)
return false;
res = solve(i + 1, x) || solve(i + 1, x - a[i]);
return res;
}
int main() {
int i, q;
int m;
scanf("%d", &n);
for (i = 0; i < n; i++)
s... | #include <stdbool.h>
#include <stdio.h>
int a[20] = {};
int n;
bool solve(int i, int x) {
bool res;
if (x == 0)
return true;
if (i >= n)
return false;
res = solve(i + 1, x) || solve(i + 1, x - a[i]);
return res;
}
int main() {
int i, q;
int m;
scanf("%d", &n);
for (i = 0; i < n; i++)
s... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 189 | 1 |
#include <stdio.h>
#define N 20
int judge(int, int);
int n;
int A[N];
int main() {
int q, B;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &B);
if (judge(i, B) == 1)
printf("yes\n");
else
pri... | #include <stdio.h>
#define N 20
int judge(int, int);
int n;
int A[N];
int main() {
int q, B;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &B);
if (judge(0, B) == 1)
printf("yes\n");
else
printf... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 15, 23, 0, 16, 31, 2, 3, 4, 0, 22], ["+", 15, 23, 0, 16, 31, 2, 3, 4, 0, 13]] | 0 | 202 | 4 |
#include <stdio.h>
int n, A[50];
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m);
if (Exhaustive(0, m))
printf("yes\n");
else
printf("no\n");
}
return 0;
}
int Exhaustive(int i,... | #include <stdio.h>
int n, A[50];
int main() {
int q, m, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m);
if (Exhaustive(0, m))
printf("yes\n");
else
printf("no\n");
}
return 0;
}
int Exhaustive(int i,... | [["-", 0, 30, 0, 14, 8, 9, 0, 57, 0, 121], ["-", 0, 14, 8, 9, 0, 57, 15, 23, 0, 24], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 32], ["-", 15, 23, 0, 16, 12, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 183 | 6 |
#include <stdio.h>
int solve(int, int);
int a[20], n;
int main() {
int q, m[200], i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
i = 0;
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &m[j]);
if (solve(i, m[j]))
printf("true\n");
else
printf(... | #include <stdio.h>
int solve(int, int);
int a[20], n;
int main() {
int q, m[200], i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
i = 0;
scanf("%d", &q);
for (j = 0; j < q; j++) {
scanf("%d", &m[j]);
if (solve(i, m[j]))
printf("yes\n");
else
printf("... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 205 | 4 |
#include <stdio.h>
#define MAX 2000
#define max 20
#define false 0
#define true 1
int solve(int, int);
int n, A[max];
int main() {
int i, q, x;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < n; i++) {
scanf("%d", &x);
if (solve(0, x) == false)
... | #include <stdio.h>
#define MAX 2000
#define max 20
#define false 0
#define true 1
int solve(int, int);
int n, A[MAX];
int main() {
int i, q, x;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &x);
if (solve(0, x) == false)
... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 22], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 22], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 205 | 4 |
#include <stdio.h>
#include <stdlib.h>
void YesOrNo(int *combination, int *array_a, int *array_m, int *ans,
int number_a, int number_m) {
int sum = 0;
int i = 0, j = 0;
for (i = 0; i < number_m; i++) {
sum = 0;
for (j = 0; j < number_a; j++) {
sum = sum + combination[j] * array_a[j];
... | #include <stdio.h>
#include <stdlib.h>
void YesOrNo(int *combination, int *array_a, int *array_m, int *ans,
int number_a, int number_m) {
int sum = 0;
int i = 0, j = 0;
for (i = 0; i < number_m; i++) {
sum = 0;
for (j = 0; j < number_a; j++) {
sum = sum + combination[j] * array_a[j];
... | [["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["-", 8, 9, 0, 57, 64, 9, 0, 93, 0, 35]] | 0 | 418 | 2 |
#include <stdio.h>
int n, a[50];
//??\?????????M???????????????????´???????????????????????????¢??°
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - a[i]);
return res;
}
int main() {
int q, M, i;
scanf("%d", &n);
for (i = 0; i ... | #include <stdio.h>
int n, a[50];
//??\?????????M???????????????????´???????????????????????????¢??°
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - a[i]);
return res;
}
int main() {
int q, M, i;
scanf("%d", &n);
for (i = 0; i ... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 180 | 4 |
#include <stdio.h>
int n, A[50];
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= 0)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main(void) {
int q, M, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
fo... | #include <stdio.h>
int n, A[50];
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main(void) {
int q, M, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
fo... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22]] | 0 | 188 | 2 |
#include <stdio.h>
int solve(int a, int b);
int n;
int A[25];
int main() {
int q, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
int M[q];
for (i = 0; i < q; i++) {
scanf("%d", &M[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, M[i])) {
pr... | #include <stdio.h>
int solve(int a, int b);
int n;
int A[25];
int main() {
int q, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
int M[q];
for (i = 0; i < q; i++) {
scanf("%d", &M[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, M[i])) {
pr... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 215 | 4 |
#include <stdio.h>
#define N 2000
int solve(int, int);
int n, A[N], S[N];
int main() {
int i, q, m[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < n; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, m[i]) == 1)
pr... | #include <stdio.h>
#define N 2000
int solve(int, int);
int n, A[N], S[N];
int main() {
int i, q, m[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &m[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, m[i]) == 1)
pr... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 245 | 2 |
#include <stdio.h>
int n, A[20];
int solve(int i, int m) {
int res;
// printf("%d\n",m);
if (m == 0)
return 1;
if (i >= n)
return 2;
res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q, i, ans;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
... | #include <stdio.h>
int n, A[20];
int solve(int i, int m) {
int res;
// printf("%d\n",m);
if (m == 0)
return 1;
if (i >= n)
return 0;
res = solve(i + 1, m) || solve(i + 1, m - A[i]);
return res;
}
int main() {
int q, i, ans;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
... | [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 13]] | 0 | 219 | 2 |
#include <stdio.h>
int solve(int, int);
int n, A[50];
int main() {
int n, q, i, j, l;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
int M;
for (i = 0; i < q; i++) {
scanf("%d", &M);
if (solve(0, M)) {
printf("yes\n");
} else {
printf("no\n");... | #include <stdio.h>
int solve(int, int);
int n, A[50];
int main() {
int q, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
int M;
for (i = 0; i < q; i++) {
scanf("%d", &M);
if (solve(0, M)) {
printf("yes\n");
} else {
printf("no\n");
}
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21]] | 0 | 202 | 6 |
#include <stdio.h>
int solve(int, int, int);
int A[2001];
int n;
int main() {
int j, q, i;
int M[2001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &M[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, A[i], M[i]))
... | #include <stdio.h>
int solve(int, int, int);
int A[2001];
int n;
int main() {
int j, q, i;
int M[2001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%d", &M[i]);
}
for (i = 0; i < q; i++) {
if (solve(0, 0, M[i]))
... | [["-", 15, 23, 0, 2, 3, 4, 0, 69, 28, 22], ["-", 15, 23, 0, 2, 3, 4, 0, 69, 0, 70], ["-", 15, 23, 0, 2, 3, 4, 0, 69, 71, 22], ["-", 15, 23, 0, 2, 3, 4, 0, 69, 0, 73], ["+", 0, 57, 15, 23, 0, 2, 3, 4, 0, 13]] | 0 | 240 | 5 |
#include <stdio.h>
#define N 20
#define Q 200
#define TRUE 1
#define FALSE 0
void solve(int, int);
int A[N];
int M[Q];
int i;
int n, q;
;
int check;
int main(void) {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &M[i]);
for (i =... | #include <stdio.h>
#define N 20
#define Q 200
#define TRUE 1
#define FALSE 0
void solve(int, int);
int A[N];
int M[Q];
int i;
int n, q;
;
int check;
int main(void) {
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
scanf("%d", &q);
for (i = 0; i < q; i++)
scanf("%d", &M[i]);
for (i =... | [["-", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 237 | 2 |
#include <stdio.h>
#define MAX 20
int A[MAX], n;
bool check(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = check(i + 1, m) || check(i + 1, m - A[i]);
return res;
}
int main() {
int q, m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%... | #include <stdio.h>
#define MAX 20
int A[MAX], n;
bool check(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = check(i + 1, m) || check(i + 1, m - A[i]);
return res;
}
int main() {
int q, m;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 186 | 1 |
#include <iostream>
using namespace std;
int n;
int a[25];
int q;
bool solve(int sum, int i) {
if (sum == 0) {
return true;
}
if (i == n) {
return false;
}
return solve(sum, i + 1) || solve(sum - a[i], i + 1);
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >>... | #include <iostream>
using namespace std;
int n;
int a[25];
int q;
bool solve(int sum, int i) {
if (sum == 0) {
return true;
}
if (i == n) {
return false;
}
return solve(sum, i + 1) || solve(sum - a[i], i + 1);
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
cin >>... | [["-", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 64, 5, 0, 6], ["-", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6], ["+", 31, 16, 12, 23, 0, 41, 75, 5, 0, 6]] | 1 | 156 | 4 |
#include <iostream>
using namespace std;
int n, A[50], q, M;
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int result = solve(i + 1, m) || solve(i + 1, m - A[i]);
return result;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
cin >> q;
for (... | #include <iostream>
using namespace std;
int n, A[50], q, M;
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int result = solve(i + 1, m) || solve(i + 1, m - A[i]);
return result;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
cin >> q;
for (... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 162 | 2 |
#include <iostream>
using namespace std;
int a[21], n, q, b[210];
int solve(int i, int m) {
if (m == 0)
return 1;
else if (i >= n)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - a[i]);
return res;
}
int main() {
cin >> n;
for (int i = 0; i < n; cin >> a[i++])
;
cin >> q;
for (int ... | #include <iostream>
using namespace std;
int a[21], n, q, b[210];
int solve(int i, int m) {
if (m == 0)
return 1;
else if (i >= n)
return 0;
int res = solve(i + 1, m) || solve(i + 1, m - a[i]);
return res;
}
int main() {
cin >> n;
for (int i = 0; i < n; cin >> a[i++])
;
cin >> q;
for (int ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 184 | 2 |
#include <iostream>
static int n, q, value;
void exhaustiveSearch(int i, int sum, int *A, bool *flag) {
if (*flag) {
return;
}
if (sum == value) {
*flag = true;
}
if (i == n) {
return;
}
exhaustiveSearch(i + 1, sum, A, flag);
exhaustiveSearch(i + 1, sum + A[i], A, flag);
}
int main() ... | #include <iostream>
static int n, q, value;
void exhaustiveSearch(int i, int sum, int *A, bool *flag) {
if (*flag) {
return;
}
if (sum == value) {
*flag = true;
}
if (i == n) {
return;
}
exhaustiveSearch(i + 1, sum, A, flag);
exhaustiveSearch(i + 1, sum + A[i], A, flag);
}
int main() ... | [["+", 0, 7, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 7, 8, 9, 0, 43, 49, 50, 51, 147]] | 1 | 251 | 2 |
#include <stdio.h>
int n, A[50];
// 入力値のMから選んだ要素を引いていく再帰関数
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
return solve(i + 1, m) || solve(i + 1, m - A[i]);
}
int main() {
int q, m;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &A[i]);
}
scanf("%d", &... | #include <stdio.h>
int n, A[50];
// 入力値のMから選んだ要素を引いていく再帰関数
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
return solve(i + 1, m) || solve(i + 1, m - A[i]);
}
int main() {
int q, m;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &A[i]);
}
scanf("%d", &... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 1 | 177 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.