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 <stdio.h>
#include <string.h>
#define LEN 100005
/* プロセスを表す構造体 */
typedef struct pp {
char name[100];
int t;
} P;
P Q[LEN];
int head, tail, n;
void enqueue(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequeue() {
P x = Q[head];
head = (head + 1) % LEN;
return x;
}
int min(int a, int b) {... | #include <stdio.h>
#include <string.h>
#define LEN 100005
/* プロセスを表す構造体 */
typedef struct pp {
char name[100];
int t;
} P;
P Q[LEN];
int head, tail, n;
void enqueue(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequeue() {
P x = Q[head];
head = (head + 1) % LEN;
return x;
}
int min(int a, int b) {... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 269 | 1 |
#include <stdio.h>
#include <string.h>
#define LEN 100005
/* プロセスを表す構造体 */
typedef struct pp {
char name[100];
int t;
} P;
P Q[LEN];
int head, tail, n;
void enqueue(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequeue() {
P x = Q[head];
head = (head + 1) % LEN;
return x;
}
int min(int a, int b) {... | #include <stdio.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
P Q[LEN];
int head, tail, n;
void enqueue(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequeue() {
P x = Q[head];
head = (head + 1) % LEN;
return x;
}
int min(int a, int b) { return a < b ? a... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 269 | 1 |
#include <stdio.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
int head, tail, n;
P Q[LEN];
void enquene(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequene() {
P x;
x = Q[head];
head = (head + 1) % LEN;
return x;
}
int min(int a, int b) {
if (a < b)
... | #include <stdio.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
int head, tail, n;
P Q[LEN];
void enquene(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequene() {
P x;
x = Q[head];
head = (head + 1) % LEN;
return x;
}
int min(int a, int b) {
if (a < b)
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 118, 28, 22], ["+", 0, 57, 15, 23, 0, 16, 31, 118, 17, 131], ["+", 0, 57, 15, 23, 0, 16, 31, 118, 119, 120]] | 0 | 268 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
P Q[LEN];
int head, tail, n;
void enqueue(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequeue() {
P tmp = Q[head];
head = (head + 1) % LEN;
return tmp;
}
int min(int a, int b... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define LEN 100005
typedef struct pp {
char name[100];
int t;
} P;
P Q[LEN];
int head, tail, n;
void enqueue(P x) {
Q[tail] = x;
tail = (tail + 1) % LEN;
}
P dequeue() {
P tmp = Q[head];
head = (head + 1) % LEN;
return tmp;
}
int min(int a, int b... | [["-", 8, 9, 0, 37, 0, 41, 15, 16, 17, 47], ["+", 8, 9, 0, 37, 0, 41, 15, 16, 17, 18], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 290 | 4 |
#include <stdio.h>
typedef struct {
char name[11];
int time;
} process;
int main() {
long long n, q, i, j, sp, ep, stime = 0;
process p[520000];
scanf("%lld%lld", &n, &q);
for (i = 0; i < n; ++i)
scanf("%s%d", p[i].name, &p[i].time);
sp = 0;
ep = n - 1;
while (sp <= ep) {
if (p[sp].time > q... | #include <stdio.h>
typedef struct {
char name[11];
int time;
} process;
int main() {
long long n, q, i, j, sp, ep, stime = 0;
process p[520000];
scanf("%lld%lld", &n, &q);
for (i = 0; i < n; ++i)
scanf("%s%d", p[i].name, &p[i].time);
sp = 0;
ep = n - 1;
while (sp <= ep) {
if (p[sp].time > q... | [["-", 0, 1, 0, 11, 31, 69, 71, 27, 28, 22], ["+", 0, 1, 0, 11, 31, 69, 71, 27, 28, 22]] | 0 | 185 | 2 |
#include <stdio.h>
int main(void) {
int n, q;
scanf("%d", &n);
scanf("%d", &q);
char qname[n][11];
int qtime[n];
int next[n];
int start = 0, end = n - 1;
int tcount = 0;
int i;
scanf("%s", qname[0]);
scanf("%d", &qtime[0]);
for (i = 1; i < n; i++) {
scanf("%s", qname[i]);
scanf("%d", ... | #include <stdio.h>
int main(void) {
int n, q;
scanf("%d", &n);
scanf("%d", &q);
char qname[n][11];
int qtime[n];
int next[n];
int start = 0, end = n - 1;
int tcount = 0;
int i;
scanf("%s", qname[0]);
scanf("%d", &qtime[0]);
for (i = 1; i < n; i++) {
scanf("%s", qname[i]);
scanf("%d", ... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 248 | 6 |
#include <stdio.h>
#define MAX 100000
typedef struct _task {
char name[11];
int t;
} task;
int head, tail;
task tasks[MAX];
void enqueue(task t) {
tasks[tail] = t;
tail = (tail + 1) % MAX;
}
void dequeue() { head = (head + 1) % MAX; }
int main() {
int n, q, i, min, timer;
head = tail = timer = 0;
s... | #include <stdio.h>
#define MAX 100000
typedef struct _task {
char name[11];
int t;
} task;
int head, tail;
task tasks[MAX];
void enqueue(task t) {
tasks[tail] = t;
tail = (tail + 1) % MAX;
}
void dequeue() { head = (head + 1) % MAX; }
int main() {
int n, q, i, min, timer;
head = tail = timer = 0;
s... | [["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 243 | 4 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int head;
int tail;
typedef struct {
char name[11];
int time;
} Q;
void enqueue(Q *a, Q b);
Q dequeue(Q *a);
int main() {
int n, m, k = 0, i, sum = 0;
head = 0;
scanf("%d %d", &n, &m);
Q *q;
Q arr[n];
tail = n - 1;
for (i = 0; i < n; i++) {
... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int head;
int tail;
typedef struct {
char name[11];
int time;
} Q;
void enqueue(Q *a, Q b);
Q dequeue(Q *a);
int main() {
int n, m, k = 0, i, sum = 0;
head = 0;
scanf("%d %d", &n, &m);
Q q[200000];
Q arr[n];
tail = n - 1;
for (i = 0; i < n; i+... | [["-", 0, 14, 8, 9, 0, 43, 49, 84, 0, 48], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 73]] | 0 | 335 | 4 |
#include <stdio.h>
typedef struct {
char s[10];
int t;
} process;
int main() {
int n, q, i, sum = 0, c = 0;
process p[100000];
scanf("%d%d", &n, &q);
for (i = 0; i < n; i++) {
scanf("%s%d", p[i].s, &p[i].t);
if (p[i].t <= q) {
sum += p[i].t;
p[i].t = 0;
printf("%s %d\n", p[i].s... | #include <stdio.h>
typedef struct {
char s[10];
int t;
} process;
int main() {
int n, q, i, sum = 0, c = 0;
process p[100000];
scanf("%d%d", &n, &q);
for (i = 0; i < n; i++) {
scanf("%s%d", p[i].s, &p[i].t);
if (p[i].t <= q) {
sum += p[i].t;
p[i].t = 0;
printf("%s %d\n", p[i].s... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 289 | 2 |
#include <stdio.h>
#include <string.h>
void Push(int, int);
#define LEN 10
#define MAX 100000
int main() {
int n, q;
int i;
int q_time = 0;
int judge = 0;
char name[MAX][LEN] = {};
int time[MAX] = {};
char subname[MAX][LEN] = {};
int subtime[MAX] = {};
int sum_time = 1;
scanf("%d %d", &n, &q);
... | #include <stdio.h>
#include <string.h>
void Push(int, int);
#define LEN 10
#define MAX 100000
int main() {
int n, q;
int i;
int q_time = 0;
int judge = 0;
char name[MAX][LEN] = {};
int time[MAX] = {};
char subname[MAX][LEN] = {};
int subtime[MAX] = {};
int sum_time = 1;
scanf("%d %d", &n, &q);
... | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 0 | 285 | 4 |
n = eval(input())
minSeq = eval(input())
maxv = -float("inf")
for i in range(n):
R = eval(input())
if R - minSeq > maxv:
maxv = R - minSeq
if R < minSeq:
minSeq = R
print(maxv) | n = eval(input())
minSeq = eval(input())
maxv = -float("inf")
for i in range(n-1):
R = eval(input())
if R - minSeq > maxv:
maxv = R - minSeq
if R < minSeq:
minSeq = R
print(maxv) | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 65 | 2 |
import sys
num_list = int(sys.stdin.readline())
lines = sys.stdin.readlines()
nums = list(map(int, lines))
max_diff = -sys.maxsize - 1
min_val = nums[0]
for num in nums :
diff = num - min_val
if diff > max_diff :
max_diff = diff
if num < min_val :
min_val = num
print(max_diff) | import sys
num_list = int(sys.stdin.readline())
lines = sys.stdin.readlines()
nums = list(map(int, lines))
max_diff = -sys.maxsize - 1
min_val = nums.pop(0)
for num in nums :
diff = num - min_val
if diff > max_diff :
max_diff = diff
if num < min_val :
min_val = num
print(max_diff) | [["-", 0, 656, 0, 1, 0, 662, 12, 206, 0, 70], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 0, 131], ["+", 0, 1, 0, 662, 12, 652, 63, 319, 319, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 662, 12, 206, 0, 73], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 78 | 6 |
n = eval(input())
maxv = - 1 * pow(10, 9)
minv = eval(input())
for _ in range(1, n - 1):
Rj = eval(input())
maxv = max(maxv, Rj - minv)
minv = min(minv, Rj)
print(maxv) | n = eval(input())
maxv = - 1 * pow(10, 9)
minv = eval(input())
for _ in range(1, n):
Rj = eval(input())
maxv = max(maxv, Rj - minv)
minv = min(minv, Rj)
print(maxv) | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 69 | 2 |
n = int(input())
maxv = -2 * 10 ** 9
minv = 2 * 10 ** 9
for i in range(1, n):
v = int(input())
maxv = max(maxv, v - minv)
minv = min(minv, v)
print(maxv) | n = int(input())
maxv = -2 * 10 ** 9
minv = 2 * 10 ** 9
for i in range(n):
v = int(input())
maxv = max(maxv, v - minv)
minv = min(minv, v)
print(maxv) | [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 63 | 2 |
n = int(input())
num_list = [int(input()) for i in range(n)]
minv = num_list[0]
maxv = -1000000000
for i in range(1, n - 1):
tmp = num_list[i] - minv
maxv = tmp if tmp > maxv else maxv
minv = num_list[i] if minv > num_list[i] else minv
print(maxv) | n = int(input())
num_list = [int(input()) for i in range(n)]
minv = num_list[0]
maxv = -1000000000
for i in range(1, n):
tmp = num_list[i] - minv
maxv = tmp if tmp > maxv else maxv
minv = num_list[i] if minv > num_list[i] else minv
# print "i = %d, tmp = %d, maxv = %d, minv = %d" % (i, tmp, maxv, minv)
print... | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 83 | 2 |
import sys
x = []
for line in sys.stdin.readlines():
x.append(line.strip())
max = -(10**9)
min = int(x[1])
for i in range(2, int(x[0])):
sa = int(x[i]) - min
if max < sa:
max = sa
if min > int(x[i]):
min = int(x[i])
print(max) | import sys
x = []
for line in sys.stdin.readlines():
x.append(line.strip())
max = -(10**9)
min = int(x[1])
for i in range(2, int(x[0])+1):
sa = int(x[i]) - min
if max < sa:
max = sa
if min > int(x[i]):
min = int(x[i])
print(max) | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 103 | 2 |
num = input()
num_list = []
for i in range(int(num)):
a = input()
num_list.append(int(a))
# print num_list
maxv = 0
minv = num_list[0]
for i in range(1, len(num_list)):
maxv = max(maxv, num_list[i] - minv)
minv = min(minv, num_list[i])
print(maxv) | num = input()
num_list = []
for i in range(int(num)):
a = input()
num_list.append(int(a))
maxv = -10000000000000
minv = num_list[0]
for i in range(1, len(num_list)):
maxv = max(maxv, num_list[i] - minv)
minv = min(minv, num_list[i])
print(maxv) | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 17, 33], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612]] | 5 | 85 | 7 |
num = input()
num_list = []
for i in range(int(num)):
a = input()
num_list.append(int(a))
# print num_list
maxv = 0
minv = num_list[0]
for i in range(1, len(num_list)):
maxv = max(maxv, num_list[i] - minv)
minv = min(minv, num_list[i])
print(maxv) | num = input()
num_list = []
for i in range(int(num)):
a = input()
num_list.append(int(a))
maxv = float("-inf")
minv = num_list[0]
for i in range(1, len(num_list)):
maxv = max(maxv, num_list[i] - minv)
minv = min(minv, num_list[i])
print(maxv) | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 0, 662, 12, 652, 3, 4, 0, 557, 0, 654], ["+", 0, 662, 12, 652, 3, 4, 0, 557, 0, 6], ["+", 0, 662, 12, 652, 3, 4, 0, 557, 0, 655], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 85 | 7 |
N = int(input())
R = [int(input()) for i in list(range(N))]
maxv = -1000000000
minr = R[0]
for i in list(range(N)):
maxv = max(maxv, R[i] - minr)
minr = min(minr, R[i])
print(maxv) | N = int(input())
R = [int(input()) for i in list(range(N))]
maxv = -1000000000
minr = R[0]
for i in list(range(1, N)):
maxv = max(maxv, R[i] - minr)
minr = min(minr, R[i])
print(maxv) | [["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 612], ["+", 12, 652, 3, 4, 0, 652, 3, 4, 0, 21]] | 5 | 77 | 2 |
N = int(input())
A = [int(input()) for i in range(N)]
max_v = A[1] - A[0]
l = 0
r = 1
while r + 1 < N:
if A[l] > A[r]:
l = r
elif A[r] > A[r + 1]:
max_v = max(max_v, A[r] - A[l])
if A[l] > A[r + 1]:
l = r + 1
r = l
r += 1
max_v = max(max_v, A[r] - A[l])
print... | N = int(input())
A = [int(input()) for i in range(N)]
max_v = A[1] - A[0]
l = 0
r = 1
while r + 1 < N:
if A[l] > A[r]:
l = r
elif A[r] > A[r + 1]:
max_v = max(max_v, A[r] - A[l])
if A[l] > A[r + 1]:
l = r + 1
r = l
r += 1
if r<N:
max_v = max(max_v, A[r] -... | [["+", 36, 36, 36, 36, 0, 656, 0, 57, 0, 121], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 0, 22], ["+", 36, 36, 0, 656, 0, 57, 15, 666, 667, 18], ["+", 36, 36, 36, 36, 0, 656, 0, 57, 0, 102]] | 5 | 136 | 5 |
N = int(input())
input_line = []
for i in range(N):
input_line.append(int(input()))
print(input_line)
maxv = input_line[1] - input_line[0]
minv = input_line[0]
for j in range(1, N):
maxv = max(maxv, input_line[j] - minv)
minv = min(minv, input_line[j])
print(maxv) | N = int(input())
input_line = []
for i in range(N):
input_line.append(int(input()))
maxv = input_line[1] - input_line[0]
minv = input_line[0]
for j in range(1, N):
maxv = max(maxv, input_line[j] - minv)
minv = min(minv, input_line[j])
print(maxv) | [["-", 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 | 90 | 4 |
n = int(input())
R = [0 for i in range(n)]
ans = 1 - 10**9
for i in range(n):
R[i] = int(input())
if i == 0:
min_R = R[0]
continue
if min_R < R[i]:
if ans < R[i]-min_R:
ans = R[i] - min_R
elif min_R > R[i]:
if ans < R[i]-min_R:
ans = R[i] - min_R... | n = int(input())
R = [0 for i in range(n)]
ans = 1 - 10**9
for i in range(n):
R[i] = int(input())
if i == 0:
min_R = R[0]
continue
if min_R < R[i]:
if ans < R[i]-min_R:
ans = R[i] - min_R
elif min_R > R[i]:
if ans < R[i]-min_R:
ans = R[i] - min_R... | [["+", 0, 57, 75, 76, 8, 196, 0, 57, 0, 121], ["+", 75, 76, 8, 196, 0, 57, 15, 666, 667, 18], ["+", 75, 76, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 0, 57, 75, 76, 8, 196, 0, 57, 0, 102], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22]] | 5 | 125 | 5 |
n = input()
n = int(n)
minv = input()
minv = iny(minv)
maxv = -1000000000
for j in range(n-1):
num = input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print(maxv) | n = input()
n = int(n)
minv = input()
minv = int(minv)
maxv = -1000000000
for j in range(n-1):
num = input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print(maxv) | [["-", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 652, 63, 22]] | 5 | 72 | 2 |
n = int(input())
minv = int(input())
maxv = -1*10**9
for j in range(n-1):
nums = int(input())
diff = nums - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = nums
print(maxv) | n = int(input())
minv = int(input())
maxv = -1*10**9
for j in range(n-1):
nums = int(input())
diff = nums - minv
if maxv < diff:
maxv = diff
if nums < minv:
minv = nums
print(maxv) | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22]] | 5 | 67 | 2 |
n = int(input())
max = -10^9
x1 = eval(input())
min = x1
for i in range(n-1):
x = int(input())
if max < x-min:
max = x- min
if x< min:
min = x
print(max) | n = int(input())
max = -10**9
x1 = eval(input())
min = x1
for i in range(n-1):
x = int(input())
if max < x-min:
max = x- min
if x< min:
min = x
print(max) | [["-", 0, 656, 0, 1, 0, 662, 12, 657, 17, 140], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 17, 578]] | 5 | 67 | 2 |
n = int(input())
a = []
a.append(int(input()))
Min = a[0]
Max = -1*10**9
for j in range(1,n):
a.append(int(input()))
Max = max(Max,R[j]-Min)
Min = min(Min,R[j])
print(Max) | n = int(input())
a = []
a.append(int(input()))
Min = a[0]
Max = -1*10**9
for j in range(1,n):
a.append(int(input()))
Max = max(Max,a[j]-Min)
Min = min(Min,a[j])
print(Max) | [["-", 12, 652, 3, 4, 0, 657, 31, 206, 51, 22], ["+", 12, 652, 3, 4, 0, 657, 31, 206, 51, 22], ["-", 0, 662, 12, 652, 3, 4, 0, 206, 51, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 206, 51, 22]] | 5 | 86 | 4 |
n = eval(input())
R = [0 for i in range(n)]
for i in range(n):
R[i] = eval(input())
maxv = -200000
minv = R[0]
for j in range(n):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print(maxv) | n = eval(input())
R = [0 for i in range(n)]
for i in range(n):
R[i] = eval(input())
maxv = -2000000000
minv = R[0]
for j in range(1, n):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print(maxv) | [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 85 | 4 |
n = eval(input())
m = [0] * n
max_rieki = -100000000
for i in range(n):
m[i] = eval(input())
min_rieki = m[0]
for i in range(1,n):
if max_rieki < m[i] - min_rieki:
max_rieki = m[i] - min_rieki
if min_rieki > m[i]:
min_rieki = m[i]
print(max_rieki) | n = eval(input())
m = [0] * n
max_rieki = -1000000000
for i in range(n):
m[i] = eval(input())
min_rieki = m[0]
for i in range(1,n):
if max_rieki < m[i] - min_rieki:
max_rieki = m[i] - min_rieki
if min_rieki > m[i]:
min_rieki = m[i]
print(max_rieki) | [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612]] | 5 | 90 | 2 |
n = eval(input())
R = [eval(input()) for i in range(0,n-1)]
max = R[1] - R[0]
min = R[0]
for i in range(1,n-1):
if R[i] - min > max:
max = R[i] - min
if R[i] < min:
min = R[i]
print(max) | n = eval(input())
R = [eval(input()) for i in range(n)]
max = R[1] - R[0]
min = R[0]
for i in range(1,n):
if R[i] - min > max:
max = R[i] - min
if R[i] < min:
min = R[i]
print(max) | [["-", 12, 658, 0, 659, 12, 652, 3, 4, 0, 612], ["-", 12, 658, 0, 659, 12, 652, 3, 4, 0, 21], ["-", 0, 659, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 659, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 94 | 6 |
def main():
N = eval(input())
a = [eval(input()) for y in range(N)]
a_max = -10**9
a_min = a[1]
for j in range(2,len(a)-1):
if a[j] - a_min > a_max:
a_max = a[j] - a_min
if a[j] < a_min:
a_min = a[j]
print(a_max)
main() | def main():
N = eval(input())
a = [eval(input()) for y in range(N)]
a_max = -10**9
a_min = a[0]
for j in range(1,len(a)):
if a[j] - a_min > a_max:
a_max = a[j] - a_min
if a[j] < a_min:
a_min = a[j]
print(a_max)
main() | [["-", 8, 196, 0, 1, 0, 662, 12, 206, 206, 612], ["+", 8, 196, 0, 1, 0, 662, 12, 206, 206, 612], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 96 | 6 |
#coding: UTF-8
N = int(input())
a = [int(input()) for i in range(N)]
ans = set()
maxv = -9999999999
minv = a[0]
for i in range(1,N-1):
if (a[i] - minv) > maxv:
maxv = a[i] - minv
if a[i] < minv:
minv = a[i]
print(maxv) | #coding: UTF-8
N = int(input())
a = [int(input()) for i in range(N)]
ans = set()
maxv = -9999999999
minv = a[0]
for i in range(1,N):
if (a[i] - minv) > maxv:
maxv = a[i] - minv
if a[i] < minv:
minv = a[i]
print(maxv) | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 91 | 2 |
n = eval(input())
R = [eval(input()) for i in range(n)]
Rmin = n
maxdif = R[1] - R[0]
while Rmin > 0:
tRmin = R.index(min(R[0:Rmin]))
Rmax = R.index(max(R[tRmin:Rmin]))
if tRmin == Rmax:
if tRmin == n:
tRmin-=1
elif tRmin < n:
Rmax = tRmin + 1
Rmin = tRmin
i... | n = eval(input())
R = [eval(input()) for i in range(n)]
Rmin = n
maxdif = R[1] - R[0]
while Rmin > 0:
tRmin = R.index(min(R[0:Rmin]))
Rmax = R.index(max(R[tRmin:Rmin]))
if tRmin == Rmax:
if tRmin == n-1:
tRmin-=1
elif tRmin < n-1:
Rmax = tRmin + 1
Rmin = tRmin
... | [["+", 64, 196, 0, 57, 15, 666, 0, 657, 17, 33], ["+", 64, 196, 0, 57, 15, 666, 0, 657, 12, 612], ["+", 0, 57, 75, 665, 15, 666, 0, 657, 17, 33], ["+", 0, 57, 75, 665, 15, 666, 0, 657, 12, 612]] | 5 | 132 | 4 |
n = int(input())
values = [int(input()) for i in range(n)]
maxv = -99999999
minimum = values[0]
for i in range(1, N):
if values[i] - minimum > maxv:
maxv = values[i] - minimum
if values[i] < minimum:
minimum = values[i]
print(maxv) | n = int(input())
values = [int(input()) for i in range(n)]
maxv = -999999999
minimum = values[0]
for i in range(1, n):
if values[i] - minimum > maxv:
maxv = values[i] - minimum
if values[i] < minimum:
minimum = values[i]
print(maxv) | [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22]] | 5 | 81 | 4 |
def getsub(arr):
minv = arr[0]
maxdist = arr[1] - minv
for v in arr[2:]:
# update maxdist
# tmpmaxdist = v - minv
# if tmpmaxdist > maxdist:
# maxdist = tmpmaxdist
maxdist = max(maxdist, v- minv)
# update minv
# if v < minv:
# minv = ... | def getsub(arr):
minv = arr[0]
maxdist = arr[1] - minv
for v in arr[1:]:
# update maxdist
maxdist = max(maxdist, v- minv)
# update minv
minv = min(minv, v)
return maxdist
def main():
# get input
N = int(input())
arr = [int(input()) for i in range(N)]
... | [["-", 8, 196, 0, 7, 12, 206, 206, 663, 0, 612], ["+", 8, 196, 0, 7, 12, 206, 206, 663, 0, 612]] | 5 | 105 | 2 |
n = int(input())
nums = [int(input()) for i in range(n)]
temp = nums[1] - nums[0]
p = nums[0]
for i in nums[1:]:
if i - p > temp:
ans = i- p
if i < p:
p = i
print(ans) | n = int(input())
nums = [int(input()) for i in range(n)]
temp = nums[1] - nums[0]
p = nums[0]
for i in nums[1:]:
if i - p > temp:
temp = i- p
if i < p:
p = i
print(temp) | [["-", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 75 | 4 |
# -*- coding : utf-8 -*-
def maximum_profit(price_list):
max = price_list[1] - price_list[0]
min = price_list[0]
for i in range(len(price_list)):
if max < price_list[i] - min:
max = price_list[i] - min
if min > price_list[i]:
min = price_list[i]
return max
input... | # -*- coding : utf-8 -*-
def maximum_profit(price_list):
max = price_list[1] - price_list[0]
min = price_list[0]
for i in range(1, len(price_list)):
if max < price_list[i] - min:
max = price_list[i] - min
if min > price_list[i]:
min = price_list[i]
return max
in... | [["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 111 | 2 |
m = int(input())
n = [int(input())for i in range(m)]
minv = n[0]
maxv = -99999999999
for i in range(m):
maxv = max(maxv, (n[i]-minv))
minv = min(minv, n[i])
print(maxv) | m = int(input())
n = [int(input())for i in range(m)]
minv = n[0]
maxv = -99999999999
for i in range(1,m):
maxv = max(maxv, (n[i]-minv))
minv = min(minv, n[i])
print(maxv) | [["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 73 | 2 |
N = eval(input())
R = [int(input()) for _ in range(N)]
S = [0 for i in range(N)]
S[N-1] = R[N-1]
for i in range(N-2, -1, -1):
S[i] = max(R[i], S[i+1])
ans = float('-inf')
for i in range(N-1):
ans = max(ans, S[i+1]-R[i]) | N = eval(input())
R = [int(input()) for _ in range(N)]
S = [0 for i in range(N)]
S[N-1] = R[N-1]
for i in range(N-2, -1, -1):
S[i] = max(R[i], S[i+1])
ans = float('-inf')
for i in range(N-1):
ans = max(ans, S[i+1]-R[i])
print(ans) | [["+", 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 | 121 | 4 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
6
5
3
1
3
4
3
output:
3
"""
import sys
def solve():
# write your code here
max_profit = -1
min_stock = prices[0]
for price in prices[1:]:
max_profit = max(max_profit, price - min_stock)
min_stock = min(min_stock, price)
re... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
6
5
3
1
3
4
3
output:
3
"""
import sys
def solve():
# write your code here
max_profit = -1 * float('inf')
min_stock = prices[0]
for price in prices[1:]:
max_profit = max(max_profit, price - min_stock)
min_stock = min(min_stock... | [["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 48], ["+", 0, 1, 0, 662, 12, 657, 12, 652, 63, 22], ["+", 0, 662, 12, 657, 12, 652, 3, 4, 0, 24], ["+", 12, 657, 12, 652, 3, 4, 0, 557, 0, 654], ["+", 12, 657, 12, 652, 3, 4, 0, 557, 0, 6], ["+", 12, 657, 12, 652, 3, 4, 0, 557, 0, 655], ["+", 0, 662, 12, 657, 12, 652, 3, 4, 0, ... | 5 | 98 | 7 |
import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
if maxv < r-minv < 0:
maxv = r-minv
minv = r
elif maxv < r-minv:
maxv = r-minv
elif m < 0:
minv = r
print(maxv) | import sys
n = int(input())
minv = int(input())
maxv = -1000000000
for r in map(int,sys.stdin.readlines()):
if maxv < r-minv < 0:
maxv = r-minv
minv = r
elif maxv < r-minv:
maxv = r-minv
elif r-minv < 0:
minv = r
print(maxv) | [["-", 8, 196, 0, 57, 75, 665, 15, 666, 0, 22], ["+", 0, 57, 75, 665, 15, 666, 0, 657, 31, 22], ["+", 0, 57, 75, 665, 15, 666, 0, 657, 17, 33], ["+", 0, 57, 75, 665, 15, 666, 0, 657, 12, 22]] | 5 | 79 | 4 |
N = int(input())
M = -1000000000
L = int(input())
for i in range(2,N):
C = int(input())
M = max(C - L, M)
L = min(C, L)
print(M) | N = int(input())
M = -1000000000
L = int(input())
for i in range(1,N):
C = int(input())
M = max(C - L, M)
L = min(C, L)
print(M) | [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 60 | 2 |
import sys
input()
a,b=-1e11,1e11
for i in map(int,sys.stdin.readlines()):
a=max(a,i-b)
b=min(i,b)
print(mar) | import sys
input()
a,b=-1e11,1e11
for i in map(int,sys.stdin.readlines()):
a=max(a,i-b)
b=min(i,b)
print(a) | [["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 51 | 2 |
n = int(input())
r = []
for i in range(n):
r.append(int(input()))
min_v = 1000000000
max_p = -1000000000
for i in range(1,n):
max_p = max(max_p,r[i]-min_v)
min_v = min(min_v,r[i])
print(max_p) | n = int(input())
r = []
for i in range(n):
r.append(int(input()))
min_v = r[0]
max_p = -1000000000
for i in range(1,n):
max_p = max(max_p,r[i]-min_v)
min_v = min(min_v,r[i])
print(max_p) | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 206, 51, 22], ["+", 0, 656, 0, 1, 0, 662, 12, 206, 0, 70], ["+", 0, 656, 0, 1, 0, 662, 12, 206, 206, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 206, 0, 73]] | 5 | 76 | 5 |
n = int(input())
R = []
for i in range(0,n):
R.insert(i, int(input()))
m = min(R[0:2])
MAX = R[1] - R[0]
for r in range(1, n):
if(R[r-1] < m):
m = R[r-1]
MAX2 = R[r] - m
if(MAX2 > MAX):
MAX = MAX2
print(MAX) | n = int(input())
R = []
for i in range(0,n):
R.insert(i, int(input()))
m = min(R[0:2])
MAX = R[1] - R[0]
for r in range(2, n):
if(R[r-1] < m):
m = R[r-1]
MAX2 = R[r] - m
if(MAX2 > MAX):
MAX = MAX2
print(MAX) | [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 109 | 2 |
# -*- coding: utf-8 -*-
num = int(input())
a = int(input())
b = int(input())
diff = b - a
pre_min = a
counter = 2
while counter < num:
current_num = int(input())
if diff < current_num - pre_min:
diff = current_num - pre_min
if pre_min > current_num:
pre_min = current_num
counter += 1
p... | # -*- coding: utf-8 -*-
num = int(input())
a = int(input())
b = int(input())
diff = b - a
pre_min = min(a,b)
counter = 2
while counter < num:
current_num = int(input())
if diff < current_num - pre_min:
diff = current_num - pre_min
if pre_min > current_num:
pre_min = current_num
counter ... | [["+", 0, 656, 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, 21], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25]] | 5 | 76 | 5 |
n = int(input())
R = [int(input()) for _ in range(n)]
minv, maxv = R[0], R[1]-R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j]-minv)
minv = min(minv, R[j])
print(maxv) | n = int(input())
R = [int(input()) for _ in range(n)]
minv, maxv = R[0], R[1]-R[0]
for j in range(1, n):
maxv = max(maxv, R[j]-minv)
minv = min(minv, R[j])
print(maxv) | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 83 | 2 |
# -*- coding: utf-8 -*-
if __name__ == '__main__':
n = eval(input())
R = []
for i in range(n):
R.append(eval(input()))
maxv = -20000000000
minv = R[0]
for i in range(n):
maxv = max(maxv, R[i] - minv)
minv = min(minv, R[i])
print(maxv) | # -*- coding: utf-8 -*-
if __name__ == '__main__':
n = eval(input())
R = []
for i in range(n):
R.append(eval(input()))
maxv = -20000000000
minv = R[0]
for i in range(1, n):
maxv = max(maxv, R[i] - minv)
minv = min(minv, R[i])
print(maxv) | [["+", 64, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 64, 196, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 85 | 2 |
times = int(input())
element = []
for i in range(times):
element.append(int(input()))
maxv = element[1]-element[0]
minv = element[0]
for j in range(1,len(element)-1):
maxv = max(element[j]-minv,maxv)
minv = min(minv,element[j])
print(maxv) | times = int(input())
element = []
for i in range(times):
element.append(int(input()))
maxv = element[1]-element[0]
minv = element[0]
for j in range(1,len(element)):
maxv = max(element[j]-minv,maxv)
minv = min(minv,element[j])
print(maxv) | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 91 | 2 |
n = int(input())
min = float('inf')
max_diff = -float('inf')
for _ in range(n-1):
i = int(input())
if max_diff < i - min:
max_diff = i - min
if i < min:
min = i
print(max_diff) | n = int(input())
min = float('inf')
max_diff = -float('inf')
for _ in range(n):
i = int(input())
if max_diff < i - min:
max_diff = i - min
if i < min:
min = i
print(max_diff) | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 67 | 2 |
import sys
def get_maximum_profit():
element_number = int(input())
v0 = int(input())
v1 = int(input())
min_v = min(v0, v1)
max_profit = v1-v0
for i in range(element_number-2):
v = int(input())
max_profit = max(max_profit, v-min_v)
min_v = min(min_v, v)
print(mi... | import sys
def get_maximum_profit():
element_number = int(input())
v0 = int(input())
v1 = int(input())
min_v = min(v0, v1)
max_profit = v1-v0
for i in range(element_number-2):
v = int(input())
max_profit = max(max_profit, v-min_v)
min_v = min(min_v, v)
print(max_p... | [["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21]] | 5 | 96 | 2 |
#ALDS1_1_D Maximum Profit
n=int(input())
A=[]
max_dif=-1*10**9
for i in range(n):
A.append(int(input()))
min=A[0]
for i in range(n-1):
if(A[i+1]-min>max_dif):
max_dif=A[i+1]
if(min>A[i+1]):
min=A[i+1]
print(max_dif) | #ALDS1_1_D Maximum Profit
n=int(input())
A=[]
max_dif=-1*10**9
for i in range(n):
A.append(int(input()))
min=A[0]
for i in range(n-1):
if(A[i+1]-min>max_dif):
max_dif=A[i+1]-min
if(min>A[i+1]):
min=A[i+1]
print(max_dif) | [["+", 64, 196, 0, 1, 0, 662, 12, 657, 17, 33], ["+", 64, 196, 0, 1, 0, 662, 12, 657, 12, 22]] | 5 | 102 | 2 |
#-*- coding:utf-8 -*-
def main():
n , data = input_data()
vMax = float('-inf')
vMin = data.pop()
for Rj in data:
if vMax < Rj - vMin:
vMax = Rj - vMin
if vMin > Rj:
vMin = Rj
print(vMax)
def input_data():
n = int(input())
lst = [int(input()) for i ... | #-*- coding:utf-8 -*-
def main():
n , data = input_data()
vMax = float('-inf')
vMin = data.pop(0)
for Rj in data:
if vMax < Rj - vMin:
vMax = Rj - vMin
if vMin > Rj:
vMin = Rj
print(vMax)
def input_data():
n = int(input())
lst = [int(input()) for i... | [["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 612]] | 5 | 103 | 1 |
n = int(input())
rt = [input() for i in range(n)]
minv = int(rt[0])
maxv = int(rt[1]) - int(rt[0])
for j in range(n):
maxv = max(maxv,int(rt[j]) - minv)
minv = min(minv,int(rt[j]))
print(maxv) | n = int(input())
rt = [input() for i in range(n)]
minv = int(rt[0])
maxv = int(rt[1]) - int(rt[0])
for j in range(1,n):
maxv = max(maxv,int(rt[j]) - minv)
minv = min(minv,int(rt[j]))
print(maxv) | [["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 90 | 2 |
def main():
n = int(input())
nums = []
for i in range(n):
nums.append(int(input()))
r = max(nums[1:]) - nums[0]
for i in range(1, n-1):
ri = nums[i]
if ri == rj:
rj = max(nums[i+1:])
r = max(r, rj-ri)
print(r)
if __name__ == '__main__':
main... | def main():
n = int(input())
nums = []
for i in range(n):
nums.append(int(input()))
rj = max(nums[1:])
r = rj - nums[0]
for i in range(1, n-1):
ri = nums[i]
if ri == rj:
rj = max(nums[i+1:])
r = max(r, rj-ri)
print(r)
if __name__ == '__main... | [["-", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["+", 8, 196, 0, 1, 0, 662, 12, 657, 31, 22]] | 5 | 110 | 5 |
N = int(input())
R = [int(input(i)) for i in range(N)]
# ?????§??????
maxv = -20000000000
# ????°????
minv = R[0]
for i in range(1, N):
# maxv ??¨ r - minv ???????????§?????????
maxv = max(R[i] - minv, maxv)
# minv ??¨ r ??????????°??????????
minv = min(R[i], minv)
print(maxv) | N = int(input())
R = [int(input()) for i in range(N)]
maxv = -20000000000
minv = R[0]
for i in range(1, N):
maxv = max(R[i] - minv, maxv)
minv = min(R[i], minv)
print(maxv) | [["-", 8, 652, 3, 4, 0, 652, 3, 4, 0, 22]] | 5 | 78 | 1 |
num=int(input())
r_1=int(input())
r_2=int(input())
max_profit=r_2 - r_1
if r_1<r_2:
min_value=r_1
else:
min_value=r_2
for i in range(n-2):
x=int(input())
t=x - min_value
if max_profit<t:
max_profit=t
if x<min_value:
min_value=x
print(max_profit) | num=int(input())
r_1=int(input())
r_2=int(input())
max_profit=r_2-r_1
if r_1<r_2:
min_value=r_1
else:
min_value=r_2
for i in range(2,num):
x=int(input())
t=x-min_value
if max_profit<t:
max_profit=t
if x<min_value:
min_value=x
print(max_profit) | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 22]] | 5 | 85 | 4 |
n=int(input())
num=[int(input()) for i in range(n)]
maxv=num[1]-num[2]
minv=num[0]
for j,n in enumerate(num[1:]):
maxv=max(maxv,n-minv)
minv=min(minv,num[j+1])
print(maxv) | n=int(input())
num=[int(input()) for i in range(n)]
maxv=num[1]-num[0]
minv=num[0]
for j,n in enumerate(num[1:]):
maxv=max(maxv,n-minv)
minv=min(minv,num[j+1])
print(maxv) | [["-", 0, 1, 0, 662, 12, 657, 12, 206, 206, 612], ["+", 0, 1, 0, 662, 12, 657, 12, 206, 206, 612]] | 5 | 83 | 2 |
i = 0
n = int(input())
maxR = -10**9
minR = int(input())
while i < n:
R = int(input())
maxR = max(maxR, R-minR)
minR = min(minR, R)
i += 1
print(maxR) | i = 1
n = int(input())
maxR = -10**9
minR = int(input())
while i < n:
R = int(input())
maxR = max(maxR, R-minR)
minR = min(minR, R)
i += 1
print(maxR) | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612]] | 5 | 63 | 2 |
n = int(input())
a = int(input())
Max = -9999999
Min = a
for i in range(n):
x = int(input())
if (Max < x - Min):
Max = x - Min
if (x < Min):
Min = x
print(Max) | n = int(input())
a = int(input())
Max = -10 ** 9
Min = a
for i in range(n-1):
x = int(input())
if (Max < x - Min):
Max = x - Min
if (x < Min):
Min = x
print(Max) | [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 31, 612], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 17, 578], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 12, 612], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 67 | 6 |
n = int(input())
max = -1000000000
min = int(input())
for i in range(1, n):
r = int(input())
if max < (r - min):
max = r - min
if min > r:
max = r
print(max) | n = int(input())
max = -1000000000
min = int(input())
for i in range(1, n):
r = int(input())
if max < (r - min):
max = r - min
if min > r:
min = r
print(max) | [["-", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 31, 22]] | 5 | 64 | 2 |
n = int(input())
min_n = -2 * 10**9
max_n = -2 * 10**9
for i in range(n):
x = int(input())
max_n = max(max_n,x - min_n)
min_n = min(x,min_n)
print (max_n) | n = int(input())
min_n = 2 * 10**9
max_n = -2 * 10**9
for i in range(n):
x = int(input())
max_n = max(max_n,x - min_n)
min_n = min(x,min_n)
print (max_n) | [["-", 0, 1, 0, 662, 12, 657, 31, 664, 17, 33]] | 5 | 62 | 1 |
import sys
n = int(input())
r0 = int(input())
r1 = int(input())
mx = r1 - r0
mn = min(r1, r0)
for i in map(int, sys.stdin.readlines()):
if mx < i - mn:
mx = i - mn
if 0 > i - mn:
mn = i
elif mn > i:
mn = 1
print(mx) | import sys
n = int(input())
r0 = int(input())
r1 = int(input())
mx = r1 - r0
mn = min(r1, r0)
for i in map(int, sys.stdin.readlines()):
if mx < i - mn:
mx = i - mn
if 0 > i - mn:
mn = i
elif mn > i:
mn = i
print(mx) | [["-", 75, 665, 64, 196, 0, 1, 0, 662, 12, 612], ["+", 75, 665, 64, 196, 0, 1, 0, 662, 12, 22]] | 5 | 89 | 2 |
import sys
n = int(input())
mx = -2000000000
mn = int(input())
for i in map(int, sys.stdin.readlines()):
mx = max(mx, mn - i)
mn = min(mn, i)
print(mx) | import sys
n = int(input())
mx = -2000000000
mn = int(input())
for i in map(int, sys.stdin.readlines()):
mx = max(mx, i - mn)
mn = min(mn, i)
print(mx) | [["-", 0, 662, 12, 652, 3, 4, 0, 657, 31, 22], ["-", 0, 662, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 17, 33], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 12, 22]] | 5 | 60 | 4 |
# -*- coding: utf-8 -*-
def maximum_profit_1(n, R):
maxv = R[1] - R[0]
for j in range(1, n):
for i in range(j):
maxv = max(maxv, R[j]-R[i])
return maxv
def maximum_profit_2(n, R):
minv = R[0]
maxv = R[1]
for j in range(1, n):
maxv = max(maxv, R[j]-minv)
min... | # -*- coding: utf-8 -*-
def maximum_profit_1(n, R):
maxv = R[1] - R[0]
for j in range(1, n):
for i in range(j):
maxv = max(maxv, R[j]-R[i])
return maxv
def maximum_profit_2(n, R):
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n):
maxv = max(maxv, R[j]-minv)
... | [["+", 8, 196, 0, 1, 0, 662, 12, 657, 17, 33], ["+", 0, 1, 0, 662, 12, 657, 12, 206, 51, 22], ["+", 0, 1, 0, 662, 12, 657, 12, 206, 0, 70], ["+", 0, 1, 0, 662, 12, 657, 12, 206, 206, 612], ["+", 0, 1, 0, 662, 12, 657, 12, 206, 0, 73]] | 5 | 156 | 5 |
n = int(input())
nums = []
for v in range(n):
num = int(input())
nums.append(num)
ma = -10000
mi = nums[0]
for p in range(1,len(nums)):
a = nums[p]
if a > a-mi:
ma = a-mi
if a < mi:
mi = a
print(ma)
| n = int(input())
nums = []
for v in range(n):
num = int(input())
nums.append(num)
ma = -1000000000
mi = nums[0]
for p in range(1,len(nums)):
a = nums[p]
if a-mi > ma:
ma = a-mi
if a < mi:
mi = a
print(ma)
| [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["-", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22], ["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 0, 22]] | 5 | 87 | 6 |
import sys
numbers = []
for line in sys.stdin:
numbers.append(int(line))
answer = numbers[2] - numbers[1]
tmp_min = numbers[1]
for target in range(1, len(numbers)):
answer = max(numbers[target] - tmp_min ,answer)
tmp_min = min(numbers[target] , tmp_min)
print(answer)
| import sys
numbers = []
for line in sys.stdin:
numbers.append(int(line))
answer = numbers[2] - numbers[1]
tmp_min = numbers[1]
for target in range(2, len(numbers)):
answer = max(numbers[target] - tmp_min ,answer)
tmp_min = min(numbers[target] , tmp_min)
print(answer)
| [["-", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 80 | 2 |
init = None
diff = None
for p in range(int(input())):
v = int(input())
if init is None:
init = v
continue
if diff is None:
diff = v - init
continue
if v - init > diff:
diff = v - init
if init > v:
init = v
print(diff)
| init = None
diff = None
for p in range(int(input())):
v = int(input())
if init is None:
init = v
continue
if diff is None:
diff = v - init
if v - init > diff:
diff = v - init
if init > v:
init = v
print(diff)
| [["-", 8, 196, 0, 57, 64, 196, 0, 116, 0, 117]] | 5 | 71 | 1 |
N = int(input())
datas = [int(input()) for _ in range(N)]
now_max = max(datas[1:])
max_index = datas[::-1].index(now_max)
_min = min(datas)
min_index = datas.index(_min)
if max_index > min_index:
diff = now_max - _min
else:
diff = now_max - datas[0]
for i in range(1,N-1):
if i == max_index:
... | N = int(input())
datas = [int(input()) for _ in range(N)]
now_max = max(datas[1:])
max_index = (N-1) - datas[::-1].index(now_max)
_min = min(datas)
min_index = datas.index(_min)
if max_index > min_index:
diff = now_max - _min
else:
diff = now_max - datas[0]
for i in range(1,N-1):
if i == max_i... | [["+", 0, 1, 0, 662, 12, 657, 31, 23, 0, 24], ["+", 0, 662, 12, 657, 31, 23, 0, 657, 31, 22], ["+", 0, 662, 12, 657, 31, 23, 0, 657, 17, 33], ["+", 0, 662, 12, 657, 31, 23, 0, 657, 12, 612], ["+", 0, 1, 0, 662, 12, 657, 31, 23, 0, 25], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 17, 33]] | 5 | 144 | 6 |
from sys import stdin
N,*datas = [int(i) for i in stdin.readlines()]
now_max = max(datas[1:])
max_index = (N-1) - datas[::-1].index(now_max)
now_min = min(datas)
min_index = datas.index(_min)
if max_index > min_index:
diff = now_max - _min
else:
diff = now_max - datas[0]
for i in range(1,N-1):
... | from sys import stdin
N,*datas = [int(i) for i in stdin.readlines()]
now_max = max(datas[1:])
max_index = (N-1) - datas[::-1].index(now_max)
_min = min(datas)
min_index = datas.index(_min)
if max_index > min_index:
diff = now_max - _min
else:
diff = now_max - datas[0]
for i in range(1,N-1):
i... | [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22]] | 5 | 148 | 2 |
n = int(input())
min_r, max_d = int(input()), - 10**9
for _ in range(n - 1):
r = int(input())
max_d = max(max_d, r - min)
min_r = min(min_r, r)
print(max_d)
| n = int(input())
min_r, max_d = int(input()), - 10**9
for _ in range(n - 1):
r = int(input())
max_d = max(max_d, r - min_r)
min_r = min(min_r, r)
print(max_d)
| [["-", 0, 662, 12, 652, 3, 4, 0, 657, 12, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 657, 12, 22]] | 5 | 63 | 2 |
row_num = int(input())
nums = []
for row in range(row_num):
nums.append(int(input()))
min_diff = nums[0]
max_diff = nums[1] - nums[0]
for i in range(len(nums)):
if max_diff < nums[i] - min_diff:
max_diff = nums[i] - min_diff
if min_diff > nums[i]:
min_diff = nums[i]
print(max_diff)
| row_num = int(input())
nums = []
for row in range(row_num):
nums.append(int(input()))
min_diff = nums[0]
max_diff = nums[1] - nums[0]
for i in range(1, len(nums)):
if max_diff < nums[i] - min_diff:
max_diff = nums[i] - min_diff
if min_diff > nums[i]:
min_diff = nums[i]
print(max_diff)
| [["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 0, 656, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 95 | 2 |
import sys
length = int(sys.stdin.readline())
value =[ int(num) for num in sys.stdin.readlines() ]
minv = value[0]
maxv = value[1] - value[0]
for i in range(1,length):
maxv = max(maxv,value[i] - minv)
minv = min(minv,value[i])
print(maxv)
return 0
| import sys
length = int(sys.stdin.readline())
value =[ int(num) for num in sys.stdin.readlines() ]
minv = value[0]
maxv = value[1] - value[0]
for i in range(1,length):
maxv = max(maxv,value[i] - minv)
minv = min(minv,value[i])
print(maxv)
| [["-", 36, 36, 36, 36, 0, 656, 0, 37, 0, 38], ["-", 36, 36, 36, 36, 0, 656, 0, 37, 0, 612]] | 5 | 89 | 2 |
n = int(input())
maxv = -2000000000
minv = int(intput())
for i in range(1, n):
cur = int(input())
maxv = max([maxv, cur - minv])
minv = min([minv, cur])
print(maxv)
| n = int(input())
maxv = -2000000000
minv = int(input())
for i in range(1, n):
cur = int(input())
maxv = max([maxv, cur - minv])
minv = min([minv, cur])
print(maxv)
| [["-", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22]] | 5 | 64 | 2 |
n = int(input())
maxv = 10**18
minv = 10**18
for i in range(n):
r= int(input())
maxv = max(maxv, r - minv)
minv = min(minv, r)
print(maxv)
| n = int(input())
maxv = -10**18
minv = 10**18
for i in range(n):
r= int(input())
maxv = max(maxv, r - minv)
minv = min(minv, r)
print(maxv)
| [["+", 0, 656, 0, 1, 0, 662, 12, 664, 17, 33]] | 5 | 56 | 1 |
N = int(input())
a = []
for i in range(N):
a.append(int(input()))
maxv = -10e10
minv = a[0]
for i in range(1, N-1):
maxv = a[i] - minv if maxv < a[i] - minv else maxv
minv = a[i] if minv > a[i] else minv
print(maxv)
| N = int(input())
a = []
for i in range(N):
a.append(int(input()))
maxv = -10e10
minv = a[0]
for i in range(1, N):
maxv = a[i] - minv if maxv < a[i] - minv else maxv
minv = a[i] if minv > a[i] else minv
print(maxv)
| [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 91 | 2 |
n=int(input())
Rt=[0 for i in range(n)]
for i in range(n):
Rt[i]=int(input())
maxv=0
minv=Rt[0]
for j in range(1,n):
maxv=max(maxv,Rt[j]-minv)
minv=min(minv,Rt[j])
print(maxv)
| n=int(input())
Rt=[0 for i in range(n)]
for i in range(n):
Rt[i]=int(input())
maxv=-100000000000000
minv=Rt[0]
for j in range(1,n):
maxv=max(maxv,Rt[j]-minv)
minv=min(minv,Rt[j])
print(maxv)
| [["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 17, 33], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612]] | 5 | 86 | 3 |
#16D8101012J 伊藤惇 dj Python3
def Maximum_Profit(n,A):
Max=A[1]-A[0]
Min=A[0]
for j in range(1,n-1):
Max=max(Max,A[j]-Min)
Min=min(Min,A[j])
return Max
if __name__ == "__main__":
n=int(input())
A=[]
for i in range(n):
A.append(int(input()))
Max=Maximum_Profit(n,A)... | #16D8101012J 伊藤惇 dj Python3
def Maximum_Profit(n,A):
Max=A[1]-A[0]
Min=A[0]
for j in range(1,n):
Max=max(Max,A[j]-Min)
Min=min(Min,A[j])
return Max
if __name__ == "__main__":
n=int(input())
A=[]
for i in range(n):
A.append(int(input()))
Max=Maximum_Profit(n,A)
... | [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 114 | 2 |
n = int(input())
A = [int(input()) for i in range(n)]
max = A[1]-A[0]
min = A[0]
for i in range(1,n-1):
if(max < A[i]-min):
max = A[i]-min
if(min > A[i]):
min = A[i]
print(max)
| n = int(input())
A = [int(input()) for i in range(n)]
max = A[1]-A[0]
min = A[0]
for i in range(1,n):
if(max < A[i]-min):
max = A[i]-min
if(min > A[i]):
min = A[i]
print(max)
| [["-", 0, 7, 12, 652, 3, 4, 0, 657, 17, 33], ["-", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 94 | 2 |
n=int(input())
maxn=-1
minn=int(input())
for j in range(1, n):
r = int(input())
maxn = max(maxn, r - minn)
minn = min(minn, r)
print(maxn)
| n=int(input())
maxn=-10**12
minn=int(input())
for j in range(1, n):
r = int(input())
maxn = max(maxn, r - minn)
minn = min(minn, r)
print(maxn)
| [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 31, 612], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 17, 578], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 12, 612]] | 5 | 60 | 4 |
if __name__ == "__main__":
n = int(input())
r0 = int(input())
r1 = int(input())
minv = r0 if r0 <= r1 else r1
maxv = r1 - r0
for i in range(2, n):
r = int(input())
maxv = max(maxv, (r-minv))
minv = min(minv, r)
print(100)
|
if __name__ == "__main__":
n = int(input())
r0 = int(input())
r1 = int(input())
minv = r0 if r0 <= r1 else r1
maxv = r1 - r0
for i in range(2, n):
r = int(input())
maxv = max(maxv, (r-minv))
minv = min(minv, r)
print(maxv)
| [["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 612], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 87 | 2 |
n = int(input())
a = [int(input()) for i in range(n)]
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n):
if (maxv < R[j] - minv):
maxv = R[j] - minv
if (R[j] < minv):
minv = R[j]
print(maxv)
| n = int(input())
R = [int(input()) for i in range(n)]
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n):
if (maxv < R[j] - minv):
maxv = R[j] - minv
if (R[j] < minv):
minv = R[j]
print(maxv)
| [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22]] | 5 | 92 | 2 |
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
mini = a[0]
b = -100000
del a[0]
for i in a:
if b < i - mini:
b = i - mini
if mini > i:
mini = i
print(mini,b)
| n = int(input())
a = []
for i in range(n):
a.append(int(input()))
mini = a[0]
b = -10000000000
del a[0]
for i in a:
if b < i - mini:
b = i - mini
if mini > i:
mini = i
print(b)
| [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21]] | 5 | 77 | 4 |
n = int(input())
min_rate = 10**9
max_prof = -1
for i in range(n):
rate = int(input())
prof = rate - min_rate
if prof > max_prof:
max_prof = prof
if min_rate > rate:
min_rate = rate
print(max_prof)
| n = int(input())
min_rate = 10**15
max_prof = -10**15
for i in range(n):
rate = int(input())
prof = rate - min_rate
if prof > max_prof:
max_prof = prof
if min_rate > rate:
min_rate = rate
print(max_prof)
| [["-", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 657, 12, 612], ["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 31, 612], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 17, 578], ["+", 0, 1, 0, 662, 12, 664, 28, 657, 12, 612]] | 5 | 58 | 6 |
import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
maxv = -100000000
minv = a[0]
for i in range(len(a)):
maxv = max(sub,b[i]-minv)
minv = min(minv,b[i])
print(sub)
| import sys
a = []
b = []
for line in sys.stdin:
a.append(int(line))
b.append(int(line))
del a[0]
del a[len(a)-1]
del b[0]
del b[0]
maxv = -1000000000
minv = a[0]
for i in range(len(a)):
maxv = max(maxv,b[i]-minv)
minv = min(minv,b[i])
print(maxv)
| [["-", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["+", 0, 656, 0, 1, 0, 662, 12, 664, 28, 612], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["+", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["+", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22]] | 5 | 109 | 6 |
import math
n = int(input())
tmp = int(input())
tmpmin = tmp
t1 = int(input())
if t1 < tmp: tmpmin = t1
tmpmax = t1 - tmp
ans = 0
for i in range(2,n):
tmp = int(input())
if tmp - tmpmin > ans: ans = tmp - tmpmin
if tmp < tmpmin: tmpmin = tmp
print(int(ans))
| import math
n = int(input())
tmp = int(input())
tmpmin = tmp
t1 = int(input())
if t1 < tmp: tmpmin = t1
ans = t1 - tmp
for i in range(2,n):
tmp = int(input())
if tmp - tmpmin > ans: ans = tmp - tmpmin
if tmp < tmpmin: tmpmin = tmp
print(int(ans))
| [["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 0, 32], ["-", 36, 36, 0, 656, 0, 1, 0, 662, 12, 612]] | 5 | 90 | 5 |
n=eval(input())
l=[eval(input()) for _ in range(n)]
chk,ans=l[0],0
for i in range(1,n):
chk=min(chk,l[i-1])
if l[i]-chk>ans:
ans=l[i]-chk
print(ans) | n=eval(input())
l=[eval(input()) for _ in range(n)]
chk,ans=l[0],-1000000000
for i in range(1,n):
chk=min(chk,l[i-1])
if l[i]-chk>ans:
ans=l[i]-chk
print(ans) | [["-", 0, 656, 0, 1, 0, 662, 12, 432, 0, 612], ["+", 0, 1, 0, 662, 12, 432, 0, 664, 17, 33], ["+", 0, 1, 0, 662, 12, 432, 0, 664, 28, 612]] | 5 | 80 | 3 |
# get input
n=gets.to_i
target=[]
n.times do
target << gets.to_i
end
# insertion sort method
def insertion_sort a, n, g
cnt = 0
(g..n-1).each do |i|
v = a[i]
j = i - g
while j >= 0 && a[j] > v
a[j+g] = a[j]
j = j - g
cnt+=1
end
a[j+g] = v
end
return cnt
end
# main
## g ... | # get input
n=gets.to_i
target=[]
n.times do
target << gets.to_i
end
# insertion sort method
def insertion_sort a, n, g
cnt = 0
(g..n-1).each do |i|
v = a[i]
j = i - g
while j >= 0 && a[j] > v
a[j+g] = a[j]
j = j - g
cnt+=1
end
a[j+g] = v
end
return cnt
end
# main
g = ... | [["-", 0, 652, 196, 737, 8, 736, 0, 662, 0, 32], ["+", 0, 652, 196, 737, 8, 736, 0, 755, 17, 107]] | 4 | 173 | 2 |
n=gets.chomp.to_i
ary=Array.new
for i in 0..n-1
ary=ary.push(gets.chomp.to_i)
end
def insertion(ary,n,g)
for i in g..n-1
v=ary[i]
j=i-g
while j>=0 && ary[j]>v
ary[j+g]=ary[j]
j-=g
@count+=1
end
ary[j+g]=v
end
end
g=1
while 3*g+1<=n
g=3*g+1
end
@count=0
k=Array.new
while g>=1
insertion(ary... | n=gets.chomp.to_i
ary=Array.new
for i in 0..n-1
ary=ary.push(gets.chomp.to_i)
end
def insertion(ary,n,g)
for i in g..n-1
v=ary[i]
j=i-g
while j>=0 && ary[j]>v
ary[j+g]=ary[j]
j-=g
@count+=1
end
ary[j+g]=v
end
end
g=1
while 3*g+1<=n
g=3*g+1
end
@count=0
k=Array.new
while g>=1
insertion(ary... | [["+", 0, 493, 0, 652, 3, 4, 0, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 652, 3, 4, 0, 25], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 0, 493, 0, 652, 3, 4, 0, 24], ["+", 0, 493, 0, 652, 3, 4, 0, 652, 486, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 652, 17, 131]] | 4 | 174 | 6 |
def insertionSort(a,n,g)
cnt = 0
for i in g..n-1
v = a[i]
j = i-g
while j>=0 && a[j]>v do
a[j+g] = a[j]
j = j-g
cnt += 1
end
a[j+g] = v
end
return cnt
end
def makeShellNum(n)
num = 0
arr = []
tmp = 1
while n > tmp do
arr << tmp
num += 1
tmp = 3*tmp + 1... | def insertionSort(a,n,g)
cnt = 0
for i in g..n-1
v = a[i]
j = i-g
while j>=0 && a[j]>v do
a[j+g] = a[j]
j = j-g
cnt += 1
end
a[j+g] = v
end
return cnt
end
def makeShellNum(n)
num = 0
arr = []
tmp = 1
while n >= tmp do
arr << tmp
num += 1
tmp = 3*tmp + ... | [["-", 0, 735, 8, 736, 0, 89, 15, 738, 17, 47], ["+", 0, 735, 8, 736, 0, 89, 15, 738, 17, 20], ["+", 8, 736, 0, 38, 0, 4, 0, 652, 17, 131], ["+", 8, 736, 0, 38, 0, 4, 0, 652, 735, 22]] | 4 | 227 | 4 |
def insertion_sort(array, n, g)
cnt = 0
g.upto n - 1 do |i|
v = array[i]
j = i - g
while j >= 0 && array[j] > v
array[j + g] = array[j]
j -= g
cnt += 1
end
array[j + g] = v
end
cnt
end
def shell_sort(array, n)
cnt = 0
g = [1]
g << 3 * g[-1] + 1 until 3 * g[-1] + 1 > ... | def insertion_sort(array, n, g)
cnt = 0
g.upto n - 1 do |i|
v = array[i]
j = i - g
while j >= 0 && array[j] > v
array[j + g] = array[j]
j -= g
cnt += 1
end
array[j + g] = v
end
cnt
end
def shell_sort(array, n)
cnt = 0
g = [1]
g << 3 * g[-1] + 1 until 3 * g[-1] + 1 > ... | [["+", 0, 652, 3, 4, 0, 652, 486, 652, 735, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 652, 17, 131]] | 4 | 196 | 2 |
#!/usr/bin/ruby
def insertionSort(a, n, g)
for i in g..n-1
v = a[i]
j = i - g
while j >= 0 && a[j] > v
a[j+g] = a[j]
j = j - g
$cnt+=1
a[j+g] = v
end
end
end
def shellSort(a, n)
$cnt = 0
g = []
h = 1
while h*2 <= n
g << h
h = 3*h+1
end
g.reverse!
m = g.size
p m
puts g*' '
for i in 0... | #!/usr/bin/ruby
def insertionSort(a, n, g)
for i in g..n-1
v = a[i]
j = i - g
while j >= 0 && a[j] > v
a[j+g] = a[j]
j = j - g
$cnt+=1
a[j+g] = v
end
end
end
def shellSort(a, n)
$cnt = 0
g = []
h = 1
while h <= n
... | [["-", 8, 736, 0, 89, 15, 738, 31, 738, 17, 48], ["-", 8, 736, 0, 89, 15, 738, 31, 738, 12, 612]] | 4 | 168 | 2 |
#!/usr/bin/ruby
def insertionSort(a,g)
for i in g..a.size-1
v = a[i]
j = i - g
while j >= 0 && a[j] > v
a[j+g] = a[j]
j = j - g
$cnt+=1
a[j+g] = v
end
end
end
def shellSort(a)
$cnt = 0
g = []
h = 1
while h <= a.size
g << h
h = 3*h+1
end
g.reverse!
m = g.size
p m
puts g*' '
for i in ... | #!/usr/bin/ruby
def insertionSort(a,g)
for i in g..a.size-1
v = a[i]
j = i - g
while j >= 0 && a[j] > v
a[j+g] = a[j]
j = j - g
$cnt+=1
a[j+g] = v
end
end
end
def shellSort(a)
$cnt = 0
g = []
h = 1
while h <= a.size
g << h
h = 3*h+1
end
g.reverse!
m = g.size
p m
puts g*' '
for i in ... | [["-", 36, 36, 0, 493, 0, 652, 3, 4, 0, 21], ["-", 0, 493, 0, 652, 3, 4, 0, 652, 486, 22], ["-", 0, 493, 0, 652, 3, 4, 0, 652, 17, 131], ["-", 0, 493, 0, 652, 3, 4, 0, 652, 735, 22]] | 4 | 163 | 4 |
import System
if sys.version_info[0]>=3: raw_input=InputStream
def insertionSort(a,g):
global cnt
for i in range(g,len(a)):
v=a[i]
j=i-g
while j>=0 and a[j]>v:
a[j+g]=a[j]
j=j-g
cnt+=1
a[j+g]=v
def shellSort(a):
global cnt
cnt=0
... | #!/usr/bin/python
import sys
if sys.version_info[0]>=3: raw_input=input
def insertionSort(a,g):
global cnt
for i in range(g,len(a)):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j = j - g
cnt+=1
a[j+g] = v
def shellSort(a... | [["-", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22], ["+", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 662, 12, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 662, 12, 22]] | 5 | 214 | 4 |
def insertionSort(A,n,g):
cnt = 0
for i in range(g,n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
return cnt
def shellsort(A,n):
cnt = 0
h = 1
G = []
while h <= 1:
G... | def insertionSort(A,n,g):
cnt = 0
for i in range(g,n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
return cnt
def shellsort(A,n):
cnt = 0
h = 1
G = []
while h <= n:
... | [["-", 0, 14, 8, 196, 0, 52, 15, 666, 0, 612], ["+", 0, 14, 8, 196, 0, 52, 15, 666, 0, 22]] | 5 | 213 | 2 |
def insertionsort(a, n, g):
cnt = 0
for i in range(g, n):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j + g] = a[j]
j = j - g
cnt += 1
a[j + g] = v
return cnt
def shellsort(a, n):
g = []
gap = 1
while gap <= n / 9:
... | def insertionsort(a, n, g):
cnt = 0
for i in range(g, n):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j + g] = a[j]
j = j - g
cnt += 1
a[j + g] = v
return cnt
def shellsort(a, n):
g = []
gap = 1
while gap <= n:
g.a... | [["-", 8, 196, 0, 52, 15, 666, 0, 657, 17, 85], ["-", 8, 196, 0, 52, 15, 666, 0, 657, 12, 612]] | 5 | 215 | 9 |
#coding:utf-8
#1_2_D
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j -= g
cnt += 1
A[j+g] = v
def shellSort(A, n):
G = [1]
while True:
g = 3*G[0] + 1
... | #coding:utf-8
#1_2_D
def insertionSort(A, n, g):
global cnt
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j -= g
cnt += 1
A[j+g] = v
def shellSort(A, n):
G = [1]
while True:
g = 3*G[0] + 1
... | [["-", 8, 196, 0, 57, 15, 666, 0, 657, 17, 85], ["-", 8, 196, 0, 57, 15, 666, 0, 657, 12, 612]] | 5 | 223 | 2 |
def insertion_sort(data, g):
global cnt
for i in range(g, len(data)):
v, j = data[i], i - g
while j >= 0 and data[j] > v:
data[j + g] = data[j]
j = j - g
cnt += 1
data[j + g] = v
def shell_sort(data):
global G
for i in range(1, 100):
t... | def insertion_sort(data, g):
global cnt
for i in range(g, len(data)):
v, j = data[i], i - g
while j >= 0 and data[j] > v:
data[j + g] = data[j]
j = j - g
cnt += 1
data[j + g] = v
def shell_sort(data):
global G
for i in range(1, 100):
t... | [["+", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["+", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 216 | 6 |
# -*- coding: utf-8 -*-
"""
Created on Sun Jul 17 16:53:19 2016
@author: Yasuhiro_2
"""
def checkSorted(A):
check = True
a = A[0]
for e in A:
if a > e:
check = False
break
else:
a = e
return check
def insertionSort(A, n, g, cnt):
for i ... | # -*- coding: utf-8 -*-
"""
Created on Sun Jul 17 16:53:19 2016
@author: Yasuhiro_2
"""
def checkSorted(A):
check = True
a = A[0]
for e in A:
if a > e:
check = False
break
else:
a = e
return check
def insertionSort(A, n, g, cnt):
for i ... | [["+", 64, 196, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["+", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 336 | 5 |
import sys
def isort(A, n, g):
cnt = 0
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j + g] = A[j]
j -= g
cnt += 1
A[j + g] = v
return cnt
def ssort(A, n):
cnt = 0
G = []
h = 1
while h < n:
... | import sys
def isort(A, n, g):
cnt = 0
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j + g] = A[j]
j -= g
cnt += 1
A[j + g] = v
return cnt
def ssort(A, n):
cnt = 0
G = []
h = 1
while h <= n:
... | [["-", 0, 14, 8, 196, 0, 52, 15, 666, 667, 18], ["+", 0, 14, 8, 196, 0, 52, 15, 666, 667, 19], ["-", 0, 14, 8, 196, 0, 1, 0, 662, 0, 32], ["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 22]] | 5 | 203 | 7 |
# -*- coding:utf-8 -*-
cnt = 0
def insection_sort(a, g):
global cnt
for i in range(g, len(a)):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j -= g
cnt += 1
a[j+g] = v
def shell_sort(a):
g = list(1)
temp = 4
while te... | # -*- coding:utf-8 -*-
cnt = 0
def insection_sort(a, g):
global cnt
for i in range(g, len(a)):
v = a[i]
j = i - g
while j >= 0 and a[j] > v:
a[j+g] = a[j]
j -= g
cnt += 1
a[j+g] = v
def shell_sort(a):
g = [1]
temp = 4
while temp <... | [["-", 8, 196, 0, 1, 0, 662, 12, 652, 63, 22], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 662, 12, 634, 0, 70], ["-", 0, 1, 0, 662, 12, 652, 3, 4, 0, 25], ["+", 8, 196, 0, 1, 0, 662, 12, 634, 0, 73]] | 5 | 202 | 5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.