problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03136
|
gets;
v=gets.split.map(&:to_i);
p v.sum() < v.max() * 2 ? "Yes" : "No"
|
gets;
v=gets.split.map(&:to_i);
print v.reduce(:+) > v.max() * 2 ? "Yes" : "No"
|
[
"call.function.change",
"io.output.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 936,652
| 936,650
|
u702482655
|
ruby
|
p03136
|
gets
ls = gets.chomp.split(' ').map(&:to_i)
longest = ls.max
others = ls.delete_at(ls.index(longest))
puts others.reduce(:+) > longest ? 'Yes' : 'No'
|
gets
ls = gets.chomp.split(' ').map(&:to_i)
longest = ls.max
ls.delete_at(ls.index(longest))
puts ls.reduce(:+) > longest ? 'Yes' : 'No'
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 937,009
| 937,010
|
u985283997
|
ruby
|
p03136
|
n = gets.chomp.to_i
l = gets.chomp.split.map(&:to_i)
if l.inject(:+) - l.max > 0 then puts "Yes" else puts "no" end
|
n = gets.chomp.to_i
l = gets.chomp.split.map(&:to_i)
if l.inject(:+) - l.max * 2 > 0 then puts "Yes" else puts "No" end
|
[
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 937,110
| 937,111
|
u411903982
|
ruby
|
p03137
|
N,M = gets.chomp.split.map(&:to_i)
Xs = gets.chomp.split.map(&:to_i).sort
dist = []
x_pre = Xs[0]
Xs.each do |x|
dist.push((x_pre - x).abs)
x_pre = x
end
dist.shift
if N > M
ans = 0
else
dist.sort!.reverse!
(N-1).times{dist.shift}
ans = dist.inject(:+)
end
puts ans
|
N,M = gets.chomp.split.map(&:to_i)
Xs = gets.chomp.split.map(&:to_i).sort
dist = []
x_pre = Xs[0]
Xs.each do |x|
dist.push((x_pre - x).abs)
x_pre = x
end
dist.shift
if N >= M
ans = 0
else
dist.sort!.reverse!
(N-1).times{dist.shift}
ans = dist.inject(:+)
end
puts ans
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 937,249
| 937,250
|
u191196346
|
ruby
|
p03137
|
# https://atcoder.jp/contests/abc117/tasks/abc117_c
N, M = gets.split.map(&:to_i)
Xs = gets.split.map(&:to_i)
if N >= M
puts "0"
exit
end
Xs.sort!
D = Xs.last - Xs.first
ds = Xs.each_cons(2).map { |x1, x2| x2 - x1 }.sort.reverse
ans = D - ds.take(N - 1).reduce(&:+)
puts ans
|
# https://atcoder.jp/contests/abc117/tasks/abc117_c
N, M = gets.split.map(&:to_i)
Xs = gets.split.map(&:to_i)
if N >= M
puts "0"
exit
end
Xs.sort!
D = Xs.last - Xs.first
ds = Xs.each_cons(2).map { |x1, x2| x2 - x1 }.sort.reverse
ans = D - (ds.take(N - 1).reduce(&:+) || 0)
puts ans
|
[] | 937,511
| 937,512
|
u091367113
|
ruby
|
p03137
|
n,m=gets.chomp.split(" ").map(&:to_i)
x=gets.chomp.split(" ").map(&:to_i)
if m==1
puts 0
else
x.sort!
ans=x[m-1]-x[0]
dis=[]
(m-1).times do|i|
dis.push(x[i+1]-x[i])
end
dis.sort!.reverse!
(n-1).times do|i|
ans-=dis[i]
end
puts ans
end
|
n,m=gets.chomp.split(" ").map(&:to_i)
x=gets.chomp.split(" ").map(&:to_i)
if m==1 or n>m
puts 0
else
x.sort!
ans=x[m-1]-x[0]
dis=[]
(m-1).times do|i|
dis.push(x[i+1]-x[i])
end
dis.sort!.reverse!
(n-1).times do|i|
ans-=dis[i]
end
puts ans
end
|
[
"control_flow.branch.if.condition.change"
] | 937,559
| 937,560
|
u415400221
|
ruby
|
p03137
|
MOD=10**9+7
cnt=0; sum=0; prev=nil; h=Hash.new(0)
def gs() gets.chomp end
def gi() gets.to_i end
def gsmi() gets.chomp.split.map(&:to_i) end
def desc(ar) ar.sort!{|x,y|y<=>x} end
def min(a,b) a<=b ? a : b end
def max(a,b) a>=b ? a : b end
def puts_yesno(can) puts(can ? 'Yes' : 'No') end
def putsend(s) puts s; exit end
def debug(k,v) puts "#{k}:#{v}" end
########### ( ˘ω˘ )ｽﾔｧ… ###########
n, m = gsmi
x = gsmi.sort
if n>=m
putsend 0
end
# 点間の移動しない距離を最大化する
blank = []
(m-1).times do |i|
blank << x[i+1]-x[i]
end
puts (x[-1]-x[0])-blank.max(n-1).inject(:+)
|
MOD=10**9+7
cnt=0; sum=0; prev=nil; h=Hash.new(0)
def gs() gets.chomp end
def gi() gets.to_i end
def gsmi() gets.chomp.split.map(&:to_i) end
def desc(ar) ar.sort!{|x,y|y<=>x} end
def min(a,b) a<=b ? a : b end
def max(a,b) a>=b ? a : b end
def puts_yesno(can) puts(can ? 'Yes' : 'No') end
def putsend(s) puts s; exit end
def debug(k,v) puts "#{k}:#{v}" end
########### ( ˘ω˘ )ｽﾔｧ… ###########
n, m = gsmi
x = gsmi.sort
if n>=m
putsend 0
end
# 点間の移動しない距離を最大化する
blank = []
(m-1).times do |i|
blank << x[i+1]-x[i]
end
puts (x[-1]-x[0])-blank.max(n-1).inject(:+).to_i
|
[
"call.add"
] | 937,822
| 937,823
|
u385631112
|
ruby
|
p03137
|
n, m = gets.split.map &:to_i
x = gets.split.map &:to_i
if m <= n then
puts 0
exit
end
x = x.sort
diff = []
(0...x.size - 1).each{ |i|
diff << x[i+1] - x[i]
}
diff = diff.sort.reverse
puts x[-1] - x[0] - diff[0...(n-1)].inject(:+)
|
n, m = gets.split.map &:to_i
x = gets.split.map &:to_i
if m <= n then
puts 0
exit
end
x = x.sort
diff = []
(0...x.size - 1).each{ |i|
diff << x[i+1] - x[i]
}
diff = diff.sort.reverse
puts x[-1] - x[0] - diff[0...(n-1)].inject(0, :+)
|
[
"call.arguments.add"
] | 937,858
| 937,859
|
u874414087
|
ruby
|
p03137
|
n, m = gets.split.map &:to_i
x = gets.split.map &:to_i
if m <= n then
puts 0
exit
end
x = x.sort
diff = []
(0...x.size - 1).each{ |i|
diff << x[i+1] - x[i]
}
diff = diff.sort.reverse
puts x[-1] - x[0] - diff[0...n].inject(:+)
|
n, m = gets.split.map &:to_i
x = gets.split.map &:to_i
if m <= n then
puts 0
exit
end
x = x.sort
diff = []
(0...x.size - 1).each{ |i|
diff << x[i+1] - x[i]
}
diff = diff.sort.reverse
puts x[-1] - x[0] - diff[0...(n-1)].inject(0, :+)
|
[
"call.arguments.change",
"call.arguments.add"
] | 937,860
| 937,859
|
u874414087
|
ruby
|
p03137
|
n,m=gets.split.map(&:to_i)
x=gets.split.map(&:to_i).sort
puts x[1..-1].map.with_index {|m,i| m - x[i]}.sort[0..n].inject(:+).to_i
|
n,m=gets.split.map(&:to_i)
x=gets.split.map(&:to_i).sort
puts x[1..-1].map.with_index {|m,i| m - x[i]}.sort[0..-n].inject(:+).to_i
|
[
"call.arguments.change"
] | 937,908
| 937,909
|
u098870186
|
ruby
|
p03137
|
N, M = gets.split.map(&:to_i)
x = gets.split.map(&:to_i).sort
if N >= M
puts 0
exit
end
diff = []
0.upto(M-2) do |i|
diff << x[i + 1] - x[i]
end
p diff.sort[0..N].inject(:+)
|
N, M = gets.split.map(&:to_i)
x = gets.split.map(&:to_i).sort
if N >= M
puts 0
exit
end
diff = []
0.upto(M-2) do |i|
diff << x[i + 1] - x[i]
end
p diff.sort[0..-N].inject(:+)
|
[
"call.arguments.change"
] | 937,922
| 937,923
|
u503890246
|
ruby
|
p03137
|
N, M = gets.split.map(&:to_i)
Xs = gets.split.map(&:to_i).sort
if M <= N
ans = 0
else
p diffs = Xs[1..-1].zip(Xs[0..-2]).map{|x1, x2| x1 - x2}.sort.reverse
ans = diffs[(N-1)..-1].reduce(&:+)
end
puts ans
|
N, M = gets.split.map(&:to_i)
Xs = gets.split.map(&:to_i).sort
if M <= N
ans = 0
else
diffs = Xs[1..-1].zip(Xs[0..-2]).map{|x1, x2| x1 - x2}.sort.reverse
ans = diffs[(N-1)..-1].reduce(&:+)
end
puts ans
|
[
"io.output.change",
"call.remove"
] | 938,051
| 938,052
|
u139858699
|
ruby
|
p03137
|
n, m = gets.split.map(&:to_i)
X = gets.split.map(&:to_i)
sorted = X.sort
diff = []
sorted.each_with_index do |x, i|
next if i == 0
diff[i - 1] = (sorted[i] - sorted[i - 1]).abs
end
sorted_diff = diff.sort.reverse
if n > m
puts 0
else
(n - 1).times do
sorted_diff.shift
end
p sorted_diff.reduce(:+)
end
|
n, m = gets.split.map(&:to_i)
X = gets.split.map(&:to_i)
sorted = X.sort
diff = []
sorted.each_with_index do |x, i|
next if i == 0
diff[i - 1] = (sorted[i] - sorted[i - 1]).abs
end
sorted_diff = diff.sort.reverse
if n >= m
puts 0
else
(n - 1).times do
sorted_diff.shift
end
p sorted_diff.reduce(:+)
end
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,191
| 938,192
|
u237620737
|
ruby
|
p03137
|
n, m = gets.split.map(&:to_i)
xs = gets.split.map(&:to_i).sort
if n > m
puts 0
exit
end
diffs = (xs.size - 1).times.map { |i| xs[i + 1] - xs[i] }.sort
puts diffs[0..-n].inject(&:+)
|
n, m = gets.split.map(&:to_i)
xs = gets.split.map(&:to_i).sort
if n >= m
puts 0
exit
end
diffs = (xs.size - 1).times.map { |i| xs[i + 1] - xs[i] }.sort
puts diffs[0..-n].inject(&:+)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,193
| 938,194
|
u701090323
|
ruby
|
p03137
|
n,m = gets.chomp.split(' ').map(&:to_i)
if n >= m
puts 0
else
places = gets.chomp.split(' ').map(&:to_i).sort
distances = (1..m - 1).map{|i| places[i] - places[i - 1]}.sort
puts distances[0..n].inject(:+)
end
|
n,m = gets.chomp.split(' ').map(&:to_i)
if n >= m
puts 0
else
places = gets.chomp.split(' ').map(&:to_i).sort
distances = (1..m - 1).map{|i| places[i] - places[i - 1]}.sort
puts distances[0..m - n - 1].inject(:+)
end
|
[
"expression.operation.binary.add"
] | 938,367
| 938,368
|
u765878014
|
ruby
|
p03136
|
n = gets.to_i
a = gets.split(" ").map(&:to_i)
b = []
b = a.sort
cnt = 0
b.each do |i|
cnt += i
end
cnt = cnt - b.max
puts cnt
if b.max >= cnt
puts 'No'
else
puts 'Yes'
end
|
n = gets.to_i
a = gets.split(" ").map(&:to_i)
b = []
b = a.sort
cnt = 0
b.each do |i|
cnt += i
end
cnt = cnt - b.max
if b.max >= cnt
puts 'No'
else
puts 'Yes'
end
|
[
"call.remove"
] | 938,600
| 938,601
|
u135201316
|
ruby
|
p03136
|
n = gets.to_i
a = gets.split(" ").map(&:to_i)
b = []
b = a.sort
cnt = 0
b.each do |i|
cnt += i
end
cnt = cnt - b.max
if b.max >= cnt
puts 'NO'
else
puts 'YES'
end
|
n = gets.to_i
a = gets.split(" ").map(&:to_i)
b = []
b = a.sort
cnt = 0
b.each do |i|
cnt += i
end
cnt = cnt - b.max
if b.max >= cnt
puts 'No'
else
puts 'Yes'
end
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 938,602
| 938,601
|
u135201316
|
ruby
|
p03136
|
def get_int
gets.to_i
end
def get_int_array
gets.chomp.split(' ').map(&:to_i)
end
def main
ls = get_int_array
longest = ls.max
sum = ls.inject(:+) - longest
puts longest < sum ? 'Yes' : 'No'
end
main
|
def get_int
gets.to_i
end
def get_int_array
gets.chomp.split(' ').map(&:to_i)
end
def main
n = get_int
ls = get_int_array
longest = ls.max
sum = ls.inject(:+) - longest
puts longest < sum ? 'Yes' : 'No'
end
main
|
[
"assignment.add"
] | 938,624
| 938,625
|
u037631042
|
ruby
|
p03137
|
n,m=gets.split.map(&:to_i)
if m-n >0
puts gets.split.map(&:to_i).sort.each_cons(2).map{|e| (e[0]-e[1])}.sort.take(m-n).inject(:+)
else
gets
puts 0
end
|
n,m=gets.split.map(&:to_i)
if m-n >0
puts gets.split.map(&:to_i).sort.each_cons(2).map{|e| (e[1]-e[0])}.sort.take(m-n).inject(:+)
else
gets
puts 0
end
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 938,632
| 938,633
|
u308416164
|
ruby
|
p03137
|
n, m = gets.chomp.split(" ").map(&:to_i)
x = gets.chomp.split(" ").map(&:to_i)
ans =0
sum = 0
l = []
if n>=m
ans =0
end
x = x.sort
path = x[m-1] - x[0]
# puts path
(0 .. m-2).each do |i|
l << x[i+1] - x[i]
end
l = l.sort
(0 .. n-2).each do |i|
sum += l[l.length-1-i]
end
puts path - sum
|
n, m = gets.chomp.split(" ").map(&:to_i)
x = gets.chomp.split(" ").map(&:to_i)
ans =0
sum = 0
l = []
if n>=m
ans =0
else
x = x.sort
path = x[m-1] - x[0]
(0 .. m-2).each do |i|
l << x[i+1] - x[i]
end
l = l.sort
(0 .. n-2).each do |i|
sum += l[l.length-1-i]
end
ans = path - sum
end
puts ans
|
[
"assignment.variable.change",
"call.add"
] | 938,659
| 938,660
|
u074306398
|
ruby
|
p03137
|
n, m = gets.split.map(&:to_i)
points = gets.split.map(&:to_i).sort
if n > m
p 0
exit 0
end
gaps = []
(points.count - 1).times do |index| #100000
gaps.push(points[index + 1] - points[index])
end
gaps.sort!.reverse!
p gaps.drop(n - 1).inject(:+)
|
n, m = gets.split.map(&:to_i)
points = gets.split.map(&:to_i).sort
if n >= m
p 0
exit 0
end
gaps = []
(points.count - 1).times do |index| #100000
gaps.push(points[index + 1] - points[index])
end
gaps.sort!.reverse!
p gaps.drop(n - 1).inject(:+)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,690
| 938,691
|
u105001881
|
ruby
|
p03137
|
k,n,*a=`dd`.split.map &:to_i
p k>=n ? 0 : a.each_cons(2).map{|x,y|y-x}.min(n-k).reduce(:+)
|
k,n,*a=`dd`.split.map &:to_i;a.sort!;p k>=n ? 0 : a.each_cons(2).map{|x,y|y-x}.min(n-k).reduce(:+)
|
[] | 938,739
| 938,740
|
u280667879
|
ruby
|
p03138
|
n, m = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
x = []
a.each do |i|
i.to_s(2).chars.reverse.each_with_index do |j, k|
if j == '1'
x[k] ||= 0
x[k] += 1
else
x[k] ||= 0
end
end
end
sum = 0
(0...(m.to_s(2).length)).reverse_each do |i|
sum += 2**i if (x[i] == nil || x[i] <= n/2.0) && sum + 2**i < m
end
puts a.map{|i| i ^ sum}.inject(:+)
|
n, m = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
x = []
a.each do |i|
i.to_s(2).chars.reverse.each_with_index do |j, k|
if j == '1'
x[k] ||= 0
x[k] += 1
else
x[k] ||= 0
end
end
end
sum = 0
(0...(m.to_s(2).length)).reverse_each do |i|
sum += 2**i if (x[i] == nil || x[i] <= n/2.0) && sum + 2**i <= m
end
puts a.map{|i| i ^ sum}.inject(:+)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 938,930
| 938,931
|
u208436761
|
ruby
|
p03138
|
N, K = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
D = 40
#dp[i][j] = 上位からibit目までの数を確定させたときに得たスコアの最大値
#j=1:上位ibitがKと一致， j=0:それ以外
dp = Array.new(D+1){Array.new(2, -1)}
dp[0][1] = 0
#dp[i][.]からdp[i+1][.]を計算する
0.upto(D-1) do |i|
mask = 1 << (D-i-1)
#A1,...ANの(i+1)bit目に1が何個あるか
num = 0
N.times do |j|
num +=1 if mask & a[j] > 0
end
#i+1bit目を0,1にしたときに得るスコアを計算
c = [num*mask, (N-num)*mask]
#i+1bit目がKと一致するとき
dp[i+1][1] = dp[i][1] + ((K & mask >0)? c[1] : c[0] )
#i+1bit目がKと一致しないとき
if K & mask > 0 #このような状況が起こりうる条件
dp[i+1][0] = dp[i][1] + c[0]
if dp[i][0] != -1
dp[i+1][0] = [
dp[i+1][0],
dp[i][0] + [c[0],c[1]].max
].max
end
end
end
puts [dp[D][0],dp[D][1]].max
|
N, K = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
D = 40
#dp[i][j] = 上位からibit目までの数を確定させたときに得たスコアの最大値
#j=1:上位ibitがKと一致， j=0:それ以外
dp = Array.new(D+1){Array.new(2, -1)}
dp[0][1] = 0
#dp[i][.]からdp[i+1][.]を計算する
0.upto(D-1) do |i|
mask = 1 << (D-i-1)
#A1,...ANの(i+1)bit目に1が何個あるか
num = 0
N.times do |j|
num +=1 if mask & a[j] > 0
end
#i+1bit目を0,1にしたときに得るスコアを計算
c = [num*mask, (N-num)*mask]
#i+1bit目がKと一致するとき
dp[i+1][1] = dp[i][1] + ((K & mask >0)? c[1] : c[0] )
#i+1bit目がKと一致しないとき
#(1) ibit目がKと一致する場合
if K & mask > 0
dp[i+1][0] = dp[i][1] + c[0]
end
#(2) ibit目がKと一致しない場合
if dp[i][0] != -1
dp[i+1][0] = [
dp[i+1][0],
dp[i][0] + [c[0],c[1]].max
].max
end
end
puts [dp[D][0],dp[D][1]].max
|
[] | 939,116
| 939,117
|
u708550576
|
ruby
|
p03138
|
N, K = gets.split.map{|i| i.to_i}
A = gets.split.map{|i| i.to_i}
count = Array.new(40, 0)
binary = Array.new(41)
k = Array.new(40)
ans = Array.new(40)
max = 0
binary[0] = 1
for i in 0..39
binary[i + 1] = binary[i] * 2
k[i] = K % binary[i + 1] / binary[i]
A.each do |a|
count[i] += a % binary[i + 1] / binary[i]
end
if i > Math.log2(K)
ans[i] = 0
else
ans[i] = (count[i] > N / 2) ? 0 : 1
end
max += (N * ans[i] - count[i]).abs * binary[i]
end
for i in 0..39
if k[39 - i] == ans[39 - i]
next
end
if k[39 - i] == 1
break
end
max -= binary[39 - i] * (2 * count[39 - i] - N)
end
puts max
|
N, K = gets.split.map{|i| i.to_i}
A = gets.split.map{|i| i.to_i}
count = Array.new(40, 0)
binary = Array.new(41)
k = Array.new(40)
ans = Array.new(40)
max = 0
binary[0] = 1
for i in 0..39
binary[i + 1] = binary[i] * 2
k[i] = K % binary[i + 1] / binary[i]
A.each do |a|
count[i] += a % binary[i + 1] / binary[i]
end
if i > Math.log2(K)
ans[i] = 0
else
ans[i] = (count[i] > N / 2) ? 0 : 1
end
max += (N * ans[i] - count[i]).abs * binary[i]
end
for i in 0..39
if k[39 - i] == ans[39 - i]
next
end
if k[39 - i] == 1
break
end
max += binary[39 - i] * (2 * count[39 - i] - N)
end
puts max
|
[
"expression.operator.change"
] | 939,598
| 939,599
|
u692254521
|
ruby
|
p03139
|
n,a,b=gets.split.map &:to_i
puts "#{[a,b].min} #{[a,b].max-n+[a,b].min}"
|
n,a,b=gets.split.map &:to_i
puts "#{[a,b].min} #{[[a,b].max-n+[a,b].min,0].max}"
|
[
"literal.string.change",
"call.arguments.change"
] | 940,098
| 940,099
|
u744908753
|
ruby
|
p03139
|
n,a,b=gets.chomp.split(" ").map(&:to_i);
if a >= b then
min = b
else
min = a
end
max = a + b - n
if max <= 0 then
max = 0
end
print("#{max} #{min}\n")
|
n,a,b=gets.chomp.split(" ").map(&:to_i);
if a >= b then
max = b
else
max = a
end
min = a + b - n
if min <= 0 then
min = 0
end
print("#{max} #{min}\n")
|
[
"misc.opposites",
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 940,342
| 940,343
|
u501660472
|
ruby
|
p03139
|
N, A, B=gets.chomp.split(" ").map(&:to_i);
if A>B
C=A
else
C=B
end
if A+B-N >0
D=A+B-N
else
D=0
end
puts "#{C} #{D}"
|
N, A, B=gets.chomp.split(" ").map(&:to_i);
if A>B
C=B
else
C=A
end
if A+B-N >0
D=A+B-N
else
D=0
end
puts "#{C} #{D}"
|
[
"assignment.remove",
"assignment.add"
] | 940,399
| 940,400
|
u602984196
|
ruby
|
p03140
|
n=gets.to_i;a,b,c=$<;s=0;n.times{|i|s+=[a[i],b[i],c[i]].uniq.size-1};p s
|
n=gets.to_i;a,b,c=*$<;s=0;n.times{|i|s+=[a[i],b[i],c[i]].uniq.size-1};p s
|
[] | 940,974
| 940,975
|
u019489252
|
ruby
|
p03141
|
n = gets.to_i
a = Array.new(n){ gets.split.map &:to_i }
a.sort_by! { |a| a[0] + a[1] }
ans = 0
n.times do |i|
if i.even?
ans += a[i][0]
else
ans -= a[i][1]
end
end
puts ans
|
n = gets.to_i
a = Array.new(n){ gets.split.map &:to_i }
a.sort_by! { |a| - a[0] - a[1] }
ans = 0
n.times do |i|
if i.even?
ans += a[i][0]
else
ans -= a[i][1]
end
end
puts ans
|
[
"expression.operation.unary.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 941,021
| 941,022
|
u106964380
|
ruby
|
p03141
|
N = gets.to_i
foods = N.times.map { gets.split.map(&:to_i) }
foods.sort_by! { |a, b| a + b }
sumA = 0
sumB = 0
N.times do |i|
a, b = foods[i]
if i.even?
sumA += a
else
sumB += b
end
end
puts sumA - sumB
|
N = gets.to_i
foods = N.times.map { gets.split.map(&:to_i) }
foods.sort_by! { |a, b| -(a + b) }
sumA = 0
sumB = 0
N.times do |i|
a, b = foods[i]
if i.even?
sumA += a
else
sumB += b
end
end
puts sumA - sumB
|
[] | 941,044
| 941,045
|
u740836226
|
ruby
|
p03141
|
N = gets.to_i
AB = N.times.map{|i|
a, b = gets.split.map(&:to_i)
next [a, -b]
}
p AB.sort_by{|a,b| a-b }.each_with_index.inject(0){|sum,(ab,i)| sum+ab[i%2] }
|
N = gets.to_i
AB = N.times.map{|i|
a, b = gets.split.map(&:to_i)
next [a, -b]
}
p AB.sort_by{|a,b| b-a }.each_with_index.inject(0){|sum,(ab,i)| sum+ab[i%2] }
|
[
"expression.operation.binary.remove"
] | 941,104
| 941,105
|
u977697682
|
ruby
|
p03141
|
N = gets.to_i
AB = N.times.map{|i|
a, b = gets.split.map(&:to_i)
next [a, -b]
}
p AB.sort_by{|a,b| a-b }.each_with_index.inject(0){|sum,(ab,i)| sum+ab[i%2] }
|
N = gets.to_i
AB = N.times.map{|i|
a, b = gets.split.map(&:to_i)
next [a, -b]
}
p AB.sort_by{|a,b| a-b }.reverse_each.with_index.inject(0){|sum,(ab,i)| sum+ab[i%2] }
|
[
"identifier.change",
"call.arguments.change",
"call.add"
] | 941,104
| 941,106
|
u977697682
|
ruby
|
p03141
|
n = gets.to_i
ab = n.times.map{gets.split.map(&:to_i)}.sort_by{|i,j|i+j}
ans = 0
for i in 0..n-1
if i%2 == 0
ans += ab[i][0]
else
ans -= ab[i][1]
end
end
puts ans
|
n = gets.to_i
ab = n.times.map{gets.split.map(&:to_i)}.sort_by{|i,j|i+j}.reverse
ans = 0
for i in 0..n-1
if i%2 == 0
ans += ab[i][0]
else
ans -= ab[i][1]
end
end
puts ans
|
[
"call.add"
] | 941,281
| 941,282
|
u506255180
|
ruby
|
p03141
|
N=gets.to_i
A=Array.new(N,0),B=Array.new(N,0),ind=Array.new(N,0)
for i in 0..N-1
ta,tb=gets.split(" ").map(&:to_i)
A[i]=ta
B[i]=tb
ind[i]=i
end
ind=ind.sort {|x,y|(A[x]+B[x])<=>(A[y]+B[y])}
sgn=1
sum=0
for i in 0..N-1
sum+=(sgn==1)? A[ind[i]] : -B[ind[i]]
sgn*=-1
end
puts sum
|
N=gets.to_i
A=Array.new(N,0),B=Array.new(N,0),ind=Array.new(N,0)
for i in 0..N-1
ta,tb=gets.split(" ").map(&:to_i)
A[i]=ta
B[i]=tb
ind[i]=i
end
ind=ind.sort {|x,y|(A[y]+B[y])<=>(A[x]+B[x])}
sgn=1
sum=0
for i in 0..N-1
sum+=(sgn==1)? A[ind[i]] : -B[ind[i]]
sgn*=-1
end
puts sum
|
[
"expression.operation.binary.remove"
] | 941,309
| 941,310
|
u129667379
|
ruby
|
p03141
|
N = gets.to_i
A, B = N.times.map{gets.split.map(&:to_i)}.transpose
order = N.times.sort_by{|i| A[i] + B[i]}
ans = 0
N.times do |i|
if i%2 == 0
ans += A[order[i]]
else
ans -= B[order[i]]
end
end
puts ans
|
N = gets.to_i
A, B = N.times.map{gets.split.map(&:to_i)}.transpose
order = N.times.sort_by{|i| A[i] + B[i]}.reverse
ans = 0
N.times do |i|
if i%2 == 0
ans += A[order[i]]
else
ans -= B[order[i]]
end
end
puts ans
|
[
"call.add"
] | 941,620
| 941,621
|
u314396879
|
ruby
|
p03141
|
s=0;gets;$<.map{|e|a,b=e.split.map &:to_i;s-=b;-a-b}.sort.each_slice(2){|x,y|s+=x};p s
|
s=0;gets;$<.map{|e|a,b=e.split.map &:to_i;s-=b;-a-b}.sort.each_slice(2){|x,y|s-=x};p s
|
[
"expression.operator.change"
] | 941,832
| 941,833
|
u280667879
|
ruby
|
p03141
|
s=0;gets;$<.map{|e|a,b=e.split.map &:to_i;s-=b;-a-b}.sort.each_slice(2){|x,y|s+=y};p s
|
s=0;gets;$<.map{|e|a,b=e.split.map &:to_i;s-=b;-a-b}.sort.each_slice(2){|x,y|s-=x};p s
|
[] | 941,834
| 941,833
|
u280667879
|
ruby
|
p03141
|
s=0;gets;$<.map{|e|a,b=e.split.map &:to_i;s-=b;-a-b}.sort.each_slice(2){|e|s+=e};p s
|
s=0;gets;$<.map{|e|a,b=e.split.map &:to_i;s-=b;-a-b}.sort.each_slice(2){|x,y|s-=x};p s
|
[
"identifier.change"
] | 941,835
| 941,833
|
u280667879
|
ruby
|
p03145
|
a, b, c = gets.chomp.split(" ").map(&:to_i)
puts a * b * 0.5
|
a, b, c = gets.chomp.split(" ").map(&:to_i)
puts a * b / 2
|
[] | 942,076
| 942,077
|
u412789323
|
ruby
|
p03145
|
ab, bc, ca = get.split.map &:to_i
p bc * ab / 2
|
ab, bc, ca = gets.split.map &:to_i
p (bc * ab / 2)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 942,085
| 942,086
|
u489339677
|
ruby
|
p03145
|
ab, bc, ca = gets.chomp!.split.map!(&:to_i)
puts ab * bc / ca
|
ab, bc, _ca = gets.chomp!.split.map!(&:to_i)
puts ab * bc / 2
|
[
"assignment.variable.change",
"identifier.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 943,531
| 943,532
|
u745385679
|
ruby
|
p03145
|
edges = gets.chomp.split(' ').map(&:to_i)
puts edges[0]*edges[2]/2
|
edges = gets.chomp.split(' ').map(&:to_i)
puts edges[0]*edges[1]/2
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 944,298
| 944,299
|
u059126963
|
ruby
|
p03146
|
def get_i() #空白区切の入力を数値(整数)の配列で返す
return gets.chomp.split(" ").map(&:to_i)
end
def get_f() #空白区切の入力を数値(実数)の配列で返す
return gets.chomp.split(" ").map(&:to_f)
end
def get() #空白区切の入力を文字列の配列で返す
return gets.chomp.split(" ")
end
def get_nsp() #入力されたものを一文字ずつに区切った文字列の配列で返す
return gets.chomp.split("")
end
def yn_judge(bool,y="Yes",n="No") #boolに真偽を投げることで、trueならy、falseならnの値を出力する
return bool ? y : n
end
def array(size1,init=nil,size2=-1) #size2に二次元配列時の最初の要素数、size1に次の配列の大きさ、initに初期値を投げることでその配列を返す
if size2==-1
return Array.new(size1){init}
else
return Array.new(size2){Array.new(size1){init}}
end
end
def f(n)
if n.odd?
return 3*n+1
else
return n/2
end
end
s=gets.to_i
a=[]
a.push(s)
exist={}
ans=0
exist[s]=1
loop do
a_=f(a[-1])
unless exist[a_].nil?
ans=exist.size+1
break
else
exist[a_]=1
a.push(a_)
end
end
puts ans+1
|
def get_i() #空白区切の入力を数値(整数)の配列で返す
return gets.chomp.split(" ").map(&:to_i)
end
def get_f() #空白区切の入力を数値(実数)の配列で返す
return gets.chomp.split(" ").map(&:to_f)
end
def get() #空白区切の入力を文字列の配列で返す
return gets.chomp.split(" ")
end
def get_nsp() #入力されたものを一文字ずつに区切った文字列の配列で返す
return gets.chomp.split("")
end
def yn_judge(bool,y="Yes",n="No") #boolに真偽を投げることで、trueならy、falseならnの値を出力する
return bool ? y : n
end
def array(size1,init=nil,size2=-1) #size2に二次元配列時の最初の要素数、size1に次の配列の大きさ、initに初期値を投げることでその配列を返す
if size2==-1
return Array.new(size1){init}
else
return Array.new(size2){Array.new(size1){init}}
end
end
def f(n)
if n.odd?
return 3*n+1
else
return n/2
end
end
s=gets.to_i
a=[]
a.push(s)
exist={}
ans=0
exist[s]=1
loop do
a_=f(a[-1])
unless exist[a_].nil?
ans=a.size+1
break
else
exist[a_]=1
a.push(a_)
end
end
puts ans
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 944,350
| 944,351
|
u415400221
|
ruby
|
p03138
|
n, k = gets.split.map(&:to_i)
xx = gets.split.map(&:to_i)
if k == 0
puts xx.reduce(:+)
else
a = 0
y = 1
loop do
break if k < (y << 1)
y <<= 1
end
loop do
break if y <= 0
if xx.count{ |x| x & y == 0 } > n / 2
a += y if a <= k
end
y >>= 1
end
puts xx.map{ |x| x ^ a }.reduce(:+)
end
|
n, k = gets.split.map(&:to_i)
xx = gets.split.map(&:to_i)
if k == 0
puts xx.reduce(:+)
else
a = 0
y = 1
loop do
break if k < (y << 1)
y <<= 1
end
loop do
break if y <= 0
if xx.count{ |x| x & y == 0 } > n / 2
a += y if a + y <= k
end
y >>= 1
end
puts xx.map{ |x| x ^ a }.reduce(:+)
end
|
[
"control_flow.branch.if.condition.change"
] | 944,541
| 944,542
|
u331906013
|
ruby
|
p03146
|
N = gets.to_i
a = Array.new(1000000)
ans = 1
wk = N
begin
ans += 1
wk = wk.even? ? wk / 2 : 3 * wk + 1
break if not a[wk].nil?
a[wk] = 1
end while true
puts ans
|
N = gets.to_i
a = Array.new(1000000)
ans = 1
wk = N
a[N] = 1
begin
ans += 1
wk = wk.even? ? wk / 2 : 3 * wk + 1
break if not a[wk].nil?
a[wk] = 1
end while true
puts ans
|
[
"assignment.add"
] | 944,614
| 944,615
|
u276517671
|
ruby
|
p03146
|
s = gets.to_i
def f(n)
n.even? ? n / 2 : 3 * n + 1
end
a = { s: 1 }
prev = s
1000000.times do |m|
prev = f(prev)
if a.has_key?(prev)
puts m + 2
exit
end
a[prev] = 1
end
|
s = gets.to_i
def f(n)
n.even? ? n / 2 : 3 * n + 1
end
a = { s => 1 }
prev = s
1000000.times do |m|
prev = f(prev)
if a.has_key?(prev)
puts m + 2
exit
end
a[prev] = 1
end
|
[
"assignment.value.change"
] | 944,863
| 944,864
|
u457499130
|
ruby
|
p03146
|
s = gets.to_i
def f(n)
if n % 2 == 0
return n / 2
else
return (3 * n) + 1
end
end
before = s
h = []
1000000.times do |i|
curr = f(before)
if(h[curr])
puts i + 2
exit
else
h[curr] = 1
end
before = curr
end
|
s = gets.to_i
def f(n)
if n % 2 == 0
return n / 2
else
return (3 * n) + 1
end
end
before = s
h = []
h[s] = 1
1000000.times do |i|
curr = f(before)
if(h[curr])
puts i + 2
exit
else
h[curr] = 1
end
before = curr
end
|
[
"assignment.add"
] | 944,963
| 944,964
|
u786261754
|
ruby
|
p03146
|
s = gets.to_i
res = []
10000000.times do |i|
if s.even?
s = s / 2
else
s = 3 * s + 1
end
if res.include? s
puts i + 2
break
else
res << s
end
end
|
s = gets.to_i
res = []
res << s
10000000.times do |i|
if s.even?
s = s / 2
else
s = 3 * s + 1
end
if res.include? s
puts i + 2
break
else
res << s
end
end
|
[
"expression.operation.binary.add"
] | 944,991
| 944,992
|
u647522078
|
ruby
|
p03146
|
s = gets.to_i
res = []
10000000.times do |i|
if s.even?
s = s / 2
else
s = 3 * s + 1
end
if res.include? s
puts i + 2
break
else
res << s
end
end
|
s = gets.to_i
res = []
res << s
10000000.times do |i|
if s.even?
s = s / 2
else
s = 3 * s + 1
end
if res.include? s
puts i + 2
break
else
res << s
end
end
|
[
"expression.operation.binary.add"
] | 944,991
| 944,993
|
u647522078
|
ruby
|
p03146
|
s = gets.to_i
cnt = 4
if !(s == 1) || !(s == 2)
while !(s == 4)
if s%2 == 0
s /= 2
cnt += 1
else
s *= 3
s += 1
cnt += 1
end
end
end
puts cnt
|
s = gets.to_i
cnt = 4
if !(s == 1 || s == 2)
while !(s == 4)
if s%2 == 0
s /= 2
cnt += 1
else
s *= 3
s += 1
cnt += 1
end
end
end
puts cnt
|
[
"control_flow.branch.if.condition.change"
] | 945,004
| 945,005
|
u581928831
|
ruby
|
p03146
|
s = gets.to_i
def f(n)
n % 2 == 0 ? n / 2 : 3 * n + 1
end
hash = {}
hash[s] = 1
count = 1
found = false
n = f(s)
while !found do
if hash[n]
puts count
found = true
else
hash[n] = 1
count += 1
n = f(n)
end
end
|
s = gets.to_i
def f(n)
n % 2 == 0 ? n / 2 : 3 * n + 1
end
hash = {}
hash[s] = 1
count = 1
found = false
n = f(s)
while !found do
if hash[n]
puts count + 1
found = true
else
hash[n] = 1
count += 1
n = f(n)
end
end
|
[
"expression.operation.binary.add"
] | 945,141
| 945,142
|
u127942942
|
ruby
|
p03146
|
s = gets.to_i
def f(n)
n % 2 == 0 ? n / 2 : 3 * n + 1
end
hash = {}
count = 1
found = false
n = f(s)
while !found do
if hash[n]
puts count + 1
found = true
else
hash[n] = 1
count += 1
n = f(n)
end
end
|
s = gets.to_i
def f(n)
n % 2 == 0 ? n / 2 : 3 * n + 1
end
hash = {}
hash[s] = 1
count = 1
found = false
n = f(s)
while !found do
if hash[n]
puts count + 1
found = true
else
hash[n] = 1
count += 1
n = f(n)
end
end
|
[
"assignment.add"
] | 945,144
| 945,142
|
u127942942
|
ruby
|
p03146
|
s = gets.to_i
dp = Array.new(1000_000 + 30)
dp[1] = s
used = {}
ans = (2 .. 1_000_000).find do |i|
v = dp[i] = dp[i - 1].odd? ? (dp[i - 1] * 3 + 1) : (dp[i - 1] / 2)
found = used[v]
used[v] = true if !found
found
end
puts ans
|
s = gets.to_i
dp = Array.new(1000_000 + 30)
dp[1] = s
used = { s => true }
ans = (2 .. 1_000_000).find do |i|
v = dp[i] = dp[i - 1].odd? ? (dp[i - 1] * 3 + 1) : (dp[i - 1] / 2)
found = used[v]
used[v] = true if !found
found
end
puts ans
|
[] | 945,162
| 945,163
|
u627981707
|
ruby
|
p03147
|
n = gets.to_i
flower = gets.split().map(&:to_i)
flower.push(0)
n = n * 1
ans = 0
max = 0
min = 0
flower.each do |f|
if f > max
max = f
elsif f < max
ans += max - min
min = f
max = 0
end
end
puts ans
|
n = gets.to_i
flower = gets.split().map(&:to_i)
flower.push(0)
n = n * 1
ans = 0
max = 0
min = 0
flower.each do |f|
if f > max
max = f
elsif f < max
ans += max - min
min = f
max = f
end
end
puts ans
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 945,470
| 945,471
|
u244401500
|
ruby
|
p03147
|
INF = 10_000_000
N = gets.to_i
H = gets.split.map(&:to_i)
ans = 0
(1 .. 10_000).find do
l = nil
r = nil
w = INF
H.each_with_index.find do |v,i|
if l.nil?
if v > 0
w = v
l = i
end
false
else
if v == 0
r = i
else
w = v < w ? v : w
false
end
end
end
r = N if r.nil?
(l ... r).each{|i| H[i] -= w }
ans += w
H.all?(&:zero?)
end
puts ans
|
INF = 10_000_000
N = gets.to_i
H = gets.split.map(&:to_i)
ans = 0
(1 .. 10_000).find do
l = nil
r = nil
w = INF
H.each_with_index.find do |v,i|
if l.nil?
if v > 0
w = v
l = i
end
false
else
if v == 0
r = i
else
w = v < w ? v : w
false
end
end
end
r = N if r.nil?
if l
(l ... r).each{|i| H[i] -= w }
ans += w
end
H.all?(&:zero?)
end
puts ans
|
[] | 945,774
| 945,775
|
u627981707
|
ruby
|
p03147
|
N = gets.to_i
Hn = gets.split.map(&:to_i)
max = Hn.max
count = 0
max.times do |i|
succ = false
Hn.each do |h|
if h >= i
count += 1 unless succ
succ = true
else
succ = false
end
end
end
p count
|
N = gets.to_i
Hn = gets.split.map(&:to_i)
max = Hn.max
count = 0
max.times do |i|
succ = false
Hn.each do |h|
if h > i
count += 1 unless succ
succ = true
else
succ = false
end
end
end
p count
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 945,891
| 945,892
|
u237620737
|
ruby
|
p03147
|
N = gets.to_i
h = gets.split.map(&:to_i)
def calc(h)
if h.size > 1
m = h.min
ret = []
needle = 0
h = h.map {|e| e - m}
h.each_with_index do |e, i|
if e == 0 || i == (h.size - 1)
ret << h[needle..i].select{|elm| elm != 0}.uniq if h[needle..i].select{|elm| elm != 0} != []
needle = i+1
end
end
m + ret.map {|a| calc(a)}.inject(&:+).to_i
else
h.min
end
end
puts calc(h)
|
N = gets.to_i
h = gets.split.map(&:to_i)
def calc(h)
if h.size > 1
m = h.min
ret = []
needle = 0
h = h.map {|e| e - m}
h.each_with_index do |e, i|
if e == 0 || i == (h.size - 1)
ret << h[needle..i].select{|elm| elm != 0} if h[needle..i].select{|elm| elm != 0} != []
needle = i+1
end
end
m + ret.map {|a| calc(a)}.inject(&:+).to_i
else
h.min
end
end
puts calc(h)
|
[
"call.remove"
] | 945,922
| 945,923
|
u941522668
|
ruby
|
p03147
|
N = gets.to_i
h = gets.split.map(&:to_i)
def calc(h)
if h.size > 1
m = h.min
ret = []
needle = 0
h = h.map {|e| e - m}
h.each_with_index do |e, i|
if e == 0 || i == (h.size - 1)
ret << h[needle..i].select{|elm| elm != 0}.uniq if h[needle..i].select{|elm| elm != 0} != []
needle = i+1
end
end
m + ret.map {|a| calc(a)}.inject(&:+)
else
h.min
end
end
puts calc(h)
|
N = gets.to_i
h = gets.split.map(&:to_i)
def calc(h)
if h.size > 1
m = h.min
ret = []
needle = 0
h = h.map {|e| e - m}
h.each_with_index do |e, i|
if e == 0 || i == (h.size - 1)
ret << h[needle..i].select{|elm| elm != 0} if h[needle..i].select{|elm| elm != 0} != []
needle = i+1
end
end
m + ret.map {|a| calc(a)}.inject(&:+).to_i
else
h.min
end
end
puts calc(h)
|
[
"call.remove",
"call.add"
] | 945,924
| 945,923
|
u941522668
|
ruby
|
p03147
|
gets;r=0;([0]+gets.split.map(&:to_i)).each_cons(2){|x,y|r+=[0,x-y].max};p r
|
gets;r=0;([0]+gets.split.map(&:to_i)).each_cons(2){|x,y|r+=[0,y-x].max};p r
|
[
"expression.operation.binary.remove"
] | 945,927
| 945,928
|
u280667879
|
ruby
|
p03147
|
n=gets.chomp.to_i
h=gets.chomp.split.map(&:to_i)
miz = 0
loop do
100.times do
begin;h.shift if h[0] == 0 ||h[0].negative?;rescue;end
begin;h.pop if h[-1] == 0 ||h[-1].negative?;rescue;end
end
if h.size==0
break
else
miz+=h.join(",").scan(/(,0,|,-\d+,){1,}/).size+1
end
h.map!{|a|a-1}
end
puts miz
|
n=gets.chomp.to_i
h=gets.chomp.split.map(&:to_i)
miz = 0
loop do
100.times do
begin;h.shift if h[0] == 0 ||h[0].negative?;rescue;end
begin;h.pop if h[-1] == 0 ||h[-1].negative?;rescue;end
end
if h.size==0
break
else
miz+=h.join(",").scan(/(,0|,-\d+){1,}/).size+1
end
h.map!{|a|a-1}
end
puts miz
|
[
"call.arguments.change"
] | 945,943
| 945,944
|
u264508862
|
ruby
|
p03147
|
n=gets.chomp.to_i
h=gets.chomp.split.map(&:to_i)
miz = 0
loop do
50.times do
begin;h.shift if h[0] == 0 ||h[0].negative?;rescue;end
begin;h.pop if h[-1] == 0 ||h[-1].negative?;rescue;end
end
if h.size==0
break
else
miz+=h.join(",").scan(/(,0,|,-\d+,){1,}/).size+1
end
h.map!{|a|a-1}
end
puts miz
|
n=gets.chomp.to_i
h=gets.chomp.split.map(&:to_i)
miz = 0
loop do
100.times do
begin;h.shift if h[0] == 0 ||h[0].negative?;rescue;end
begin;h.pop if h[-1] == 0 ||h[-1].negative?;rescue;end
end
if h.size==0
break
else
miz+=h.join(",").scan(/(,0|,-\d+){1,}/).size+1
end
h.map!{|a|a-1}
end
puts miz
|
[
"literal.number.integer.change",
"call.arguments.change"
] | 945,945
| 945,944
|
u264508862
|
ruby
|
p03146
|
s=gets.to_i
h = {}
2.upto(1000000) do |i|
# puts s
if s.odd?
s = 3 * s + 1
else
s = s/2
end
if h.has_key?(s)
puts i
exit
else
h[s] = 1
end
end
|
s=gets.to_i
h = {}
h[s] = 1
2.upto(1000000) do |i|
# puts s
if s.odd?
s = 3 * s + 1
else
s = s/2
end
if h.has_key?(s)
puts i
exit
else
h[s] = 1
end
end
|
[
"assignment.add"
] | 945,973
| 945,974
|
u868089307
|
ruby
|
p03146
|
a = gets
numbers = [a]
value = false
b = a
sum = 1
until value
if b % 2 == 0
sum += 1
b = b / 2
numbers.each do |number|
if number == b
value = true
puts sum
end
end
numbers.push(b)
else
sum += 1
b = b * 3 + 1
numbers.each do |number|
if number == b
value = true
puts sum
end
end
numbers.push(b)
end
end
|
a = gets.to_i
numbers = [a]
value = false
b = a
sum = 1
until value
if b % 2 == 0
sum += 1
b = b / 2
numbers.each do |number|
if number == b
value = true
puts sum
end
end
numbers.push(b)
else
sum += 1
b = b * 3 + 1
numbers.each do |number|
if number == b
value = true
puts sum
end
end
numbers.push(b)
end
end
|
[
"call.add"
] | 946,020
| 946,021
|
u634322249
|
ruby
|
p03148
|
n,k = gets.split.map(&:to_i)
a = n.times.map{|i|gets.split.map(&:to_i).push(i)}.sort_by{|i,j,k|-j}
v = 0
ans = 0
ret = 0
used = Hash.new(-1)
for i in 0..k-1
ans += a[i][1]
if used[a[i][0]] == -1
v += 1
used[a[i][0]] = a[i][2]
end
end
ans += v**2
l = k-1
ret = ans
for i in k..n-1
if used[a[i][0]] == -1
while used[a[l][0]] == a[l][2]
l -= 1
end
break if l < 0
used[a[l][0]] = a[l][2]
ret += a[i][1]-a[l][1]+2*v+1
v += 1
l -= 1
end
ans = ret if ans < ret
end
puts ans
|
n,k = gets.split.map(&:to_i)
a = n.times.map{|i|gets.split.map(&:to_i).push(i)}.sort_by{|i,j,k|-j}
v = 0
ans = 0
ret = 0
used = Hash.new(-1)
for i in 0..k-1
ans += a[i][1]
if used[a[i][0]] == -1
v += 1
used[a[i][0]] = a[i][2]
end
end
ans += v**2
l = k-1
ret = ans
for i in k..n-1
if used[a[i][0]] == -1
while used[a[l][0]] == a[l][2]
l -= 1
end
break if l < 0
used[a[i][0]] = a[i][2]
ret += a[i][1]-a[l][1]+2*v+1
v += 1
l -= 1
end
ans = ret if ans < ret
end
puts ans
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 946,111
| 946,112
|
u506255180
|
ruby
|
p03148
|
n,k = gets.split.map(&:to_i)
a = n.times.map{|i|gets.split.map(&:to_i).push(i)}.sort_by{|i,j,k|-j}
v = 0
ans = 0
ret = 0
used = Hash.new(-1)
for i in 0..k-1
ans += a[i][1]
if used[a[i][0]] == -1
v += 1
used[a[i][0]] = a[i][2]
end
end
ans += v**2
l = k-1
ret = ans
for i in k..n-1
if used[a[i][0]] == -1
while used[a[l][0]] == a[l][2]
l -= 1
end
break if l < 0
used[a[l][0]] = a[l][2]
ret += a[i][1]-a[l][1]+2*v+1
v += 1
end
ans = ret if ans < ret
end
puts ans
|
n,k = gets.split.map(&:to_i)
a = n.times.map{|i|gets.split.map(&:to_i).push(i)}.sort_by{|i,j,k|-j}
v = 0
ans = 0
ret = 0
used = Hash.new(-1)
for i in 0..k-1
ans += a[i][1]
if used[a[i][0]] == -1
v += 1
used[a[i][0]] = a[i][2]
end
end
ans += v**2
l = k-1
ret = ans
for i in k..n-1
if used[a[i][0]] == -1
while used[a[l][0]] == a[l][2]
l -= 1
end
break if l < 0
used[a[i][0]] = a[i][2]
ret += a[i][1]-a[l][1]+2*v+1
v += 1
l -= 1
end
ans = ret if ans < ret
end
puts ans
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 946,113
| 946,112
|
u506255180
|
ruby
|
p03148
|
#require 'pp'
n, k = gets.chomp!.split(" ").map(&:to_i)
all_sushi = []
group_max = {}
n.times do |i|
t, d = gets.chomp!.split(" ").map(&:to_i)
all_sushi[i] = [d, t]
group_max[t] ||= 0
group_max[t] = group_max[t] < d ? d : group_max[t]
end
all_sushi.sort!.reverse!
sorted_group_max = group_max.sort {|a, b| b[1] <=> a[1]}.to_h
#pp all_sushi
#pp sorted_group_max
# 大きいほうからK個取り出す
max_point = 0
max_comb = {}
others = []
k.times do |i|
max_point += all_sushi[i][0]
if max_comb[all_sushi[i][1]] == nil
max_comb[all_sushi[i][1]] = all_sushi[i][0]
else
others << all_sushi[i][0]
end
end
max_comb.each do |x, _|
sorted_group_max.delete(x)
end
#pp max_point
#pp max_comb
#pp others
#pp sorted_group_max
tmp_max = max_point
tmp_kind = max_comb.size
tmp_point = tmp_max + tmp_kind ** 2
ans = tmp_point
others.each do |o|
k, v = sorted_group_max.first
break if k == nil
sorted_group_max.delete(k)
tmp_kind += 1
tmp_max = tmp_max - o + v
tmp_point = tmp_max + tmp_kind ** 2
if tmp_point > ans
ans = tmp_point
end
end
puts ans
|
require 'pp'
n, k = gets.chomp!.split(" ").map(&:to_i)
all_sushi = []
group_max = {}
n.times do |i|
t, d = gets.chomp!.split(" ").map(&:to_i)
all_sushi[i] = [d, t]
group_max[t] ||= 0
group_max[t] = group_max[t] < d ? d : group_max[t]
end
all_sushi.sort!.reverse!
sorted_group_max = group_max.sort {|a, b| b[1] <=> a[1]}.to_h
#pp all_sushi
#pp sorted_group_max
# 大きいほうからK個取り出す
max_point = 0
max_comb = {}
others = []
k.times do |i|
max_point += all_sushi[i][0]
if max_comb[all_sushi[i][1]] == nil
max_comb[all_sushi[i][1]] = all_sushi[i][0]
else
others << all_sushi[i][0]
end
end
max_comb.each do |x, _|
sorted_group_max.delete(x)
end
#pp max_point
#pp max_comb
#pp others
#pp sorted_group_max
tmp_max = max_point
tmp_kind = max_comb.size
tmp_point = tmp_max + tmp_kind ** 2
ans = tmp_point
others.reverse_each do |o|
k, v = sorted_group_max.first
break if k == nil
sorted_group_max.delete(k)
tmp_kind += 1
tmp_max = tmp_max - o + v
tmp_point = tmp_max + tmp_kind ** 2
if tmp_point > ans
ans = tmp_point
end
end
puts ans
|
[
"call.add",
"identifier.change"
] | 946,338
| 946,339
|
u754375546
|
ruby
|
p03148
|
# https://atcoder.jp/contests/abc116/tasks/abc116_d
N, K = gets.split.map(&:to_i)
max_in_type = {}
values = []
N.times do
temp = gets.split.map(&:to_i)
max_in_type[temp[0]] = temp[1] if !(max_in_type[temp[0]]&.>(temp[1]))
values << (temp[1] << 17) + temp[0]
end
ph = []
sum = 0
use_type_count = 0
type_flags = {}
t_mask = (1 << 17) - 1
values.sort.reverse[0...K].each do |t_v|
t = t_v & t_mask
v = t_v >> 17
sum += v
if !type_flags[t]
type_flags[t] = true
use_type_count += 1
else
ph << v
end
end
ph.sort!
ans = sum + use_type_count**2
rph = max_in_type.select { |t, v| !type_flags[t] }.values.sort.reverse
t = 0
phsize = ph.size
rphsize = rph.size
(phsize > rphsize ? rphsize : phsize).times do |i|
sum = sum - ph.pop + rph[i]
t = sum + (use_type_count += 1)**2
ans = t if t > ans
end
p ans
|
# https://atcoder.jp/contests/abc116/tasks/abc116_d
N, K = gets.split.map(&:to_i)
max_in_type = {}
values = []
N.times do
temp = gets.split.map(&:to_i)
max_in_type[temp[0]] = temp[1] if !(max_in_type[temp[0]]&.>(temp[1]))
values << (temp[1] << 17) + temp[0]
end
ph = []
sum = 0
use_type_count = 0
type_flags = {}
t_mask = (1 << 17) - 1
values.sort.reverse[0...K].each do |t_v|
t = t_v & t_mask
v = t_v >> 17
sum += v
if !type_flags[t]
type_flags[t] = true
use_type_count += 1
else
ph << v
end
end
ph.sort!
ans = sum + use_type_count**2
rph = max_in_type.select { |t, v| !type_flags[t] }.values.sort.reverse
t = 0
phsize = ph.size
rphsize = rph.size
(phsize > rphsize ? rphsize : phsize).times do |i|
sum = sum - ph[i] + rph[i]
t = sum + (use_type_count += 1)**2
ans = t if t > ans
end
p ans
|
[] | 946,355
| 946,356
|
u987208743
|
ruby
|
p03148
|
n, k = gets.split.map(&:to_i)
sushi = Hash.new { |h, k| h[k] = [] }
s_0 = []
s_1 = []
n.times do
t, d = gets.split.map(&:to_i)
sushi[t] << d
end
sushi.values.each do |arr|
arr.sort!.reverse!
arr.each_with_index do |a, i|
if i == 0
s_1 << a
else
s_0 << a
end
end
end
s_0.sort_by!.reverse!
s_1.sort_by!.reverse!
n_0 = s_0.size
n_1 = s_1.size
tmp = 0
sum_0 = [0].concat(s_0.map { |si| tmp += si })
tmp = 0
sum_1 = [0].concat(s_1.map { |si| tmp += si })
ans = 0
(k + 1).times do |i|
next if i == 0
# s_1 からi個とる
x = i
y = k - i
# 取れないときのための微調整
if x > n_1
y += x - n_1
x = n_1
end
if y > n_0
x += y - n_0
y = n_0
end
sum = sum_1[x] + sum_0[y] + x * x
ans = sum if sum > ans
end
p ans
|
n, k = gets.split.map(&:to_i)
sushi = Hash.new { |h, k| h[k] = [] }
s_0 = []
s_1 = []
n.times do
t, d = gets.split.map(&:to_i)
sushi[t] << d
end
sushi.values.each do |arr|
arr.sort!.reverse!
arr.each_with_index do |a, i|
if i == 0
s_1 << a
else
s_0 << a
end
end
end
s_0.sort!.reverse!
s_1.sort!.reverse!
n_0 = s_0.size
n_1 = s_1.size
tmp = 0
sum_0 = [0].concat(s_0.map { |si| tmp += si })
tmp = 0
sum_1 = [0].concat(s_1.map { |si| tmp += si })
ans = 0
(k + 1).times do |i|
next if i == 0
# s_1 からi個とる
x = i
y = k - i
# 取れないときのための微調整
if x > n_1
y += x - n_1
x = n_1
end
if y > n_0
x += y - n_0
y = n_0
end
sum = sum_1[x] + sum_0[y] + x * x
ans = sum if sum > ans
end
p ans
|
[
"identifier.change"
] | 946,665
| 946,666
|
u706695185
|
ruby
|
p03149
|
n = gets.split(" ").map(&:to_i)
puts n.sort.join == '1479' ? 'Yes' : 'No'
|
n = gets.split(" ").map(&:to_i)
puts n.sort.join == '1479' ? 'YES' : 'NO'
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 946,927
| 946,928
|
u968836442
|
ruby
|
p03149
|
d = gets.chomp.split.map(&:to_i)
if d.include?(1) && d.include?(9) && d.include?(7) && d.include?(4)
puts 'Yes'
else
puts 'No'
end
|
d = gets.chomp.split.map(&:to_i)
if d.include?(1) && d.include?(9) && d.include?(7) && d.include?(4)
puts 'YES'
else
puts 'NO'
end
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 946,960
| 946,961
|
u411203878
|
ruby
|
p03149
|
n=gets.chomp.chars.sort.join
puts n==1479 ? "YES" : "NO"
|
n=gets.chomp.split.sort.join
puts n=="1479" ? "YES" : "NO"
|
[
"assignment.value.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 947,062
| 947,063
|
u616320334
|
ruby
|
p03149
|
puts gets.split.sort.join.to_i == 1974 ? :YES: :NO
|
puts gets.split.sort.join.to_i == 1479 ? :YES: :NO
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 947,095
| 947,096
|
u785521224
|
ruby
|
p03149
|
n = gets.chomp.split.map(&:to_i)
x = "1 9 7 4".chomp.split.map(&:to_i)
if n==x then
puts "YES"
else
puts "NO"
end
|
n = gets.chomp.split.map(&:to_i).sort!
x = "1 9 7 4".chomp.split.map(&:to_i).sort!
if n==x then
puts "YES"
else
puts "NO"
end
|
[
"call.add"
] | 947,672
| 947,673
|
u411903982
|
ruby
|
p03149
|
n = gets.chomp.split(" ").map{|a| a.to_i}
answer = "NO"
if n.include?(1)
if n.include?(7)
if n.include?(9)
if n.include?(4)
answer = "YES"
end
end
end
end
p answer
|
n = gets.chomp.split(" ").map{|a| a.to_i}
answer = "NO"
if n.include?(1)
if n.include?(7)
if n.include?(9)
if n.include?(4)
answer = "YES"
end
end
end
end
puts answer
|
[
"call.function.change",
"io.output.change"
] | 947,690
| 947,691
|
u257354345
|
ruby
|
p03150
|
s = gets.chomp
if s =~ /^(.+keyence|k.+eyence|ke.+yence|key.+ence|keye.+nce|keyen.+ce|keyenc.+e|keyence.+)$/
puts :YES
else
puts :NO
end
|
s = gets.chomp
if s =~ /^(keyence|.+keyence|k.+eyence|ke.+yence|key.+ence|keye.+nce|keyen.+ce|keyenc.+e|keyence.+)$/
puts :YES
else
puts :NO
end
|
[
"control_flow.branch.if.condition.change"
] | 948,096
| 948,097
|
u104886851
|
ruby
|
p03150
|
s = gets.chomp
if s == "keyence"
puts "YES"
exit
end
l = s.length
l.times do |i|
(l-i).times do |j|
x = s[i..(i + j)]
p x
if s.sub(x, "") == "keyence"
puts "YES"
exit
end
end
end
puts "NO"
|
s = gets.chomp
if s == "keyence"
puts "YES"
exit
end
l = s.length
l.times do |i|
(l-i).times do |j|
x = s[i..(i + j)]
if s.sub(x, "") == "keyence"
puts "YES"
exit
end
end
end
puts "NO"
|
[
"call.remove"
] | 948,312
| 948,313
|
u910756197
|
ruby
|
p03150
|
input = gets.to_s
arrayOfStrings = []
arrayOfStrings = input.split("")
#前に固まって存在している場合
if arrayOfStrings[0,7].join == "keyence" then
puts "YES"
#後ろに固まって存在している場合
elsif arrayOfStrings[-7,7].join == "keyence" then
puts "YES"
#前と後ろに分けて存在し、間に文字列が存在する場合。
elsif arrayOfStrings[0] == "k" && arrayOfStrings[-6,6].join == "eyence" then
puts "YES"
elsif arrayOfStrings[0,2].join == "ke" && arrayOfStrings[-5,5].join == "yence" then
puts "YES"
elsif arrayOfStrings[0,3].join == "key" && arrayOfStrings[-4,4].join == "ence" then
puts "YES"
elsif arrayOfStrings[0,4].join == "keye" && arrayOfStrings[-3,3].join == "nce" then
puts "YES"
elsif arrayOfStrings[0,5].join == "keyen" && arrayOfStrings[-2,2].join == "ce" then
puts "YES"
elsif arrayOfStrings[0,6].join == "keyenc" && arrayOfStrings[-1,1].join == "e" then
puts "YES"
else
puts "NO"
end
|
input = gets.chomp!.to_s
arrayOfStrings = []
arrayOfStrings = input.split("")
#前に固まって存在している場合
if arrayOfStrings[0,7].join == "keyence" then
puts "YES"
#後ろに固まって存在している場合
elsif arrayOfStrings[-7,7].join == "keyence" then
puts "YES"
#前と後ろに分けて存在し、間に文字列が存在する場合。
elsif arrayOfStrings[0] == "k" && arrayOfStrings[-6,6].join == "eyence" then
puts "YES"
elsif arrayOfStrings[0,2].join == "ke" && arrayOfStrings[-5,5].join == "yence" then
puts "YES"
elsif arrayOfStrings[0,3].join == "key" && arrayOfStrings[-4,4].join == "ence" then
puts "YES"
elsif arrayOfStrings[0,4].join == "keye" && arrayOfStrings[-3,3].join == "nce" then
puts "YES"
elsif arrayOfStrings[0,5].join == "keyen" && arrayOfStrings[-2,2].join == "ce" then
puts "YES"
elsif arrayOfStrings[0,6].join == "keyenc" && arrayOfStrings[-1,1].join == "e" then
puts "YES"
else
puts "NO"
end
|
[
"call.add"
] | 948,382
| 948,383
|
u894939163
|
ruby
|
p03151
|
n=gets.to_i
arr=[]
s=0
ans = 0
a = gets.chomp.split(" ").map!(&:to_i)
b = gets.chomp.split(" ").map!(&:to_i)
i=0
b.each do |v|
if v>a[i]
s+=v-a[i]
ans+=1
else
arr.push(a[i]-v)
end
i+=1
end
arr.sort.reverse
arr.each do |v|
break if s<=0
s-=v
ans+=1
end
if s<=0
puts ans
else
puts -1
end
|
n=gets.to_i
arr=[]
s=0
ans = 0
a = gets.chomp.split(" ").map!(&:to_i)
b = gets.chomp.split(" ").map!(&:to_i)
i=0
b.each do |v|
if v>a[i]
s+=v-a[i]
ans+=1
else
arr.push(a[i]-v)
end
i+=1
end
arr.sort!.reverse!
arr.each do |v|
break if s<=0
s-=v
ans+=1
end
if s<=0
puts ans
else
puts -1
end
|
[
"call.suffix.change"
] | 948,610
| 948,611
|
u097182283
|
ruby
|
p03151
|
n=gets.to_i
a = gets.chomp.split(" ").map!(&:to_i)
b = gets.chomp.split(" ").map!(&:to_i)
ex=[]
lack=0
ans = 0
n.times do |i|
t=a[i]-b[i]
ex << t if t>0
if t<0
lack+= -t
ans+=1
end
end
ex.sort!.reverse!
ex.each do |v|
break if lack<=0
lack-=v
ans+=1
end
if lack<=0
puts ans+cnt
else
puts -1
end
|
n=gets.to_i
a = gets.chomp.split(" ").map!(&:to_i)
b = gets.chomp.split(" ").map!(&:to_i)
ex=[]
lack=0
ans = 0
n.times do |i|
t=a[i]-b[i]
ex << t if t>0
if t<0
lack+= -t
ans+=1
end
end
ex.sort!.reverse!
ex.each do |v|
break if lack<=0
lack-=v
ans+=1
end
if lack<=0
puts ans
else
puts -1
end
|
[
"expression.operation.binary.remove"
] | 948,612
| 948,613
|
u097182283
|
ruby
|
p03150
|
a = gets.to_s
b = a.match(/^keyence\w+/)
c = a.match(/^\w+keyence$/)
d = a.match(/^k\w+eyence$/)
e = a.match(/^ke\w+yence$/)
f = a.match(/^key\w+ence$/)
g = a.match(/^keye\w+nce$/)
h = a.match(/^keyen\w+ce$/)
i = a.match(/^keyenc\w+e$/)
case when b,c,d,e,f,g,h,i
puts "YES"
else
puts "NO"
end
|
a = gets.to_s
b = a.match(/^keyence\w*/)
c = a.match(/^\w+keyence$/)
d = a.match(/^k\w+eyence$/)
e = a.match(/^ke\w+yence$/)
f = a.match(/^key\w+ence$/)
g = a.match(/^keye\w+nce$/)
h = a.match(/^keyen\w+ce$/)
i = a.match(/^keyenc\w+e$/)
case when b,c,d,e,f,g,h,i
puts "YES"
else
puts "NO"
end
|
[
"literal.string.change",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change"
] | 949,231
| 949,232
|
u135201316
|
ruby
|
p03160
|
n = gets.to_i
a = gets.split.map &:to_i
dp = Array.new(n+2){ 10**5 }
dp[0] = 0
(n-1).times do |i|
if dp[i+1] > dp[i] + (a[i+1] - a[i]).abs
dp[i+1] = dp[i] + (a[i+1] - a[i]).abs
end
next if i+2 >= n
if dp[i+2] > dp[i] + (a[i+2] - a[i]).abs
dp[i+2] = dp[i] + (a[i+2] - a[i]).abs
end
end
puts dp[n-1]
|
n = gets.to_i
a = gets.split.map &:to_i
dp = Array.new(n+2){ 10**12 }
dp[0] = 0
(n-1).times do |i|
if dp[i+1] > dp[i] + (a[i+1] - a[i]).abs
dp[i+1] = dp[i] + (a[i+1] - a[i]).abs
end
next if i+2 >= n
if dp[i+2] > dp[i] + (a[i+2] - a[i]).abs
dp[i+2] = dp[i] + (a[i+2] - a[i]).abs
end
end
puts dp[n-1]
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 952,776
| 952,777
|
u106964380
|
ruby
|
p03160
|
n = gets.to_i
a = gets.split.map &:to_i
dp = Array.new(n){ 10**5 }
dp[0] = 0
n.times do |i|
(1..2).each do |j|
next if i + j >= n
k = (a[i+j] - a[i]).abs + dp[i]
dp[i+j] = k if dp[i+j] > k
end
end
puts dp[n-1]
|
n = gets.to_i
a = gets.split.map &:to_i
dp = Array.new(n){ 10**12 }
dp[0] = 0
n.times do |i|
(1..2).each do |j|
next if i + j >= n
k = (a[i+j] - a[i]).abs + dp[i]
dp[i+j] = k if dp[i+j] > k
end
end
puts dp[n-1]
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 952,778
| 952,779
|
u106964380
|
ruby
|
p03160
|
### INPUT
# array = [*1..q].map { |_| gets.split.map(&:to_i) }
# n = gets.split.map(&:to_i)
### SNIPPET
# [].all?(&:even?)
# a = [*1..m].repeated_combination(n).to_a
# 切り捨て: .floor(2).to_f ,切り上げ： .ceil(2).to_f,四捨五入: round(2)
# 3.upto(6) do |i|, 6.downto(3) do |i|
# 公約数125.gcd(100)、公倍数125.lcm(100)
# PI = Math::PI
# 高さh = a * Math.sin(w / 180.0 * Math::PI)
# 底辺 = a * Math.cos(w / 180.0 * Math::PI)
INF = Float::INFINITY
### DP
def chmin(a, b) a < b ? a : b end
# def chmax(a, b) a > b ? a : b end
require 'pry'
# 4
# [10 30 40 20]
n = gets.to_i
h = gets.split.map(&:to_i)
h.unshift(0)
dp = [INF] * (n+1)
dp[1] = 0
# binding.pry
1.upto(n-1) do |i|
dp[i+1] = chmin(dp[i+1], dp[i] + (h[i+1] - h[i]).abs)
dp[i+1] = chmin(dp[i+1], dp[i-1] + (h[i+1] - h[i-1]).abs) if i >= 1
end
puts dp[n]
|
### INPUT
# array = [*1..q].map { |_| gets.split.map(&:to_i) }
# n = gets.split.map(&:to_i)
### SNIPPET
# [].all?(&:even?)
# a = [*1..m].repeated_combination(n).to_a
# 切り捨て: .floor(2).to_f ,切り上げ： .ceil(2).to_f,四捨五入: round(2)
# 3.upto(6) do |i|, 6.downto(3) do |i|
# 公約数125.gcd(100)、公倍数125.lcm(100)
# PI = Math::PI
# 高さh = a * Math.sin(w / 180.0 * Math::PI)
# 底辺 = a * Math.cos(w / 180.0 * Math::PI)
INF = Float::INFINITY
### DP
def chmin(a, b) a < b ? a : b end
# def chmax(a, b) a > b ? a : b end
n = gets.to_i
h = gets.split.map(&:to_i)
h.unshift(0)
dp = [INF] * (n+1)
dp[1] = 0
1.upto(n-1) do |i|
dp[i+1] = chmin(dp[i+1], dp[i] + (h[i+1] - h[i]).abs)
dp[i+1] = chmin(dp[i+1], dp[i-1] + (h[i+1] - h[i-1]).abs) if i >= 1
end
puts dp[n]
|
[
"call.remove"
] | 952,931
| 952,932
|
u219902564
|
ruby
|
p03160
|
n = gets.to_i
h = gets.split.map(&:to_i)
a = Array.new(n + 1, 1000)
a[0] = 0
h.unshift(h[0])
0.upto(n - 1) do |i|
a[i + 1] = [a[i + 1], (h[i] - h[i + 1]).abs + a[i]].min
a[i + 2] = [a[i + 2], (h[i] - h[i + 2]).abs + a[i]].min if i < n - 1
end
puts a[n]
|
n = gets.to_i
h = gets.split.map(&:to_i)
a = Array.new(n + 1, Float::INFINITY)
a[0] = 0
h.unshift(h[0])
0.upto(n - 1) do |i|
a[i + 1] = [a[i + 1], (h[i] - h[i + 1]).abs + a[i]].min
a[i + 2] = [a[i + 2], (h[i] - h[i + 2]).abs + a[i]].min if i < n - 1
end
puts a[n]
|
[
"assignment.value.change",
"call.arguments.change"
] | 953,015
| 953,016
|
u979552932
|
ruby
|
p03160
|
n = gets.to_i
h = gets.split.map(&:to_i)
dp = []
dp[0] = 0
dp[1] = (h[0] - h[1]).abs
2.upto(n-1) { |i|
dp[i] = [dp[i-1] + (h[i] - h[i-1]).abs, (dp[i-2] + (h[i] - h[i-2])).abs].min
}
puts dp[n-1]
|
n = gets.to_i
h = gets.split.map(&:to_i)
dp = []
dp[0] = 0
dp[1] = (h[0] - h[1]).abs
2.upto(n-1) { |i|
dp[i] = [dp[i-1] + (h[i] - h[i-1]).abs, dp[i-2] + (h[i] - h[i-2]).abs].min
}
puts dp[n-1]
|
[] | 953,742
| 953,743
|
u584272055
|
ruby
|
p03160
|
n = gets.to_i
h = gets.split.map(&:to_i)
dp = []
dp[0] = 0
dp[1] = (h[0] - h[1]).abs
2.upto(n-1) { |i|
dp[i] = [dp[i-1] + (h[i] - h[i-1]).abs, (dp[i-2] + (h[i] - h[i-2])).abs].min
}
p dp[n-1]
|
n = gets.to_i
h = gets.split.map(&:to_i)
dp = []
dp[0] = 0
dp[1] = (h[0] - h[1]).abs
2.upto(n-1) { |i|
dp[i] = [dp[i-1] + (h[i] - h[i-1]).abs, dp[i-2] + (h[i] - h[i-2]).abs].min
}
puts dp[n-1]
|
[
"call.function.change",
"io.output.change"
] | 953,744
| 953,743
|
u584272055
|
ruby
|
p03160
|
n, k = gets.split.map(&:to_i)
h = gets.split.map(&:to_i)
INF = 1001001001
dp = Array.new(n, INF)
dp[0] = 0
(n-1).times{|i_|
i = i_ + 1
c1 = i>0 ? dp[i-1]+(h[i]-h[i-1]).abs : INF
c2 = i>1 ? dp[i-2]+(h[i]-h[i-2]).abs : INF
p c1, c2
dp[i] = [c1, c2].min
}
p dp[n-1]
|
n, k = gets.split.map(&:to_i)
h = gets.split.map(&:to_i)
INF = 1001001001
dp = Array.new(n, INF)
dp[0] = 0
(n-1).times{|i_|
i = i_ + 1
c1 = i>0 ? dp[i-1]+(h[i]-h[i-1]).abs : INF
c2 = i>1 ? dp[i-2]+(h[i]-h[i-2]).abs : INF
dp[i] = [c1, c2].min
}
p dp[n-1]
|
[
"call.remove"
] | 954,099
| 954,100
|
u679291177
|
ruby
|
p03160
|
n = gets.to_i
hs = gets.chomp.split.map(&:to_i)
dp = Array.new(n,10**18)
dp[0] = 0
(0..n-1).each do |i|
dp[i+1] = [dp[i+1],dp[i] + (hs[i] - hs[i+1]).abs].min if i+1 < n
dp[i+2] = [dp[i+2],dp[i] + (hs[i] - hs[i+2]).abs].min if i+2 < n
end
puts dp[n-1]
p dp
|
n = gets.to_i
hs = gets.chomp.split.map(&:to_i)
dp = Array.new(n,10**18)
dp[0] = 0
(0..n-1).each do |i|
dp[i+1] = [dp[i+1],dp[i] + (hs[i] - hs[i+1]).abs].min if i+1 < n
dp[i+2] = [dp[i+2],dp[i] + (hs[i] - hs[i+2]).abs].min if i+2 < n
end
puts dp[n-1]
|
[
"call.remove"
] | 954,679
| 954,680
|
u191196346
|
ruby
|
p03160
|
N,*H = $<.read.split.map &:to_i
A = Array.new(N,0)
H.fill H[0],N,2
A.map!.with_index {|_,i|
h = H[i]
(1..2).map {|j| A[i-j] + (h-H[i-j]).abs }.min
}
|
N,*H = $<.read.split.map &:to_i
A = Array.new(N,0)
H.fill H[0],N,2
A.map!.with_index {|_,i|
h = H[i]
(1..2).map {|j| A[i-j]+(h-H[i-j]).abs }.min
}
p A[-1]
|
[
"call.add"
] | 954,825
| 954,826
|
u720281401
|
ruby
|
p03160
|
N = gets.to_i
H = gets.split.map(&:to_i)
dp = Array.new(H.size, 0)
2.step(H.size - 1) do |i|
p1 = i-2 >= 0 ? dp[i-2] + (H[i-2] - H[i]).abs : Float::INFINITY
p2 = i-1 >= 0 ? dp[i-1] + (H[i-1] - H[i]).abs : Float::INFINITY
dp[i] = p1 > p2 ? p2 : p1
end
puts dp.last
|
N = gets.to_i
H = gets.split.map(&:to_i)
dp = Array.new(N, 0)
1.step(H.size - 1) do |i|
p1 = i-2 >= 0 ? dp[i-2] + (H[i-2] - H[i]).abs : Float::INFINITY
p2 = i-1 >= 0 ? dp[i-1] + (H[i-1] - H[i]).abs : Float::INFINITY
dp[i] = p1 > p2 ? p2 : p1
end
puts dp.last
|
[
"assignment.value.change",
"call.arguments.change",
"call.remove",
"literal.number.integer.change"
] | 955,129
| 955,130
|
u984479733
|
ruby
|
p03160
|
lines = $stdin.read
array = lines.split("\n")
N = array[0].to_i
H = array[1].split(" ").map(&:to_i)
INF = 10**5
def cost(hi, hj)
#puts "|#{H[hi]}-#{H[hj]}|=#{(H[hi]-H[hj]).abs}"
ans = (H[hi]-H[hj]).abs
ans
end
dp = Array.new(N, INF)
dp[0] = 0
for j in 1...N
dp[j] = [ dp[j-1] + cost(j-1, j), dp[j] ].min
dp[j] = [ dp[j-2] + cost(j-2, j), dp[j] ].min if j>1
end
puts dp[N-1]
|
lines = $stdin.read
array = lines.split("\n")
N = array[0].to_i
H = array[1].split(" ").map(&:to_i)
INF = 10**9
def cost(hi, hj)
#puts "|#{H[hi]}-#{H[hj]}|=#{(H[hi]-H[hj]).abs}"
ans = (H[hi]-H[hj]).abs
ans
end
dp = Array.new(N, INF)
dp[0] = 0
for j in 1...N
dp[j] = [ dp[j-1] + cost(j-1, j), dp[j] ].min
dp[j] = [ dp[j-2] + cost(j-2, j), dp[j] ].min if j>1
end
puts dp[N-1]
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 955,403
| 955,404
|
u108333452
|
ruby
|
p03160
|
lines = $stdin.read
array = lines.split("\n")
N = array[0].to_i
H = array[1].split(" ").map(&:to_i)
INF = 10**5
def cost(hi, hj)
#puts "|#{H[hi]}-#{H[hj]}|=#{(H[hi]-H[hj]).abs}"
ans = (H[hi]-H[hj]).abs
ans
end
dp = Array.new(N, INF)
dp[0] = 0
for j in 1...N
dp[j] = [ dp[j-1] + cost(j-1, j), dp[j] ].min
dp[j] = [ dp[j-2] + cost(j-2, j), dp[j] ].min if j>1
end
puts dp.max
|
lines = $stdin.read
array = lines.split("\n")
N = array[0].to_i
H = array[1].split(" ").map(&:to_i)
INF = 10**9
def cost(hi, hj)
#puts "|#{H[hi]}-#{H[hj]}|=#{(H[hi]-H[hj]).abs}"
ans = (H[hi]-H[hj]).abs
ans
end
dp = Array.new(N, INF)
dp[0] = 0
for j in 1...N
dp[j] = [ dp[j-1] + cost(j-1, j), dp[j] ].min
dp[j] = [ dp[j-2] + cost(j-2, j), dp[j] ].min if j>1
end
puts dp[N-1]
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 955,405
| 955,404
|
u108333452
|
ruby
|
p03160
|
n = gets.rstrip.to_i
hs = gets.rstrip.split.map(&:to_i)
dp = Array.new(n, 0)
1.upto(n-1) do | i |
if i==1
dp[i] = (hs[i] - hs[i-1]).abs
p dp
next
end
step1 = (hs[i] - hs[i-1]).abs + dp[i-1]
step2 = (hs[i] - hs[i-2]).abs + dp[i-2]
dp[i] = step1 < step2 ? step1 : step2
end
p dp[-1]
|
n = gets.rstrip.to_i
hs = gets.rstrip.split.map(&:to_i)
dp = Array.new(n, 0)
1.upto(n-1) do | i |
if i==1
dp[i] = (hs[i] - hs[i-1]).abs
next
end
step1 = (hs[i] - hs[i-1]).abs + dp[i-1]
step2 = (hs[i] - hs[i-2]).abs + dp[i-2]
dp[i] = step1 < step2 ? step1 : step2
end
p dp[-1]
|
[
"call.remove"
] | 956,120
| 956,121
|
u366779547
|
ruby
|
p03161
|
eval'N,K,*A='+`dd`.split*?,
*b=0
2.upto(N){|i|b<<(1..K).map{|j|j<i ?b[-j]+(A[i]-A[i-j]).abs: 9**9}.min}
p b[-1]
|
eval'N,K,*A='+`dd`.split*?,
*b=0
1.upto(N-1){|i|b<<(1..K).map{|j|j<=i ?b[-j]+(A[i]-A[i-j]).abs: 9**9}.min}
p b[-1]
|
[
"literal.number.integer.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,153
| 957,154
|
u657913472
|
ruby
|
p03161
|
n,k=gets.split.map(&:to_i)
h=gets.split.map(&:to_i)
INF=100000000
dp=Array.new(n,INF)
dp[0]=0
for i in 1..n-1
if i==1
dp[i]=(h[i]-h[i-1]).abs
else
dp[i]=[]
for j in 1..k
if j>=i
break
end
dp[i]<<dp[i-j]+(h[i-j]-h[i]).abs
end
dp[i]=dp[i].min
end
end
p dp[-1]
|
n,k=gets.split.map(&:to_i)
h=gets.split.map(&:to_i)
INF=100000000
dp=Array.new(n,INF)
dp[0]=0
for i in 1..n-1
if i==1
dp[i]=(h[i]-h[i-1]).abs
else
dp[i]=[]
for j in 1..k
if j>i
break
end
dp[i]<<dp[i-j]+(h[i-j]-h[i]).abs
end
dp[i]=dp[i].min
end
end
p dp[-1]
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 957,523
| 957,524
|
u590472228
|
ruby
|
p03161
|
N,K = gets.split.map(&:to_i)
steps = gets.split.map(&:to_i)
inf = 10**12
dp = Array.new(N){inf}
dp[0] = 0
dp[1] = (steps[0]-steps[1]).abs
(2...N).each do |i|
(1..K).each do |k|
next if k > i
d = dp[i-k] + (steps[i-k] - steps[i]).abs
dp[i] = d if d < dp[i]
end
end
p dp
puts dp[N-1]
|
N,K = gets.split.map(&:to_i)
steps = gets.split.map(&:to_i)
inf = 10**12
dp = Array.new(N){inf}
dp[0] = 0
dp[1] = (steps[0]-steps[1]).abs
(2...N).each do |i|
(1..K).each do |k|
next if k > i
d = dp[i-k] + (steps[i-k] - steps[i]).abs
dp[i] = d if d < dp[i]
end
end
puts dp[N-1]
|
[
"call.remove"
] | 958,932
| 958,933
|
u173515518
|
ruby
|
p03162
|
gets;*a=0;$<.map{|s|i=0;a=s.split.map{|x|i+=1;j=0;a.map{|y|i!=(j+=1)?x.to_i+y:0}.max}};p a.max
|
gets;*a=0,0;$<.map{|s|i=0;a=s.split.map{|x|i+=1;j=0;a.map{|y|i!=(j+=1)?x.to_i+y:0}.max}};p a.max
|
[] | 962,539
| 962,540
|
u657913472
|
ruby
|
p03162
|
n = gets.chomp.to_i
k = []
n.times do |i|
k[i] = gets.chomp.split.map(&:to_i)
end
dp = Array.new(10 ** 5 + 5) { Array.new(3, 0) }
dp[0][0] = 0
dp[0][1] = 0
dp[0][2] = 0
0.upto(n) do |i|
(0..2).each do |j|
max = 0
(0..2).each do |d|
next if d == j
tmp = dp[i][d] + k[i-1][d]
max = tmp if tmp > max
end
dp[i+1][j] = max
end
end
p [dp[n][0], dp[n][1], dp[n][2]].max
|
n = gets.chomp.to_i
k = []
n.times do |i|
k[i] = gets.chomp.split.map(&:to_i)
end
dp = Array.new(10 ** 5 + 5) { Array.new(3, 0) }
dp[0][0] = 0
dp[0][1] = 0
dp[0][2] = 0
1.upto(n) do |i|
(0..2).each do |j|
max = 0
(0..2).each do |d|
next if d == j
tmp = dp[i-1][d] + k[i-1][d]
max = tmp if tmp > max
end
dp[i][j] = max
end
end
p [dp[n][0], dp[n][1], dp[n][2]].max
|
[
"literal.number.integer.change",
"expression.operation.binary.remove"
] | 963,029
| 963,030
|
u195257137
|
ruby
|
p03162
|
N = gets.to_i
abc = Array.new(N)
N.times do |i|
abc[i] = gets.split.map(&:to_i)
end
dp = Array.new(N)
dp[0] = [0,0,0]
(1..N).each do |i|
dp[i] = []
dp[i][0] = abc[i-1][0] + (dp[i-1][1] < dp[i-1][2] ? dp[i-1][2] : dp[i-1][1])
dp[i][1] = abc[i-1][1] + (dp[i-1][2] < dp[i-1][0] ? dp[i-1][0] : dp[i-1][2])
dp[i][2] = abc[i-1][2] + (dp[i-1][0] < dp[i-1][1] ? dp[i-1][1] : dp[i-1][0])
p dp[i]
end
puts dp[N].max
|
N = gets.to_i
abc = Array.new(N)
N.times do |i|
abc[i] = gets.split.map(&:to_i)
end
dp = Array.new(N)
dp[0] = [0,0,0]
(1..N).each do |i|
dp[i] = []
dp[i][0] = abc[i-1][0] + (dp[i-1][1] < dp[i-1][2] ? dp[i-1][2] : dp[i-1][1])
dp[i][1] = abc[i-1][1] + (dp[i-1][2] < dp[i-1][0] ? dp[i-1][0] : dp[i-1][2])
dp[i][2] = abc[i-1][2] + (dp[i-1][0] < dp[i-1][1] ? dp[i-1][1] : dp[i-1][0])
end
puts dp[N].max
|
[
"call.remove"
] | 963,051
| 963,052
|
u315859894
|
ruby
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.