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 <iostream>
#include <vector>
using namespace std;
vector<int> A;
int n;
bool solve(int i, int m) {
if (m == 0)
return true;
if (i >= n - 1)
return false;
return solve(i + 1, m - A[i]) || solve(i + 1, m);
}
int main() {
cin >> n;
A.reserve(n);
for (int i = 0; i < n; ++i) {
cin >> A[i... | #include <iostream>
#include <vector>
using namespace std;
vector<int> A;
int n;
bool solve(int i, int m) {
if (m == 0)
return true;
if (i >= n)
return false;
return solve(i + 1, m - A[i]) || solve(i + 1, m);
}
int main() {
cin >> n;
A.reserve(n);
for (int i = 0; i < n; ++i) {
cin >> A[i];
... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 172 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
int a[50], n;
int solve(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int res = solve(i + 1, n) || 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]... | #include <cstdio>
#include <iostream>
using namespace std;
int a[50], n;
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 < n; i++)
scanf("%d", &a[i]... | [["-", 49, 50, 51, 16, 31, 2, 3, 4, 0, 22], ["+", 49, 50, 51, 16, 31, 2, 3, 4, 0, 22]] | 1 | 187 | 2 |
#include <iostream>
using namespace std;
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;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
cin >> q;
int m[q]... | #include <iostream>
using namespace std;
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, tmp;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
cin >> q;
int... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 0, 57, 15, 339, 51, 2, 3, 4, 0, 22], ["+", 0, 57, 15, 339, 51, 2, 3, 4, 0, 22]] | 1 | 168 | 18 |
#include <iostream>
using namespace std;
int DP(int i, int m, int A[], int n) {
if (m == 0) {
return 1;
} else if (m != 0 && i == n - 1) {
return 0;
}
int res1 = DP(i + 1, m, A, n);
int res2 = DP(i + 1, m - A[i], A, n);
if (res1 == 1 || res2 == 1) {
return 1;
} else {
return 0;
}
}
i... | #include <iostream>
using namespace std;
int DP(int i, int m, int A[], int n) {
if (m == 0) {
return 1;
} else if (m != 0 && i == n) {
return 0;
}
int res1 = DP(i + 1, m, A, n);
int res2 = DP(i + 1, m - A[i], A, n);
if (res1 == 1 || res2 == 1) {
return 1;
} else {
return 0;
}
}
int m... | [["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 12, 13]] | 1 | 244 | 2 |
#include <iostream>
int n, a[50];
int search(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int r = search(i + 1, m) || search(i + 1, m - a[i]);
return r;
}
int main() {
int q, m, i;
std::cin >> n;
for (int i = 0; i < n; i++) {
std::cin >> a[i];
std::cin >> q;
}
for (i = 0... | #include <iostream>
int n, a[50];
int search(int i, int m) {
if (m == 0)
return 1;
if (i >= n)
return 0;
int r = search(i + 1, m) || search(i + 1, m - a[i]);
return r;
}
int main() {
int q, m, i;
std::cin >> n;
for (int i = 0; i < n; i++)
std::cin >> a[i];
std::cin >> q;
for (i = 0; i < q;... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 176 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
int n;
int A[30];
int q;
int m[300];
bool solve(int i, int m) {
if (m == 0)
return true;
else if (i >= n)
return false;
else
return solve(i + 1, m) || solve(i + 1, m - A[i]);
}
int main(... | #include <algorithm>
#include <iostream>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)n; i++)
int n;
int A[30];
int q;
int m[300];
bool solve(int i, int m) {
if (m == 0)
return true;
else if (i >= n)
return false;
else
return solve(i + 1, m) || solve(i + 1, m - A[i]);
}
int main(... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 1 | 173 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
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; i < n; i++)
scanf("%d",... | #include <stdio.h>
using namespace std;
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; i < n; i++)
scanf("%d", &A[i]);
scanf("%d... | [["-", 36, 36, 36, 36, 0, 30, 0, 135, 136, 137], ["-", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 186 | 3 |
#include <iostream>
using namespace std;
int A[20], N;
bool exhaustiveSearch(int m, int s, int n) {
if (n == N)
return false; // it's over
if (s == m)
return true;
int next = n + 1;
if (exhaustiveSearch(m, s, next)) {
return true;
} else {
s += A[n];
return exhaustiveSearch(m, s, next)... | #include <iostream>
using namespace std;
int A[20], N;
bool exhaustiveSearch(int m, int s, int n) {
if (n == N + 1)
return false; // it's over
if (s == m)
return true;
int next = n + 1;
if (exhaustiveSearch(m, s, next)) {
return true;
} else {
s += A[n];
return exhaustiveSearch(m, s, n... | [["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 72], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 178 | 31 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int A[2000], n;
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() {
cin >> n;
for (int i = 0; i < n; i+... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int A[2000], n;
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() {
cin >> n;
for (int i = 0; i < n; i+... | [["-", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 16, 12, 69, 341, 342, 0, 22]] | 1 | 170 | 2 |
#include <cstdio>
#include <iostream>
using namespace std;
#define MAX 1000
int dat[MAX];
int ind[MAX];
int dp[21][1000];
int n;
bool solve(int i, int m) {
// cout<<"solve i:"<<i<<" m:"<<m<<" n:"<<n<<endl;
if (m == 0) {
return true;
} else if (i < n) {
if (solve(i + 1, m))
return true;
retur... | #include <cstdio>
#include <iostream>
using namespace std;
#define MAX 1000
int dat[MAX];
int ind[MAX];
int dp[21][1000];
int n;
bool solve(int i, int m) {
// cout<<"solve i:"<<i<<" m:"<<m<<" n:"<<n<<endl;
if (m == 0) {
return true;
} else if (i < n) {
if (solve(i + 1, m))
return true;
retur... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 238 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int A[20], n, q, k;
bool Comb(int i, int m) {
if (m == 0)
return true;
if (i == n - 1)
return false;
return Comb(i + 1, m - A[i]) || Comb(i + 1, m);
}
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
cin >... | #include <algorithm>
#include <iostream>
using namespace std;
int A[20], n, q, k;
bool Comb(int i, int m) {
if (m == 0)
return true;
if (i == n)
return false;
return Comb(i + 1, m - A[i]) || Comb(i + 1, m);
}
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> A[i];
}
cin >> q;... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 162 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#de... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#de... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 314 | 2 |
#include <iostream>
using namespace std;
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;
cin >> n;
for (i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (i = 0... | #include <iostream>
using namespace std;
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;
cin >> n;
for (i = 0; i < n; i++)
cin >> A[i];
cin >> q;
for (i = 0... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 161 | 2 |
#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... | #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... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 186 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
int n, q = 0;
vector<int> A;
vector<int> M;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
int n, q = 0;
vector<int> A;
vector<int> M;
... | [["-", 0, 57, 15, 339, 51, 16, 12, 23, 0, 24], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 17, 33], ["-", 15, 339, 51, 16, 12, 23, 0, 16, 12, 13], ["-", 0, 57, 15, 339, 51, 16, 12, 23, 0, 25]] | 1 | 273 | 4 |
#include <bits/stdc++.h>
using namespace std;
int m, n, q, A[20];
int ans(int x, int y) {
if (x == 0)
return 0;
if (y == 0)
return 1;
if (ans(x, y + 1) == 0 || ans(x - A[y], y + 1) == 0)
return 0;
else
return 1;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> ... | #include <bits/stdc++.h>
using namespace std;
int m, n, q, A[20];
int ans(int x, int y) {
if (x == 0)
return 0;
if (y >= n)
return 1;
if (ans(x, y + 1) == 0 || ans(x - A[y], y + 1) == 0)
return 0;
else
return 1;
}
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> A[i];
cin >> ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 169 | 4 |
#include <iostream>
using namespace std;
int n, A[2000];
// ??\?????????M???????????????????´????????????????????????°??¢??°
int solve(
int i,
int m) { // i????????\??????????´?????????£???m??????????????´???ture?????????
if (m == 0)
return 1; // ???????????°???????????¨??§??¶???????¨?0?????????????????... | #include <iostream>
using namespace std;
int n, A[2000];
// ??\?????????M???????????????????´????????????????????????°??¢??°
int solve(
int i,
int m) { // i????????\??????????´?????????£???m??????????????´???ture?????????
if (m == 0)
return 1; // ???????????°???????????¨??§??¶???????¨?0?????????????????... | [["-", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["-", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6], ["+", 0, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 166 | 4 |
#include <iostream>
#include <vector>
using namespace std;
bool Judge(int m, int index, vector<int> &A) {
if (m == 0) {
return true;
}
if (index != A.size() - 1) {
int l = m - A[index];
index++;
if (Judge(m, index, A) || Judge(l, index, A)) {
return true;
}
}
return false;
}
int ma... | #include <iostream>
#include <vector>
using namespace std;
bool Judge(int m, int index, vector<int> &A) {
if (m == 0) {
return true;
}
if (index != A.size()) {
int l = m - A[index];
index++;
if (Judge(m, index, A) || Judge(l, index, A)) {
return true;
}
}
return false;
}
int main()... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 234 | 20 |
#include <cstdio>
#include <iostream>
using namespace std;
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 argc, char const *argv[]) {
int q, M, i;
cin >> n;
for (i = 0; i < n; ... | #include <cstdio>
#include <iostream>
using namespace std;
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 argc, char const *argv[]) {
int q, M, i;
cin >> n;
for (i = 0; i < n; ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 185 | 2 |
#include <stdio.h>
int n, A[50], q;
int solve(int c, int m) {
if (m == 0)
return 1;
if (c >= n)
return 0;
int tans = solve(c + 1, m) || solve(c + 1, m - A[c]);
return tans;
}
int main() {
int B;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for ... | #include <stdio.h>
int n, A[50], q;
int solve(int c, int m) {
if (m == 0)
return 1;
if (c >= n)
return 0;
int tans = solve(c + 1, m) || solve(c + 1, m - A[c]);
return tans;
}
int main() {
int B;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
scanf("%d", &q);
for ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 200 | 4 |
#include <iostream>
using namespace std;
int A[21], n;
bool solve(int A[], int i, int m) {
if (m == 0)
return true;
if (i >= n)
return false;
bool res = (solve(A, i + 1, m) || solve(A, i + 1, A[i] - m));
return res;
}
int main(int argc, char const *argv[]) {
int q;
cin >> n;
for (int i = 0; i < ... | #include <iostream>
using namespace std;
int A[21], n;
bool solve(int A[], int i, int m) {
if (m == 0)
return true;
if (i >= n)
return false;
bool res = (solve(A, i + 1, m) || solve(A, i + 1, m - A[i]));
return res;
}
int main(int argc, char const *argv[]) {
int q;
cin >> n;
for (int i = 0; i < ... | [["+", 0, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 186 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
bool check(int m, int i, int A[], int n) {
if (m == 0) {
return true;
}
if (i == n - 1) {
return false;
}
return check(m, i + 1, A, n) || check(m - A[i], i + 1, A, n);
}
int main() {
int n;
scanf("%d", &n);
int A[n];
for (int i ... | #include <cstdio>
#include <iostream>
using namespace std;
bool check(int m, int i, int A[], int n) {
if (m == 0) {
return true;
}
if (i == n) {
return false;
}
return check(m, i + 1, A, n) || check(m - A[i], i + 1, A, n);
}
int main() {
int n;
scanf("%d", &n);
int A[n];
for (int i = 0;... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 33], ["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 248 | 46 |
#include <iostream>
using namespace std;
int a, b[20] = {0}, c, d, ans;
bool check(int e, int f) {
if (e == c)
return true;
if (f == a)
return false;
return check(e, f + 1) || check(e + b[f], f + 1);
}
int main() {
cin >> a;
for (int i = 0; i < a; ++i) {
cin >> b[i];
}
cin >> d;
for (in... | #include <iostream>
using namespace std;
int a, b[20] = {0}, c, d, ans;
bool check(int e, int f) {
if (e == c)
return true;
if (f == a)
return false;
return check(e, f + 1) || check(e + b[f], f + 1);
}
int main() {
cin >> a;
for (int i = 0; i < a; ++i) {
cin >> b[i];
}
cin >> d;
for (in... | [["-", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 64, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 170 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define maxn 24
int a[maxn];
int n, q;
bool solve(int i, int m) {
if (m == 0)
return true;
if (i >= n)
return false;
return (solve(i + 1, m) || solve(i + 1, m - a[i]));
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
... | #include <bits/stdc++.h>
using namespace std;
#define maxn 24
int a[maxn];
int n, q;
bool solve(int i, int m) {
if (m == 0)
return true;
if (i > n)
return false;
return (solve(i + 1, m) || solve(i + 1, m - a[i]));
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 179 | 2 |
#include <stdio.h>
int n, A[50];
int solve(int x, int m) {
if (m == 0)
return 1;
if (x >= n)
return 0;
int res = solve(x + 1, m) || solve(x + 1, m - A[x]);
return res;
}
int main() {
int q, M, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("d", A[i]);
}
scanf("%d", &q);
for (i = ... | #include <stdio.h>
int n, A[50];
int solve(int x, int m) {
if (m == 0)
return 1;
if (x >= n)
return 0;
int res = solve(x + 1, m) || solve(x + 1, m - A[x]);
return res;
}
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, 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, 66, 17, 67]] | 1 | 185 | 4 |
#include <cstdio>
#define MAX 100
int num[MAX], N;
bool solve(int i, int m) {
if (0 == m)
return true;
if (i >= N)
return false;
return ((solve(i + 1, m)) || (solve(i + 1, m - num[i])));
}
int main() {
int i, j, k;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &num[i]);
}
scanf(... | #include <cstdio>
#define MAX 100
int num[MAX], N;
bool solve(int i, int m) {
if (0 == m)
return true;
if (i >= N)
return false;
return ((solve(i + 1, m)) || (solve(i + 1, m - num[i])));
}
int main() {
int i, j, k;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &num[i]);
}
scanf(... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 187 | 2 |
#include <climits>
#include <iostream>
using namespace std;
const int INFTY = INT_MAX;
const int maxn = 500000;
int L[maxn / 2 + 2], R[maxn / 2 + 2];
int count;
void merge(int *Array, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = Array[left... | #include <climits>
#include <iostream>
using namespace std;
const int INFTY = INT_MAX;
const int maxn = 500000;
int L[maxn / 2 + 2], R[maxn / 2 + 2];
int count;
void merge(int *Array, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++) {
L[i] = Array[left... | [["-", 0, 1, 0, 11, 12, 11, 31, 69, 28, 22], ["+", 0, 1, 0, 11, 12, 11, 31, 69, 28, 22]] | 1 | 404 | 2 |
#include <algorithm>
#include <limits.h>
#include <stdio.h>
using namespace std;
int cmp_count = 0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1], R[n2 + 1];
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
... | #include <algorithm>
#include <limits.h>
#include <stdio.h>
using namespace std;
int cmp_count = 0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1], R[n2 + 1];
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 377 | 2 |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
//#include "libs.h"
#include <random>
#include <unordered_map>
#include <unordered_set>
//#include <opencv2/core.hpp>
//#include <opencv2/highgui.hpp>
//#include <opencv2/imgproc.hpp>
using namespace std;
//呪文
#define DUMPOUT cerr
#define dump(...) ... | [["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 1,723 | 6 |
#include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | #include <iostream>
using namespace std;
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2... | [["+", 64, 9, 0, 43, 49, 50, 51, 16, 17, 85], ["+", 64, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 391 | 2 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
using vi = vector<int>;
using i64 = int64_t;
constexpr int INF = 1 << 25;
constexpr int M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), i##_max = (b); i < i##_max; ++i)
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
using vi = vector<int>;
using i64 = int64_t;
constexpr int INF = 1 << 30;
constexpr int M... | [["-", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 0, 30, 0, 43, 49, 50, 51, 16, 12, 13], ["+", 49, 53, 54, 55, 0, 56, 49, 352, 0, 67]] | 1 | 377 | 3 |
#include <stdio.h>
#define MAX 500000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
R[i] = A[mid + i];
L[n1] = R[n2] = 200... | #include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int A[], int n, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i < n2; i++)
R[i] = A[mid... | [["+", 36, 36, 36, 36, 0, 30, 0, 58, 0, 148], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 141, 22], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 1, 0, 11, 12, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 11, 12, 22]] | 1 | 394 | 5 |
#include <iostream>
#include <vector>
using namespace std;
#define INF 1.0e9
int cnt = 0;
void merge(vector<int> A, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
vector<int> L(n1 + 1, 0);
for (int i = 0; i < n1; ++i) {
L[i] = A[left + i];
}
vector<int> R(n2 + 1, 0);
for... | #include <iostream>
#include <vector>
using namespace std;
#define INF 1.0e9
int cnt = 0;
void merge(vector<int> &A, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
vector<int> L(n1 + 1, 0);
for (int i = 0; i < n1; ++i) {
L[i] = A[left + i];
}
vector<int> R(n2 + 1, 0);
fo... | [["+", 49, 53, 54, 55, 0, 56, 49, 352, 0, 67], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 387 | 3 |
can = [0]
gets
a = gets.split.map(&:to_i)
n = gets.to_i
m = gets.split.map(&:to_i)
a.each_with_index {|e,i|
if i == 0
can << e
else
can = Marshal.load(Marshal.dump(can + can.map {|ele| ele + e}))
end
can.uniq!
}
n.times{|i|
if can.include?can[i]
puts 'yes'
else
puts 'no'
end
} | can = [0]
gets
a = gets.split.map(&:to_i)
n = gets.to_i
m = gets.split.map(&:to_i)
a.each_with_index {|e,i|
if i == 0
can << e
else
can = Marshal.load(Marshal.dump(can + can.map {|ele| ele + e}))
end
can.uniq!
}
n.times{|i|
if can.include?m[i]
puts 'yes'
else
puts 'no'
end
} | [["-", 0, 121, 15, 652, 3, 4, 0, 742, 500, 22], ["+", 0, 121, 15, 652, 3, 4, 0, 742, 500, 22]] | 4 | 106 | 2 |
module Main
extend self
@@memo = {}
def can_assemble?(elements, index, sum, raw_elements_length)
unless @@memo[index].nil?
return @@memo[index][sum] unless @@memo[index][sum].nil?
else
@@memo[index] = []
end
if sum == 0
true
elsif index >= raw_elements_length
false
... | module Main
extend self
@@memo = {}
def can_assemble?(elements, index, sum, raw_elements_length)
unless @@memo[index].nil?
return @@memo[index][sum] unless @@memo[index][sum].nil?
else
@@memo[index] = {}
end
if sum == 0
true
elsif index >= raw_elements_length
false
... | [["-", 0, 747, 75, 95, 0, 662, 12, 516, 0, 70], ["-", 0, 747, 75, 95, 0, 662, 12, 516, 0, 73], ["+", 0, 747, 75, 95, 0, 662, 12, 767, 0, 45], ["+", 0, 747, 75, 95, 0, 662, 12, 767, 0, 46]] | 4 | 209 | 4 |
gets.to_i
a = gets.split.map(&:to_i)
gets.to_i
m = gets.split.map(&:to_i)
arr = [0]
a.each{|i|
arr += arr.clone.map{|j| j+i}
p arr
}
m.each{|num|
if arr.index(num) == nil then
puts "no"
else
puts "yes"
end
} | gets.to_i
a = gets.split.map(&:to_i)
gets.to_i
m = gets.split.map(&:to_i)
arr = [0]
a.each{|i|
arr += arr.clone.map{|j| j+i}
# p arr
}
m.each{|num|
if arr.index(num) == nil then
puts "no"
else
puts "yes"
end
} | [["-", 0, 652, 196, 196, 8, 734, 0, 652, 735, 22], ["-", 196, 196, 8, 734, 0, 652, 3, 4, 0, 22]] | 4 | 86 | 3 |
gets.to_i
a = gets.split.map(&:to_i)
gets.to_i
m = gets.split.map(&:to_i)
arr = [0]
a.each{|i|
arr += arr.clone.map{|j| j+i}
p arr
}
m.each{|num|
if arr.index(num) == nil then
puts "no"
else
puts "yes"
end
} | gets.to_i
a = gets.split.map(&:to_i)
gets.to_i
m = gets.split.map(&:to_i)
arr = [0]
a.each{|i|
arr += arr.clone.map{|j| j+i}
arr.uniq!
}
m.each{|num|
if arr.index(num) == nil then
puts "no"
else
puts "yes"
end
} | [["-", 0, 652, 196, 196, 8, 734, 0, 652, 735, 22], ["+", 0, 652, 196, 196, 8, 734, 0, 652, 17, 131], ["+", 0, 652, 196, 196, 8, 734, 0, 652, 735, 22]] | 4 | 86 | 3 |
n = eval(input())
A = list(map( int , input().split() ))
q = eval(input())
mi = list(map( int , input().split() ))
def solve(i, m):
if m == 0:
return True
if i >= n or sum(A):
return False
res = solve( i+1 , m ) | solve( i+1 , m-A[i] )
return res
for m in mi:
if solve( 0 , m ): print("yes")
else:... | n = eval(input())
A = list(map( int , input().split() ))
q = eval(input())
mi = list(map( int , input().split() ))
def solve(i, m):
if m == 0:
return True
elif i >= n or m > sum(A):
return False
res = solve( i+1 , m ) or solve( i+1 , m-A[i] )
return res
for m in mi:
if solve( 0 , m ): print("yes")
... | [["-", 0, 656, 0, 14, 8, 196, 0, 57, 0, 121], ["+", 0, 14, 8, 196, 0, 57, 75, 665, 0, 683], ["+", 0, 57, 75, 665, 15, 679, 12, 666, 0, 22], ["+", 0, 57, 75, 665, 15, 679, 12, 666, 667, 47], ["-", 8, 196, 0, 1, 0, 662, 12, 657, 17, 139], ["+", 8, 196, 0, 1, 0, 662, 12, 679, 17, 354]] | 5 | 130 | 6 |
#include <stdio.h>
#define N 5000000
#define INFTY 1000000
void mergesort(int, int);
void merge(int, int, int);
int count = 0, S[N];
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
mergesort(0, n);
for (i = 0; i < n; i++) {
printf("%d", S[i]);
if (i < n... | #include <stdio.h>
#define N 500000
#define INFTY 1000000000
void mergesort(int, int);
void merge(int, int, int);
int count = 0, S[N];
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
mergesort(0, n);
for (i = 0; i < n; i++) {
printf("%d", S[i]);
if (i <... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 395 | 4 |
#include <stdio.h>
#define MAX 500000
#define INFTY 20000000000
void mergesort(int *, int, int);
void merge(int *, int, int, int);
int l[MAX / 2 + 2], r[MAX / 2 + 2];
int count;
int s[MAX];
int main() {
int n, i;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
mergesort(... | #include <stdio.h>
#define MAX 500000
#define INFTY 2000000000
void mergesort(int *, int, int);
void merge(int *, int, int, int);
int l[MAX / 2 + 2], r[MAX / 2 + 2];
int count;
int s[MAX];
int main() {
int n, i;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &s[i]);
}
mergesort(s... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 431 | 2 |
#include <stdio.h>
#define MAX 1000000
#define INF 3000000000
void merge(int[], int, int, int);
void mergeSort(int[], int, int);
int count = 0;
int main() {
int i, n, array[MAX];
int left, right;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
left = 0;
right = n;
mergeS... | #include <stdio.h>
#define MAX 1000000
#define INF 2000000000
void merge(int[], int, int, int);
void mergeSort(int[], int, int);
int count = 0;
int main() {
int i, n, array[MAX];
int left, right;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &array[i]);
}
left = 0;
right = n;
mergeS... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 426 | 2 |
#include <stdio.h>
#define N 500000
#define INF 200000000
int S[N];
int count = 0;
void merge(int[], int, int, int);
void mergeSort(int[], int, int);
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
mergeSort(S, 0, n);
for (i = 0; i < n - 1; i++) {
printf("%d "... | #include <stdio.h>
#define N 500000
#define INF 2000000000
int S[N];
int count = 0;
void merge(int[], int, int, int);
void mergeSort(int[], int, int);
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
mergeSort(S, 0, n);
for (i = 0; i < n - 1; i++) {
printf("%d ... | [["-", 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, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22]] | 0 | 417 | 6 |
#include <stdio.h>
#define MAX_DATA 500000
#define N 2000000000
void merge(int[], int, int, int);
void mergeSort(int[], int, int);
int A[MAX_DATA], count = 0;
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
mergeSort(A, 0, n);
for (i = 0; i < n - 1; i++) {
... | #include <stdio.h>
#define MAX_DATA 500000
#define N 2000000000
void merge(int[], int, int, int);
void mergeSort(int[], int, int);
int A[MAX_DATA], count = 0;
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
mergeSort(A, 0, n);
for (i = 0; i < n - 1; i++) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22]] | 0 | 414 | 4 |
#include <stdio.h>
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int count = 0;
int main() {
int S[1000000];
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
mergeSort(S, 0, n);
for (i = 0; i < n; i++) {
if (i != n - 1) {
printf("%d ", S[i... | #include <stdio.h>
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int count = 0;
int main() {
int S[1000000];
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
mergeSort(S, 0, n);
for (i = 0; i < n; i++) {
if (i != n - 1) {
printf("%d ", S[i... | [["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22]] | 0 | 417 | 2 |
#include <stdio.h>
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
#define N 500000
int count = 0;
int main() {
int S[N], n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
mergeSort(S, 0, n);
for (i = 0; i < n - 1; i++)
printf("%d ", S[i]);
printf("%d\n",... | #include <stdio.h>
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
#define N 500000
int count = 0;
int main() {
int S[N], n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
mergeSort(S, 0, n);
for (i = 0; i < n - 1; i++)
printf("%d ", S[i]);
printf("%d\n",... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 22]] | 0 | 399 | 2 |
#include <stdio.h>
#define INF 50000
int cnt;
int merge(int A[], int l, int m, int r) {
long R[500000], L[500000];
int i, j, k;
int n1, n2;
n1 = m - l;
n2 = r - m;
for (i = 0; i < n1; i++) {
L[i] = A[l + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[m + i];
}
L[n1] = INF;
R[n2] = INF;
i =... | #include <stdio.h>
#define INF 1000000005
int cnt;
int merge(int A[], int l, int m, int r) {
int R[250010], L[250010];
int i, j, k;
int n1, n2;
n1 = m - l;
n2 = r - m;
for (i = 0; i < n1; i++) {
L[i] = A[l + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[m + i];
}
L[n1] = INF;
R[n2] = INF;
... | [["-", 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, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 401 | 8 |
#include <stdio.h>
#define N 500000
#define INF 100000000
int c;
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int main() {
int n, i, arr[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
mergeSort(arr, 0, n);
for (i = 0; i < n; i++) {
printf("%d",... | #include <stdio.h>
#define N 500000
#define INF 1000000000
int c;
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int main() {
int n, i, arr[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &arr[i]);
}
mergeSort(arr, 0, n);
for (i = 0; i < n; i++) {
printf("%d"... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 1, 0, 11, 12, 69, 71, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 69, 71, 16, 31, 22]] | 0 | 412 | 6 |
#include <stdio.h>
#define MAX 500000
#define BIG 4000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count = 0;
void merge(int A[], int n, int left, int mid, int right);
void mergeSort(int A[], int n, int left, int right);
int main() {
int A[MAX], i, n;
scanf("%d\n", &n);
for (i = 0; i < n; i++)
scanf("%d\n"... | #include <stdio.h>
#define MAX 500000
#define BIG 1000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count = 0;
void merge(int A[], int n, int left, int mid, int right);
void mergeSort(int A[], int n, int left, int right);
int main() {
int A[MAX], i, n;
scanf("%d\n", &n);
for (i = 0; i < n; i++)
scanf("%d\n"... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 449 | 2 |
#include <stdio.h>
#define SENTINEL 1000000000
int count = 0;
void merge(int A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1], R[n2 + 1];
for (i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[mid + i];
}
... | #include <stdio.h>
#define SENTINEL 1000000000
int count = 0;
void merge(int A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1], R[n2 + 1];
for (i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (j = 0; j < n2; j++) {
R[j] = A[mid + j];
}
... | [["-", 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], ["-", 8, 9, 0, 1, 0, 11, 31, 69, 71, 22], ["+", 8, 9, 0, 1, 0, 11, ... | 0 | 404 | 12 |
#include <stdio.h>
#define MAX 500000
#define Large 3000000000
int cnt;
int L[250000 + 2];
int R[250000 + 2];
int A[MAX];
void merge1(int l, int m, int r) {
int n1, n2, i;
n1 = m - l; //?????´???????????¨
n2 = r - m; //?????´???????????¨
for (i = 0; i < n1; i++) {
L[i] = A[l + i];
}
for (i = 0; i < n2; ... | #include <stdio.h>
#define MAX 500000
#define Large 2000000000
int cnt;
int L[250000 + 2];
int R[250000 + 2];
int A[MAX];
void merge1(int l, int m, int r) {
int n1, n2, i;
n1 = m - l; //?????´???????????¨
n2 = r - m; //?????´???????????¨
for (i = 0; i < n1; i++) {
L[i] = A[l + i];
}
for (i = 0; i < n2; ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 391 | 2 |
#include <stdio.h>
#define INFTY 1000000000
#define N 10000000
int sum = 0;
void merge(int *A, int left, int mid, int right) {
int n1, n2, i, j, k, L[N], R[N];
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] = A[mid + i];
L[n1] = INFT... | #include <stdio.h>
#define INFTY 1000000000
#define N 500001
int sum = 0;
void merge(int *A, int left, int mid, int right) {
int n1, n2, i, j, k, L[N], R[N];
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] = A[mid + i];
L[n1] = INFTY;... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 391 | 2 |
#include <stdio.h>
#define MAX 5000000
#define INFTY 20000000
int cou = 0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left, n2 = right - mid;
int i, j, L[MAX / 2 + 2], R[MAX / 2 + 2], k;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] = A[mid + i];
L... | #include <stdio.h>
#define MAX 500000
#define INFTY 1000000000
int cou = 0;
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left, n2 = right - mid;
int i, j, L[MAX / 2 + 2], R[MAX / 2 + 2], k;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] = A[mid + i];
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 384 | 4 |
#include <stdio.h>
#define MAX 1000000
#define INFTY 500000
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int count = 0;
int main() {
int i, n, A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
mergeSort(A, 0, n);
for (i = 0; i < n - 1; i++) {
printf... | #include <stdio.h>
#define MAX 500001
#define INFTY 1000000000
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int count = 0;
int main() {
int i, n, A[MAX];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
mergeSort(A, 0, n);
for (i = 0; i < n - 1; i++) {
pri... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 472 | 4 |
#include <stdio.h>
#define sentinel 500000000
#define N 1000000
int count = 0;
void Merge(int a[], int left, int mid, int right) {
int n1, n2, i, j, L[N], R[N], k;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
... | #include <stdio.h>
#define sentinel 1000000000
#define N 500000
int count = 0;
void Merge(int a[], int left, int mid, int right) {
int n1, n2, i, j, L[N], R[N], k;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 393 | 4 |
#include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count = 0;
void merge(int A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] =... | #include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int count = 0;
void merge(int A[], int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = A[left + i];
for (i = 0; i < n2; i++)
R[i] =... | [["-", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 69, 71, 22], ["-", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 69, 71, 22]] | 0 | 391 | 4 |
#include <stdio.h>
#define INFTY 1000000000000;
int cnt = 0;
void merge(int A[], int left, int mid, int right) {
int n1, n2, i, j, k;
int L[1024], R[1024];
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[mid + i];
}
... | #include <stdio.h>
#define INFTY 2000000000;
int cnt = 0;
void merge(int A[], int left, int mid, int right) {
int n1, n2, i, j, k;
int L[250002], R[250002];
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[mid + i];
}
... | [["-", 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, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 412 | 8 |
#include <stdio.h>
int L[300000], R[300000];
int cnt = 0;
int merge(int A[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
int L[500000], R[500000];
for (i = 0; i < n1 - 1; i++) {
L[i] = A[left + i];
}
for (i = 0; i < n2 - 1; i++) {
R[i... |
#include <stdio.h>
int L[300000], R[300000];
int cnt = 0;
int merge(int A[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
int L[500000], R[500000];
for (i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[mi... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 419 | 4 |
#include <stdio.h>
int L[500000], R[500000], count;
void merge(int S[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = S[left + i];
for (i = 0; i < n2; i++)
R[i] = S[mid + i];
L[n1] = 50000000000;
R[n2] = 50000000000... | #include <stdio.h>
int L[500000], R[500000], count;
void merge(int S[], int n, int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
for (i = 0; i < n1; i++)
L[i] = S[left + i];
for (i = 0; i < n2; i++)
R[i] = S[mid + i];
L[n1] = 2000000000;
R[n2] = 2000000000;
... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 391 | 4 |
#include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int a[], int n, int left, int mid, int right) {
int n1, n2, i, j, k;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (i = 0; i < n2; i++) {
... | #include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int L[MAX / 2 + 2], R[MAX / 2 + 2];
int cnt;
void merge(int a[], int n, int left, int mid, int right) {
int n1, n2, i, j, k;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (i = 0; i < n2; i++) {
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22]] | 0 | 417 | 2 |
#include <stdio.h>
#define LIM 500000
#define INF 1000000001
int cnt = 0;
int A[LIM];
int L[LIM], R[LIM];
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int I, J;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; i < n2; i++) {
R[... | #include <stdio.h>
#define LIM 500000
#define INF 1000000001
int cnt = 0;
int A[LIM];
int L[LIM], R[LIM];
void merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int I, J;
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; i < n2; i++) {
R[... | [["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 79], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 393 | 4 |
#include <stdio.h>
#define INFTY 1 << 30;
int Merge(int A[], int left, int mid, int right) {
int k;
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1];
int R[n2 + 1];
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; i < n2; i++) {
R[i] = A[mid + i];
}
L[n1] =... | #include <stdio.h>
#define INFTY 1 << 30;
int Merge(int A[], int left, int mid, int right) {
int k;
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1];
int R[n2 + 1];
for (int i = 0; i < n1; i++) {
L[i] = A[left + i];
}
for (int i = 0; i < n2; i++) {
R[i] = A[mid + i];
}
L[n1] =... | [["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 397 | 2 |
#include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int Left[MAX / 2 + 2], Right[MAX / 2 + 2];
int cnt;
void merge(int ary[], int n, int left, int mid, int right) {
int i, j, k;
int n1, n2;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++)
Left[i] = ary[left + 1];
for (i = 0; i... | #include <stdio.h>
#define MAX 500000
#define SENTINEL 2000000000
int Left[MAX / 2 + 2], Right[MAX / 2 + 2];
int cnt;
void merge(int ary[], int n, int left, int mid, int right) {
int i, j, k;
int n1, n2;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++)
Left[i] = ary[left + i];
for (i = 0; i... | [["-", 8, 1, 0, 11, 12, 69, 71, 16, 12, 13], ["+", 8, 1, 0, 11, 12, 69, 71, 16, 12, 22]] | 0 | 407 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define INFTY 1000000
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int cnt = 0;
int main() {
int i, n, *p;
int S[500000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
p = &S[0];
mergeSort(p, 0, n);
for (i = 0; i < n - ... | #include <stdio.h>
#include <stdlib.h>
#define INFTY 1000000000
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int cnt = 0;
int main() {
int i, n, *p;
int S[500000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &S[i]);
}
p = &S[0];
mergeSort(p, 0, n);
for (i = 0; i < n... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 0, 57, 15, 23, 0, 16, 31, 16, 17, 72]] | 0 | 456 | 4 |
#include <stdio.h>
#include <stdlib.h>
void printArray(int, int[]);
int merge(int, int[], int, int, int);
int merge_sort(int, int[], int, int);
int main(int argc, char **argv) {
int size;
scanf("%d\n", &size);
int array[size];
for (int i = 0; i < size; i++)
scanf("%d", &array[i]);
int returnVal = merge... | #include <stdio.h>
#include <stdlib.h>
void printArray(int, int[]);
int merge(int, int[], int, int, int);
int merge_sort(int, int[], int, int);
int main(int argc, char **argv) {
int size;
scanf("%d\n", &size);
int array[size];
for (int i = 0; i < size; i++)
scanf("%d", &array[i]);
int returnVal = merge... | [["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 106], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 20], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 22]] | 0 | 470 | 4 |
#include <stdio.h>
void merge(int[], int, int, int, int);
void mergeSort(int[], int, int, int);
#define MAX 500000
int Right[MAX / 2 + 2], Left[MAX / 2 + 2];
int count;
int main() {
int data[MAX], n, i, key;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &data[i]);
mergeSort(data, n, 0, n... | #include <stdio.h>
void merge(int[], int, int, int, int);
void mergeSort(int[], int, int, int);
#define MAX 500000
int Right[MAX / 2 + 2], Left[MAX / 2 + 2];
int count;
int main() {
int data[MAX], n, i, key;
count = 0;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &data[i]);
mergeSort(data, n, 0, n... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22]] | 0 | 412 | 4 |
#include <stdio.h>
int S[500000];
int count = 0;
int merge(int, int, int);
int mergeSort(int, int);
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
mergeSort(0, n);
for (i = 0; i < n; i++) {
if (i == n - 1)
printf("%d", S[i]);
printf("%d ", S[i]);
}
... | #include <stdio.h>
int S[500000];
int count = 0;
int merge(int, int, int);
int mergeSort(int, int);
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
mergeSort(0, n);
for (i = 0; i < n; i++) {
if (i == n - 1) {
printf("%d", S[i]);
break;
}
prin... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 8, 9, 0, 57, 64, 9, 0, 93, 0, 94], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 376 | 4 |
#include <stdio.h>
#define N 500000
int tmp[N], cnt = 0;
void MergeSort(int data[], int left, int right) {
int mid, i, j, k;
if (left >= right)
return;
mid = (left + right) / 2;
MergeSort(data, left, mid);
MergeSort(data, mid + 1, right);
for (i = left; i <= mid; i++)
tmp[i] = data[i];
for (i =... | #include <stdio.h>
#define N 500000
int tmp[N], cnt;
void MergeSort(int data[], int left, int right) {
int mid, i, j, k;
if (left >= right)
return;
mid = (left + right) / 2;
MergeSort(data, left, mid);
MergeSort(data, mid + 1, right);
for (i = left; i <= mid; i++)
tmp[i] = data[i];
for (i = mid ... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 0, 32], ["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 0, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 304 | 4 |
#define _CRT_SECURE_NO_WARNINGS
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#define SENTINEL INT_MAX
int A[500000], c = 0;
void Merge(int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
int L[INT_MAX], R[INT_MAX];
// L = (int *)malloc(sizeof(int)*n1);
// ... | #define _CRT_SECURE_NO_WARNINGS
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>
#define SENTINEL INT_MAX
int A[500000], c = 0;
void Merge(int left, int mid, int right) {
int i, j, k;
int n1 = mid - left;
int n2 = right - mid;
int L[300000], R[300000];
for (i = 0; i < n1; i++) {
L[i] = A[left... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 387 | 4 |
#include <limits.h>
#include <stdio.h>
#define max 500000
int sum = 0;
void margeSort(int s[], int l, int r) {
int m;
if (l + 1 < r) {
m = (l + r) / 2;
margeSort(s, l, m);
margeSort(s, m, r);
marge(s, l, m, r);
}
}
void marge(int s[], int l1, int m, int r1) {
int i, j, k, n1, n2;
n1 = m - l1... | #include <limits.h>
#include <stdio.h>
#define max 500000
int sum = 0;
void margeSort(int s[], int l, int r) {
int m;
if (l + 1 < r) {
m = (l + r) / 2;
margeSort(s, l, m);
margeSort(s, m, r);
marge(s, l, m, r);
}
}
void marge(int s[], int l1, int m, int r1) {
int i, j, k, n1, n2;
n1 = m - l1... | [["+", 0, 2, 3, 4, 0, 69, 71, 16, 17, 33], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 384 | 2 |
#include <stdio.h>
int A[500000], count = 0;
void Merge(int l, int m, int r) {
int n1 = m - l, n2 = r - m, i, j, k;
int L[n1], R[n2];
for (i = 0; i < n1; i++) {
L[i] = A[l + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[r + i];
}
L[n1] = 1000000001;
R[n2] = 1000000001;
for (i = 0, j = 0, k = l;... | #include <stdio.h>
int A[500000], count = 0;
void Merge(int l, int m, int r) {
int n1 = m - l, n2 = r - m, i, j, k;
int L[n1], R[n2];
for (i = 0; i < n1; i++) {
L[i] = A[l + i];
}
for (i = 0; i < n2; i++) {
R[i] = A[m + i];
}
L[n1] = 1000000001;
R[n2] = 1000000001;
for (i = 0, j = 0, k = l;... | [["-", 0, 1, 0, 11, 12, 69, 71, 16, 31, 22], ["+", 0, 1, 0, 11, 12, 69, 71, 16, 31, 22]] | 0 | 360 | 2 |
#include <stdio.h>
#define LENGTH_N 500000
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int mergenum = 0;
int main() {
int i, nl, ql, arrayN[LENGTH_N], q;
scanf("%d", &nl);
for (i = 0; i < nl; i++) {
scanf("%d", &arrayN[i]);
}
mergeSort(arrayN, 0, nl);
for (i = 0; i < nl; i+... | #include <stdio.h>
#define LENGTH_N 500000
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int mergenum = 0;
int main() {
int i, nl, ql, arrayN[LENGTH_N], q;
scanf("%d", &nl);
for (i = 0; i < nl; i++) {
scanf("%d", &arrayN[i]);
}
mergeSort(arrayN, 0, nl);
for (i = 0; i < nl; i+... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 424 | 2 |
config = {
input : 'tmp',
newline : '\r\n'
}; // win
// config = { input: '/dev/stdin', newline: '\n' }; // linux
line =
require('fs').readFileSync(config.input, 'ascii').split(config.newline, 2);
S = line[1].split(' ').map(Number);
sorted = [].concat(S);
cnt = 0;
mergeSort(sorted, 0, sorted.length);
console.... | // config = { input: 'tmp', newline: '\r\n' }; // win
config = {
input : '/dev/stdin',
newline : '\n'
}; // linux
line =
require('fs').readFileSync(config.input, 'ascii').split(config.newline, 2);
S = line[1].split(' ').map(Number);
sorted = [].concat(S);
cnt = 0;
mergeSort(sorted, 0, sorted.length);
console.... | [["-", 0, 11, 12, 500, 0, 569, 51, 557, 0, 491], ["+", 0, 11, 12, 500, 0, 569, 51, 557, 0, 491], ["-", 0, 11, 12, 500, 0, 569, 51, 557, 0, 44]] | 2 | 384 | 3 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
static final int INF = 1000000001;
static final int N = 500000;
static int n, c;
static int a[], L[], R[];
public static void merge(int l, int ... | import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
static final int INF = 1000000001;
static final int N = 500000;
static int n, c;
static int a[], L[], R[];
public static void merge(int l, int ... | [["+", 0, 16, 31, 492, 3, 4, 0, 504, 516, 22], ["+", 0, 16, 31, 492, 3, 4, 0, 504, 0, 70], ["+", 0, 16, 31, 492, 3, 4, 0, 504, 0, 73]] | 3 | 445 | 3 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
private static final int max = 500000;
private static int count = 0;
private static int[] l = new int[max / 2];
private static int[] r = new int[max / 2];
private static int sentinel = 1000000001;
public static void main... | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
private static final int max = 500000;
private static int count = 0;
private static int[] l = new int[max / 2 + 1];
private static int[] r = new int[max / 2 + 1];
private static int sentinel = 1000000001;
public static v... | [["+", 49, 200, 51, 227, 497, 505, 0, 16, 17, 72], ["+", 49, 200, 51, 227, 497, 505, 0, 16, 12, 499], ["-", 8, 196, 0, 1, 0, 492, 500, 509, 119, 22], ["+", 8, 196, 0, 1, 0, 492, 500, 509, 119, 22]] | 3 | 476 | 8 |
import java.util.*;
public class Main {
static int cmps = 0;
static void merge(int[] A, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int[] L = new int[n1 + 1];
int[] R = new int[n2 + 1];
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i ... | import java.util.*;
public class Main {
static int cmps = 0;
static void merge(int[] A, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int[] L = new int[n1 + 1];
int[] R = new int[n2 + 1];
for (int i = 0; i < n1; i++)
L[i] = A[left + i];
for (int i = 0; i ... | [["-", 8, 196, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 196, 0, 7, 15, 16, 12, 16, 12, 499]] | 3 | 446 | 2 |
import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
private static FastScanner sc = new FastScanner();
static int cnt = 0;
public static void main(String[] args) {
int n = sc.nextInt();
int[] A = new int[n];
for (int i = 0; i < n; i++... | import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;
public class Main {
private static FastScanner sc = new FastScanner();
static int cnt = 0;
public static void main(String[] args) {
int n = sc.nextInt();
int[] A = new int[n];
for (int i = 0; i < n; i++... | [["+", 0, 1, 0, 492, 3, 4, 0, 504, 516, 22], ["+", 0, 1, 0, 492, 3, 4, 0, 504, 0, 70], ["+", 0, 1, 0, 492, 3, 4, 0, 504, 0, 73]] | 3 | 732 | 3 |
#include <stdio.h>
#include <stdlib.h>
#define S 1000000000
#define N 500000
int count = 0;
void merge(int A[], int left, int mid, int right) {
int n1, n2, i, j, k, *L, *R;
n1 = mid - left;
n2 = right - mid;
L = (int *)malloc(sizeof(int) * (n1 + 1));
R = (int *)malloc(sizeof(int) * (n2 - 1));
for (i = 0; i... | #include <stdio.h>
#include <stdlib.h>
#define S 1000000000
#define N 500000
int count = 0;
void merge(int A[], int left, int mid, int right) {
int n1, n2, i, j, k, *L, *R;
n1 = mid - left;
n2 = right - mid;
L = (int *)malloc(sizeof(int) * (n1 + 1));
R = (int *)malloc(sizeof(int) * (n2 + 1));
for (i = 0; i... | [["-", 3, 4, 0, 16, 12, 23, 0, 16, 17, 33], ["+", 3, 4, 0, 16, 12, 23, 0, 16, 17, 72], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 27, 17, 29]] | 0 | 452 | 5 |
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define N 1000000000
void mergeSort(int[], int, int);
void merge(int[], int, int, int);
int cnt = 0;
int main() {
int i, S[N], n;
while (1) {
scanf("%d", &n);
if (n <= N && n > 0)
break;
}
for (i = 0; i < n; i++)
scanf("%d", &S[i])... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#define N 1000000
void mergeSort(int[], int, int);
void merge(int[], int, int, int);
int cnt = 0;
int main() {
int i, S[N], n;
while (1) {
scanf("%d", &n);
if (n <= N && n > 0)
break;
}
for (i = 0; i < n; i++)
scanf("%d", &S[i]);
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 460 | 2 |
#include <stdio.h>
#define Max 500000
#define term 1000000000
int Left[(Max / 2) + 2], Right[(Max / 2) + 2];
int c = 0;
void merge(int e[], int n, int left, int mid, int right) {
int i, j, k;
int x = (mid - left);
int y = (right - mid);
for (i = 0; i < x; i++)
Left[i] = e[left + i];
for (i = 0; i < y;... | #include <stdio.h>
#define Max 500000
#define term 2000000000
int Left[(Max / 2) + 2], Right[(Max / 2) + 2];
int c = 0;
void merge(int e[], int n, int left, int mid, int right) {
int i, j, k;
int x = (mid - left);
int y = (right - mid);
for (i = 0; i < x; i++)
Left[i] = e[left + i];
for (i = 0; i < y;... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 0, 1, 0, 11, 12, 69, 71, 16, 17, 72], ["-", 0, 1, 0, 11, 12, 69, 71, 16, 12, 13], ["+", 0, 1, 0, 11, 12, 69, 71, 27, 17, 29]] | 0 | 426 | 58 |
#include <stdio.h>
#define INF 20000000000
void merge(int *, int, int, int);
void mergesort(int *, int, int);
int A[100000000], L[10000000], R[10000000];
int count = 0;
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
mergesort(A, 0, n);
for (i = 0; i < n; i++) {
... | #include <stdio.h>
#define INF 2000000000
void merge(int *, int, int, int);
void mergesort(int *, int, int);
int A[100000000], L[1000000], R[1000000];
int count = 0;
int main() {
int i, n;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &A[i]);
mergesort(A, 0, n);
for (i = 0; i < n; i++) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13]] | 0 | 417 | 6 |
#include <stdio.h>
#define N 100000000
#define INF 100000000
int cnt;
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int main() {
int a, A[N], i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
mergeSort(A, 0, a);
for (i = 0; i < a; i++) {
if (i == a - 1) {
... | #include <stdio.h>
#define N 500000
#define INF 1000000000
int cnt;
void merge(int *, int, int, int);
void mergeSort(int *, int, int);
int main() {
int a, A[N], i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
mergeSort(A, 0, a);
for (i = 0; i < a; i++) {
if (i == a - 1) {
... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 426 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void merge(int[], int, int, int);
void mergesort(int[], int, int);
#define na 500000
#define INFTY 1000000000
int change = 0;
int L[na], R[na];
int main() {
int i = 0, A[na], n = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
void merge(int[], int, int, int);
void mergesort(int[], int, int);
#define na 500000
#define INFTY 1000000000
int change = 0;
int L[na], R[na];
int main() {
int i = 0, A[na], n = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 31, 22]] | 0 | 428 | 2 |
#include <stdio.h>
#include <stdlib.h>
void mergeSort(int numbers[], int temp[], int array_size);
void m_sort(int numbers[], int temp[], int left, int right);
void merge(int numbers[], int temp[], int left, int mid, int right);
int numbers[10000];
int temp[10000];
int cnt = 0;
int main() {
int i;
int n;
scanf(... | #include <stdio.h>
#include <stdlib.h>
void mergeSort(int numbers[], int temp[], int array_size);
void m_sort(int numbers[], int temp[], int left, int right);
void merge(int numbers[], int temp[], int left, int mid, int right);
int numbers[500000];
int temp[500000];
int cnt = 0;
int main() {
int i;
int n;
scan... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 535 | 6 |
#include <math.h>
#include <stdio.h>
#define N 500000
int cnt = 0;
void merge(int *A, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int i, j, k;
int L[N], R[N];
for (i = 0; i <= n1 - 1; i++) {
L[i] = A[left + i];
}
for (i = 0; i <= n2 - 1; i++) {
R[i] = A[mid + i];
... | #include <math.h>
#include <stdio.h>
#define N 500000
int cnt = 0;
void merge(int *A, int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int i, j, k;
int L[N], R[N];
for (i = 0; i <= n1 - 1; i++) {
L[i] = A[left + i];
}
for (i = 0; i <= n2 - 1; i++) {
R[i] = A[mid + i];
... | [["-", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22], ["+", 64, 9, 0, 1, 0, 11, 12, 69, 71, 22]] | 0 | 397 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define O 10000000
void N(int B[], int left, int right);
void M(int C[], int left, int mid, int right);
int count;
int main() {
int A[150060010];
int a, i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
N(A, 0, a);
for (i = 0; i < a; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#define O 1000000000
void N(int B[500001], int left, int right);
void M(int C[500001], int left, int mid, int right);
int count;
int main() {
int A[500001];
int a, i;
scanf("%d", &a);
for (i = 0; i < a; i++) {
scanf("%d", &A[i]);
}
N(A, 0, a);
for (i = 0; i < a... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 49, 53, 54, 55, 0, 56, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 484 | 6 |
#include <stdio.h>
int c;
void merge(int a[], int n, int l, int mid, int r) {
int n1, n2, i, j, k;
n1 = mid - l;
n2 = r - mid;
int left[n1], right[n2];
for (i = 0; i < n1; i++) {
left[i] = a[l + i];
}
for (i = 0; i < n2; i++) {
right[i] = a[mid + i];
}
left[n1] = right[n2] = 2000000000;
i ... | #include <stdio.h>
int c;
void merge(int a[], int n, int l, int mid, int r) {
int n1, n2, i, j, k;
n1 = mid - l;
n2 = r - mid;
int left[n1], right[n2];
for (i = 0; i < n1; i++) {
left[i] = a[l + i];
}
for (i = 0; i < n2; i++) {
right[i] = a[mid + i];
}
left[n1] = right[n2] = 2000000000;
i ... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 393 | 2 |
#include <stdio.h>
int l[250002];
int r[250002];
int count = 0;
void merge(int a[], int left, int mid, int right) {
int n1, n2, i;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++)
l[i] = a[left + i];
for (i = 0; i < n2; i++)
r[i] = a[mid + i];
l[n1] = 2000000000;
r[n2] = 2000000000;
... | #include <stdio.h>
int l[250002];
int r[250002];
int count = 0;
void merge(int a[], int left, int mid, int right) {
int n1, n2, i;
n1 = mid - left;
n2 = right - mid;
for (i = 0; i < n1; i++)
l[i] = a[left + i];
for (i = 0; i < n2; i++)
r[i] = a[mid + i];
l[n1] = 2000000000;
r[n2] = 2000000000;
... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 376 | 2 |
const config = {
input : '/dev/stdin',
newline : '\n'
};
const line =
require('fs').readFileSync(config.input, 'utf-8').split(config.newline);
const pos = (x, y) => { return {x : x, y : y}; };
const div = (p1, p2, n) => {
if (n === 0)
return [];
const cos = Math.cos(Math.PI / 3.0);
const sin = Math... | const config = {
input : '/dev/stdin',
newline : '\n'
};
const line =
require('fs').readFileSync(config.input, 'utf-8').split(config.newline);
const pos = (x, y) => { return {x : x, y : y}; };
const div = (p1, p2, n) => {
if (n === 0)
return [];
const cos = Math.cos(Math.PI / 3.0);
const sin = Math... | [["+", 3, 3, 0, 568, 8, 561, 0, 562, 0, 574], ["+", 0, 562, 0, 2, 63, 558, 500, 558, 500, 22], ["+", 0, 562, 0, 2, 63, 558, 500, 558, 0, 131], ["+", 0, 562, 0, 2, 63, 558, 500, 558, 559, 560], ["+", 8, 561, 0, 562, 0, 2, 63, 558, 0, 131], ["+", 8, 561, 0, 562, 0, 2, 63, 558, 559, 560], ["+", 8, 561, 0, 562, 0, 2, 3, 3,... | 2 | 421 | 21 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
double[] a = new double[2];
double[] b = new double[2];
a[0] = 0;
a[1] = 0;
b[0] = 100;
b[1] = 0;
double z = 1;
System.out.printf(... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
double[] a = new double[2];
double[] b = new double[2];
a[0] = 0;
a[1] = 0;
b[0] = 100;
b[1] = 0;
double z = 1;
System.out.printf(... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72]] | 3 | 557 | 2 |
import java.util.Scanner;
public class Main {
int n;
public static void main(String args[]) { new Main().run(); }
Main() {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
}
void run() {
Node n1 = new Node(0, 0);
Node n2 = new Node(100, 0);
System.out.println(n1);
koch(n1, n... | import java.util.Scanner;
public class Main {
int n;
public static void main(String args[]) { new Main().run(); }
Main() {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
}
void run() {
Node n1 = new Node(0, 0);
Node n2 = new Node(100, 0);
System.out.println(n1);
koch(n1, n... | [["-", 0, 503, 49, 200, 51, 16, 31, 16, 17, 33], ["+", 0, 503, 49, 200, 51, 16, 31, 16, 17, 72]] | 3 | 451 | 2 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Point p1 = new Point(0, 0);
Point p2 = new Point(100, 0);
System.out.println("0.00000000 0.00000000");
koch(n, p1, p2);
System.out.println("100.000000... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Point p1 = new Point(0, 0);
Point p2 = new Point(100, 0);
System.out.println("0.00000000 0.00000000");
koch(n, p1, p2);
System.out.println("100.000000... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72]] | 3 | 478 | 2 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws Exception {
... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class Main {
private static BufferedReader br =
new BufferedReader(new InputStreamReader(System.in));
public static void main(String[] args) throws Exception {
... | [["-", 0, 1, 0, 11, 12, 16, 12, 509, 500, 22], ["+", 0, 1, 0, 11, 12, 16, 12, 509, 500, 22]] | 3 | 498 | 4 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java... | [["-", 8, 196, 0, 503, 49, 200, 51, 16, 31, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 31, 22], ["-", 8, 196, 0, 503, 49, 200, 51, 16, 12, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 22]] | 3 | 670 | 4 |
import java.io.*;
class Point {
public double x, y;
Point(double x, double y) {
this.x = x;
this.y = y;
}
public static void move(Point move, double mx, double my, double si,
double co) {
double[][] xy = {{move.x}, {move.y}, {1}};
double[][] r = {{co, -si, 0}, {si, co,... | import java.io.*;
class Point {
public double x, y;
Point(double x, double y) {
this.x = x;
this.y = y;
}
public static void move(Point move, double mx, double my, double si,
double co) {
double[][] xy = {{move.x}, {move.y}, {1}};
double[][] r = {{co, -si, 0}, {si, co,... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 515], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 515]] | 3 | 999 | 2 |
import java.io.IOException;
import java.util.Scanner;
class Main {
static final int INF = 1000000001;
static int changecount;
public static void main(String args[]) throws IOException {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
Cood p1 = new Cood(0, 0);
Cood p2... | import java.io.IOException;
import java.util.Scanner;
class Main {
static final int INF = 1000000001;
static int changecount;
public static void main(String args[]) throws IOException {
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
Cood p1 = new Cood(0, 0);
Cood p2... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 457 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Point p1 = new Point(0, 0), p2 = new Point(100, 0);
System.out.println(p1.x + " " + p1.y);
kochCurve(n, p1, p2);
System.out.println(p2.x + " " + p... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Point p1 = new Point(0, 0), p2 = new Point(100, 0);
System.out.println(p1.x + " " + p1.y);
kochCurve(n, p1, p2);
System.out.println(p2.x + " " + p... | [["-", 51, 230, 3, 4, 0, 16, 31, 16, 17, 33], ["+", 51, 230, 3, 4, 0, 16, 31, 16, 17, 72]] | 3 | 445 | 2 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n;
double[] p1 = {0, 0};
double[] p2 = {100, 0};
n = scan.nextInt();
koch(n, p1, p2);
System.out.printf("%f %f\n", p2[0], p2[1]);
scan.close();
}
publi... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n;
double[] p1 = {0, 0};
double[] p2 = {100, 0};
n = scan.nextInt();
koch(n, p1, p2);
System.out.printf("%f %f\n", p2[0], p2[1]);
scan.close();
}
publi... | [["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72]] | 3 | 447 | 2 |
/*
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_5_C&lang=jp
*/
import java.util.*;
class Point {
double x, y;
Point(double x, double y) {
this.x = x;
this.y = y;
}
void print() { System.out.printf("%.8f %.8f\n", x, y); }
}
public class Main {
double dist(Point s, Point t) {
... | /*
* http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_5_C&lang=jp
*/
import java.util.*;
class Point {
double x, y;
Point(double x, double y) {
this.x = x;
this.y = y;
}
void print() { System.out.printf("%.8f %.8f\n", x, y); }
}
public class Main {
double dist(Point s, Point t) {
... | [["-", 0, 503, 49, 200, 51, 16, 31, 16, 17, 33], ["+", 0, 503, 49, 200, 51, 16, 31, 16, 17, 72], ["-", 0, 503, 49, 200, 51, 16, 12, 509, 119, 22], ["+", 0, 503, 49, 200, 51, 16, 12, 509, 119, 22]] | 3 | 465 | 4 |
import java.util.Scanner;
public class Main {
class Pair {
double y, x;
Pair(double x, double y) {
this.y = y;
this.x = x;
}
void print() { System.out.println(this.y + " " + this.x); }
}
int n;
void run() {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
Pair... | import java.util.Scanner;
public class Main {
class Pair {
double y, x;
Pair(double x, double y) {
this.y = y;
this.x = x;
}
void print() { System.out.println(this.y + " " + this.x); }
}
int n;
void run() {
Scanner scan = new Scanner(System.in);
n = scan.nextInt();
Pair... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60]] | 3 | 498 | 2 |
import java.util.Scanner;
public class Main {
static StringBuilder sb = new StringBuilder();
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
recursive(0, 0, 100, 0.0, n);
sb.append("100.00000000 0.00000000");
System.out.println(sb.toString())... | import java.util.Scanner;
public class Main {
static StringBuilder sb = new StringBuilder();
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
recursive(0, 0, 100, 0.0, n);
sb.append("100.00000000 0.00000000");
System.out.println(sb.toString())... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 18], ["-", 8, 196, 0, 57, 15, 15, 0, 16, 12, 22], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 31, 22], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 47], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 12, 22]] | 3 | 421 | 6 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.