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 |
|---|---|---|---|---|---|---|---|
p03036
|
r, d, x = gets.split.map(:to_i)
1.upto(10) do
x = r * x - d
puts x
end
|
r, d, x = gets.split.map(&:to_i)
1.upto(10) do
x = r * x - d
puts x
end
|
[
"call.arguments.change"
] | 849,403
| 849,404
|
u951762226
|
ruby
|
p03036
|
puts "Hello World!"
r, d, x = gets.strip.split.map(&:to_i)
10.times do
x = r * x - d
puts x
end
|
r, d, x = gets.strip.split.map(&:to_i)
10.times do
x = r * x - d
puts x
end
|
[
"call.remove"
] | 849,467
| 849,468
|
u686508464
|
ruby
|
p03037
|
n, m = gets.chomp.split.map(&:to_i)
l = 0
r = n
m.times do |i|
fl,fr = gets.chomp.split.map(&:to_i)
l = fl if l < fl
r = fr if fr < r
end
puts r - l + 1
|
n, m = gets.chomp.split.map(&:to_i)
l = 0
r = n
m.times do |i|
fl,fr = gets.chomp.split.map(&:to_i)
l = fl if l < fl
r = fr if fr < r
end
puts [r - l + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 849,517
| 849,518
|
u409390792
|
ruby
|
p03037
|
n,m = gets.chomp.split(" ").map(&:to_i)
min = 1
max = n
m.times do |i|
l,r = gets.chomp.split(" ").map(&:to_i)
min = l if l > min
max = r if r < max
end
puts max - min + 1
|
n,m = gets.chomp.split(" ").map(&:to_i)
min = 1
max = n
m.times do |i|
l,r = gets.chomp.split(" ").map(&:to_i)
min = l if l > min
max = r if r < max
end
puts [max - min + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 849,589
| 849,590
|
u257668305
|
ruby
|
p03037
|
n,m = gets.split.map(&:to_i)
l_max = 0
r_min = 10**9
m.times do |i|
l,r = gets.split.map(&:to_i)
l_max = [l,l_max].max
r_min = [r,r_min].min
end
p [n,r_min].min - l_max + 1
|
n,m = gets.split.map(&:to_i)
l_max = 0
r_min = 10**9
m.times do |i|
l,r = gets.split.map(&:to_i)
l_max = [l,l_max].max
r_min = [r,r_min].min
end
p [[n,r_min].min - l_max + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 850,046
| 850,047
|
u238956837
|
ruby
|
p03037
|
n,m = gets.strip.split.map(&:to_i)
left = []
right = []
m.times do
l,r = gets.strip.split.map(&:to_i)
left << l
right << r
end
if l.max <= r.min
puts r.min-l.max+1
else
puts 0
end
|
n,m = gets.strip.split.map(&:to_i)
left = []
right = []
m.times do
l,r = gets.strip.split.map(&:to_i)
left << l
right << r
end
if left.max <= right.min
puts right.min-left.max+1
else
puts 0
end
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 850,173
| 850,174
|
u313103408
|
ruby
|
p03037
|
n, m = gets.split.map &:to_i
l_max, r_min = -1, 1000000
m.times do
l, r = gets.split.map &:to_i
l_max = [l, l_max].max
r_min = [r, r_min].min
end
p r_min - l_max + 1
|
n, m = gets.split.map &:to_i
l_max, r_min = -1, 1000000
m.times do
l, r = gets.split.map &:to_i
l_max = [l, l_max].max
r_min = [r, r_min].min
end
p [r_min - l_max + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 850,205
| 850,206
|
u347948131
|
ruby
|
p03037
|
N, M = gets.to_s.split(' ').map(&:to_i)
lm = 1
rm = N
M.times do |m|
l, r = gets.to_s.split(' ').map(&:to_i)
lm = l if l > lm
rm = r if r < rm
end
puts rm - (lm - 1)
|
N, M = gets.to_s.split(' ').map(&:to_i)
lm = 1
rm = N
M.times do |m|
l, r = gets.to_s.split(' ').map(&:to_i)
lm = l if l > lm
rm = r if r < rm
end
puts [rm - (lm - 1), 0].max
|
[
"call.arguments.change",
"call.add"
] | 850,495
| 850,496
|
u289815651
|
ruby
|
p03037
|
N,M = gets.split.map(&:to_i)
l = []
r = []
M.times do |i|
l[i],r[i] = gets.split.map(&:to_i)
end
result = r.min-l.max
if result < 0
puts 0
else
result+1
end
|
N,M = gets.split.map(&:to_i)
l = []
r = []
M.times do |i|
l[i],r[i] = gets.split.map(&:to_i)
end
result = r.min-l.max
if result < 0
puts 0
else
puts result+1
end
|
[
"io.output.change",
"call.add"
] | 850,618
| 850,619
|
u760636024
|
ruby
|
p03037
|
n, m = gets.split.map(&:to_i)
l, r = m.times.map {|i|
gets.split.map(&:to_i)
}.transpose
result = r.min - l.max + 1
p result > 100000 ? 100000 : result
|
n, m = gets.split.map(&:to_i)
l, r = m.times.map {|i|
gets.split.map(&:to_i)
}.transpose
result = r.min - l.max + 1
p result > 0 ? result : 0
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 851,135
| 851,136
|
u679291177
|
ruby
|
p03037
|
n,m = gets.split.map(&:to_i)
ls = m.times.map{gets.split.map(&:to_i)}
a = [ls[0][0],ls[0][1]]
ls.each do |b|
if a[0] < b[0]
a[0] = b[0]
end
if a[1] > b[1]
a[1] = b[1]
end
end
tmp = a[1] - a[0]
p a
if tmp < 0
puts 0
else
puts tmp + 1
end
|
n,m = gets.split.map(&:to_i)
ls = m.times.map{gets.split.map(&:to_i)}
a = [ls[0][0],ls[0][1]]
ls.each do |b|
if a[0] < b[0]
a[0] = b[0]
end
if a[1] > b[1]
a[1] = b[1]
end
end
tmp = a[1] - a[0]
if tmp < 0
puts 0
else
puts tmp + 1
end
|
[
"call.remove"
] | 851,759
| 851,760
|
u296101474
|
ruby
|
p03037
|
n, m = gets.split.map(&:to_i)
l_arr = []
r_arr = []
m.times do
l, r = gets.split.map(&:to_i)
l_arr << l
r_arr << r
end
if r_arr.min == l_arr.max
puts 1
elsif r_arr.min < l_arr.max
puts (r_arr.min - l_arr.max) + 1
else
puts 0
end
|
n, m = gets.split.map(&:to_i)
l_arr = []
r_arr = []
m.times do
l, r = gets.split.map(&:to_i)
l_arr << l
r_arr << r
end
if r_arr.min == l_arr.max
puts 1
elsif r_arr.min > l_arr.max
puts (r_arr.min - l_arr.max) + 1
else
puts 0
end
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,835
| 851,836
|
u793801197
|
ruby
|
p03037
|
n,m = gets.split.map(&:to_i)
l = []
r = []
m.times do |i|
a,b = gets.split.map(&:to_i)
l << a
r << b
end
ans = r.min - l.max
puts ans > 0 ? ans + 1 : 0
|
n,m = gets.split.map(&:to_i)
l = []
r = []
m.times do |i|
a,b = gets.split.map(&:to_i)
l << a
r << b
end
ans = r.min - l.max
puts ans >= 0 ? ans + 1 : 0
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 851,982
| 851,983
|
u178515699
|
ruby
|
p03037
|
n,m = gets.split.map(&:to_i)
l = []
r = []
m.times do |i|
a,b = gets.split.map(&:to_i)
l << a
r << b
end
ans = r.min - l.max
puts ans > 0 ? ans - 1 : 0
|
n,m = gets.split.map(&:to_i)
l = []
r = []
m.times do |i|
a,b = gets.split.map(&:to_i)
l << a
r << b
end
ans = r.min - l.max
puts ans >= 0 ? ans + 1 : 0
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 851,984
| 851,983
|
u178515699
|
ruby
|
p03037
|
N, M = gets.chomp.split(" ").map(&:to_i)
li = []
ri = []
for i in 0...M do
l, r = gets.chomp.split(" ").map(&:to_i)
li[i] = l
ri[i] = r
end
if (ri.min - li.max) >= 1 then
puts ri.min - li.max
else
puts 0
end
|
N, M = gets.chomp.split(" ").map(&:to_i)
li = []
ri = []
for i in 0...M do
l, r = gets.chomp.split(" ").map(&:to_i)
li[i] = l
ri[i] = r
end
# liの最大値 - riの最小値が答え
if (ri.min - li.max) >= 0 then
puts ri.min - li.max + 1
else
puts 0
end
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 852,035
| 852,036
|
u339791405
|
ruby
|
p03037
|
N, M = gets.chomp.split.map(&:to_i)
l_max = 1
r_min = N
M.times do
p, q = gets.chomp.split.map(&:to_i)
l_max = p if (l_max < p)
r_min = q if (q < r_min)
end
puts (r_min - l_max + 1)
|
N, M = gets.chomp.split.map(&:to_i)
l_max = 1
r_min = N
M.times do
p, q = gets.chomp.split.map(&:to_i)
l_max = p if (l_max < p)
r_min = q if (q < r_min)
end
puts [r_min - l_max + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 852,065
| 852,066
|
u938270657
|
ruby
|
p03037
|
n,m = gets.split(' ').map(&:to_i)
min_limit = 1
max_limit = n
(0...m).each do |i|
gate_info = gets.split(' ').map(&:to_i)
min_limit = gate_info[0] if gate_info[0] > min_limit
max_limit = gate_info[1] if gate_info[1] < max_limit
end
puts max_limit - min_limit + 1
|
n,m = gets.split(' ').map(&:to_i)
min_limit = 1
max_limit = n
(0...m).each do |i|
gate_info = gets.split(' ').map(&:to_i)
min_limit = gate_info[0] if gate_info[0] > min_limit
max_limit = gate_info[1] if gate_info[1] < max_limit
end
puts [max_limit - min_limit + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 852,192
| 852,193
|
u765878014
|
ruby
|
p03037
|
input_nk = gets.chomp
n,m = input_nk.split.collect{ |item| item.to_i}
min = 1
max = n
m.times do |i|
input = gets.chomp
l,r = input.split.collect{ |item| item.to_i}
min = l if l >= min
max = r if r <= max
end
rsult = 0
if max >= min
result = max - min + 1
end
puts result
|
input_nk = gets.chomp
n,m = input_nk.split.collect{ |item| item.to_i}
min = 1
max = n
m.times do |i|
input = gets.chomp
l,r = input.split.collect{ |item| item.to_i}
min = l if l >= min
max = r if r <= max
end
result = 0
if max >= min
result = max - min + 1
end
puts result
|
[
"assignment.variable.change",
"identifier.change"
] | 852,285
| 852,286
|
u552366486
|
ruby
|
p03037
|
n, m = gets.chomp.split(" ").map(&:to_i)
max_l = 0
min_r = n + 1
m.times do |i|
l, r = gets.chomp.split(" ").map(&:to_i)
max_l = l if l > max_l
min_r = r if min_r > r
end
puts min_r - max_l + 1
|
n, m = gets.chomp.split(" ").map(&:to_i)
max_l = 0
min_r = n + 1
m.times do |i|
l, r = gets.chomp.split(" ").map(&:to_i)
max_l = l if l > max_l
min_r = r if min_r > r
end
puts [min_r - max_l + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 852,305
| 852,306
|
u443924743
|
ruby
|
p03037
|
n,m= gets.split(" ").map(&:to_i)
min = 0
max = n
m.times do
l,r= gets.split(" ").map(&:to_i)
if l > min
min = l
end
if r < max
max = r
end
end
puts max - min + 1
|
n,m= gets.split(" ").map(&:to_i)
min = 0
max = n
m.times do
l,r= gets.split(" ").map(&:to_i)
if l > min
min = l
end
if r < max
max = r
end
end
puts [max - min + 1,0].max
|
[
"call.arguments.change",
"call.add"
] | 852,494
| 852,495
|
u094826590
|
ruby
|
p03037
|
n,m = gets.split.map(&:to_i)
l,r = m.times.map{gets.split.map(&:to_i)}.transpose
puts r.min - l.max+1
|
n,m = gets.split.map(&:to_i)
l,r = m.times.map{gets.split.map(&:to_i)}.transpose
puts [r.min - l.max + 1, 0].max
|
[
"call.arguments.change",
"call.add"
] | 852,516
| 852,517
|
u056944756
|
ruby
|
p03037
|
N, M = gets.split(" ").map(&:to_i)
maxL = 1
minR = N
M.times do
l, r = gets.split(" ").map(&:to_i)
maxL = [maxL, l].max
minR = [minR, r].min
end
puts (minR - maxL + 1)
|
N, M = gets.split(" ").map(&:to_i)
maxL = 1
minR = N
M.times do
l, r = gets.split(" ").map(&:to_i)
maxL = [maxL, l].max
minR = [minR, r].min
end
puts [0, (minR - maxL + 1)].max
|
[
"literal.array.change",
"call.add"
] | 852,642
| 852,643
|
u579651661
|
ruby
|
p03037
|
n,m = gets.chomp.split.map(&:to_i)
gs = m.times.map{gets.chomp.split.map(&:to_i)}
lmax = 0
rmin = n+1
gs.each do |l,r|
lmax = [l,lmax].max
rmin = [r,rmin].min
end
puts rmin - lmax + 1
|
n,m = gets.chomp.split.map(&:to_i)
gs = m.times.map{gets.chomp.split.map(&:to_i)}
lmax = 0
rmin = n+1
gs.each do |l,r|
lmax = [l,lmax].max
rmin = [r,rmin].min
end
puts [rmin - lmax + 1,0].max
|
[
"call.arguments.change",
"call.add"
] | 852,650
| 852,651
|
u191196346
|
ruby
|
p03038
|
N,M = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
x = a.map{|ai| [1, ai]}
M.times do
x << gets.split.map(&:to_i)
end
x.sort_by!{|xi| -xi[1]}
cnt = 0
ans = 0
p x
x.each do |xi|
cnt += xi[0]
if cnt < N
ans += xi[1]*xi[0]
else
ans += xi[1]*xi[0]
ans -= (cnt-N)*xi[1]
break
end
end
puts cnt
puts ans
|
N,M = gets.split.map(&:to_i)
a = gets.split.map(&:to_i)
x = a.map{|ai| [1, ai]}
M.times do
x << gets.split.map(&:to_i)
end
x.sort_by!{|xi| -xi[1]}
cnt = 0
ans = 0
x.each do |xi|
cnt += xi[0]
if cnt < N
ans += xi[1]*xi[0]
else
ans += xi[1]*xi[0]
ans -= (cnt-N)*xi[1]
break
end
end
puts ans
|
[
"call.remove"
] | 853,518
| 853,519
|
u706695185
|
ruby
|
p03038
|
n, m = gets.split.map(&:to_i)
a = gets.split.map(&:to_i).sort
bc = []
m.times do |i|
bc << gets.split.map(&:to_i) # b枚、cに書き換える
end
bc = bc.sort_by{|x|x[1]}
n.times do |i|
if a[i] < bc[-1][1]
a[i] = bc[-1][1]
bc[-1][0] -= 1
bc.pop if bc[-1][0] == 0
end
end
p a.inject(:+)
|
n, m = gets.split.map(&:to_i)
a = gets.split.map(&:to_i).sort
bc = []
m.times do |i|
bc << gets.split.map(&:to_i) # b枚、cに書き換える
end
bc = bc.sort_by{|x|x[1]}
n.times do |i|
if a[i] < bc[-1][1]
a[i] = bc[-1][1]
bc[-1][0] -= 1
bc.pop if bc[-1][0] == 0
break if bc.empty?
end
end
p a.inject(:+)
|
[] | 853,522
| 853,523
|
u315597999
|
ruby
|
p03038
|
N, M = gets.split.map(&:to_i)
A = gets.split.map(&:to_i).sort
OP = M.times.map{ gets.split.map(&:to_i) }.sort_by(&:last).reverse
OP.inject(0) do |offset, (b,c)|
flag = b.times.all? do |i|
A[offset + i] = c if A[offset + i] < c
end
if flag
offset + b
else
break
end
end
puts A.inject(&:+)
|
N, M = gets.split.map(&:to_i)
A = gets.split.map(&:to_i).sort
OP = M.times.map{ gets.split.map(&:to_i) }.sort_by(&:last).reverse
OP.inject(0) do |offset, (b,c)|
flag = b.times.all? do |i|
A[offset + i] = c if offset + i < N && A[offset + i] < c
end
if flag
offset + b
else
break
end
end
puts A.inject(&:+)
|
[
"control_flow.branch.if.condition.change"
] | 853,644
| 853,645
|
u627981707
|
ruby
|
p03038
|
n, m = gets.chomp.split(' ').map(&:to_i)
a = gets.chomp.split(' ').map(&:to_i)
a.sort!
bcs = []
m.times do
bcs << gets.chomp.split(' ').map(&:to_i)
end
bcs.sort!{|x, y| y[1] <=> x[1]}
i = 0
catch :loop do
bcs.each do |bc|
bc[0].times do
if i <= n
if bc[1] > a[i]
a[i] = bc[1]
i += 1
else
throw :loop
end
end
end
end
end
puts a.inject(:+)
|
n, m = gets.chomp.split(' ').map(&:to_i)
a = gets.chomp.split(' ').map(&:to_i)
a.sort!
bcs = []
m.times do
bcs << gets.chomp.split(' ').map(&:to_i)
end
bcs.sort!{|x, y| y[1] <=> x[1]}
i = 0
catch :loop do
bcs.each do |bc|
bc[0].times do
if i < n
if bc[1] > a[i]
a[i] = bc[1]
i += 1
else
throw :loop
end
else
throw :loop
end
end
end
end
puts a.inject(:+)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add"
] | 853,780
| 853,781
|
u906574460
|
ruby
|
p03038
|
input = gets.chomp.split
n = input[0].to_i
m = input[1].to_i
a = gets.chomp.split(" ").map(&:to_i)
bc = []
for i in 1..m do
bc.push(gets.chomp.split(" ").map(&:to_i))
end
a.sort!
bc.sort! {| x,y | y[1] <=> x[1]}
i = 0
j = 0
while i < m
b = bc[i][0]
c = bc[i][1]
for k in 1..b
if a[j] < c
a[j] = c
j += 1
if j >= m
i = m
break
end
else
i = m
break
end
end
i += 1
end
sum = 0
for i in 1..n do
sum += a[i-1]
end
p sum
|
input = gets.chomp.split
n = input[0].to_i
m = input[1].to_i
a = gets.chomp.split(" ").map(&:to_i)
bc = []
for i in 1..m do
bc.push(gets.chomp.split(" ").map(&:to_i))
end
a.sort!
bc.sort! {| x,y | y[1] <=> x[1]}
i = 0
j = 0
while i < m
b = bc[i][0]
c = bc[i][1]
for k in 1..b
if a[j] < c
a[j] = c
j += 1
if j >= n
i = m
break
end
else
i = m
break
end
end
i += 1
end
sum = 0
for i in 1..n do
sum += a[i-1]
end
p sum
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 853,814
| 853,815
|
u988912858
|
ruby
|
p03038
|
N, M = gets.split.map(&:to_i)
as = gets.split.map(&:to_i)
bcs = []
M.times do |i|
bcs << gets.split.map(&:to_i)
end
bcs.sort! { |(b1,c1),(b2,c2)| c2<=>c1}
n = N
bcs2 = []
while n > 0 do
bcs.each do |bc|
t = [bc[0], n].min
n -= t
bcs2 << [bc[1]] * t
break if n == 0
end
end
bcs2.flatten!
puts (as + bcs2).sort.reverse[0..N-1].inject(:+)
|
N, M = gets.split.map(&:to_i)
as = gets.split.map(&:to_i)
bcs = []
M.times do |i|
bcs << gets.split.map(&:to_i)
end
bcs.sort! { |(b1,c1),(b2,c2)| c2<=>c1}
n = N
bcs2 = []
bcs.each do |bc|
t = [bc[0], n].min
n -= t
bcs2 << [bc[1]] * t
break if n == 0
end
bcs2.flatten!
puts (as + bcs2).sort.reverse[0..N-1].inject(:+)
|
[] | 853,853
| 853,854
|
u729246375
|
ruby
|
p03038
|
n,m = gets.chomp.split.map(&:to_i)
as = gets.chomp.split.map(&:to_i).sort
ops = m.times.map{gets.chomp.split.map(&:to_i)}.sort_by(&:last).reverse
flag = false
current = 0
ops.each do |b,c|
(current..current+b-1).each do |i|
if as[i] < c
as[i] = c
else
flag = true
break
end
end
if flag
break
else
current += b
end
end
puts as.inject(:+)
|
n,m = gets.chomp.split.map(&:to_i)
as = gets.chomp.split.map(&:to_i).sort
ops = m.times.map{gets.chomp.split.map(&:to_i)}.sort_by(&:last).reverse
flag = false
current = 0
ops.each do |b,c|
(current..current+b-1).each do |i|
if i < n && as[i] < c
as[i] = c
else
flag = true
break
end
end
if flag
break
else
current += b
end
end
puts as.inject(:+)
|
[
"control_flow.branch.if.condition.change"
] | 853,882
| 853,883
|
u191196346
|
ruby
|
p03038
|
N, M = gets.split.map(&:to_i)
A = gets.split.map(&:to_i)
O = Array.new(M) { gets.split.map(&:to_i) }
A.sort!
O.sort_by! {|o| o[1] }.reverse!
i, j = 0, 0
while i < N
break if O[j][1] < A[i]
A[i] = O[j][1]
i += 1
O[j][0] -= 1
j += 1 if O[j][0] == 0
end
p A.inject(:+)
|
N, M = gets.split.map(&:to_i)
A = gets.split.map(&:to_i)
O = Array.new(M) { gets.split.map(&:to_i) }
A.sort!
O.sort_by! {|o| o[1] }.reverse!
i, j = 0, 0
while i < N && j < M
break if O[j][1] < A[i]
A[i] = O[j][1]
i += 1
O[j][0] -= 1
j += 1 if O[j][0] == 0
end
p A.inject(:+)
|
[
"expression.operation.binary.add"
] | 853,965
| 853,966
|
u333012034
|
ruby
|
p03038
|
# Integer Cards
cards = []
rewrite_source = []
N, M = gets.chomp.split(" ").map(&:to_i)
cards = gets.chomp.split(" ").map(&:to_i)
for i in 0...M do
bnum, cnum = gets.chomp.split(" ").map(&:to_i)
rewrite_source[i] = [bnum, cnum]
end
cards.sort!
rewrite_source.sort_by!{|a| a[1]}.reverse!
check = 0
j = 0
i = 0
while i < M
#for i in 0...M
if j > rewrite_source[i][0] + check then
while j < N
if cards[j] <= rewrite_source[i][1] then
cards[j] = rewrite_source[i][1]
else
break
end
j += 1
end
else
while j < rewrite_source[i][0] + check
if cards[j] <= rewrite_source[i][1] then
cards[j] = rewrite_source[i][1]
else
break
end
j += 1
end
end
check = j
i += 1
end
answer = 0
cards.each{|a|
answer += a
}
puts answer
|
# Integer Cards
cards = []
rewrite_source = []
N, M = gets.chomp.split(" ").map(&:to_i)
cards = gets.chomp.split(" ").map(&:to_i)
for i in 0...M do
bnum, cnum = gets.chomp.split(" ").map(&:to_i)
rewrite_source[i] = [bnum, cnum]
end
cards.sort!
rewrite_source.sort_by!{|a| a[1]}.reverse!
check = 0
j = 0
i = 0
while i < M
#for i in 0...M
if N < rewrite_source[i][0] + check then
while j < N
if cards[j] <= rewrite_source[i][1] then
cards[j] = rewrite_source[i][1]
else
break
end
j += 1
end
else
while j < rewrite_source[i][0] + check
if cards[j] <= rewrite_source[i][1] then
cards[j] = rewrite_source[i][1]
else
break
end
j += 1
end
end
check = j
i += 1
end
answer = 0
cards.each{|a|
answer += a
}
puts answer
|
[] | 854,049
| 854,050
|
u339791405
|
ruby
|
p03038
|
n,m = gets.split.map(&:to_i)
arr = gets.split.map(&:to_i).sort
ls = m.times.map{gets.split.map(&:to_i)}.sort_by{|i| i[1]}.reverse
sum = 0
ls.each do |j|
j[0].times do |i|
if arr.size == nil
break
elsif arr[0] < j[1]
sum += j[1]
arr.shift
else
break
end
end
end
if arr.size != nil
p arr.inject(:+) + sum
else
p sum
end
|
n,m = gets.split.map(&:to_i)
arr = gets.split.map(&:to_i).sort
ls = m.times.map{gets.split.map(&:to_i)}.sort_by{|i| i[1]}.reverse
sum = 0
ls.each do |j|
j[0].times do |i|
if arr.size == 0
break
elsif arr[0] < j[1]
sum += j[1]
arr.shift
else
break
end
end
end
if arr.size != 0
p arr.inject(:+) + sum
else
p sum
end
|
[
"control_flow.branch.if.condition.change"
] | 854,152
| 854,153
|
u296101474
|
ruby
|
p03041
|
n,k = gets.chomp.split(' ').map(&:to_i)
s = gets.chomp
s[k] = s[k].downcase
puts s
|
n,k = gets.chomp.split(' ').map(&:to_i)
s = gets.chomp
s[k-1] = s[k-1].downcase
puts s
|
[
"assignment.change"
] | 854,717
| 854,718
|
u059126963
|
ruby
|
p03041
|
# A, B, C からなる長さ N の文字列 S と、1 以上 N 以下の整数 K が与えられます。
# 文字列 S の K 文字目を小文字に書き換え、新しくできた S を出力してください。
nk = gets.chomp.split
n = nk[0].to_i
k = nk[1].to_i
s = gets.chomp
s[k] = s[k].downcase
puts s
|
# A, B, C からなる長さ N の文字列 S と、1 以上 N 以下の整数 K が与えられます。
# 文字列 S の K 文字目を小文字に書き換え、新しくできた S を出力してください。
nk = gets.chomp.split
n = nk[0].to_i
k = nk[1].to_i
s = gets.chomp
s[k-1] = s[k-1].downcase
puts s
|
[
"assignment.change"
] | 855,523
| 855,524
|
u139850627
|
ruby
|
p03041
|
n,k = gets.split(" ").map(&:to_i)
s = gets.split(//).map(&:to_s)
s[k-1] = s[k-1].downcase
puts s
|
n,k = gets.split(" ").map(&:to_i)
s = gets.split(//).map(&:to_s)
s[k-1] = s[k-1].downcase
puts s.join
|
[
"call.add"
] | 855,656
| 855,657
|
u944733909
|
ruby
|
p03041
|
n, k = gets.chomp.split(" ").map(&:to_i)
s = gets.chomp.split("")
s[k-1].downcase!
puts s
|
n, k = gets.chomp.split(" ").map(&:to_i)
s = gets.chomp.split("")
s[k-1].downcase!
puts s.join
|
[
"call.add"
] | 855,660
| 855,661
|
u333374716
|
ruby
|
p03041
|
n,k = gets.split.map(&:to_i)
s = gets.chomp
s[k-1] = s[k-1].downcase
p s
|
n,k = gets.split.map(&:to_i)
s = gets.chomp
s[k-1] = s[k-1].downcase
puts s
|
[
"call.function.change",
"io.output.change"
] | 855,780
| 855,781
|
u562082015
|
ruby
|
p03041
|
n,k = gets.split.map(&:to_i)
s = gets.chomp
s[k] = s[k].downcase
p s
|
n,k = gets.split.map(&:to_i)
s = gets.chomp
s[k-1] = s[k-1].downcase
puts s
|
[
"call.function.change",
"io.output.change"
] | 855,782
| 855,781
|
u562082015
|
ruby
|
p03041
|
i = gets.split(" ")[1].to_i
puts ((str = gets.chomp)[i-1] = str[i-1].downcase)
|
i = gets.split(" ")[1].to_i
(str = gets.chomp)[i-1] = str[i-1].downcase
puts str
|
[
"call.remove",
"call.arguments.change"
] | 855,785
| 855,786
|
u538351278
|
ruby
|
p03041
|
k = gets.to_i
s = gets.chomp
s[k-1] = s[k-1].downcase
puts s
|
n,k=gets.split.map &:to_i
s = gets.chomp
s[k-1] = s[k-1].downcase
puts s
|
[
"assignment.value.change",
"identifier.change",
"call.add"
] | 856,151
| 856,152
|
u012110567
|
ruby
|
p03041
|
n, k = gets.split.map(&:to_i)
s = gets.chomp.split("")
s[k-1].downcase!
p s.join
|
n, k = gets.split.map(&:to_i)
s = gets.chomp.split("")
s[k-1].downcase!
puts s.join
|
[
"call.function.change",
"io.output.change"
] | 856,185
| 856,186
|
u679291177
|
ruby
|
p03041
|
k=gets.chomp.split(" ").map{|n|n.to_i}[1]
str = gets.chomp
str[k-1] = str[k-i].downcase
puts str
|
k=gets.chomp.split(" ").map{|n|n.to_i}[1]
str = gets.chomp
str[k-1] = str[k-1].downcase
puts str
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 856,205
| 856,206
|
u606976120
|
ruby
|
p03041
|
n,k=gets.chomp.split(" ").map{|n|n.to_i}
str = gets.chomp
str[k-1] = str[k-i].downcase
puts str
|
k=gets.chomp.split(" ").map{|n|n.to_i}[1]
str = gets.chomp
str[k-1] = str[k-1].downcase
puts str
|
[
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 856,207
| 856,206
|
u606976120
|
ruby
|
p03041
|
a = []
n, m = gets.split.map(&:to_i)
str = gets.chomp.split("")
str.each_with_index do |s,i|
if i == (m-1)
a << s.downcase!
else
a << s
end
end
p a.join
|
a = []
n, m = gets.split.map(&:to_i)
str = gets.chomp.split("")
str.each_with_index do |s,i|
if i == (m-1)
a << s.downcase!
else
a << s
end
end
puts a.join
|
[
"call.function.change",
"io.output.change"
] | 856,284
| 856,285
|
u819939299
|
ruby
|
p03041
|
n,k = gets.split(" ").map(&:to_i);
s = gets.chomp
s[k-1] = s[k-1].downcase
p s
|
n,k = gets.split(" ").map(&:to_i);
s = gets.chomp
s[k-1] = s[k-1].downcase
puts s
|
[
"call.function.change",
"io.output.change"
] | 856,345
| 856,346
|
u307452818
|
ruby
|
p03041
|
N,K = readline.chomp.split.map(&:to_i)
S = readline.chomp.split.map(&:to_s)[0]
p S.slice(0, K-1) + S.slice(K-1, 1).downcase + S.slice(K,N)
|
N,K = readline.chomp.split.map(&:to_i)
S = readline.chomp.split.map(&:to_s)[0]
print S.slice(0, K-1) + S.slice(K-1, 1).downcase + S.slice(K,N)
|
[
"call.function.change",
"io.output.change"
] | 856,422
| 856,423
|
u634813468
|
ruby
|
p03041
|
num = gets.split.map(&:to_i).last
str = gets.chomp.chars
str[num - 1].downcase!
p str.join
|
num = gets.split.map(&:to_i).last
str = gets.chomp.chars
str[num - 1].downcase!
puts str.join
|
[
"call.function.change",
"io.output.change"
] | 856,457
| 856,458
|
u906724785
|
ruby
|
p03041
|
num = gets.split.map(&:to_i).last
str = gets.chomp.chars
str[num - 1].downcase!
p str.join
|
num = gets.split.map(&:to_i).last
str = gets.chomp.chars
str[num - 1].downcase!
puts str.join
|
[
"call.function.change",
"io.output.change"
] | 856,459
| 856,458
|
u906724785
|
ruby
|
p03041
|
N, K = gets.chomp.split(/\s+/, 2).map(&:to_i)
S = gets.chomp
S[K+1] = {?A=>"a", ?B=>"b", ?C=>"c"}[S[K+1]]
puts S
|
N, K = gets.chomp.split(/\s+/, 2).map(&:to_i)
S = gets.chomp
S[K-1] = {?A=>"a", ?B=>"b", ?C=>"c"}[S[K-1]]
puts S
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 856,460
| 856,461
|
u977697682
|
ruby
|
p03041
|
input = gets.split(" ").map{|item|item.to_i}
moji= gets.chomp
if moji[input[1]-1] == "A" then
moji[input[1]-1] == "a"
elsif moji[input[1]-1] == "B" then
moji[input[1]-1] == "b"
else
moji[input[1]-1] == "c"
end
print moji
|
input = gets.split(" ").map{|item|item.to_i}
moji= gets.chomp
if moji[input[1]-1] == "A" then
moji[input[1]-1] = "a"
elsif moji[input[1]-1] == "B" then
moji[input[1]-1] = "b"
else
moji[input[1]-1] = "c"
end
print moji
|
[
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 856,526
| 856,527
|
u312004378
|
ruby
|
p03041
|
n,k = gets.split(' ').map(&:to_i)
s = gets
k += 1
s[k] = s[k].downcase!
puts s
|
n,k = gets.split(' ').map(&:to_i)
s = gets
k -= 1
s[k] = s[k].downcase!
puts s
|
[
"expression.operator.change"
] | 856,636
| 856,637
|
u528642874
|
ruby
|
p03041
|
N,k = gets.split(' ').map(&:to_i)
s = gets
k += 1
s[K] = s[K].downcase!
puts s
|
n,k = gets.split(' ').map(&:to_i)
s = gets
k -= 1
s[k] = s[k].downcase!
puts s
|
[
"assignment.variable.change",
"expression.operator.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 856,638
| 856,637
|
u528642874
|
ruby
|
p03041
|
N,K = gets.split(' ').map(&:to_i)
s = gets
K += 1
s[K] = s[K].downcase!
puts s
|
n,k = gets.split(' ').map(&:to_i)
s = gets
k -= 1
s[k] = s[k].downcase!
puts s
|
[
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 856,639
| 856,637
|
u528642874
|
ruby
|
p03041
|
K = gets.chomp.split[1].to_i
S = gets
puts S.chars.map.with_index {|s, i| i == K ? s.downcase : s }.join('')
|
K = gets.chomp.split[1].to_i - 1
S = gets
puts S.chars.map.with_index {|s, i| i == K ? s.downcase : s }.join('')
|
[
"assignment.change"
] | 856,642
| 856,643
|
u198207452
|
ruby
|
p03041
|
K = gets.chomp.split[2].to_i
S = gets
puts S.chars.map.with_index {|s, i| i == K ? s.downcase : s }.join('')
|
K = gets.chomp.split[1].to_i - 1
S = gets
puts S.chars.map.with_index {|s, i| i == K ? s.downcase : s }.join('')
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 856,644
| 856,643
|
u198207452
|
ruby
|
p03041
|
(n,k)=gets().map(&:to_i)
s=gets
s[k-1] = s[k-1].downcase
print s
|
(n,k)=gets.split.map(&:to_i)
s=gets
s[k-1] = s[k-1].downcase
print s
|
[] | 856,713
| 856,714
|
u702482655
|
ruby
|
p03041
|
N,K = gets.split.map(&:to_i)
S = gets.chop(&:to_s)
if K >= 2
p S[0,K-1] + S[K-1,N].capitalize.swapcase
else
p S.capitalize.swapcase
end
|
N,K = gets.split.map(&:to_i)
S = gets.chop(&:to_s)
if K >= 2
puts S[0,K-1] + S[K-1,N].capitalize.swapcase
else
puts S.capitalize.swapcase
end
|
[
"call.function.change",
"io.output.change"
] | 856,771
| 856,772
|
u581928831
|
ruby
|
p03041
|
n,k=gets.split.map &:to_i
s=gets.to_s
ss=[]
(1..s.size-1).each do |i|
if i==k
ss<<s[i-1].swapcase!
else
ss<<s[i-1]
end
end
puts ss
|
n,k=gets.split.map &:to_i
s=gets.to_s
ss=''
(1..s.size-1).each do |i|
if i==k
ss<<s[i-1].swapcase!
else
ss<<s[i-1]
end
end
puts ss
|
[] | 856,837
| 856,838
|
u135201316
|
ruby
|
p03041
|
n, k = gets.rstrip.split(' ').map(&:to_i)
s = gets.rstrip
p "#{s.slice(0, k-1)}#{s[k-1].downcase}#{s.slice(k, n)}"
|
n, k = gets.rstrip.split(' ').map(&:to_i)
s = gets.rstrip
puts "#{s.slice(0, k-1)}#{s[k-1].downcase}#{s.slice(k, n)}"
|
[
"call.function.change",
"io.output.change"
] | 856,839
| 856,840
|
u366779547
|
ruby
|
p03041
|
N,K = gets.split.map(&:to_i)
s = gets.strip
if K == 1
puts s[0].downcase + s[1,N]
elsif K == N
puts s[1,-2] + s[N-1].downcase
else
puts s[0,K-1] + s[K-1].downcase + s[K,N]
end
|
N,K = gets.split.map(&:to_i)
s = gets.strip
if K == 1
puts s[0].downcase + s[1,N]
elsif K == N
puts s[0,N-1] + s[N-1].downcase
else
puts s[0,K-1] + s[K-1].downcase + s[K,N]
end
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 856,854
| 856,855
|
u843036991
|
ruby
|
p03041
|
a,b = gets.split(" ").map(&:to_i)
c = gets
c[b-1] = c[b-1].to_s.swapcase
p c
|
a,b = gets.split(" ").map(&:to_i)
c = gets
c[b-1] = c[b-1].to_s.swapcase!
puts c
|
[] | 856,944
| 856,945
|
u702652578
|
ruby
|
p03041
|
a,b = gets.split(" ").map(&:to_i)
c = gets
c[b-1] = c[b-1].to_s.swapcase!
p c
|
a,b = gets.split(" ").map(&:to_i)
c = gets
c[b-1] = c[b-1].to_s.swapcase!
puts c
|
[
"call.function.change",
"io.output.change"
] | 856,946
| 856,945
|
u702652578
|
ruby
|
p03041
|
def main(argv)
(n, k) = gets.chomp.split(' ').map(&:to_i)
s = gets.chomp
s[k] = s[k].downcase!
puts s
end
if self.to_s == 'main' then
main(ARGV)
end
|
def main(argv)
(n, k) = gets.chomp.split(' ').map(&:to_i)
s = gets.chomp
s[k - 1] = s[k - 1].downcase!
puts s
end
if self.to_s == 'main' then
main(ARGV)
end
|
[
"assignment.change"
] | 856,966
| 856,967
|
u198355306
|
ruby
|
p03042
|
S = gets.chomp
data1 = S[0..1].to_i
data2 = S[2..3].to_i
yymm = (1 <= data1 && data1 <= 12)
mmyy = (1 <= data2 && data2 <= 12)
if yymm && mmyy
puts "AMBIGUOUS"
elsif yymm
puts "YYMM"
elsif mmyy
puts "MMYY"
else
puts "NA"
end
|
s = gets.chomp
data1 = s[0..1].to_i
data2 = s[2..3].to_i
mmyy = (1 <= data1 && data1 <= 12)
yymm = (1 <= data2 && data2 <= 12)
if yymm && mmyy
puts "AMBIGUOUS"
elsif yymm
puts "YYMM"
elsif mmyy
puts "MMYY"
else
puts "NA"
end
|
[
"misc.typo",
"assignment.variable.change",
"assignment.value.change",
"identifier.change"
] | 857,094
| 857,095
|
u585819925
|
ruby
|
p03042
|
S = gets.chomp.to_i
a = S/100
b = S%100
p [a,b]
if 12<a || a==0 then
if 12>=b && b>=1 then
print'YYMM'
else
print 'NA'
end
else
if 12<b || b==0 then
print 'MMYY'
else
print 'AMBIGUOUS'
end
end
|
S = gets.chomp.to_i
a = S/100
b = S%100
if 12<a || a==0 then
if 12>=b && b>=1 then
print'YYMM'
else
print 'NA'
end
else
if 12<b || b==0 then
print 'MMYY'
else
print 'AMBIGUOUS'
end
end
|
[
"call.remove"
] | 857,201
| 857,202
|
u600153083
|
ruby
|
p03042
|
S = gets.chomp.to_i
a = S/100
b = S%100
if 12<a || a==0 then
if 12>=a && a>=1 then
print'YYMM'
else
print 'NA'
end
else
if 12<a || a==0 then
print 'MMYY'
else
print 'AMBIGUOUS'
end
end
|
S = gets.chomp.to_i
a = S/100
b = S%100
if 12<a || a==0 then
if 12>=b && b>=1 then
print'YYMM'
else
print 'NA'
end
else
if 12<b || b==0 then
print 'MMYY'
else
print 'AMBIGUOUS'
end
end
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 857,203
| 857,202
|
u600153083
|
ruby
|
p03042
|
S = gets.chomp.split('').map(&:to_i)
def yymm?(s)
_a = s.slice(0, 2)
b = s.slice(2, 2)
b = b.join.to_i
0 < b && b <= 12
end
def mmyy?(s)
a = s.slice(0, 2)
_b = s.slice(2, 2)
a = a.join.to_i
0 < a && a <= 12
end
if yymm?(S) && mmyy?(S)
puts 'AMBIGIOUS'
elsif yymm?(S)
puts 'YYMM'
elsif mmyy?(S)
puts 'MMYY'
else
puts 'NA'
end
|
S = gets.chomp.split('').map(&:to_i)
def yymm?(s)
_a = s.slice(0, 2)
b = s.slice(2, 2)
b = b.join.to_i
0 < b && b <= 12
end
def mmyy?(s)
a = s.slice(0, 2)
_b = s.slice(2, 2)
a = a.join.to_i
0 < a && a <= 12
end
if yymm?(S) && mmyy?(S)
puts 'AMBIGUOUS'
elsif yymm?(S)
puts 'YYMM'
elsif mmyy?(S)
puts 'MMYY'
else
puts 'NA'
end
|
[
"misc.typo",
"literal.string.change",
"call.arguments.change"
] | 857,538
| 857,539
|
u727437745
|
ruby
|
p03042
|
s = gets.chomp
a = s[0..1]
b = s[2..4]
m_arr = []
(1..12).to_a.each do |v|
m_arr << v.to_s.rjust(2,"0")
end
if m_arr.include?(a) && m_arr.include?(b)
puts "AMBIGUOUS"
elsif (m_arr.include?(a)==false) && (m_arr.include?(b)==false)
puts "NA"
elsif m_arr.include?(a)
put "MMYY"
elsif m_arr.include?(b)
puts "YYMM"
end
|
s = gets.chomp
a = s[0..1]
b = s[2..4]
m_arr = []
(1..12).to_a.each do |v|
m_arr << v.to_s.rjust(2,"0")
end
if m_arr.include?(a) && m_arr.include?(b)
puts "AMBIGUOUS"
elsif (m_arr.include?(a)==false) && (m_arr.include?(b)==false)
puts "NA"
elsif m_arr.include?(a)
puts "MMYY"
elsif m_arr.include?(b)
puts "YYMM"
end
|
[
"misc.typo",
"identifier.change"
] | 857,825
| 857,826
|
u012110567
|
ruby
|
p03042
|
s=gets
x,y=s=~/^..(0[1-9]|1[0-2]).$/,s=~/^(0[1-9]|1[0-2])...$/
puts x&&y ? :AMBIGUOUS : x ? :YYMM : y ? :MMYY : :NA
|
s=gets.chomp
x,y=s=~/^..(0[1-9]|1[0-2])$/,s=~/^(0[1-9]|1[0-2])..$/
puts x&&y ? :AMBIGUOUS : x ? :YYMM : y ? :MMYY : :NA
|
[
"call.add"
] | 857,877
| 857,878
|
u264508862
|
ruby
|
p03042
|
S = gets.chomp
ab =S.slice(0..1).to_i
cd =S.slice(2..3).to_i
if 0 < ab && ab < 13
if 0 < cd && cd < 13
puts 'AMBIGUOUS'
else
puts 'YYMM'
end
else
if 0 < cd && cd < 13
puts 'MMYY'
else
puts 'NA'
end
end
|
S = gets.chomp
ab =S.slice(0..1).to_i
cd =S.slice(2..3).to_i
if 0 < ab && ab < 13
if 0 < cd && cd < 13
puts 'AMBIGUOUS'
else
puts 'MMYY'
end
else
if 0 < cd && cd < 13
puts 'YYMM'
else
puts 'NA'
end
end
|
[
"literal.string.change",
"call.arguments.change"
] | 858,003
| 858,004
|
u932417742
|
ruby
|
p03042
|
s = gets.to_i
t = s / 100
u = s % 100
puts t
if t > 0 && t < 13
if u > 0 && u < 13
puts "AMBIGUOUS"
else
puts "MMYY"
end
else
if u > 0 && u < 13
puts "YYMM"
else
puts "NA"
end
end
|
s = gets.to_i
t = s / 100
u = s % 100
if t > 0 && t < 13
if u > 0 && u < 13
puts "AMBIGUOUS"
else
puts "MMYY"
end
else
if u > 0 && u < 13
puts "YYMM"
else
puts "NA"
end
end
|
[
"call.remove"
] | 858,148
| 858,149
|
u911373146
|
ruby
|
p03042
|
s = gets.to_i
t = s / 100
u = s % 100
if s > 0 && s < 13
if u > 0 && u < 13
puts "AMBIGUOUS"
else
puts "MMYY"
end
else
if u > 0 && u < 13
puts "YYMM"
else
puts "NA"
end
end
|
s = gets.to_i
t = s / 100
u = s % 100
if t > 0 && t < 13
if u > 0 && u < 13
puts "AMBIGUOUS"
else
puts "MMYY"
end
else
if u > 0 && u < 13
puts "YYMM"
else
puts "NA"
end
end
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 858,150
| 858,149
|
u911373146
|
ruby
|
p03042
|
a = gets.to_i
a1 = a / 100
a2 = a % 100
if a1.between?(0,19) == true && a2.between?(1,12) == true
if a1.between?(1,12) == true && a2.between?(0,19) == true
puts "AMBIGUOUS"
else
puts "YYMM"
end
elsif a1.between?(1,12) == true && a2.between?(0,19) == true
puts "MMYY"
else
puts "NA"
end
|
a = gets.to_i
a1 = a / 100
a2 = a % 100
if a1.between?(0,99) == true && a2.between?(1,12) == true
if a1.between?(1,12) == true && a2.between?(0,99) == true
puts "AMBIGUOUS"
else
puts "YYMM"
end
elsif a1.between?(1,12) == true && a2.between?(0,99) == true
puts "MMYY"
else
puts "NA"
end
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 858,209
| 858,210
|
u521114363
|
ruby
|
p03042
|
s = gets.to_i
ymf = 0
myf = 0
ato = (s % 100).to_i
mae = (s / 100).to_i
if 1 <= mae and mae<= 12
if 1 <= ato and ato <= 12
puts "AMBIGUOUS"
else
puts "YYAA"
end
else
if 1 <= ato and ato <= 12
puts "MMYY"
else
puts"NA"
end
end
|
s = gets.to_i
ymf = 0
myf = 0
ato = (s % 100).to_i
mae = (s / 100).to_i
if 1 <= mae and mae <= 12
if 1 <= ato and ato <= 12
puts "AMBIGUOUS"
else
puts "MMYY"
end
else
if 1 <= ato and ato <= 12
puts "YYMM"
else
puts"NA"
end
end
|
[
"literal.string.change",
"call.arguments.change"
] | 858,333
| 858,334
|
u512524057
|
ruby
|
p03042
|
a=gets.chomp.split('')
b=(a[0]+a[1])
c=(a[2]+a[3])
if b == "00" || c == "00"
if b.to_i<13 || b.to_i != 0
puts "MMYY"
elsif c.to_i<13 || c.to_i != 0
puts "YYMM"
else
puts "NA"
end
elsif b.to_i < 13 && c.to_i <13
puts "AMBIGUOUS"
elsif b.to_i <13
puts "MMYY"
elsif c.to_i <13
puts "YYMM"
else
puts "NA"
end
|
a=gets.chomp.split('')
b=(a[0]+a[1])
c=(a[2]+a[3])
if b == "00" || c == "00"
if b.to_i<13 && b.to_i != 0
puts "MMYY"
elsif c.to_i<13 && c.to_i != 0
puts "YYMM"
else
puts "NA"
end
elsif b.to_i < 13 && c.to_i <13
puts "AMBIGUOUS"
elsif b.to_i <13
puts "MMYY"
elsif c.to_i <13
puts "YYMM"
else
puts "NA"
end
|
[
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 859,064
| 859,065
|
u925626028
|
ruby
|
p03042
|
S=gets.chomp
s1=S[0..1].to_i
s2=S[2..3].to_i
a=false
b=false
if s1<=12 && s1>0 then
a=true
end
if s2<=12 && s2>0 then
b=true
end
p a
p b
if a && b then
puts 'AMBIGUOUS'
elsif !a && b
puts 'YYMM'
elsif a && !b
puts 'MMYY'
else
puts 'NA'
end
|
S=gets.chomp
s1=S[0..1].to_i
s2=S[2..3].to_i
a=false
b=false
if s1<=12 && s1>0 then
a=true
end
if s2<=12 && s2>0 then
b=true
end
if a && b then
puts 'AMBIGUOUS'
elsif !a && b
puts 'YYMM'
elsif a && !b
puts 'MMYY'
else
puts 'NA'
end
|
[
"call.remove"
] | 859,068
| 859,069
|
u854471099
|
ruby
|
p03042
|
S=gets.chomp
s1=S[0..1].to_i
s2=S[2..3].to_i
a=false
b=false
if s1<=12 && s1>0 then
a=true
end
if s2<=12 && s2>0 then
b=true
end
if a && b then
puts 'AMBIGUOUS'
elsif a
puts 'YYMM'
elsif b
puts 'MMYY'
else
puts 'NA'
end
|
S=gets.chomp
s1=S[0..1].to_i
s2=S[2..3].to_i
a=false
b=false
if s1<=12 && s1>0 then
a=true
end
if s2<=12 && s2>0 then
b=true
end
if a && b then
puts 'AMBIGUOUS'
elsif !a && b
puts 'YYMM'
elsif a && !b
puts 'MMYY'
else
puts 'NA'
end
|
[
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 859,070
| 859,069
|
u854471099
|
ruby
|
p03042
|
s = gets.chomp.to_i
aa = s/100
bb = s%100
ay = true
am = 0 < aa && aa < 13
by = true
bm = 0 < bb && bb < 13
if am && bm
puts "AMBIGUOUS"
elsif !am && bm
puts "YYMM"
elsif am && !bm
puts "MMYY"
elsif !am && !bm
puts "na"
end
|
s = gets.chomp.to_i
aa = s/100
bb = s%100
ay = true
am = 0 < aa && aa < 13
by = true
bm = 0 < bb && bb < 13
if am && bm
puts "AMBIGUOUS"
elsif !am && bm
puts "YYMM"
elsif am && !bm
puts "MMYY"
elsif !am && !bm
puts "NA"
end
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 859,083
| 859,084
|
u650620788
|
ruby
|
p03042
|
S = gets.chomp
first = S[0, 2].to_i
last = S[3, 2].to_i
if (1..12).include?(first)
if (1..12).include?(last)
puts 'AMBIGUOUS'
else
puts 'MMYY'
end
else
if (1..12).include?(last)
puts 'YYMM'
else
puts 'NA'
end
end
|
S = gets.chomp
first = S[0, 2].to_i
last = S[2, 2].to_i
if (1..12).include?(first)
if (1..12).include?(last)
puts 'AMBIGUOUS'
else
puts 'MMYY'
end
else
if (1..12).include?(last)
puts 'YYMM'
else
puts 'NA'
end
end
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 859,348
| 859,349
|
u857555436
|
ruby
|
p03042
|
string = gets.chomp
first_i = string[0..1].to_i
last_i = string[2..3].to_i
if first_i > 12
if last_i == 0 || last_i > 12
puts "NA"
else
puts "YYMM"
end
elsif first_i == 0
if 0 < last_i && last_i < 13
puts "YYMM"
else
puts "NA"
end
else
if last_i == 0
puts "MMYY"
elsif last_i < 13
if last_i == 0
puts "NA"
else
puts "AMBIGUOUS"
end
else
pusts "MMYY"
end
end
|
string = gets.chomp
first_i = string[0..1].to_i
last_i = string[2..3].to_i
if first_i > 12
if last_i == 0 || last_i > 12
puts "NA"
else
puts "YYMM"
end
elsif first_i == 0
if 0 < last_i && last_i < 13
puts "YYMM"
else
puts "NA"
end
else
if last_i == 0
puts "MMYY"
elsif last_i < 13
if last_i == 0
puts "NA"
else
puts "AMBIGUOUS"
end
else
puts "MMYY"
end
end
|
[
"identifier.change"
] | 859,745
| 859,746
|
u012653767
|
ruby
|
p03042
|
r = ['NA', 'YYMM', 'MMYY', 'AMBIGUOUS']
s = STDIN.gets
p = 0
if (1..12) === s[0..1].to_i
p += 1
end
if (1..12) === s[2..3].to_i
p += 2
end
puts r[p]
|
r = ['NA', 'MMYY', 'YYMM', 'AMBIGUOUS']
s = STDIN.gets
p = 0
if (1..12) === s[0..1].to_i
p += 1
end
if (1..12) === s[2..3].to_i
p += 2
end
puts r[p]
|
[
"literal.string.change",
"assignment.value.change"
] | 859,771
| 859,772
|
u374892957
|
ruby
|
p03042
|
N = readline.chomp.split.map(&:to_s)[0]
if N.slice(0,2).to_i > 12 or N.slice(0,2).to_i == 0
if N.slice(2,2).to_i > 12 or N.slice(0,2).to_i == 0
print 'NA'
else
print 'YYMM'
end
else
if N.slice(2,2).to_i > 12 or N.slice(0,2).to_i == 0
print 'MMYY'
else
print 'AMBIGUOUS'
end
end
|
N = readline.chomp.split.map(&:to_s)[0]
if N.slice(0,2).to_i > 12 || N.slice(0,2).to_i == 0
if N.slice(2,2).to_i > 12 || N.slice(2,2).to_i == 0
print 'NA'
else
print 'YYMM'
end
else
if N.slice(2,2).to_i > 12 || N.slice(2,2).to_i == 0
print 'MMYY'
else
print 'AMBIGUOUS'
end
end
|
[
"control_flow.branch.if.condition.change",
"literal.number.integer.change"
] | 859,785
| 859,784
|
u634813468
|
ruby
|
p03042
|
def month_candidate?(x)
(1 <= x) && (x <= 12)
end
def main(argv)
s = gets.chomp
f = month_candidate((s[0] + s[1]).to_i)
g = month_candidate((s[2] + s[3]).to_i)
if (f && g) then
puts 'AMBIGUOUS'
elsif f then
puts 'MMYY'
elsif g then
puts 'YYMM'
else
puts 'NA'
end
end
if self.to_s == 'main' then
main(ARGV)
end
|
def month_candidate?(x)
(1 <= x) && (x <= 12)
end
def main(argv)
s = gets.chomp
f = month_candidate?((s[0] + s[1]).to_i)
g = month_candidate?((s[2] + s[3]).to_i)
if (f && g) then
puts 'AMBIGUOUS'
elsif f then
puts 'MMYY'
elsif g then
puts 'YYMM'
else
puts 'NA'
end
end
if self.to_s == 'main' then
main(ARGV)
end
|
[
"assignment.value.change",
"identifier.change"
] | 859,933
| 859,934
|
u198355306
|
ruby
|
p03042
|
s = gets.chomp
def isYYMM(s)
# 下2桁が01~12かどうか
mm = s[2,2].to_i
if mm > 0 && mm < 13
true
else
false
end
end
def isMMYY(s)
#上2桁が01~12かどうか
mm = s[0,2].to_i
puts mm
if mm > 0 && mm < 13
true
else
false
end
end
if isYYMM(s)
if isMMYY(s)
puts "AMBIGUOUS"
else
puts "YYMM"
end
else
if isMMYY(s)
puts "MMYY"
else
puts "NA"
end
end
|
s = gets.chomp
def isYYMM(s)
# 下2桁が01~12かどうか
mm = s[2,2].to_i
if mm > 0 && mm < 13
true
else
false
end
end
def isMMYY(s)
#上2桁が01~12かどうか
mm = s[0,2].to_i
if mm > 0 && mm < 13
true
else
false
end
end
if isYYMM(s)
if isMMYY(s)
puts "AMBIGUOUS"
else
puts "YYMM"
end
else
if isMMYY(s)
puts "MMYY"
else
puts "NA"
end
end
|
[
"call.remove"
] | 859,958
| 859,959
|
u182948299
|
ruby
|
p03042
|
S = gets.chomp
def a(s)
case s.to_i
when 1..12
:month
else
:year
end
end
puts case [a(S[0..1]), a(S[2..3])]
when [:month, :month]
'ANBIGUOUS'
when [:year, :month]
'YYMM'
when [:month, :year]
'MMYY'
else
'NA'
end
|
S = gets.chomp
def a(s)
case s.to_i
when 1..12
:month
else
:year
end
end
puts case [a(S[0..1]), a(S[2..3])]
when [:month, :month]
'AMBIGUOUS'
when [:year, :month]
'YYMM'
when [:month, :year]
'MMYY'
else
'NA'
end
|
[
"literal.string.change",
"call.arguments.change"
] | 859,990
| 859,991
|
u765478029
|
ruby
|
p03042
|
S = gets.chomp
def a(s)
case s.to_i
when 1..12
:month
else
:year
end
end
puts case p [a(S[0..1]), a(S[2..3])]
when [:month, :month]
'ANBIGUOUS'
when [:year, :month]
'YYMM'
when [:month, :year]
'MMYY'
else
'NA'
end
|
S = gets.chomp
def a(s)
case s.to_i
when 1..12
:month
else
:year
end
end
puts case [a(S[0..1]), a(S[2..3])]
when [:month, :month]
'AMBIGUOUS'
when [:year, :month]
'YYMM'
when [:month, :year]
'MMYY'
else
'NA'
end
|
[
"io.output.change",
"call.remove",
"literal.string.change",
"call.arguments.change"
] | 859,992
| 859,991
|
u765478029
|
ruby
|
p03043
|
n, k = gets.split.map(&:to_i)
sum = 0
1.upto(n) do |i|
if i >= k
sum += 1
next
end
cnt = 1
while k > i * 2 ** cnt
cnt += 1
end
sum += 0.5 ** cnt
end
puts sum
|
n, k = gets.split.map(&:to_i)
sum = 0
1.upto(n) do |i|
if i >= k
sum += 1
next
end
cnt = 1
while k > i * 2 ** cnt
cnt += 1
end
sum += 0.5 ** cnt
end
sum /= n
puts sum
|
[] | 860,092
| 860,093
|
u979552932
|
ruby
|
p03043
|
N, K = gets.chomp.split.map(&:to_i)
result = 0
(1..N).each do |i|
d = 1.0 / N
now = i
while now <= K
now *= 2
d /= 2
end
result += d
end
puts result
|
N, K = gets.chomp.split.map(&:to_i)
result = 0
(1..N).each do |i|
d = 1.0 / N
now = i
while now < K
now *= 2
d /= 2
end
result += d
end
puts result
|
[
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 860,753
| 860,754
|
u411203878
|
ruby
|
p03042
|
def month?(n)
return n >= 1 && n <= 12
end
s = gets.strip
h = s[0, 2].to_i
l = s[2, 2].to_i
hm = month?(h)
lm = month?(l)
if !hm && lm
puts 'YYMM'
elsif hm && !lm
puts 'MMYY'
elsif hm && lm
puts 'AMBIGOUS'
else
puts 'NA'
end
|
def month?(n)
return n >= 1 && n <= 12
end
s = gets.strip
h = s[0, 2].to_i
l = s[2, 2].to_i
hm = month?(h)
lm = month?(l)
if !hm && lm
puts 'YYMM'
elsif hm && !lm
puts 'MMYY'
elsif hm && lm
puts 'AMBIGUOUS'
else
puts 'NA'
end
|
[
"literal.string.change",
"call.arguments.change"
] | 860,934
| 860,935
|
u919970507
|
ruby
|
p03043
|
n, k = gets.chomp.split(' ').map(&:to_i)
sum = (1..n).inject(0) do |s, i|
if i < k
s + (1r / n) * (1r / 2r) ** Math.log2(10 / i).ceil
else
s + (1r / n)
end
end
puts sum.to_f
|
n, k = gets.chomp.split(' ').map(&:to_i)
sum = (1..n).inject(0) do |s, i|
if i < k
s + (1r / n) * (1r / 2r) ** Math.log2(k.to_f / i).ceil
else
s + (1r / n)
end
end
puts sum.to_f
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"call.add"
] | 861,163
| 861,164
|
u484832756
|
ruby
|
p03043
|
n, k = gets.chomp.split.map(&:to_i)
ary = 0
(1..n).each do |i|
cnt = i
s = 0
while cnt <= k
cnt *= 2
s += 1
end
ary += (1/n.to_f) * 1/2**s
end
puts ary
|
n, k = gets.chomp.split.map(&:to_i)
ary = 0
(1..n).each do |i|
cnt = i
s = 0
while cnt < k
cnt *= 2
s += 1
end
ary += (1/n.to_f) * 1/2**s
end
puts ary
|
[
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 861,314
| 861,315
|
u945643510
|
ruby
|
p03043
|
num = gets.split.map(&:to_i)
dice = num.first
std_point = num.last
prob = 0.0
(1..dice).each do |i|
p point = i
p tmp_prob = 1.0 / dice.to_f
while point < std_point do
point = point * 2
tmp_prob = tmp_prob * 0.5
end
prob += tmp_prob
end
puts prob
|
num = gets.split.map(&:to_i)
dice = num.first
std_point = num.last
prob = 0.0
(1..dice).each do |i|
point = i
tmp_prob = 1.0 / dice.to_f
while point < std_point do
point = point * 2
tmp_prob = tmp_prob * 0.5
end
prob += tmp_prob
end
puts prob
|
[
"io.output.change",
"call.remove"
] | 861,727
| 861,728
|
u906724785
|
ruby
|
p03043
|
require 'bigdecimal'
require 'bigdecimal/util'
n,k = gets.strip.split.map(&:to_i)
m = n
array = []
coin = 0
while n > 0 do
x = k / n
while x > 2 ** coin do
coin += 1
end
array << coin
n -= 1
end
ans = 0.0.to_f
array.each do |ele|
ans += (1.to_f / ((2 ** ele) * m))
end
p ans
|
require 'bigdecimal'
require 'bigdecimal/util'
n,k = gets.strip.split.map(&:to_f)
m = n
array = []
coin = 0
while n > 0 do
x = k / n
while x > 2 ** coin do
coin += 1
end
array << coin
n -= 1
end
ans = 0.0.to_f
array.each do |ele|
ans += (1.to_f / ((2 ** ele) * m).to_f)
end
p ans
|
[
"assignment.value.change",
"call.arguments.change",
"call.add"
] | 862,651
| 862,652
|
u654590131
|
ruby
|
p03044
|
def even_relation(edges)
neighbors = Hash.new { |h, k| h[k] = [] }
costs = Hash.new { |h, k| h[k] = {} }
edges.each do |edge|
v, u, w = edge
v -= 1
u -= 1
neighbors[v] << u
neighbors[u] << v
costs[v][u] = w
costs[u][v] = w
end
colors = [0]
queue = [0]
until queue.empty?
v = queue.shift
neighbors[v].each do |u|
next if colors[u]
colors[u] = (colors[v] + costs[v][u]) % 2
queue << u
end
end
colors
end
edges = []
gets.to_i.times do
edges << gets.split.map(&:to_i)
end
puts even_relation(edges)
|
def even_relation(edges)
neighbors = Hash.new { |h, k| h[k] = [] }
costs = Hash.new { |h, k| h[k] = {} }
edges.each do |edge|
v, u, w = edge
v -= 1
u -= 1
neighbors[v] << u
neighbors[u] << v
costs[v][u] = w
costs[u][v] = w
end
colors = [0]
queue = [0]
until queue.empty?
v = queue.shift
neighbors[v].each do |u|
next if colors[u]
colors[u] = (colors[v] + costs[v][u]) % 2
queue << u
end
end
colors
end
edges = []
(gets.to_i - 1).times do
edges << gets.split.map(&:to_i)
end
puts even_relation(edges)
|
[] | 862,983
| 862,984
|
u976045502
|
ruby
|
p03045
|
# https://atcoder.jp/contests/abc126/tasks/abc126_e
class UnionFindWithType
attr_reader :types
def initialize(size)
@rank = Array.new(size, 0)
@parent = Array.new(size, &:itself)
@types = size
end
def unite(id_x, id_y)
x_parent = get_parent(id_x)
y_parent = get_parent(id_y)
return if x_parent == y_parenta
@types -= 1
if @rank[x_parent] > @rank[y_parent]
@parent[y_parent] = x_parent
else
@parent[x_parent] = y_parent
@rank[y_parent] += 1 if @rank[x_parent] == @rank[y_parent]
end
end
def get_parent(id_x)
@parent[id_x] == id_x ? id_x : (@parent[id_x] = get_parent(@parent[id_x]))
end
end
N, M = gets.split.map(&:to_i)
uf = UnionFindWithType.new(N)
M.times do
uf.unite(*gets.split.take(2).map { |s| s.to_i - 1 })
end
p uf.types
|
# https://atcoder.jp/contests/abc126/tasks/abc126_e
class UnionFindWithType
attr_reader :types
def initialize(size)
@rank = Array.new(size, 0)
@parent = Array.new(size, &:itself)
@types = size
end
def unite(id_x, id_y)
x_parent = get_parent(id_x)
y_parent = get_parent(id_y)
return if x_parent == y_parent
@types -= 1
if @rank[x_parent] > @rank[y_parent]
@parent[y_parent] = x_parent
else
@parent[x_parent] = y_parent
@rank[y_parent] += 1 if @rank[x_parent] == @rank[y_parent]
end
end
def get_parent(id_x)
@parent[id_x] == id_x ? id_x : (@parent[id_x] = get_parent(@parent[id_x]))
end
end
N, M = gets.split.map(&:to_i)
uf = UnionFindWithType.new(N)
M.times do
uf.unite(*gets.split.take(2).map { |s| s.to_i - 1 })
end
p uf.types
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 863,656
| 863,657
|
u987208743
|
ruby
|
p03043
|
n,k = gets.split.map(&:to_i)
ans = 0.0
n.each do |i|
div = 1.0/n
dob = i
while dob < k do
dob *= 2
div *= 1.0/2
end
ans += div
end
puts ans
|
n,k = gets.split.map(&:to_i)
ans = 0.0
(1..n).each do |i|
div = 1.0/n
dob = i
while dob < k do
dob *= 2
div *= 1.0/2
end
ans += div
end
puts ans
|
[] | 863,799
| 863,800
|
u634342027
|
ruby
|
p03043
|
n,k = gets.split.map(&:to_i)
ans = 0.0
n.each do |i|
div = 1.0/n
dob = i
while dob < k do
dob *= 2
div *= 1.0/2
end
ans += div
end
puts ans
|
n,k = gets.split.map(&:to_i)
ans = 0.0
(1..n).each do |i|
div = 1.0/n
dob = i
while dob < k do
dob *= 2
div *= 1.0/2
end
ans += div
end
puts ans
|
[] | 863,801
| 863,800
|
u634342027
|
ruby
|
p03047
|
p gets.split.map(&:to_i) + 1
|
p gets.split.map(&:to_i).reduce(:-) + 1
|
[
"call.add"
] | 864,491
| 864,492
|
u467508794
|
ruby
|
p03047
|
n,k=gets.to_i
puts n-k+1
|
n,k=gets.split.map(&:to_i)
puts n-k+1
|
[
"assignment.value.change",
"identifier.change",
"call.add"
] | 864,731
| 864,732
|
u987183622
|
ruby
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.