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>
#define N 2000000
int main() {
int n, i, max = -100, min, r[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
min = r[0];
for (i = 1; i < n; i++) {
if (r[i] - min > max) {
max = r[i] - min;
} else if (min > r[i]) {
min = r[i];
}
}
... | #include <stdio.h>
#define N 2000000
int main() {
int n, i, max = -100000000000, min, r[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
min = r[0];
for (i = 1; i < n; i++) {
if (r[i] - min > max) {
max = r[i] - min;
}
if (min > r[i]) {
min = r[i];
}... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 0 | 141 | 3 |
#include <stdio.h>
int main() {
int i, n, min, maxdif, a[200000];
maxdif = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
min = a[0];
for (i = 1; i < n; i++) {
if (maxdif < a[i] - min) {
maxdif = a[i] - min;
}
if (a[i] < min) {
min = a[i];
}
}
... | #include <stdio.h>
int main() {
int i, n, min, maxdif, a[200000];
maxdif = -1000000000;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
min = a[0];
for (i = 1; i < n; i++) {
if (maxdif < a[i] - min) {
maxdif = a[i] - min;
}
if (a[i] < min) {
min = a[i];
... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 0 | 139 | 2 |
#include <math.h>
#include <stdio.h>
int main() {
int n, i, count = 0, min, max = -1000000000;
int Number[200000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &Number[i]);
}
min = Number[0];
for (i = 0; i < n; i++) {
if (max < Number[i] - min) {
max = Number[i] - min;
}
... | #include <math.h>
#include <stdio.h>
int main() {
int n, i, count = 0, min, max = -1000000000;
int Number[200000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &Number[i]);
}
min = Number[0];
for (i = 1; i < n; i++) {
if (max < Number[i] - min) {
max = Number[i] - min;
}
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 144 | 2 |
include Math
ans = 0
num, *ary = $<.map &:to_i
ary.each do|i|
for j in 2..sqrt(i).floor
if i % j == 0
ans -= 1
break
end
ans += 1
end
end
puts ans
| include Math
ans = 0
num, *ary = $<.map &:to_i
ary.each do|i|
for j in 2..sqrt(i).floor
if i % j == 0
ans -= 1
break
end
end
ans += 1
end
puts ans
| [["+", 196, 737, 8, 736, 0, 88, 8, 170, 0, 444], ["-", 196, 737, 8, 736, 0, 88, 8, 170, 0, 444]] | 4 | 51 | 2 |
n = gets.to_i
ans = 0
n.times do
if gets.to_i.prime?
ans += 1
end
end
puts ans
| require 'prime'
n = gets.to_i
ans = 0
n.times do
if gets.to_i.prime?
ans += 1
end
end
puts ans
| [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 62], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 25 | 4 |
n = gets.strip.to_i
count = 0
while line = gets do
num = line.strip.to_i
root_num = Math.sqrt(num).floor
can_divide = (2..root_num).any? do |i|
num % i == 0
end
if can_divide then
count += 1
end
end
p count | n = gets.strip.to_i
count = 0
while line = gets do
num = line.strip.to_i
root_num = Math.sqrt(num).floor
can_divide = (2..root_num).any? do |i|
num % i == 0
end
if !can_divide then
count += 1
end
end
p count | [["+", 0, 89, 8, 170, 0, 121, 15, 748, 17, 111]] | 4 | 61 | 1 |
n = 0
gets.to_i.times do
n+=1 if gets.to_i.prime?
end
puts n | require 'prime'
n = 0
gets.to_i.times do
n+=1 if gets.to_i.prime?
end
puts n | [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 62], ["+", 0, 493, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 21 | 4 |
def prime?(n)
return true if n == 2
return false if n.even?
3.step(Math.sqrt(n), 2) {|i| return false if n.modulo(i).zero? }
return true
end
n = gets.to_i
numbers = []
n.times { numbers << gets.to_i }
result = numbers.select { |i| prime?(i) }
puts results.size |
def prime?(n)
return true if n == 2
return false if n.even?
3.step(Math.sqrt(n), 2) {|i| return false if n.modulo(i).zero? }
return true
end
n = gets.to_i
numbers = []
n.times { numbers << gets.to_i }
result = numbers.select { |i| prime?(i) }
puts result.size | [["-", 0, 493, 0, 652, 3, 4, 0, 652, 486, 22], ["+", 0, 493, 0, 652, 3, 4, 0, 652, 486, 22]] | 4 | 86 | 2 |
Fixnum.class_eval {
def is_prime?
return true if self == 2
return false if self < 2 or self % 2 == 0
3.step(Math.sqrt(self).ceil, 2) { |i|
return false if self % i == 0
}
true
end
}
STDIN.read.split("\s")[1..-1].map(&:to_i).map(&:is_prime?).select { |x| x }.size | Fixnum.class_eval {
def is_prime?
return true if self == 2
return false if self < 2 or self % 2 == 0
3.step(Math.sqrt(self).ceil, 2) { |i|
return false if self % i == 0
}
true
end
}
puts STDIN.read.split("\s")[1..-1].map(&:to_i).map(&:is_prime?).select { |x| x }.size | [["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]] | 4 | 93 | 1 |
require 'prime'
n = gets.chomp.to_i
data = Array.new
n.times { |i|
data[i] = gets.chomp.to_i
}
data.sort!
prime = Prime.each(10000).to_a
cnt=0
n.times { |i|
limit = Math::sqrt(data[i])
j = 0
flg = 1
while j<prime.length && limit<prime[j]
if data[i]%prime[j]==0
flg = 0
end
j += 1
end
if flg == 1
cnt +... | require 'prime'
n = gets.chomp.to_i
data = Array.new
n.times { |i|
data[i] = gets.chomp.to_i
}
data.sort!
prime = Prime.each(10000).to_a
cnt=0
n.times { |i|
limit = Math::sqrt(data[i])
j = 0
flg = 1
while j<prime.length && limit>=prime[j]
if data[i]%prime[j]==0
flg = 0
break
end
j += 1
end
if flg ==... | [["-", 8, 734, 0, 89, 15, 738, 12, 738, 17, 18], ["+", 8, 734, 0, 89, 15, 738, 12, 738, 17, 20], ["+", 8, 170, 0, 121, 64, 749, 0, 94, 0, 94]] | 4 | 118 | 3 |
require 'prime'
primes = []
Prime.each(10000){|i|
primes.push(i)
}
n = gets.to_i
nums =[]
n.times{
nums.push(get.to.i)
}
cnt = n
nums.each{|val|
primes.each{|i|
break if val == i
if val%i == 0
cnt -=1
break
end
}
}
puts(cnt) | require 'prime'
primes =[]
Prime.each(10000){|i|
primes.push(i)
}
n = gets.to_i
nums = []
n.times{
nums.push(gets.to_i)
}
cnt = n
nums.each{|val|
primes.each{|i|
break if val == i
if val%i == 0
cnt -=1
break
end
}
}
puts (cnt) | [["-", 0, 652, 3, 4, 0, 652, 486, 652, 486, 22], ["-", 0, 652, 3, 4, 0, 652, 486, 652, 17, 131], ["-", 0, 652, 3, 4, 0, 652, 486, 652, 735, 22], ["+", 8, 734, 0, 652, 3, 4, 0, 652, 486, 22], ["-", 8, 734, 0, 652, 3, 4, 0, 652, 735, 22], ["+", 8, 734, 0, 652, 3, 4, 0, 652, 735, 22]] | 4 | 88 | 6 |
include Math
require 'prime'
n = gets.to_i
root_prime = Prime.each(10000).to_a
c = 0
n.times {
catch(:next) do
x = gets.to_i
if (x <= 10000)
c += 1 if (root_prime.bsearch{|i| x == i})
throw :next
end
xs = sqrt(x).floor
root_prime.each{ |rp|
break if (rp > xs)
throw :next ... | include Math
require 'prime'
n = gets.to_i
root_prime = Prime.each(10000).to_a
c = 0
n.times {
catch(:next) do
x = gets.to_i
if (x <= 10000)
c += 1 if (x == root_prime.bsearch{|i| x <= i})
throw :next
end
xs = sqrt(x).floor
root_prime.each{ |rp|
break if (rp > xs)
throw :... | [["+", 64, 749, 0, 751, 15, 739, 0, 738, 31, 22], ["+", 64, 749, 0, 751, 15, 739, 0, 738, 17, 60], ["-", 0, 652, 196, 196, 8, 734, 0, 738, 17, 60], ["+", 12, 652, 196, 196, 8, 734, 0, 738, 17, 19]] | 4 | 104 | 4 |
require 'prime'
N = gets.to_i
count = 0
#AS=[]
N.times{
AS << gets.to_i
}
puts AS.count{ | x | Prime.prime?(x) }
| require 'prime'
N = gets.to_i
count = 0
AS=[]
N.times{
AS << gets.to_i
}
puts AS.count{ | x | Prime.prime?(x) }
| [["+", 36, 36, 36, 36, 0, 493, 0, 662, 31, 743], ["+", 36, 36, 36, 36, 0, 493, 0, 662, 0, 32], ["+", 36, 36, 0, 493, 0, 662, 12, 516, 0, 70], ["+", 36, 36, 0, 493, 0, 662, 12, 516, 0, 73]] | 4 | 38 | 4 |
#!/usr/bin/ruby
require 'prime'
h={}
Prime.each(10**4+10){|e|h[e]=1}
p gets.to_i.times.count{e=gets.to_i;h[e]||h.keys.any?{|f|e%f==0}} | #!/usr/bin/ruby
require 'prime'
h={}
Prime.each(10**4+10){|e|h[e]=1}
p gets.to_i.times.count{e=gets.to_i;h[e]||h.keys.none?{|f|e%f==0}} | [["-", 196, 196, 8, 734, 0, 738, 12, 652, 735, 22], ["+", 196, 196, 8, 734, 0, 738, 12, 652, 735, 22]] | 4 | 66 | 2 |
n = gets.to_i
m = []
p_num = 0
n.times{
m += [gets.to_i]
}
for x in m
flag = 0
for y in 2..(x**0.5)+1
if x % y == 0
flag = 1
break
end
end
if flag == 0
p_num += 1
end
end
puts p_num | n = gets.to_i
m = []
p_num = 0
n.times{
m += [gets.to_i]
}
for x in m
flag = 0
for y in 2..(x**0.5)
if x % y == 0
flag = 1
break
end
end
if flag == 0
p_num += 1
end
end
puts p_num | [["-", 0, 88, 51, 267, 0, 475, 444, 738, 17, 72], ["-", 0, 88, 51, 267, 0, 475, 444, 738, 12, 612]] | 4 | 66 | 2 |
def primeq(x):
if x==1:return False
for i in range(2,int(x**.5)):
if x%i==0:return False
return True
c=0
for i in range(int(input())):
if primeq(int(input())):c+=1
print(c)
| def primeq(x):
if x==1:return False
for i in range(2,int(x**.5)+1):
if x%i==0:return False
return True
c=0
for i in range(int(input())):
if primeq(int(input())):c+=1
print(c)
| [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 73 | 2 |
n = int(input())
sum = 0
for _ in range(n):
a = int(input())
if a == 2:
continue
for i in range(a):
x = i + 2
if a%x == 0:
sum += 1
print(a)
break
if x > a ** 0.5:
break
print(n - sum)
| n = int(input())
sum = 0
for _ in range(n):
a = int(input())
if a == 2:
continue
for i in range(a):
x = i + 2
if a%x == 0:
sum += 1
break
if x > a ** 0.5:
break
print(n - sum)
| [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 75 | 4 |
import math
n = eval(input())
prime_count = 0
is_prime = 1
for i in range(0,n):
is_prime = 1
prime_check_number = eval(input())
if prime_check_number == 2:
prime_count = prime_count + 1
continue
elif prime_check_number == 1 or prime_check_number % 2 == 0:
continue
else:
prime_check_number_sqrt = int(math.... | import math
n = eval(input())
prime_count = 0
is_prime = 1
for i in range(0,n):
is_prime = 1
prime_check_number = eval(input())
if prime_check_number == 2:
prime_count = prime_count + 1
continue
elif prime_check_number == 1 or prime_check_number % 2 == 0:
continue
else:
prime_check_number_sqrt = int(math.... | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612]] | 5 | 110 | 2 |
count = 0
for _ in range(int(input())):
n = int(input())
if pow(2,n-1,n) == 1:
count += 1
print(count)
| count = 0
for _ in range(int(input())):
n = int(input())
if n == 2 or pow(2,n-1,n) == 1:
count += 1
print(count)
| [["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 22], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 667, 60], ["+", 8, 196, 0, 57, 15, 679, 31, 666, 0, 612], ["+", 0, 7, 8, 196, 0, 57, 15, 679, 17, 354]] | 5 | 45 | 4 |
class PrimeChecker:
def __init__(self):
self.primes = [2,3]
def isPrime(self, n):
if n in self.primes:
return True
else:
for i in self.primes:
if n % i == 0:
return False
i = 5
w = 2
while i * i < n:
... | class PrimeChecker:
def __init__(self):
self.primes = [2,3]
def isPrime(self, n):
if n in self.primes:
return True
else:
for i in self.primes:
if n % i == 0:
return False
i = 5
w = 2
while i * i <= n:... | [["-", 0, 14, 8, 196, 0, 52, 15, 666, 667, 18], ["+", 0, 14, 8, 196, 0, 52, 15, 666, 667, 19]] | 5 | 139 | 2 |
def is_prime(num):
if num == 2:
return True
elif num % 2 == 0:
return False
else:
for i in range(3,int(num**0.5)):
if num % i == 0:
return False
return True
n = int(input())
ans = 0
for _ in range(n):
num = int(input())
if is_prime(num)... | def is_prime(num):
if num == 2:
return True
elif num % 2 == 0:
return False
else:
for i in range(3,int(num**0.5)+1,2):
if num % i == 0:
return False
return True
n = int(input())
ans = 0
for _ in range(n):
num = int(input())
if is_prime(... | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612]] | 5 | 90 | 4 |
#!/usr/bin/env python
# coding: utf-8
def check_pn(num):
if (num <2):
return False
elif (num==2):
return True
if (num%2 == 0):
return False
i = 3
while (i <= num/i):
if num % i == 0:
return False
print ( num, i)
i += 2
return True
... | #!/usr/bin/env python
# coding: utf-8
def check_pn(num):
if (num <2):
return False
elif (num==2):
return True
if (num%2 == 0):
return False
i = 3
while (i <= num/i):
if num % i == 0:
return False
i += 2
return True
n = int(input())
listdat... | [["-", 0, 52, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 21], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 121 | 6 |
primes = [2]
def is_prime(num):
root = num ** 0.5
for prime in primes:
if root < prime:
break
if num % prime == 0:
return False
return True
def create_primes(primes, max):
for i in range(primes[-1] + 1,max):
if is_prime(i):
primes += [i]
cre... | primes = [2]
def is_prime(num):
root = num ** 0.5
for prime in primes:
if root < prime:
break
if num % prime == 0:
return False
return True
def create_primes(primes, max):
for i in range(primes[-1] + 1,max):
if is_prime(i):
primes += [i]
cre... | [["+", 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 | 113 | 3 |
#!/usr/bin/env python3
from itertools import takewhile
from math import sqrt
def is_prime(primes, i):
if i in primes:
return True
for p in takewhile(lambda x: x * x <= i, sorted(primes)):
if i % p == 0:
return False
return True
def sieve_of_eratosthenes(max):
is_prime = [... | #!/usr/bin/env python3
from itertools import takewhile
from math import sqrt
def is_prime(primes, i):
if i in primes:
return True
for p in takewhile(lambda x: x * x <= i, sorted(primes)):
if i % p == 0:
return False
return True
def sieve_of_eratosthenes(max):
is_prime = [... | [["+", 8, 196, 0, 57, 15, 652, 3, 4, 0, 22], ["+", 8, 196, 0, 57, 15, 652, 3, 4, 0, 21]] | 5 | 199 | 2 |
import math
def prime(a):
if a==1:
return 0
n=2
while n<math.sqrt(a):
if a%n==0:
return 0
n+=1
return 1
N=int(input())
count=0
for i in range(N):
a=int(input())
count+=prime(a)
print(count) | import math
def prime(a):
if a==1:
return 0
n=2
while n<=math.sqrt(a):
if a%n==0:
return 0
n+=1
return 1
N=int(input())
count=0
for i in range(N):
a=int(input())
count+=prime(a)
print(count) | [["-", 0, 14, 8, 196, 0, 52, 15, 666, 667, 18], ["+", 0, 14, 8, 196, 0, 52, 15, 666, 667, 19]] | 5 | 79 | 2 |
import sys
import math
count = 0
judge = 0
for line in sys.stdin.readlines():
num = int(line.strip())
if judge == 0:
judge = 1
else:
flag = 0
for i in range(2, math.sqrt(num) + 1):
if num % i == 0:
flag = 1
break
if flag == 0:... | import sys
import math
count = 0
judge = 0
for line in sys.stdin.readlines():
num = int(line.strip())
if judge == 0:
judge = 1
else:
flag = 0
for i in range(2, int(math.sqrt(num)) + 1):
if num % i == 0:
flag = 1
break
if flag ... | [["+", 12, 652, 3, 4, 0, 657, 31, 652, 63, 22], ["+", 3, 4, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 31, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 84 | 3 |
import sys
import math
x_list = []
for line in sys.stdin.readlines():
x_list.append(int(line.strip()))
count = 0
num_list.remove(x_list[0])
for i in x_list:
flag = 0
for j in range(2, math.sqrt(i)+1):
if i % j == 0:
flag = 1
break
if flag == 0:
count += 1
print(count)
| import sys
import math
x_list = []
for line in sys.stdin.readlines():
x_list.append(int(line.strip()))
count = 0
x_list.remove(x_list[0])
for i in x_list:
flag = 0
for j in range(2, int(math.sqrt(i))+1):
if i % j == 0:
flag = 1
break
if flag == 0:
count += 1
print(count)
| [["-", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 0, 656, 0, 1, 0, 652, 63, 319, 500, 22], ["+", 12, 652, 3, 4, 0, 657, 31, 652, 63, 22], ["+", 3, 4, 0, 657, 31, 652, 3, 4, 0, 24], ["+", 31, 652, 3, 4, 0, 652, 3, 4, 0, 25]] | 5 | 92 | 5 |
import math
n = int(input())
num = list()
count = 0
max = 0
for i in range(n):
num.append(int(input()))
for i in range(n):
root_num = math.sqrt(num[i])
for j in range(2, int(root_num) + 1):
if num[i] % j == 0:
print(j)
count = count + 1
break
print(n - count) | import math
n = int(input())
num = list()
count = 0
max = 0
for i in range(n):
num.append(int(input()))
for i in range(n):
root_num = math.sqrt(num[i])
for j in range(2, int(root_num) + 1):
if num[i] % j == 0:
count = count + 1
break
print(n - count) | [["-", 0, 57, 64, 196, 0, 1, 0, 652, 63, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 64, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 100 | 4 |
N = int(input())
ns = [int(input()) for _ in range(N)]
#primes = set()
#def is_prime(n):
# if n in primes:
# return True
#
# for m in range(2, n):
# if is_prime(m) and n % m == 0:
# return False
#
# primes.add(n)
# return True
# Proof:
# if n < d ^ 2 and n mod d = 0;
# n = ad (a in N)
# ad < d ^ 2
# a ... | N = int(input())
ns = [int(input()) for _ in range(N)]
#primes = set()
#def is_prime(n):
# if n in primes:
# return True
#
# for m in range(2, n):
# if is_prime(m) and n % m == 0:
# return False
#
# primes.add(n)
# return True
# Proof:
# if n < d ^ 2 and n mod d = 0;
# n = ad (a in N)
# ad < d ^ 2
# a ... | [["+", 0, 14, 8, 196, 0, 57, 15, 666, 667, 60], ["+", 0, 14, 8, 196, 0, 57, 15, 666, 0, 612]] | 5 | 111 | 2 |
import math
def prime_array(n=1000):
List = [2]
i = 3
while i <= n:
judge = True
for k in List :
if math.sqrt(i) > k :
break
if i%k == 0:
judge = False
break
if judge :
List.append(i)
i += 2
return List
def main():
cnt=0
prime_List=prime_array(10**4)
n=eval(input())
for i in range(n... | import math
def prime_array(n=1000):
List = [2]
i = 3
while i <= n:
judge = True
for k in List :
if math.sqrt(i) < k :
break
if i%k == 0:
judge = False
break
if judge :
List.append(i)
i += 2
return List
def main():
cnt=0
prime_List=prime_array(10**4)
n=eval(input())
for i in range(n... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 667, 47], ["+", 0, 7, 8, 196, 0, 57, 15, 666, 667, 18]] | 5 | 175 | 2 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import math
def isprime(n):
if n == 2:
return True
elif n < 2 or n % 2 == 0:
return False
else:
for i in range(3, math.floor(math.sqrt(n)), 2):
if x % i == 0:
return False
else:
return Tr... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import math
def isprime(n):
if n == 2:
return True
elif n < 2 or n % 2 == 0:
return False
else:
for i in range(3, math.floor(math.sqrt(n)) + 1, 2):
if n % i == 0:
return False
else:
retur... | [["+", 0, 7, 12, 652, 3, 4, 0, 657, 17, 72], ["+", 0, 7, 12, 652, 3, 4, 0, 657, 12, 612], ["-", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22]] | 5 | 122 | 4 |
def isPrime(num):
if num == 2: return 1
if num < 2 or num&1 == 0: return 0
if pow(2, num-1, num) == 1: return 1
n = eval(input())
s = 0
for i in range(n):
s += isPrime(eval(input()))
print(s) | def isPrime(num):
if num == 2: return 1
if num < 2 or num&1 == 0: return 0
if pow(2, num-1, num) == 1: return 1
return 0
n = eval(input())
s = 0
for i in range(n):
s += isPrime(eval(input()))
print(s) | [["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 38], ["+", 0, 656, 0, 14, 8, 196, 0, 37, 0, 612]] | 5 | 76 | 2 |
import math
primenum =int(input())
ans = 0
for p in range(primenum):
targ = int(input())
for t in range(2,math.floor(math.sqrt(targ)) + 1):
print(t)
if targ % t == 0:
break
else:
ans += 1
print(ans) | import math
primenum =int(input())
ans = 0
for p in range(primenum):
targ = int(input())
for t in range(2,math.floor(math.sqrt(targ)) + 1):
if targ % t == 0:
break
else:
ans += 1
print(ans) | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 72 | 4 |
def is_prime(n):
for i in range(3, int(n ** 0.5) + 1, 2):
if n % i == 0: return False
return True
count = 0
for i in range(int(input())):
if is_prime(int(input())) : count += 1
print(count) | def is_prime(n):
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0: return False
return True
count = 0
for i in range(int(input())):
if is_prime(int(input())) : count += 1
print(count) | [["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["+", 8, 196, 0, 7, 12, 652, 3, 4, 0, 612], ["-", 8, 196, 0, 7, 12, 652, 3, 4, 0, 21]] | 5 | 70 | 11 |
#include <bits/stdc++.h>
using namespace std;
int num[200050] = {0};
int main() {
int n;
int maxv = -200000000, minv;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &num[i]);
minv = num[1];
for (int i = 1; i <= n; i++) {
maxv = max(maxv, num[i] - minv);
minv = min(minv, num[i]);
}
... | #include <bits/stdc++.h>
using namespace std;
int num[200050] = {0};
int main() {
int n;
int maxv = -2000000000, minv;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &num[i]);
minv = num[1];
for (int i = 2; i <= n; i++) {
maxv = max(maxv, num[i] - minv);
minv = min(minv, num[i]);
}... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 131 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int r[200000], i, maxv = -1000000000, minv, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> r[i];
}
minv = r[0];
for (i = 0; i < n; i++) {
maxv = max(maxv, r[i] - minv);
minv = min(minv, r[i]);
}
cout << maxv << endl... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int r[200000], i, maxv = -1000000000, minv, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> r[i];
}
minv = r[0];
for (i = 1; i < n; i++) {
maxv = max(maxv, r[i] - minv);
minv = min(minv, r[i]);
}
cout << maxv << endl... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 113 | 2 |
// cで提出 事故る
#include <algorithm> //min,max
#include <iostream>
using namespace std; // cin cout
static const int MAX = 200000;
// static 存在し続ける
// const 値を書き換えない
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000; //こんなとこで定義？
int minv = R[0];
for (... | // cで提出 事故る
#include <algorithm> //min,max
#include <iostream>
using namespace std; // cin cout
static const int MAX = 200000;
// static 存在し続ける
// const 値を書き換えない
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000; //こんなとこで定義？
int minv = R[0];
for (... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 124 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> r;
for (int i = 0; i < n; i++) {
int ri;
cin >> ri;
r.push_back(ri);
}
int diffmax = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> r;
for (int i = 0; i < n; i++) {
int ri;
cin >> ri;
r.push_back(ri);
}
int diffmax = ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 143 | 2 |
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int n, buff[MAX];
cin >> n;
for (int i = 0; i < n; i++)
cin >> buff[i];
int minv = buff[0], maxv = -2000000000;
for (int j = 1; j < n - 1; j++) {
if (maxv < buff[j] - minv)
maxv = buff[j] - minv;
if (b... | #include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int n, buff[MAX];
cin >> n;
for (int i = 0; i < n; i++)
cin >> buff[i];
int minv = buff[0], maxv = -2000000000;
for (int j = 1; j < n; j++) {
if (maxv < buff[j] - minv)
maxv = buff[j] - minv;
if (buff[... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 124 | 2 |
#include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
unsigned int n;
int ans = INT_MIN;
int mi = INT_MIN;
cin >> n;
for (unsigned int i = 0; i < n; ++i) {
int x;
cin >> x;
if (mi > INT_MIN)
ans = max(ans, x - mi);
mi = min(mi, x);
}
cout << ... | #include <algorithm>
#include <climits>
#include <iostream>
using namespace std;
int main() {
unsigned int n;
int ans = INT_MIN;
int mi = INT_MAX;
cin >> n;
for (unsigned int i = 0; i < n; ++i) {
int x;
cin >> x;
if (mi < INT_MAX)
ans = max(ans, x - mi);
mi = min(mi, x);
}
cout << ... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 93 | 6 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int d = -2000000000000;
for (int i = 0; i < n; i++)
cin >> a[i];
int mi = a[0];
for (int i = 1; i < n; i++) {
d = max(a[i] - mi, d);
if (mi > a[i])
mi = a[i];
}
cout << d << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int d = -2000000000;
for (int i = 0; i < n; i++)
cin >> a[i];
int mi = a[0];
for (int i = 1; i < n; i++) {
d = max(a[i] - mi, d);
if (mi > a[i])
mi = a[i];
}
cout << d << endl;
return 0;
}
| [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 114 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
int maxn = -1, minn;
cin >> n >> m;
minn = m;
for (int i = 1; i < n; ++i) {
cin >> m;
maxn = max(maxn, m - minn);
minn = min(minn, m);
}
cout << maxn << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m;
int maxn = -999999999, minn;
cin >> n >> m;
minn = m;
for (int i = 1; i < n; ++i) {
cin >> m;
maxn = max(maxn, m - minn);
minn = min(minn, m);
}
cout << maxn << endl;
return 0;
}
| [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 85 | 2 |
#include "bits/stdc++.h"
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> Y(N);
for (int i = 0; i < N; i++)
cin >> Y.at(i);
int Ymin = Y.at(0);
int K = Y.at(1) - Y.at(0);
for (int i = 1; i < N; i++) {
if ((Y.at(i) - Ymin) > K) {
K = Y.at(i);
}
if (Y.at(i) < Ymin... | #include "bits/stdc++.h"
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> Y(N);
for (int i = 0; i < N; i++)
cin >> Y.at(i);
int Ymin = Y.at(0);
int K = Y.at(1) - Y.at(0);
for (int i = 1; i < N; i++) {
if ((Y.at(i) - Ymin) > K) {
K = (Y.at(i) - Ymin);
}
if (Y.at(... | [["+", 64, 9, 0, 1, 0, 11, 12, 23, 0, 24], ["+", 12, 23, 0, 16, 31, 2, 3, 4, 0, 25], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 12, 22]] | 1 | 154 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int n, a[200010], ma[200010], mi[200010], ans = -1145141919;
int main() {
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) {
if (i == 0)
mi[i] = a[i];
else
mi[i] = min(mi[i - 1], a[i]);
}
for (int i = n -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int n, a[200010], ma[200010], mi[200010], ans = -1145141919;
int main() {
cin >> n;
rep(i, n) cin >> a[i];
rep(i, n) {
if (i == 0)
mi[i] = a[i];
else
mi[i] = min(mi[i - 1], a[i]);
}
for (int i = n -... | [["+", 0, 11, 31, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 11, 31, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 194 | 4 |
#include <iostream>
using namespace std;
int main() {
int min;
int max_delta = 999999999;
int n, i;
cin >> n;
int input[n];
for (i = 0; i < n; i++) {
cin >> input[i];
}
for (i = 0; i < n; i++) {
if (i == 0) {
min = input[i];
} else {
if (max_delta < input[i] - min) {
... | #include <iostream>
using namespace std;
int main() {
int min;
int max_delta = -999999999;
int n, i;
cin >> n;
int input[n];
for (i = 0; i < n; i++) {
cin >> input[i];
}
for (i = 0; i < n; i++) {
if (i == 0) {
min = input[i];
} else {
if (max_delta < input[i] - min) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 139 | 2 |
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
static const int MAX = 200000;
int main() {
vector<int> R(MAX);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R.at(i);
int maxv = -2000000000;
int minv = R.at(0);
for (in... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
static const int MAX = 200000;
int main() {
vector<int> R(MAX);
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R.at(i);
int maxv = -2000000000;
int minv = R.at(0);
for (in... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 136 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, minv = 0, maxv = -2000000000;
cin >> n;
int r[n];
for (int i = 0; i < n; i++) {
cin >> r[i];
}
minv = r[0];
for (int i = 0; i < n; i++) {
maxv = max(maxv, r[i] - minv);
minv = min(minv, r[i]);
}
cout << max... |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, minv = 0, maxv = -2000000000;
cin >> n;
int r[n];
for (int i = 0; i < n; i++) {
cin >> r[i];
}
minv = r[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, r[i] - minv);
minv = min(minv, r[i]);
}
cout << ma... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 116 | 2 |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265
int main(void) {
int max = -1000000000;
int n;
int min, data;
cin >> n;
cin >> min;
for (int i = 0; i < n - 1; i++) {
cin >> data... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
#define PI 3.14159265
int main(void) {
int max = -1000000000;
int n;
int min, data;
cin >> n;
cin >> min;
for (int i = 0; i < n - 1; i++) {
cin >> data... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22]] | 1 | 102 | 2 |
#include <algorithm>
#include <iostream>
using std::cin;
using std::max;
using std::min;
int main() {
int data_num;
cin >> data_num;
long rate_min, rate_tmp;
cin >> rate_min >> rate_tmp;
long range_max = rate_tmp - rate_min;
rate_min = min(rate_min, rate_tmp);
data_num--;
long range_tmp;
while (da... | #include <algorithm>
#include <iostream>
using std::cin;
using std::max;
using std::min;
int main() {
int data_num;
cin >> data_num;
long rate_min, rate_tmp;
cin >> rate_min >> rate_tmp;
long range_max = rate_tmp - rate_min;
rate_min = min(rate_min, rate_tmp);
data_num -= 2;
long range_tmp;
while ... | [["-", 0, 14, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13]] | 1 | 113 | 3 |
#include <cstdio>
#include <iostream>
using namespace std;
const int INF = (1e+9) * 2;
int main() {
int n, r[200001] = {0};
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &r[i]);
int ans = -INF, min_r = 0;
for (int i = 0; i < n; ++i) {
ans = max(ans, r[i] - min_r);
min_r = min(min_r, r[i]);
... | #include <cstdio>
#include <iostream>
using namespace std;
const int INF = (1e+9) * 2;
int main() {
int n, r[200001] = {0};
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &r[i]);
int ans = -INF, min_r = r[0];
for (int i = 1; i < n; ++i) {
ans = max(ans, r[i] - min_r);
min_r = min(min_r, r[i]... | [["+", 8, 9, 0, 43, 49, 50, 51, 69, 28, 22], ["+", 0, 43, 49, 50, 51, 69, 341, 342, 0, 70], ["+", 0, 43, 49, 50, 51, 69, 341, 342, 0, 73], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 128 | 5 |
// include "stdafx.h"
#include <algorithm>
#include <iostream>
using namespace std;
void maximumProfit();
int main() {
maximumProfit();
return 0;
}
void maximumProfit() {
const int MAX = 200000;
int R[MAX];
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> R[i];
}
int mi = R[0];
int ma = -... | // include "stdafx.h"
#include <algorithm>
#include <iostream>
using namespace std;
void maximumProfit();
int main() {
maximumProfit();
return 0;
}
void maximumProfit() {
const int MAX = 200000;
int R[MAX];
int N;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> R[i];
}
int mi = R[0];
int ma = -... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 138 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
#define MAX 200000
int main() {
int n, a[MAX], i;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
int maxv, minv;
maxv = -200000000;
minv = a[0];
for (i = 0; i < n; i++) {
maxv = max(maxv, a[i] - minv);
minv = min(minv, a[i]);
}
... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAX 200000
int main() {
int n, a[MAX], i;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
int maxv, minv;
maxv = -2000000000;
minv = a[0];
for (i = 1; i < n; i++) {
maxv = max(maxv, a[i] - minv);
minv = min(minv, a[i]);
}... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 117 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, R[200000], min;
int answer = -999999999;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
min = R[0];
for (int i = 0; i < n; i++) {
if (min > R[i]) {
if (answer < R[i] - min)
answer = R[i] - min;
min = R[i];
} el... | #include <iostream>
using namespace std;
int main() {
int n, R[200000], min;
int answer = -999999999;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
min = R[0];
for (int i = 1; i < n; i++) {
if (min > R[i]) {
if (answer < R[i] - min)
answer = R[i] - min;
min = R[i];
} el... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 75, 76, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 19]] | 1 | 154 | 4 |
#include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin... | #include <algorithm>
#include <cmath>
#include <complex>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define vvi vector<vector<int>>
#define vi vector<int>
#define All(X) X.begin... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 225 | 4 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, v;
int R[200000] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v;
R[i] = v;
}
int minv = R[0];
int maxv = R[1] - R[0];
for (int j = 1; j < n - 1; j++) {
if (maxv < (R[j] - minv))
maxv = (R[j] - mi... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, v;
int R[200000] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v;
R[i] = v;
}
int minv = R[0];
int maxv = R[1] - R[0];
for (int j = 1; j < n; j++) {
if (maxv < (R[j] - minv))
maxv = (R[j] - minv);... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 148 | 9 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
static const int MAX = 200000;
int main(int argc, char *argv[]) {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -200000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
static const int MAX = 200000;
int main(int argc, char *argv[]) {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22], ["+", 0, 1, 0, 11, 12, 2, 3, 4, 0, 22]] | 1 | 132 | 4 |
#include <bits/stdc++.h>
int main() {
int N;
int max = -1;
int min = 1000001000;
int temp;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> temp;
max = std::max(max, temp - min);
min = std::min(min, temp);
}
std::cout << max << std::endl;
return 0;
} | #include <bits/stdc++.h>
int main() {
int N;
int max = -2000001000;
int min = 2000001000;
int temp;
std::cin >> N;
for (int i = 0; i < N; ++i) {
std::cin >> temp;
max = std::max(max, temp - min);
min = std::min(min, temp);
}
std::cout << max << std::endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 89 | 4 |
// 2???n???200,000
// 1???Rt???10
#include <iostream>
#include <limits>
#include <vector>
int main() {
int N;
std::vector<int> R;
std::cin >> N;
R.resize(N);
for (int i = 0; i < N; ++i) {
std::cin >> R[i];
}
std::vector<int> R_min(N);
std::vector<int> R_max(N);
R_min[0] = R[0];
R_max[N - 1... | // 2???n???200,000
// 1???Rt???10
#include <iostream>
#include <limits>
#include <vector>
int main() {
int N;
std::vector<int> R;
std::cin >> N;
R.resize(N);
for (int i = 0; i < N; ++i) {
std::cin >> R[i];
}
std::vector<int> R_min(N);
std::vector<int> R_max(N);
R_min[0] = R[0];
R_max[N - 1... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 16, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 258 | 4 |
#include <cstdio>
int main() {
int num;
scanf("%d", &num);
int *prices = new int[num];
for (int i = 0; i < num; i++) {
int input;
scanf("%d", &input);
prices[i] = input;
}
int maxProfit = prices[1] - prices[0];
if (num == 2) {
printf("%d\n", maxProfit);
return 0;
}
int minPrice... | #include <cstdio>
int main() {
int num;
scanf("%d", &num);
int *prices = new int[num];
for (int i = 0; i < num; i++) {
int input;
scanf("%d", &input);
prices[i] = input;
}
int maxProfit = prices[1] - prices[0];
if (num == 2) {
printf("%d\n", maxProfit);
return 0;
}
int minPrice... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 200 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int MAX = 200000;
int r[MAX], n;
for (int i = 0; i < n; i++) {
cin >> r[i];
}
int maxdiff = -1000000000;
int minnum = r[0];
for (int i = 1; i < n; i++) {
maxdiff = max(maxdiff, r[i] - minnum);
minnum = min(minnum,... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int MAX = 200000;
int r[MAX], n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r[i];
}
int maxdiff = -1000000000;
int minnum = r[0];
for (int i = 1; i < n; i++) {
maxdiff = max(maxdiff, r[i] - minnum);
minnum ... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 114 | 4 |
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_D
#include <iostream>
using namespace std;
int max(int x, int y) {
if (x > y)
return x;
else
return y;
}
int min(int x, int y) {
if (x > y)
return y;
else
return x;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i... | // http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_D
#include <iostream>
using namespace std;
int max(int x, int y) {
if (x > y)
return x;
else
return y;
}
int min(int x, int y) {
if (x > y)
return y;
else
return x;
}
int main() {
int N;
cin >> N;
int A[N];
for (int i... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 167 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int n, R[MAX];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int maxv = -200000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int n, R[MAX];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int maxv = -2000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(m... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 117 | 2 |
#include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int mn = t;
int ret = 0;
for (int i = 1; i < n; ++i) {
cin >> t;
ret = max(ret, t - mn);
mn = min(mn, t);
... | #include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t;
cin >> n >> t;
int mn = t;
int ret = -INT_MAX;
for (int i = 1; i < n; ++i) {
cin >> t;
ret = max(ret, t - mn);
mn = min(mn,... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 17, 33], ["+", 8, 9, 0, 43, 49, 50, 51, 91, 28, 22]] | 1 | 94 | 3 |
#include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int num;
int input;
int lst[200000];
int small;
int large;
int maximum;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> lst[i];
}
maximum = -20000000;
small = lst[0];
large = lst[0];
for (int i = 0; i < num... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int num;
int input;
int lst[200000];
int small;
int large;
int maximum;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> lst[i];
}
maximum = -2000000000;
small = lst[0];
large = lst[0];
for (int i = 1; i < n... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 129 | 4 |
#include <iostream>
#include <vector>
std::vector<int> GetInput() {
int n = 0;
std::vector<int> values;
std::cin >> n;
values.resize(n, 0.0);
for (auto it = values.begin(); it < values.end(); it++) {
std::cin >> *it;
}
return values;
}
int main(int argc, char const *argv[]) {
auto values = GetIn... | #include <iostream>
#include <vector>
std::vector<int> GetInput() {
int n = 0;
std::vector<int> values;
std::cin >> n;
values.resize(n, 0.0);
for (auto it = values.begin(); it < values.end(); it++) {
std::cin >> *it;
}
return values;
}
int main(int argc, char const *argv[]) {
auto values = GetIn... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 251 | 2 |
#include <iostream>
using namespace std;
int main() {
int R[200000], n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> R[i];
}
int maxvalue = -2000000;
int minvalue = R[0];
for (int i = 0; i < n; ++i) {
maxvalue = max(maxvalue, R[i] - minvalue);
minvalue = min(minvalue, R[i]);
}
cout <<... | #include <iostream>
using namespace std;
int main() {
int R[200000], n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> R[i];
}
int maxvalue = -2000000000;
int minvalue = R[0];
for (int i = 1; i < n; ++i) {
maxvalue = max(maxvalue, R[i] - minvalue);
minvalue = min(minvalue, R[i]);
}
cout... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 111 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000000000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv =... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -MAX * MAX;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 91, 17, 33], ["+", 0, 43, 49, 50, 51, 16, 31, 91, 28, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 22]] | 1 | 118 | 5 |
#include <bits/stdc++.h>
using namespace std;
#define REP(asd, fgh) for (int asd = 0; asd < fgh; asd++)
#define MAX_N 200000
class RMinQ {
public:
int n;
int data[MAX_N * 2 - 1];
void init() {
for (int i = 0; i < 2 * n - 1; i++) {
data[i] = INT_MAX;
}
}
void update(int i, int x) {
i += n -... | #include <bits/stdc++.h>
using namespace std;
#define REP(asd, fgh) for (int asd = 0; asd < fgh; asd++)
#define MAX_N 200000
class RMinQ {
public:
int n;
int data[MAX_N * 2 - 1];
void init() {
for (int i = 0; i < 2 * n - 1; i++) {
data[i] = INT_MAX;
}
}
void update(int i, int x) {
i += n -... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 12, 13], ["+", 0, 16, 12, 2, 3, 4, 0, 118, 28, 22], ["+", 0, 16, 12, 2, 3, 4, 0, 118, 17, 131]] | 1 | 408 | 6 |
#include <stdio.h>
int main() {
int n = 0;
int curR = 0;
int maxR = 1;
int minR = 10 ^ 9;
int difR = 0;
int difRmax = maxR - minR;
scanf("%d", &n);
scanf("%d", &minR);
for (int i = 1; i < n; ++i) {
scanf("%d", &curR);
difR = curR - minR;
if (difR > difRmax)
difRmax = difR;
if ... | #include <stdio.h>
int main() {
int n = 0;
int curR = 0;
int maxR = 0;
int minR = 1000000000;
int difR = 0;
int difRmax = maxR - minR;
scanf("%d", &n);
scanf("%d", &minR);
for (int i = 1; i < n; ++i) {
scanf("%d", &curR);
difR = curR - minR;
if (difR > difRmax)
difRmax = difR;
... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 13], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 17, 140], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 127 | 6 |
#include <bits/stdc++.h>
using namespace std;
static const int MAX = 200000;
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000;
int minv = R[0];
for (int i = 1; i < n - 1; i++) {
maxv = max(R[i] - minv, maxv);
minv = min(R[i], minv);
}
cout... | #include <bits/stdc++.h>
using namespace std;
static const int MAX = 200000;
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(R[i] - minv, maxv);
minv = min(R[i], minv);
}
cout << ... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 118 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = R[1] - R[0];
int minv = R[0];
for (int j = 1; j < n; j++) {
maxv = max(maxv, R[j]);
minv = min(minv, R[j]);
... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = R[1] - R[0];
int minv = R[0];
for (int j = 1; j < n; j++) {
maxv = max(maxv, R[j] - minv);
minv = min(minv, R... | [["+", 0, 11, 12, 2, 3, 4, 0, 16, 17, 33], ["+", 0, 11, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 124 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 20000;
int main() {
/* code */
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++) {
/* code */
cin >> R[i];
}
int maxv = R[1] - R[0];
int minv = R[0];
for (int i = 2; i < n; i++) {
/* code */
maxv =... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 2000000;
// unsolved
int main() {
/* code */
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; i++) {
/* code */
cin >> R[i];
}
int maxv = R[1] - R[0];
int minv = R[0];
for (int i = 1; i < n; i++) {
/* cod... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 131 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int m;
cin >> n;
int maxv = -1000000000;
int minv = 1000000000;
for (int i = 1; i < n; i++) {
cin >> m;
maxv = max(maxv, m - minv);
minv = min(minv, m);
}
cout << maxv << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
int m;
cin >> n;
int maxv = -2000000000;
int minv = 2000000000;
for (int i = 0; i < n; i++) {
cin >> m;
maxv = max(maxv, m - minv);
minv = min(minv, m);
}
cout << maxv << endl;
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 83 | 6 |
#include <iostream>
int main() {
int n;
while (std::cin >> n) {
int *array = new int[n];
for (int i = 1; i < n; i++) {
std::cin >> array[i];
}
int maxv = array[1] - array[0];
int minj;
if (maxv < 0) {
minj = array[1];
} else {
minj = array[0];
}
for (int j = 2... | #include <iostream>
int main() {
int n;
while (std::cin >> n) {
int *array = new int[n];
for (int i = 0; i < n; i++) {
std::cin >> array[i];
}
int maxv = array[1] - array[0];
int minj;
if (maxv < 0) {
minj = array[1];
} else {
minj = array[0];
}
for (int j = 2... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 175 | 2 |
#include <cstdio>
using namespace std;
int main() {
int bottom, benefit, N, rt;
scanf("%d", &N);
scanf("%d", &rt);
bottom = rt;
scanf("%d", &rt);
benefit = rt - bottom;
if (rt < bottom)
bottom = rt;
for (int i = 1; i < N; ++i) {
scanf("%d", &rt);
if (benefit < rt - bottom)
benefit =... | #include <cstdio>
using namespace std;
int main() {
int bottom, benefit, N, rt;
scanf("%d", &N);
scanf("%d", &rt);
bottom = rt;
scanf("%d", &rt);
benefit = rt - bottom;
if (rt < bottom)
bottom = rt;
for (int i = 2; i < N; ++i) {
scanf("%d", &rt);
if (benefit < rt - bottom)
benefit ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 134 | 2 |
#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
//// < "D:\D_Download\Visual Studio
///2015\Projects\programing_contest_c++\Debug\a.txt" > "D:... | [["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 1 | 126 | 2 |
//#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | //#define _GRIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// ?????¬???????????¬??????
#pragma region MACRO
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define PED cout << "\n"
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, x, n) for (int i = x; i < (int)n; ++i)
#define rep... | [["-", 0, 14, 8, 9, 0, 14, 49, 53, 49, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]] | 1 | 592 | 5 |
#include <iostream>
using namespace std;
#define NUMBER 200000
int main() {
int ary[NUMBER];
int min_register[NUMBER];
/*
for(int i = 0; i < NUMBER; i++){
ary[i] = -1;
min_register[i] = -1;
}
*/
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ary[i];
}
int min ... |
#include <iostream>
using namespace std;
#define NUMBER 200000
int main() {
int ary[NUMBER];
int min_register[NUMBER];
/*
for(int i = 0; i < NUMBER; i++){
ary[i] = -1;
min_register[i] = -1;
}
*/
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> ary[i];
}
int min ... | [["+", 12, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 12, 16, 12, 69, 341, 342, 0, 16, 12, 13], ["+", 75, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 75, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 171 | 4 |
#include <iostream>
using namespace std;
int main() {
int n, max, min, r[200000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r[i];
}
min = r[0];
max = 0x80000000; // 0x80000000???????????´??° (-2147483648)
for (int i = 0; i < n; i++) {
if ((r[i] - min) > max) {
max = r[i] - min;
... | #include <iostream>
using namespace std;
int main() {
int n, max, min, r[200000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> r[i];
}
min = r[0];
max = 0x80000000; // 0x80000000???????????´??° (-2147483648)
for (int i = 1; i < n;
i++) { // min???r[0]????????????????????§1????????????????... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 133 | 3 |
#include <iostream>
using namespace std;
int max_value(int maxv, int max) {
if (maxv > max) {
return maxv;
} else {
return max;
}
}
int min_value(int minv, int min) {
if (minv < min) {
return minv;
} else {
return min;
}
}
int main() {
int i, n, r[200000];
cin >> n;
for (i = 0; i... | #include <iostream>
using namespace std;
int max_value(int maxv, int max) {
if (maxv > max) {
return maxv;
} else {
return max;
}
}
int min_value(int minv, int min) {
if (minv < min) {
return minv;
} else {
return min;
}
}
int main() {
int i, n, r[200000];
cin >> n;
for (i = 0; i... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 1 | 167 | 2 |
#include <algorithm>
#include <iostream>
int main() {
using namespace std;
const int MAX = 20000000;
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> R[i];
}
int maxv = -1000;
int minv = R[0];
for (int i = 1; i < n; ++i) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[... | #include <algorithm>
#include <iostream>
int main() {
using namespace std;
const int MAX = 200000;
int R[MAX], n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> R[i];
}
int maxv = -2000000000;
int minv = R[0];
for (int i = 1; i < n; ++i) {
maxv = max(maxv, R[i] - minv);
minv = min(minv... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 119 | 4 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int t;
cin >> t;
v[i] = t;
}
int maxv = v[1] - v[0], minv = v[0];
for (int i = 1; i < n - 1; i++) {
maxv = max(maxv, v[i... | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
int t;
cin >> t;
v[i] = t;
}
int maxv = v[1] - v[0], minv = v[0];
for (int i = 1; i < n - 0; i++) {
maxv = max(maxv, v[i... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 135 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, R[200000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int maxv = R[1] - R[0];
int minv = R[0];
for (int i = 0; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[i]);
}
cout << max... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, R[200000];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int maxv = R[1] - R[0];
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[i]);
}
cout << max... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 118 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int R[200000], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000;
int minv = R[0];
for (int i = 0; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[i]);
}
cout << maxv ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int R[200000], n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int maxv = -2000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[i]);
}
cout << maxv ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 111 | 2 |
#include <algorithm>
#include <iostream>
using namespace std;
template <typename T, typename U> void dmax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U> void dmin(T &x, U y) {
if (x > y)
x = y;
}
const int INF = 1001001001;
int main() {
int x;
int max_p = -INF, min_v;
cin >> min... | #include <algorithm>
#include <iostream>
using namespace std;
template <typename T, typename U> void dmax(T &x, U y) {
if (x < y)
x = y;
}
template <typename T, typename U> void dmin(T &x, U y) {
if (x > y)
x = y;
}
const int INF = 1001001001;
int main() {
int x, n;
int max_p = -INF, min_v;
cin >> ... | [["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 128 | 4 |
#include <stdio.h>
int main(void) {
int r[200000], n, min, p, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
for (i = 0; i < n; i++) {
if (i > 0) {
if (r[i] - min > p) {
p = r[i] - min;
} else if (r[i] < min) {
min = r[i];
}
} else {
m... | #include <stdio.h>
int main(void) {
int r[200000], n, min, p = -999999999, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &r[i]);
}
for (i = 0; i < n; i++) {
if (i > 0) {
if (r[i] - min > p) {
p = r[i] - min;
}
if (r[i] < min) {
min = r[i];
}
} ... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["-", 0, 57, 64, 9, 0, 57, 75, 76, 0, 95]] | 1 | 148 | 3 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int minv = a[0], maxv = a[1] - a[0];
for (int j = 0; j < n; j++) {
maxv = max(maxv, a[j] - minv);
minv = min(minv, a[j]);
}
cout << ma... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int minv = a[0], maxv = a[1] - a[0];
for (int j = 1; j < n; j++) {
maxv = max(maxv, a[j] - minv);
minv = min(minv, a[j]);
}
cout << ma... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 123 | 2 |
#include <algorithm>
#include <climits>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map> //pair is also included in this library
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, s, n) for (int i = (int)... | #include <algorithm>
#include <climits>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map> //pair is also included in this library
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define REP(i, s, n) for (int i = (int)... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 43, 49, 50, 51, 16, 31, 91, 17, 33], ["+", 0, 43, 49, 50, 51, 16, 31, 91, 28, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 17, 48], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 161 | 5 |
#include <iostream>
#include <stdio.h>
using namespace std;
static const int MAX_COUNT = 20000;
int main() {
int n;
int R[MAX_COUNT];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int max = R[1] - R[0];
int min = R[0];
for (int i = 2; i < n; i++) {
if (max < R[i] - min)
max ... | #include <iostream>
#include <stdio.h>
using namespace std;
static const int MAX_COUNT = 200000;
int main() {
int n;
int R[MAX_COUNT];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int max = R[1] - R[0];
int min = R[0];
for (int i = 1; i < n; i++) {
if (max < R[i] - min)
max... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 139 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int n, R[MAX];
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int minv = R[0];
int maxv = R[1] - R[0];
for (int i = 0; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[i])... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int n, R[MAX];
cin >> n;
for (int i = 0; i < n; i++)
cin >> R[i];
int minv = R[0];
int maxv = R[1] - R[0];
for (int i = 1; i < n; i++) {
maxv = max(maxv, R[i] - minv);
minv = min(minv, R[i])... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 126 | 2 |
#include <stdio.h>
int main(void) {
int i = 0;
int n = 0;
int min;
int now;
int max_margin = -2147483648;
int margin;
scanf("%d", &n);
scanf("%d", &min);
for (i = 1; i < n; i++) {
scanf("%d", now);
margin = now - min;
if (margin > max_margin) {
max_margin = margin;
}
if (no... | #include <stdio.h>
int main(void) {
int i = 0;
int n = 0;
int min;
int now;
int max_margin = -2147483648;
int margin;
scanf("%d", &n);
scanf("%d", &min);
for (i = 1; i < n; i++) {
scanf("%d", &now);
margin = now - min;
if (margin > max_margin) {
max_margin = margin;
}
if (n... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 120 | 1 |
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAX = 200010;
int n;
int R[MAX];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
int mi = R[0];
int ans = -1;
for (int i... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int MAX = 200010;
int n;
int R[MAX];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &R[i]);
}
int mi = R[0];
int ans = -2000000000;
f... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 147 | 2 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int r[n];
for (int i = 0; i < n; ++i) {
cin >> r[i];
}
int maxv = -1000000000;
int minv = r[0];
for (int i = 0; i < n; ++i) {
maxv = max(maxv, r[i] - minv);
minv = min(minv, r[i]);
}
cout << maxv << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int r[n];
for (int i = 0; i < n; ++i) {
cin >> r[i];
}
int maxv = -1000000000;
int minv = r[0];
for (int i = 1; i < n; ++i) {
maxv = max(maxv, r[i] - minv);
minv = min(minv, r[i]);
}
cout << maxv << endl;
ret... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 112 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, a, b, max, min;
cin >> n >> a >> b;
max = b - a;
min = a;
if (a > b)
b = a;
for (int i = 1; i < n - 1; i++) {
cin >> a;
if (max < a - min)
max = a - min;
if (min > a)
min = a;
}
cout << max << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b, max, min;
cin >> n >> a >> b;
max = b - a;
min = a;
if (a > b)
min = b;
for (int i = 1; i < n - 1; i++) {
cin >> a;
if (max < a - min)
max = a - min;
if (min > a)
min = a;
}
cout << max << endl;
return 0;
} | [["-", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 22]] | 1 | 106 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int a = 200000;
int num;
cin >> num;
int p[a];
for (int i = 0; i < num; i++) {
cin >> p[i];
}
int minc = p[0];
int maxc = p[1] - p[0];
for (int i = 0; i < num; i++) {
maxc = max(maxc, p[i] - minc);
minc = min(... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
const int a = 200000;
int num;
cin >> num;
int p[a];
for (int i = 0; i < num; i++) {
cin >> p[i];
}
int minc = p[0];
int maxc = p[1] - p[0];
for (int i = 1; i < num; i++) {
maxc = max(maxc, p[i] - minc);
minc = min(... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 128 | 2 |
#include <algorithm>
#include <iostream>
#include <limits>
#include <vector>
#define INT_MAX 2147483647
#define INT_MIN -2147483647
using namespace std;
int main() {
int maxProf = -2000000000;
int minVal = 0;
cin >> minVal;
int val = 0;
while (cin >> val) {
maxProf = std::max(maxProf, val - minVal);
... | #include <algorithm>
#include <iostream>
#include <limits>
#include <vector>
#define INT_MAX 2147483647
#define INT_MIN -2147483647
using namespace std;
int main() {
int maxProf = -2000000000;
int minVal = 0;
cin >> minVal;
cin >> minVal;
int val = 0;
while (cin >> val) {
maxProf = std::max(maxProf, v... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 84 | 4 |
#include <stdio.h>
#define INF 1000000000
const int N = 200000;
int main() {
int n, r[N + 1];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &r[i]);
r[n] = 0;
int min = r[0], max = r[0], ans = -INF;
for (int i = 0; i <= n; i++) {
if (r[i] <= min) {
if (max == min) {
if (r[... | #include <stdio.h>
#define INF 1000000000
const int N = 200000;
int main() {
int n, r[N + 1];
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &r[i]);
r[n] = -INF;
int min = r[0], max = r[0], ans = -INF;
for (int i = 1; i <= n; i++) {
if (r[i] <= min) {
if (max == min) {
if ... | [["-", 0, 14, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 1, 0, 11, 12, 91, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 91, 28, 22], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 209 | 5 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main(int argc, const char *argv[]) {
int R[MAX];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int maxv = -20000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max... | #include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main(int argc, const char *argv[]) {
int R[MAX];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> R[i];
}
int maxv = -2000000000;
int minv = R[0];
for (int i = 1; i < n; i++) {
maxv = max(... | [["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 130 | 2 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long int n;
long int num[200000];
long int max = -1000000000;
long int min = 1000000000;
long int sub;
long int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> num[i];
}
min = num[0];
for (i = 1; i < n; i++) {
sub = num... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long int n;
long int num[200000];
long int max = -1000000000;
long int min = 1000000000;
long int sub;
long int i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> num[i];
}
min = num[0];
for (i = 1; i < n; i++) {
sub = nu... | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 141 | 2 |
#include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int a[MAX], n;
cin >> n;
int max, tmp;
int min;
max = -1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
for (int i = 1; i < n; i++) {
tmp = a[i] - min;
if (max < tmp) {
max = tm... | #include <iostream>
using namespace std;
static const int MAX = 200000;
int main() {
int a[MAX], n;
cin >> n;
int max, tmp;
int min;
max = -1000000000;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
min = a[0];
for (int i = 1; i < n; i++) {
tmp = a[i] - min;
if (max < tmp) {
max = tm... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47]] | 1 | 134 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.