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 9
values |
|---|---|---|---|---|---|---|---|
p03555 | io = STDIN
a=io.gets.chomp
b=io.gets.chomp
aa=a.clone
bb=b.clone
if a == a.reverse &&
b == b.reverse
puts 'YES'
else
puts 'NO'
end
| io = STDIN
a=io.gets.chomp
b=io.gets.chomp
aa=a.clone
bb=b.clone
if a == b.reverse &&
b == a.reverse
puts 'YES'
else
puts 'NO'
end
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,272,464 | 1,272,465 | u132360211 | ruby |
p03556 | a=gets.chomp.to_i
n=1
while(n**2 < a)
n+=1
end
puts (n-1)**2
| a=gets.chomp.to_i
n=1
while(n**2 <= a)
n+=1
end
puts (n-1)**2
| [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,272,568 | 1,272,569 | u585819925 | ruby |
p03556 | n=gets.to_i
a=math.sqrt(n)
b=a.to_i
puts b**2 | n=gets.to_i
a=Math.sqrt(n)
b=a.to_i
puts b**2
| [
"assignment.value.change"
] | 1,272,795 | 1,272,796 | u987183622 | ruby |
p03556 | ret = ( gets.to_i ** (1/2.0) ).to_i
ret * ret | ret = ( gets.to_i ** (1/2.0) ).to_i
puts ret * ret | [
"io.output.change",
"call.add"
] | 1,273,169 | 1,273,170 | u523130469 | ruby |
p03556 | #! /usr/bin/env ruby
N = STDIN.read.to_i
i = N
while i != 0
r = i**(1/2.0) * 10
if r.ceil % 10 == 0 then
break
end
i = i - 1
end
puts i
| #! /usr/bin/env ruby
N = STDIN.read.to_i
i = N
while i != 0
r = i**(1/2.0) * 10
if r - r.ceil == 0
break
end
i = i - 1
end
puts i
| [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,273,215 | 1,273,216 | u346050999 | ruby |
p03556 | n=gets.to_i
p (1..99999).bsearch{|x|x*x>=n}**2 | n=gets.to_i
p ((1..99999).bsearch{|x| x*x>n}-1)**2 | [
"call.arguments.change",
"expression.operator.compare.change",
"expression.operation.binary.change"
] | 1,273,312 | 1,273,313 | u079330987 | ruby |
p03556 | Math.sqrt(gets.to_i).to_i**2
| p Math.sqrt(gets.to_i).to_i**2
| [
"io.output.change",
"call.add"
] | 1,273,377 | 1,273,378 | u907904115 | ruby |
p03557 | n = gets.to_s.to_i
a = gets.to_s.split.map{|t| t.to_i }.sort
b = gets.to_s.split.map{|t| t.to_i }.sort
c = gets.to_s.split.map{|t| t.to_i }.sort
ans = i = j = 0
b.each do |m|
while i < n && a[i] < m
i += 1
end
while 0 <= j && c[j] <= m
j += 1
end
ans += i * (n-j)
end
puts ans | n = gets.to_s.to_i
a = gets.to_s.split.map{|t| t.to_i }.sort
b = gets.to_s.split.map{|t| t.to_i }.sort
c = gets.to_s.split.map{|t| t.to_i }.sort
ans = i = j = 0
b.each do |m|
while i < n && a[i] < m
i += 1
end
while j < n && c[j] <= m
j += 1
end
ans += i * (n-j)
end
puts ans | [
"expression.operation.binary.remove"
] | 1,273,924 | 1,273,925 | u693378622 | ruby |
p03557 | n = gets.to_s.to_i
a = gets.to_s.split.map{|t| t.to_i }.sort.reverse
b = gets.to_s.split.map{|t| t.to_i }
c = gets.to_s.split.map{|t| t.to_i }.sort
ans = 0
b.each do |m|
i = n - (a.bsearch_index{ |u| u < m } || 0)
j = n - (c.bsearch_index{ |b| m < b } || 0)
ans += i * j
end
puts ans | n = gets.to_s.to_i
a = gets.to_s.split.map{|t| t.to_i }.sort.reverse
b = gets.to_s.split.map{|t| t.to_i }
c = gets.to_s.split.map{|t| t.to_i }.sort
ans = 0
b.each do |m|
i = n - (a.bsearch_index{ |u| u < m } || n)
j = n - (c.bsearch_index{ |b| m < b } || n)
ans += i * j
end
puts ans | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,273,926 | 1,273,927 | u693378622 | ruby |
p03556 | num = gets.chomp.to_i
i = 1
while i < 100
if (i*i) > num
puts (i-1)*(i-1)
break
end
i += 1
end | num = gets.chomp.to_i
i = 1
while true
if (i*i) > num
puts (i-1)*(i-1)
break
end
i += 1
end | [
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,274,294 | 1,274,295 | u179428857 | ruby |
p03555 | r1 = gets.chomp
r2 = gets.chomp
puts r1.reverse == r2 ? :Yes: :No | r1 = gets.chomp
r2 = gets.chomp
puts r1.reverse == r2 ? :YES: :NO | [
"call.arguments.change"
] | 1,275,054 | 1,275,055 | u489339677 | ruby |
p03555 | s = gets.chomp
t = gets.chomp.reverse
puts s == t ? "Yes" : "No" | s = gets.chomp
t = gets.chomp.reverse
puts s == t ? "YES" : "NO" | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,275,061 | 1,275,062 | u244257825 | ruby |
p03557 | N = gets.to_i
A = gets.chomp.split.map(&:to_i).sort
B = gets.chomp.split.map(&:to_i).sort
C = gets.chomp.split.map(&:to_i).sort
s = 0
B.each do |b|
i = A.bsearch_index { |a| a >= b } || N
k = N - (C.bsearch_index { |c| c >= b } || N)
s += i * k
end
puts s
| N = gets.to_i
A = gets.chomp.split.map(&:to_i).sort
B = gets.chomp.split.map(&:to_i).sort
C = gets.chomp.split.map(&:to_i).sort
s = 0
B.each do |b|
i = A.bsearch_index { |a| a >= b } || N
k = N - (C.bsearch_index { |c| c > b } || N)
s += i * k
end
puts s
| [
"expression.operator.compare.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,275,186 | 1,275,187 | u585819925 | ruby |
p03557 | N = gets.to_i
A, B, C = (0..2).map{gets.split.map(&:to_i).sort}
x = B.map{|b|(s = C.bsearch_index{|c|b<c}) ? s : 0}
(2..N).each{|i|x[-i] += x[-i+1]}
p A.map{|a|(s = B.bsearch_index{|b|a<b}) ? x[s] : 0}.inject:+ | N = gets.to_i
A, B, C = (0..2).map{gets.split.map(&:to_i).sort}
x = B.map{|b|(s = C.bsearch_index{|c|b<c}) ? N-s : 0}
(2..N).each{|i|x[-i] += x[-i+1]}
p A.map{|a|(s = B.bsearch_index{|b|a<b}) ? x[s] : 0}.inject:+ | [
"assignment.change"
] | 1,275,233 | 1,275,234 | u752146271 | ruby |
p03557 | n=gets.to_i
as=gets.split.map(&:to_i)
bs=gets.split.map(&:to_i)
cs=gets.split.map(&:to_i)
as.sort!
cs.sort!
ans=0
bs.each do |bi|
anum=as.index{|ai| bi<=ai}
anum=n if anum==nil
cnum=cs.index{|ci| bi<ci}
ans+=anum*(n-cnum) if cnum
end
puts ans
| n=gets.to_i
as=gets.split.map(&:to_i)
bs=gets.split.map(&:to_i)
cs=gets.split.map(&:to_i)
as.sort!
cs.sort!
ans=0
bs.each do |bi|
anum=as.bsearch_index{|ai| bi<=ai}
anum=n if anum==nil
cnum=cs.bsearch_index{|ci| bi<ci}
ans+=anum*(n-cnum) if cnum
end
puts ans
| [
"assignment.value.change",
"identifier.change"
] | 1,275,513 | 1,275,514 | u602591412 | ruby |
p03559 | n = gets.to_i
as = gets.split.map(&:to_i).sort!
bs = gets.split.map(&:to_i)
cs = gets.split.map(&:to_i).sort!
ans = 0
bs.each do |b|
x = as.bsearch_index { |a| a >= b } || n
y = n - cs.bsearch_index { |c| b < c } || n
ans += x * y
end
puts ans
| n = gets.to_i
as = gets.split.map(&:to_i).sort!
bs = gets.split.map(&:to_i)
cs = gets.split.map(&:to_i).sort!
ans = 0
bs.each do |b|
x = as.bsearch_index { |a| a >= b } || n
y = n - (cs.bsearch_index { |c| b < c } || n)
ans += x * y
end
puts ans
| [] | 1,276,153 | 1,276,154 | u579668395 | ruby |
p03557 | n = gets.chomp.to_i
a = gets.chomp.split.map(&:to_i).sort
b = gets.chomp.split.map(&:to_i).sort
c = gets.chomp.split.map(&:to_i).sort
res = b.inject(0) do |r, bi|
ai = a.bsearch_index{ |x| x >= bi }
ci = c.bsearch_index{ |x| x > bi }
if ai and ci
r + (ai)*(n-ci)
else
r
end
end
puts res | n = gets.chomp.to_i
a = gets.chomp.split.map(&:to_i).sort
b = gets.chomp.split.map(&:to_i).sort
c = gets.chomp.split.map(&:to_i).sort
res = b.inject(0) do |r, bi|
ai = a.bsearch_index{ |x| x >= bi }
ci = c.bsearch_index{ |x| x > bi }
if ci
r + (ai || n)*(n-ci)
else
r
end
end
puts res | [
"expression.operation.binary.remove"
] | 1,276,320 | 1,276,321 | u664737319 | ruby |
p03559 | n = gets.to_i
a = gets.split.map(&:to_i).sort
b = gets.split.map(&:to_i).sort
c = gets.split.map(&:to_i).sort
count = 0
b.each do |bb|
ai = a.bsearch_index {|x| x >= bb} || n
ci = c.bsearch_index {|x| x > bb} || 0
count += ai * (n - ci)
end
puts count | n = gets.to_i
a = gets.split.map(&:to_i).sort
b = gets.split.map(&:to_i).sort
c = gets.split.map(&:to_i).sort
count = 0
b.each do |bb|
ai = a.bsearch_index {|x| x >= bb} || n
ci = c.bsearch_index {|x| x > bb} || n
count += ai * (n - ci)
end
puts count | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 1,276,467 | 1,276,468 | u723180465 | ruby |
p03563 | a,b=`dd`.to_i
p b+b-a | a,b=`dd`.split.map(&:to_i)
p b+b-a
| [
"assignment.value.change",
"identifier.change",
"call.add"
] | 1,277,323 | 1,277,324 | u966810027 | ruby |
p03563 | line = readline
r = line[0].to_i
g = line[1].to_i
puts 2 * g - r
| line = readlines
r = line[0].to_i
g = line[1].to_i
puts 2 * g - r
| [
"assignment.value.change",
"identifier.change"
] | 1,277,936 | 1,277,937 | u259280397 | ruby |
p03563 | r,g=gets.split.map(&:to_i);puts 2*g-r | r,g=readlines.map(&:to_i);puts 2*g-r
| [
"assignment.value.change",
"identifier.change",
"call.remove"
] | 1,277,938 | 1,277,939 | u050914494 | ruby |
p03564 | n = gets.to_i
k = gets.to_i
ar = []
sum = 1
ctr = 0
while ctr != n do
if k < (sum*2 - sum)
sum += k
else
sum *= 2
end
ar << sum
ctr += 1
end
p puts[-1]
| n = gets.to_i
k = gets.to_i
ar = []
sum = 1
ctr = 0
while ctr != n do
if k < (sum*2 - sum)
sum += k
else
sum *= 2
end
ar << sum
ctr += 1
end
puts ar[-1]
| [
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,278,821 | 1,278,822 | u012110567 | ruby |
p03563 | p 2*gets.to_i-gets.to_i | g=gets;p 2*gets.to_i-g.to_i | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,279,440 | 1,279,441 | u598016178 | ruby |
p03564 | n = gets.to_i
k = gets.to_i
a = 1
n.times do |i|
if a <= k
a *= 2
else
a += k
end
end | n = gets.to_i
k = gets.to_i
a = 1
n.times do |i|
if a <= k
a *= 2
else
a += k
end
end
p a | [
"call.add"
] | 1,279,599 | 1,279,600 | u912087911 | ruby |
p03565 | s = gets.to_s.chomp
t = gets.to_s.chomp
n_s = s.size
n_t = t.size
candidates = []
( n_s - n_t + 1 ).times do |i|
s_sub = s[i, n_t]
flag = true
n_t.times do |j|
next if s_sub[j] == t[j] || s_sub[j] == '?'
flag = false
break
end
if flag
candidate = s[0, i-1] + t + s[i+n_t..-1]
candidates << candidate.tr("?", "a")
end
end
if candidates.empty?
puts "UNRESTORABLE"
else
puts candidates.sort.first
end | s = gets.to_s.chomp
t = gets.to_s.chomp
n_s = s.size
n_t = t.size
candidates = []
( n_s - n_t + 1 ).times do |i|
s_sub = s[i, n_t]
flag = true
n_t.times do |j|
next if s_sub[j] == t[j] || s_sub[j] == '?'
flag = false
break
end
if flag
candidate = s[0...i] + t + s[i+n_t..-1]
candidates << candidate.tr("?", "a")
end
end
if candidates.empty?
puts "UNRESTORABLE"
else
puts candidates.sort.first
end | [
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,279,800 | 1,279,801 | u693378622 | ruby |
p03565 | def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
anss = []
0.downto(k) do |i|
if my_match(sp[i,tl],t)
tmp = String.new(sp)
tmp[i,tl] = t
anss << tmp.gsub(??, ?a)
end
end
return anss.sort[0] if anss.size != 0
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t
| def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
anss = []
0.upto(k) do |i|
if my_match(sp[i,tl],t)
tmp = String.new(sp)
tmp[i,tl] = t
anss << tmp.gsub(??, ?a)
end
end
return anss.sort[0] if anss.size != 0
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t
| [
"identifier.change"
] | 1,279,802 | 1,279,803 | u693378622 | ruby |
p03565 | def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
anss = []
k.downto(0) do |i|
if my_match(sp[i,tl],t)
tmp = String.new(sp)
tmp[i,tl] = t
anss << tmp.gsub(??, ?a)
end
end
return anss.sort[0] unless anss.nil?
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t
| def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
anss = []
k.downto(0) do |i|
if my_match(sp[i,tl],t)
tmp = String.new(sp)
tmp[i,tl] = t
anss << tmp.gsub(??, ?a)
end
end
return anss.sort[0] if anss.size != 0
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,279,805 | 1,279,806 | u693378622 | ruby |
p03565 | def my_match s,t
sl = s.length
sl.times do |i|
# puts i
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
# puts k
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk+1,tl] = t
# puts s
# puts 1
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk,tl] = t
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | [
"expression.operation.binary.remove"
] | 1,279,807 | 1,279,808 | u693378622 | ruby |
p03565 | def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] == t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
# puts k
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk+1,tl] = t
# puts s
# puts 1
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk,tl] = t
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,279,809 | 1,279,808 | u693378622 | ruby |
p03565 | def my_match s,t
sl = s.length
sl.times do |i|
# puts i
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
# puts k
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk+1,tl] = t
# puts s
# puts 1
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | def my_match s,t
sl = s.length
sl.times do |i|
# puts i
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
# puts k
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk,tl] = t
# puts s
# puts 1
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | [
"expression.operation.binary.remove"
] | 1,279,807 | 1,279,810 | u693378622 | ruby |
p03565 | def my_match s,t
sl = s.length
sl.times do |i|
return false if s[i] != ?? and s[i] == t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
# puts k
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk+1,tl] = t
# puts s
# puts 1
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | def my_match s,t
sl = s.length
sl.times do |i|
# puts i
return false if s[i] != ?? and s[i] != t[i]
end
return true
end
def solve sp,t
s = sp
sl = s.length
tl = t.length
no = "UNRESTORABLE"
i = sl - 1
j = tl - 1
return no if sl < tl
if sp.include?(t)
k = sp.index(t)
s[k, tl] = t
return s.gsub(??, ?a)
end
k = sl - tl
# puts k
k.downto(0) do |kk|
if my_match(sp[kk,tl],t)
s[kk,tl] = t
# puts s
# puts 1
return s.gsub(??, ?a)
end
end
return no
end
sp = gets.chomp
t = gets.chomp
puts solve sp,t | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,279,809 | 1,279,810 | u693378622 | ruby |
p03565 | s = gets.chomp.split("")
t = gets.chomp.split("")
res = 1919810
(s.size - t.size + 1).times do |i|
flag = true
t.size.times do |j|
next if s[i+j] == "?"
if s[i+j] != t[j]
flag = false
break
end
end
if flag then
res = i
break
end
end
if res > 50
puts "UNRESTORABLE"
else
t.size.times do |i|
s[res + i] = t[i]
end
puts s.join("").gsub(/\?/, "a")
end | s = gets.chomp.split("").reverse
t = gets.chomp.split("").reverse
res = 1919810
(s.size - t.size + 1).times do |i|
flag = true
t.size.times do |j|
next if s[i+j] == "?"
if s[i+j] != t[j]
flag = false
break
end
end
if flag then
res = i
break
end
end
if res > 50
puts "UNRESTORABLE"
else
t.size.times do |i|
s[res + i] = t[i]
end
puts s.reverse.join("").gsub(/\?/, "a")
end | [
"call.add"
] | 1,280,017 | 1,280,018 | u466332671 | ruby |
p03565 | s_dash = gets.chomp.chars
t = gets.chomp.chars
n = s_dash.length
m = t.length
# ずらしていって一致する部分を見つける
# 一致したらそれ+?を0埋めの文字をansに入れる
# ansを昇順にして一番最初のもの
ans = []
(n - m + 1).times do |i|
tmp = s_dash[i,m]
flag = true
m.times do |j|
next if tmp[j] == '?'
flag = false if tmp[j] != t[j]
end
if flag
char = ''
char += s_dash[0..i-1].join.gsub('?', 'a') if i > 0
char += t.join
char += s_dash[i+m-1..n-1].join.gsub('?', 'a') if i+m-1 < n
ans << char
end
end
puts ans.empty? ? 'UNRESTORABLE' : ans.sort[0]
| s_dash = gets.chomp.chars
t = gets.chomp.chars
n = s_dash.length
m = t.length
# ずらしていって一致する部分を見つける
# 一致したらそれ+?を0埋めの文字をansに入れる
# ansを昇順にして一番最初のもの
ans = []
(n - m + 1).times do |i|
tmp = s_dash[i,m]
flag = true
m.times do |j|
next if tmp[j] == '?'
flag = false if tmp[j] != t[j]
end
if flag
char = ''
char += s_dash[0..i-1].join.gsub('?', 'a') if i > 0
char += t.join
char += s_dash[i+m..n-1].join.gsub('?', 'a') if i+m < n
ans << char
end
end
puts ans.empty? ? 'UNRESTORABLE' : ans.sort[0]
| [
"expression.operation.binary.remove"
] | 1,280,372 | 1,280,373 | u157887852 | ruby |
p03565 | SD=gets.strip
T=gets.strip
ans=SD
(0..SD.size-T.size).to_a.reverse.each do |i|
judge=true
for j in i..i+T.size
judge=false if SD[j]!=T[j-i] && SD[j]!="?"
end
if judge
ans[i,T.size]=T
ans.gsub!("?","a")
puts ans
exit 0
end
end
puts "UNRESTORABLE"
| SD=gets.strip
T=gets.strip
ans=SD
(0..SD.size-T.size).to_a.reverse.each do |i|
judge=true
for j in i...i+T.size
judge=false if SD[j]!=T[j-i] && SD[j]!="?"
end
if judge
ans[i,T.size]=T
ans.gsub!("?","a")
puts ans
exit 0
end
end
puts "UNRESTORABLE"
| [] | 1,280,602 | 1,280,603 | u926099741 | ruby |
p03565 | s = gets
t = gets
s_size = s.size
t_size = t.size
tt = t.split('')
a = []
(s_size-t_size+1).times do |i|
ss = s.slice(i, t_size)
ss.split('').each_with_index do |c, index|
break if c != tt[index] && c != '?'
if index == t_size - 1
a << (s.slice(0, i) + t + s.slice(i + t_size, s_size - t_size + 1 - i)).gsub(/\?/, 'a')
end
end
end
if a.empty?
puts 'UNRESTORABLE'
else
puts a.sort.first
end
| s = gets.chomp
t = gets.chomp
s_size = s.size
t_size = t.size
tt = t.split('')
a = []
(s_size-t_size+1).times do |i|
ss = s.slice(i, t_size)
ss.split('').each_with_index do |c, index|
break if c != tt[index] && c != '?'
if index == t_size - 1
a << (s.slice(0, i) + t + s.slice(i + t_size, s_size - t_size + 1 - i)).gsub(/\?/, 'a')
end
end
end
if a.empty?
puts 'UNRESTORABLE'
else
puts a.sort.first
end
| [
"call.add"
] | 1,280,937 | 1,280,938 | u195257137 | ruby |
p03565 | s = gets
t = gets
s_size = s.size
t_size = t.size
tt = t.split('')
a = []
(s_size-t_size+1).times do |i|
ss = s.slice(i, t_size)
ss.split('').each_with_index do |c, index|
break if c != tt[index] && c != '?'
if index == t_size - 1
a << (s.slice(0, i) + t + s.slice(i + t_size, s_size - t_size + 1 - i)).gsub(/\?/, 'a')
end
end
end
if a.empty?
p 'UNRESTORABLE'
else
p a.sort.first
end
| s = gets.chomp
t = gets.chomp
s_size = s.size
t_size = t.size
tt = t.split('')
a = []
(s_size-t_size+1).times do |i|
ss = s.slice(i, t_size)
ss.split('').each_with_index do |c, index|
break if c != tt[index] && c != '?'
if index == t_size - 1
a << (s.slice(0, i) + t + s.slice(i + t_size, s_size - t_size + 1 - i)).gsub(/\?/, 'a')
end
end
end
if a.empty?
puts 'UNRESTORABLE'
else
puts a.sort.first
end
| [
"call.add",
"call.function.change",
"io.output.change"
] | 1,280,939 | 1,280,938 | u195257137 | ruby |
p03565 | S = gets.chomp
T = gets.chomp
sl = S.size
tl = T.size
if sl < tl
puts "UNRESTORABLE"
exit
end
x = []
(sl-tl+1).times{|i|
str = S
sbs = S[i,tl]
if (0...tl).all?{|j|sbs[j] == T[j] || sbs[j] == '?'}
str[i,tl] = T
x << str.gsub('?', 'a')
end
}
puts x.empty? ? "UNRESTORABLE" : x.sort[0] | S = gets.chomp
T = gets.chomp
sl = S.size
tl = T.size
if sl < tl
puts "UNRESTORABLE"
exit
end
x = []
(sl-tl+1).times{|i|
str = S.dup
sbs = str[i,tl]
if (0...tl).all?{|j|sbs[j] == T[j] || sbs[j] == '?'}
str[i,tl] = T
x << str.gsub('?', 'a')
end
}
puts x.empty? ? "UNRESTORABLE" : x.sort[0] | [
"call.add",
"assignment.value.change"
] | 1,281,080 | 1,281,081 | u752146271 | ruby |
p03565 | s = gets.chomp
t = gets.chomp
(s.size-t.size).downto(0) do |i|
if /#{s[i, t.size].gsub('?','[a-z]')}/ === t
s[i, t.size] = t
puts s.gsub('.','a')
exit
end
end
puts "UNRESTORABLE"
| s = gets.chomp
t = gets.chomp
(s.size-t.size).downto(0) do |i|
if /#{s[i, t.size].gsub('?','.')}/ === t
s[i, t.size] = t
puts s.gsub('?','a')
exit
end
end
puts "UNRESTORABLE"
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,281,566 | 1,281,567 | u868089307 | ruby |
p03565 | s = gets.chomp
t = gets.chomp
(s.size-t.size).downto(0) do |i|
# puts s.slice(i, t.size).gsub(/\?/, ".")
pat = s[i, t.size]
ret = false
pat.size.times do |j|
ret = pat[i] == '?' || pat[i] == t[i]
break if ret == false
end
if ret
s[i, t.size] = t
puts s.gsub('?','a')
exit
end
# if /#{s.slice(i, t.size).gsub("?", ".")}/ === t
# puts s.gsub!("?","a")
# exit
# end
end
puts "UNRESTORABLE"
| s = gets.chomp
t = gets.chomp
(s.size-t.size).downto(0) do |i|
# puts s.slice(i, t.size).gsub(/\?/, ".")
pat = s[i, t.size]
ret = false
pat.size.times do |j|
ret = pat[j] == '?' || pat[j] == t[j]
break if ret == false
end
if ret
s[i, t.size] = t
puts s.gsub('?','a')
exit
end
# if /#{s.slice(i, t.size).gsub("?", ".")}/ === t
# puts s.gsub!("?","a")
# exit
# end
end
puts "UNRESTORABLE"
| [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,281,569 | 1,281,570 | u868089307 | ruby |
p03565 | sp = gets.chomp
t = gets.chomp
rsp = sp.reverse
rt = t.reverse
r = rsp.gsub(/\?/, '.')
0.upto(sp.size - t.size - 1) do |i|
if Regexp.new(r[i..i+t.size-1]) =~ rt
r[i..i+t.size-1] = rt
puts r.gsub(/\./, 'a').reverse
exit
end
end
puts 'UNRESTORABLE'
| sp = gets.chomp
t = gets.chomp
rsp = sp.reverse
rt = t.reverse
r = rsp.gsub(/\?/, '.')
0.upto(sp.size - t.size) do |i|
if Regexp.new(r[i..i+t.size-1]) =~ rt
r[i..i+t.size-1] = rt
puts r.gsub(/\./, 'a').reverse
exit
end
end
puts 'UNRESTORABLE'
| [
"expression.operation.binary.remove"
] | 1,281,653 | 1,281,654 | u434509016 | ruby |
p03565 | S = gets.chomp.chars
T = gets.chomp.chars
s = S.length
t = T.length
(s-t).downto(0).each do |i|
check = S[i..i+t].zip(T).all?{|a,b| a == b or a == "?"}
if check
retval = S.join.gsub("?", "a").chars
retval[i..i+t] = T
puts(retval.join)
exit
end
end
puts "UNRESTORABLE" | S = gets.chomp.chars
T = gets.chomp.chars
s = S.length
t = T.length
(s-t).downto(0).each do |i|
check = S[i..i+t-1].zip(T).all?{|a,b| a == b or a == "?"}
if check
retval = S.join.gsub("?", "a").chars
retval[i..i+t-1] = T
puts(retval.join)
exit
end
end
puts "UNRESTORABLE" | [
"assignment.change"
] | 1,281,905 | 1,281,906 | u616360029 | ruby |
p03565 | str = gets.chomp
key = gets.chomp
isExist = false
idx = 0
(str.length - key.length + 1).downto(0) do |i|
key.length.times do |j|
if str[i+j] != "?" && key[j] != str[i+j]
break
end
if j == key.length-1
isExist = true
idx = i
break
end
end
if isExist
break
end
end
if isExist
key.length.times do |i|
str[idx+i] = key[i]
end
str.length.times do |i|
str[i] = "a" if str[i] == "?"
end
p str
else
p "UNRESTORABLE"
end | str = gets.chomp
key = gets.chomp
isExist = false
idx = 0
(str.length - key.length + 1).downto(0) do |i|
key.length.times do |j|
if str[i+j] != "?" && key[j] != str[i+j]
break
end
if j == key.length-1
isExist = true
idx = i
break
end
end
if isExist
break
end
end
if isExist
key.length.times do |i|
str[idx+i] = key[i]
end
str.length.times do |i|
str[i] = "a" if str[i] == "?"
end
puts str
else
puts "UNRESTORABLE"
end | [
"call.function.change",
"io.output.change"
] | 1,281,913 | 1,281,914 | u448351882 | ruby |
p03565 | s_dash = gets.chomp.split("")
t = gets.chomp.split("")
answers = []
s_dash.length.times { |i|
count = 0
s_dash_tmp = Marshal.load(Marshal.dump(s_dash))
t.length.times { |j|
if s_dash_tmp[i+j] == t[j] || s_dash_tmp[i+j] == "?"
count += 1
end
if count == t.length
s_dash_tmp[i..i+t.length] = t
answers << s_dash_tmp.join("").gsub(/\?/, "a")
end
}
}
if answers.length == 0
puts "UNRESTORABLE"
else
puts answers.sort[0]
end | s_dash = gets.chomp.split("")
t = gets.chomp.split("")
answers = []
s_dash.length.times { |i|
count = 0
s_dash_tmp = Marshal.load(Marshal.dump(s_dash))
t.length.times { |j|
if s_dash_tmp[i+j] == t[j] || s_dash_tmp[i+j] == "?"
count += 1
end
if count == t.length
s_dash_tmp[i..i+t.length-1] = t
answers << s_dash_tmp.join("").gsub(/\?/, "a")
end
}
}
if answers.length == 0
puts "UNRESTORABLE"
else
puts answers.sort[0]
end | [
"assignment.change"
] | 1,281,917 | 1,281,918 | u931757436 | ruby |
p03565 | s_dash = gets.chomp.split("")
t = gets.chomp.split("")
answers = []
s_dash.length.times { |i|
count = 0
s_dash_tmp = Marshal.load(Marshal.dump(s_dash))
t.length.times { |j|
if s_dash_tmp[i+j] == t[j] || s_dash_tmp[i+j] == "?"
count += 1
end
if count == t.length
s_dash_tmp[i..i+t.length] = t
answers << s_dash_tmp.join("").gsub(/\?/, "a")
end
}
}
if answers.length == 0
puts "UNRESTORABLE"
else
puts answers.reverse[0]
end | s_dash = gets.chomp.split("")
t = gets.chomp.split("")
answers = []
s_dash.length.times { |i|
count = 0
s_dash_tmp = Marshal.load(Marshal.dump(s_dash))
t.length.times { |j|
if s_dash_tmp[i+j] == t[j] || s_dash_tmp[i+j] == "?"
count += 1
end
if count == t.length
s_dash_tmp[i..i+t.length-1] = t
answers << s_dash_tmp.join("").gsub(/\?/, "a")
end
}
}
if answers.length == 0
puts "UNRESTORABLE"
else
puts answers.sort[0]
end | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,281,919 | 1,281,918 | u931757436 | ruby |
p03565 | def judge(s1, s2)
if s1.size != s2.size
return false
end
s1.size.times do |i|
if s1[i] != ?? && s1[i] != s2[i]
return false
end
end
return true
end
s,t=$<.map(&:chomp)
ans = -1
s.size.times do |i|
if judge(s[i, t.size], t)
tmp = s
tmp[i, t.size] = t
s.size.times do |j|
if tmp[j] == ??
tmp[j] = ?a
end
end
if ans == -1
ans = tmp
else
ans = [ans, tmp].min
end
end
end
puts (ans == -1 ? "UNRESTORABLE" : ans) | def judge(s1, s2)
if s1.size != s2.size
return false
end
s1.size.times do |i|
if s1[i] != ?? && s1[i] != s2[i]
return false
end
end
return true
end
s,t=$<.map(&:chomp)
ans = -1
s.size.times do |i|
if judge(s[i, t.size], t)
tmp = String.new(s)
tmp[i, t.size] = t
s.size.times do |j|
if tmp[j] == ??
tmp[j] = ?a
end
end
if ans == -1
ans = tmp
else
ans = [ans, tmp].min
end
end
end
puts (ans == -1 ? "UNRESTORABLE" : ans) | [
"call.add",
"call.arguments.change"
] | 1,281,924 | 1,281,925 | u553623615 | ruby |
p03565 | def judge(s1, s2)
if s1.size != s2.size
return false
end
s1.size.times do |i|
if s1[i] != ?? && s1[i] != s2[i]
return false
end
end
return true
end
s,t=$<.map(&:chomp)
ans = -1
s.size.times do |i|
if judge(s[i, t.size], t)
tmp = s
tmp[i, t.size] = t
s.size.times do |j|
if tmp[j] == ??
tmp[j] = ?a
end
end
if ans == -1
ans = tmp
else
ans = [ans, tmp].min
end
end
end
puts (ans == -1 ? "UNRESTORABLE" : ans) | def judge(s1, s2)
if s1.size != s2.size
return false
end
s1.size.times do |i|
if s1[i] != ?? && s1[i] != s2[i]
return false
end
end
return true
end
s,t=$<.map(&:chomp)
ans = -1
s.size.times do |i|
if judge(s[i, t.size], t)
tmp = String.new(s)
tmp[i, t.size] = t
s.size.times do |j|
if tmp[j] == ??
tmp[j] = ?a
end
end
if ans == -1
ans = tmp
else
ans = [ans, tmp].min
end
end
end
puts (ans == -1 ? "UNRESTORABLE" : ans) | [
"call.add",
"call.arguments.change"
] | 1,281,924 | 1,281,929 | u553623615 | ruby |
p03565 | sd = gets.chomp
t = gets.chomp
result = false
count = sd.length - t.length + 1
count.times{|i|
arr = sd[i, t.length]
arr.length.times{|ai|
result = arr[ai] == '?' || arr[ai] == t[ai]
break if result == false
}
if result then
sd[i, t.length] = t
break
end
}
puts result ? sd.gsub('?', 'a') : "UNRESTORABLE"
| sd = gets.chomp
t = gets.chomp
result = false
count = sd.length - t.length
count.downto(0){|i|
arr = sd[i, t.length]
arr.length.times{|ai|
result = arr[ai] == '?' || arr[ai] == t[ai]
break if result == false
}
if result then
sd[i, t.length] = t
break
end
}
puts result ? sd.gsub('?','a') : "UNRESTORABLE" | [
"expression.operation.binary.remove",
"identifier.change",
"call.arguments.add"
] | 1,281,932 | 1,281,933 | u436509682 | ruby |
p03565 | S,t=$<.map &:chomp
r=nil
(0..S.size-t.size).each{|i|
s=S.dup
if t.size.times.all?{|j|
if s[i+j]=='?' || s[i+j]==t[j]
s[i+j]=t[j]
end
}
s.tr!('?','a')
r=s if !r||r>s
end
}
puts r | S,t=$<.map &:chomp
r=nil
(0..S.size-t.size).each{|i|
s=S.dup
if t.size.times.all?{|j|
if s[i+j]=='?' || s[i+j]==t[j]
s[i+j]=t[j]
end
}
s.tr!('?','a')
r=s if !r||r>s
end
}
puts r||:UNRESTORABLE | [
"expression.operation.binary.add"
] | 1,281,967 | 1,281,968 | u280667879 | ruby |
p03565 | s = gets.chomp
t = gets.chomp
if s.length < t.length
puts "UNRESTORABLE"
elsif s.include?(t)
s.gsub!(/\?/, 'a')
puts s
else
f = true
ans = "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz"
(0..(s.length - t.length)).each {|i|
f = true
tmp = "" << s
t.length.times {|j|
if tmp[i + j] != t[j] and tmp[i + j] != '?'
f = false
break
else
tmp[i + j] = t[j]
end
}
if f
tmp.gsub!(/\?/, 'a')
ans = [ans, tmp].min
end
}
if ans != "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz"
puts ans
else
puts "NORESTORABLE"
end
end
| s = gets.chomp
t = gets.chomp
if s.length < t.length
puts "UNRESTORABLE"
elsif s.include?(t)
s.gsub!(/\?/, 'a')
puts s
else
f = true
ans = "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz"
(0..(s.length - t.length)).each {|i|
f = true
tmp = "" << s
t.length.times {|j|
if tmp[i + j] != t[j] and tmp[i + j] != '?'
f = false
break
else
tmp[i + j] = t[j]
end
}
if f
tmp.gsub!(/\?/, 'a')
ans = [ans, tmp].min
end
}
if ans != "zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz"
puts ans
else
puts "UNRESTORABLE"
end
end
| [
"literal.string.change",
"call.arguments.change"
] | 1,281,993 | 1,281,994 | u294283114 | ruby |
p03566 | def ascan; gets.split.map(&:to_f);end
n = gets.to_i
tt = ascan
vv = ascan
tt.unshift(0.0)
vv.unshift(0.0)
tt.push(0.0)
vv.push(0.0)
n+=2
(1..(n-2)).each do |i|
t = tt[i]
v = [vv[i], vv[i-1]+t].min
v = [v, vv[i+1]+t].min
vv[i] = v
end
(1..(n-2)).to_a.reverse.each do |i|
t = tt[i]
v = [vv[i], vv[i-1]+t].min
v = [v, vv[i+1]+t].min
vv[i] = v
end
p vv
#simulate_vel = 0.0
area = 0.0
(1..(n-2)).each do |i|
uptime = [vv[i]-vv[i-1], 0.0].max
downtime = [vv[i]-vv[i+1], 0.0].max
if uptime + downtime > tt[i]
v = (tt[i]+vv[i-1]+vv[i+1])/2.0
uptime = (vv[i-1]-v).abs
downtime = (vv[i+1]-v).abs
end
midtime = tt[i]-uptime-downtime
area += (vv[i-1])*uptime+uptime*uptime/2.0
area += midtime*vv[i]
area += (vv[i+1])*downtime+downtime*downtime/2.0
#p [uptime,midtime,downtime, vv[i]]
#p area
#simulate_vel += uptime
#abort "up" unless
end
p area | def ascan; gets.split.map(&:to_f);end
n = gets.to_i
tt = ascan
vv = ascan
tt.unshift(0.0)
vv.unshift(0.0)
tt.push(0.0)
vv.push(0.0)
n+=2
(1..(n-2)).each do |i|
t = tt[i]
v = [vv[i], vv[i-1]+t].min
v = [v, vv[i+1]+t].min
vv[i] = v
end
(1..(n-2)).to_a.reverse.each do |i|
t = tt[i]
v = [vv[i], vv[i-1]+t].min
v = [v, vv[i+1]+t].min
vv[i] = v
end
#p vv
#simulate_vel = 0.0
area = 0.0
(1..(n-2)).each do |i|
uptime = [vv[i]-vv[i-1], 0.0].max
downtime = [vv[i]-vv[i+1], 0.0].max
if uptime + downtime > tt[i]
v = (tt[i]+vv[i-1]+vv[i+1])/2.0
uptime = (vv[i-1]-v).abs
downtime = (vv[i+1]-v).abs
end
midtime = tt[i]-uptime-downtime
area += (vv[i-1])*uptime+uptime*uptime/2.0
area += midtime*vv[i]
area += (vv[i+1])*downtime+downtime*downtime/2.0
#p [uptime,midtime,downtime, vv[i]]
#p area
#simulate_vel += uptime
#abort "up" unless
end
p area | [
"call.remove"
] | 1,282,019 | 1,282,020 | u079330987 | ruby |
p03567 | p gets.include?("AC")?"Yes":"No" | puts gets.include?( "AC" )?"Yes":"No" | [
"call.function.change",
"io.output.change"
] | 1,282,195 | 1,282,196 | u408023666 | ruby |
p03567 | gets.include?("AC") ? "Yes": "No" | s=gets.chomp
puts s.include?("AC") ? "Yes": "No" | [
"call.add"
] | 1,282,238 | 1,282,239 | u049159332 | ruby |
p03567 | puts gets.index(/A.*C/)?"Yes":"No" | puts gets.index(/AC/)?"Yes":"No" | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,282,310 | 1,282,311 | u612721349 | ruby |
p03567 | puts gets.include? 'AC' ? 'Yes' : 'No' | puts gets.include?('AC')? 'Yes' : 'No' | [
"control_flow.branch.if.condition.change"
] | 1,282,337 | 1,282,338 | u056944756 | ruby |
p03567 | s=gets.chop
puts s=~/.*A.*C.*/ ? "Yes" : "No" | s=gets.chop
puts s=~/.*AC.*/ ? "Yes" : "No" | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,282,351 | 1,282,352 | u598016178 | ruby |
p03566 | n=gets.to_i
t=gets.split.map{|e|e.to_i*2}
v=gets.split.map{|e|e.to_i*2}
z=[0]*10**5
q=j=s=m=0
n.times{|i|z[j]=[z[j],v[i]].min;(j+1..j=q+=t[i]).each{|k|z[k]=[z[k-1]+1,v[i]].min}}
~-j.downto(0){|i|s+=m=[m+1,z[i]].min}
p s/4.0 | n=gets.to_i
t=gets.split.map{|e|e.to_i*2}
v=gets.split.map{|e|e.to_i*2}
z=[0]*10**5
q=j=s=m=0
n.times{|i|z[j]=[z[j],v[i]].min;(j+1..j=q+=t[i]).each{|k|z[k]=[z[k-1]+1,v[i]].min}}
(j-1).downto(0){|i|s+=m=[m+1,z[i]].min}
p s/4.0 | [
"expression.operation.unary.arithmetic.remove"
] | 1,282,976 | 1,282,977 | u280667879 | ruby |
p03566 | n=gets.to_i
t=gets.split.map{|e|e.to_i*2}
v=gets.split.map{|e|e.to_i*2}
z=[0]*10**5
q=j=s=m=0
n.times{|i|
q+=t[i]
z[j]=[z[j],v[i]].min
(j+1..q).each{|k|z[k]=[z[j-1]+1,v[i]].min}
j=q
}
(j-1).downto(0){|i|s+=m=[m+1,z[i]].min}
p s/4.0 | n=gets.to_i
t=gets.split.map{|e|e.to_i*2}
v=gets.split.map{|e|e.to_i*2}
z=[0]*10**5
q=j=s=m=0
n.times{|i|
q+=t[i]
z[j]=[z[j],v[i]].min
(j+1..q).each{|k|z[k]=[z[k-1]+1,v[i]].min}
j=q
}
(j-1).downto(0){|i|s+=m=[m+1,z[i]].min}
p s/4.0 | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,282,978 | 1,282,979 | u280667879 | ruby |
p03565 | def eq(s, t)
n = s.size
n.times do |i|
return false if s[i] != '?' && t[i] != '?' && s[i] != t[i]
end
true
end
s = gets.chomp
t = gets.chomp
(s.size - t.size+1).times.to_a.reverse.each do |i|
if eq(t, s[i...i+t.size])
ans = s.chars
(i...i+t.size).each do |idx|
ans[idx] = t[idx-i]
end
ans.each_with_index do |c, i|
if c == '?'
ans[i] = 'a'
end
end
p ans.join('')
exit
end
end
puts :UNRESTORABLE
| def eq(s, t)
n = s.size
n.times do |i|
return false if s[i] != '?' && t[i] != '?' && s[i] != t[i]
end
true
end
s = gets.chomp
t = gets.chomp
(s.size - t.size+1).times.to_a.reverse.each do |i|
if eq(t, s[i...i+t.size])
ans = s.chars
(i...i+t.size).each do |idx|
ans[idx] = t[idx-i]
end
ans.each_with_index do |c, i|
if c == '?'
ans[i] = 'a'
end
end
puts ans.join('')
exit
end
end
puts :UNRESTORABLE
| [
"call.function.change",
"io.output.change"
] | 1,283,139 | 1,283,140 | u161323909 | ruby |
p03565 | s = gets.chomp
t_ = gets.chomp
ns = s.length
nt = t_.length
arr = []
(ns - nt + 1).times do |i|
x = s
ss = s[i..(i + nt - 1)]
ok = true
nt.times do |j|
if ss[j] != "?" && ss[j] != t_[j]
ok = false
end
end
if ok
x[i, nt] = t_
arr << x
end
end
if arr.empty?
puts "UNRESTORABLE"
else
arr.sort!
ans = arr[0].gsub("?", "a")
puts ans
end | s = gets.chomp
t_ = gets.chomp
ns = s.length
nt = t_.length
arr = []
(ns - nt + 1).times do |i|
x = s.clone
ss = s[i..(i + nt - 1)]
ok = true
nt.times do |j|
if ss[j] != "?" && ss[j] != t_[j]
ok = false
end
end
if ok
x[i, nt] = t_
arr << x
end
end
if arr.empty?
puts "UNRESTORABLE"
else
arr.sort!
ans = arr[0].gsub("?", "a")
puts ans
end | [
"call.add"
] | 1,283,162 | 1,283,163 | u910756197 | ruby |
p03565 | s = gets.chomp
t = gets.chomp
if s.size<t.size then
puts 'UNRESTORABLE'
exit
end
w = -1
s.size.times{|i|
f = true
t.size.times{|j|
if !(s[i+j]=='?'||s[i+j]==t[j]) then
f = false
end
}
w = i if f
}
if w==-1 then
puts 'UNRESTORABLE'
exit
end
a = ''
s.size.times{|i|
if w<=i && i<=w+t.size then
a+=t[i-w]
elsif s[i] == '?' then
a+='a'
else
a+=s[i]
end
}
puts a | s = gets.chomp
t = gets.chomp
if s.size<t.size then
puts 'UNRESTORABLE'
exit
end
w = -1
s.size.times{|i|
f = true
t.size.times{|j|
if !(s[i+j]=='?'||s[i+j]==t[j]) then
f = false
end
}
w = i if f
}
if w==-1 then
puts 'UNRESTORABLE'
exit
end
a = ''
s.size.times{|i|
if w<=i && i<w+t.size then
a+=t[i-w]
elsif s[i] == '?' then
a+='a'
else
a+=s[i]
end
}
puts a | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,283,166 | 1,283,167 | u397763977 | ruby |
p03569 | s = gets.chomp
l = 0
r = s.size - 1
res = 0
while l != r
if s[l] == s[r]
l += 1
r -= 1
next
end
if s[l] == 'x'
# xooo
l += 1
elsif s[r] == 'x'
# ooox
r -= 1
else
# aoo
res = -1
break
end
res += 1
end
puts res | s = gets.chomp
l = 0
r = s.size - 1
res = 0
while r > l
if s[l] == s[r]
l += 1
r -= 1
next
end
if s[l] == 'x'
# xooo
l += 1
elsif s[r] == 'x'
# ooox
r -= 1
else
# aoo
res = -1
break
end
res += 1
end
puts res | [
"expression.operation.binary.remove"
] | 1,283,209 | 1,283,210 | u624505752 | ruby |
p03569 | s = readline
l = 0
r = s.size - 1
res = 0
while l < r
if s[l] == s[r]
l += 1
r -= 1
elsif s[l] == "x"
l += 1
res += 1
elsif s[r] == "x"
r -= 1
res += 1
else
puts -1
exit
end
end
puts res | s = readline.chomp
l = 0
r = s.size - 1
res = 0
while l < r
if s[l] == s[r]
l += 1
r -= 1
elsif s[l] == "x"
l += 1
res += 1
elsif s[r] == "x"
r -= 1
res += 1
else
puts -1
exit
end
end
puts res | [
"call.add"
] | 1,283,563 | 1,283,564 | u520404466 | ruby |
p03565 | s = gets
t = gets
ans = nil
(0..s.size-t.size).each {|i|
ok = 1
(0..t.size-1).each{|j|
if s[i+j] != ?? && s[i+j] != t[j] then
ok = 0
end
}
next if ok == 0
result = ""
(0..s.size-1).each{|j|
if s[j] == ??
if i <= j && j < i+t.size then
result << t[j-i]
else
result << ?a
end
else
result << s[j]
end
}
ans = result if !ans || result < ans
}
if ans
puts ans
else
puts :UNRESTORABLE
end
| s = gets.strip
t = gets.strip
ans = nil
(0..s.size-t.size).each {|i|
ok = 1
(0..t.size-1).each{|j|
if s[i+j] != ?? && s[i+j] != t[j] then
ok = 0
end
}
next if ok == 0
result = ""
(0..s.size-1).each{|j|
if s[j] == ??
if i <= j && j < i+t.size then
result << t[j-i]
else
result << ?a
end
else
result << s[j]
end
}
ans = result if !ans || result < ans
}
if ans
puts ans
else
puts :UNRESTORABLE
end
| [
"call.add"
] | 1,283,613 | 1,283,614 | u226155577 | ruby |
p03569 | s = gets.chomp.split("")
b = 0
l = s.length-1
count = 0
while b!=l do
if s[b] == s[l] then
b += 1
l -= 1
elsif s[b] == "x" then
count += 1
b += 1
elsif s[l] == "x" then
count += 1
l -= 1
else
puts -1
exit(0)
end
end
puts count | s = gets.chomp.split("")
b = 0
l = s.length-1
count = 0
while b<l do
if s[b] == s[l] then
b += 1
l -= 1
elsif s[b] == "x" then
count += 1
b += 1
elsif s[l] == "x" then
count += 1
l -= 1
else
puts -1
exit(0)
end
end
puts count | [] | 1,283,782 | 1,283,783 | u308041652 | ruby |
p03573 | a = gets.chomp.split.map(&:to_i).sort
a.delete!(a[1])
puts a[0] | a = gets.chomp.split.map(&:to_i).sort
a.delete(a[1])
puts a[0] | [
"identifier.change"
] | 1,284,186 | 1,284,187 | u744908753 | ruby |
p03573 | puts gets.split.map(&:to_i).goup_by(&:itself).select{|k,v|v.size==1}.values[0] | puts gets.split.map(&:to_i).group_by(&:itself).select{|k,v|v.size==1}.values[0]
| [
"identifier.change",
"call.arguments.change"
] | 1,284,147 | 1,284,148 | u050914494 | ruby |
p03573 | i = gets.split("").map(&:to_i)
if i[0]==i[1]
print i[2]
elsif i[1]==i[2]
print i[0]
else
print i[1]
end | i = gets.split(" ").map(&:to_i)
if i[0]==i[1]
print i[2]
elsif i[1]==i[2]
print i[0]
else
print i[1]
end | [
"literal.string.change",
"assignment.value.change",
"call.arguments.change"
] | 1,284,272 | 1,284,273 | u312004378 | ruby |
p03573 | puts gets.chomp.split.find{|n| n.count(n)==1} | a = gets.chomp.split
puts a.find{|n| a.count(n)==1} | [
"assignment.variable.change",
"call.add",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,284,293 | 1,284,294 | u502306384 | ruby |
p03573 | gets.tap{|x| x.tap{|y| y.chars.each{|i| puts i if x.count(i) == 1}}} | gets.split.tap{|x| x.tap{|y| y.each{|i| puts i if x.count(i) == 1}}} | [
"call.add",
"call.remove"
] | 1,284,500 | 1,284,501 | u302896114 | ruby |
p03573 | A,B,C = gets.split("\s").map {|s|s.to_i}
if A==B then
puts C
elsif A==C then
puts B
else
puts C
end | A,B,C = gets.split("\s").map {|s|s.to_i}
if A==B then
puts C
elsif A==C then
puts B
else
puts A
end | [
"call.arguments.change"
] | 1,284,539 | 1,284,540 | u186737744 | ruby |
p03577 | puts gets[0..-9] | puts gets[0...-9] | [
"call.arguments.change"
] | 1,287,217 | 1,287,218 | u670503797 | ruby |
p03577 | x = gets.chomp
puts x[0...(x.length-7)] | x = gets.chomp
puts x[0...(x.length-8)] | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,287,223 | 1,287,224 | u183509493 | ruby |
p03577 | puts gets.sub(/F.*?L$/,"") | puts gets.sub(/FESTIVAL$/,"") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,287,271 | 1,287,272 | u408023666 | ruby |
p03577 | puts gets.slice(0..-9) | puts gets.chomp.slice(0..-9) | [
"call.add"
] | 1,287,295 | 1,287,296 | u091810847 | ruby |
p03577 | S = gets.chomp
pust S[0,-8] | S = gets.chomp
puts S[0, S.length - 8]
| [
"identifier.change",
"call.add"
] | 1,287,326 | 1,287,327 | u858670323 | ruby |
p03576 | N, K = gets.split.map(&:to_i)
dots = Array.new(N) { gets.split.map(&:to_i) }
area =Float::INFINITY
dots.combination([4, K].min) do |set|
x, y = set.transpose
min_x = x.min
max_x = x.max
min_y = y.min
max_y = y.max
count = dots.select { |xi, yi| min_x <= xi and xi <= max_x and min_y <= yi and max_y <= yi }.size
if count >= K
if temp = (max_x - min_x) * (max_y - min_y) and temp < area
area = temp
end
end
end
puts area
| N, K = gets.split.map(&:to_i)
dots = Array.new(N) { gets.split.map(&:to_i) }
area =Float::INFINITY
dots.combination([4, K].min) do |set|
x, y = set.transpose
min_x = x.min
max_x = x.max
min_y = y.min
max_y = y.max
count = dots.select { |xi, yi| min_x <= xi and xi <= max_x and min_y <= yi and yi <= max_y }.size
if count >= K
if temp = (max_x - min_x) * (max_y - min_y) and temp < area
area = temp
end
end
end
puts area
| [
"expression.operation.binary.remove"
] | 1,287,424 | 1,287,425 | u033378815 | ruby |
p03576 | N,K=gets.split.map &:to_i
A=N.times.map{gets.split.map &:to_i}.sort
x,y=A.transpose
Y=y.sort
r=(x[-1]-x[0])*(Y[-1]-Y[0])
N.times{|i|(i+1...N).each{|j|N.times{|k|(k+1...N).each{|l|
lx=x[i];rx=x[j];ly=Y[k];ry=Y[l]
q=(rx-lx)*(ry-ly)
r=q if r<q&&j-i+1>=K&&(i..j).count{|z|
ly<=y[z]&&y[z]<=ry
}>=K
}}}}
p r | N,K=gets.split.map &:to_i
A=N.times.map{gets.split.map &:to_i}.sort
x,y=A.transpose
Y=y.sort
r=(x[-1]-x[0])*(Y[-1]-Y[0])
N.times{|i|(i+1...N).each{|j|N.times{|k|(k+1...N).each{|l|
lx=x[i];rx=x[j];ly=Y[k];ry=Y[l]
q=(rx-lx)*(ry-ly)
r=q if r>q&&j-i+1>=K&&(i..j).count{|z|
ly<=y[z]&&y[z]<=ry
}>=K
}}}}
p r | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,287,476 | 1,287,477 | u280667879 | ruby |
p03578 | n=gets.to_i
d=gets.split.map(&:to_i)
m=gets.to_i
t=gets.split.map(&:to_i)
dh=Hash.new(0)
d.each{|w|dh[w]+=1}
t.each{|w|
dh[w]-=1
if dh[w]<0 then
puts 'No'
exit
end
}
puts 'Yes' | n=gets.to_i
d=gets.split.map(&:to_i)
m=gets.to_i
t=gets.split.map(&:to_i)
dh=Hash.new(0)
d.each{|w|dh[w]+=1}
t.each{|w|
dh[w]-=1
if dh[w]<0 then
puts 'NO'
exit
end
}
puts 'YES' | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 1,287,870 | 1,287,871 | u397763977 | ruby |
p03578 | n=gets.to_i
a=gets.split.map &:to_i
m=gets.to_i
b=gets.split.map &:to_i
a.sort!
b.sort!
c=true
ca=0
b.each do |e|
loop do
if ca>n
c=false
break
end
if a[ca]==e
ca+=1
break
end
if a[ca]>e
c=false
break
end
ca+=1
end
end
puts c ? :YES : :NO
| n=gets.to_i
a=gets.split.map &:to_i
m=gets.to_i
b=gets.split.map &:to_i
a.sort!
b.sort!
c=true
ca=0
b.each do |e|
loop do
if ca>=n
c=false
break
end
if a[ca]==e
ca+=1
break
end
if a[ca]>e
c=false
break
end
ca+=1
end
end
puts c ? :YES : :NO
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,287,879 | 1,287,880 | u554838392 | ruby |
p03578 | N = gets.chop.to_i;
D = gets.chop.split.map(&:to_i)
M = gets.chop.to_i;
T = gets.chop.split.map(&:to_i)
if M > N
puts "No"
exit
end
h = Hash.new
for i in D
if h.has_key?(i)
h.store(i, h.fetch(i) + 1)
else
h.store(i, 1)
end
end
for i in T
if h.has_key?(i) == false
puts "NO"
exit
else
if h.fetch(i) == 0
puts "NO"
exit
else
h.store(i, h.fetch(i) - 1)
end
end
end
puts "YES" | N = gets.chop.to_i;
D = gets.chop.split.map(&:to_i)
M = gets.chop.to_i;
T = gets.chop.split.map(&:to_i)
if M > N
puts "NO"
exit
end
h = Hash.new
for i in D
if h.has_key?(i)
h.store(i, h.fetch(i) + 1)
else
h.store(i, 1)
end
end
for i in T
if h.has_key?(i) == false
puts "NO"
exit
else
if h.fetch(i) == 0
puts "NO"
exit
else
h.store(i, h.fetch(i) - 1)
end
end
end
puts "YES" | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,288,005 | 1,288,006 | u634209474 | ruby |
p03577 | s = gets
puts s[0, s.size - 8]
| #!/usr/bin/env ruby
s = gets.chomp
puts s[0..s.size - 9]
| [
"call.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"literal.number.integer.change",
"expression.operation.binary.change"
] | 1,288,295 | 1,288,296 | u232013343 | ruby |
p03577 | #!/usr/bin/env ruby
s = gets
puts s[0, s.size - 8]
| #!/usr/bin/env ruby
s = gets.chomp
puts s[0..s.size - 9]
| [
"call.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"literal.number.integer.change",
"expression.operation.binary.change"
] | 1,288,297 | 1,288,296 | u232013343 | ruby |
p03577 | puts gets.chomp.slice(-8,8) | a = gets.chomp
a.slice!(-8,8)
puts a | [
"assignment.variable.change",
"call.add",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,288,309 | 1,288,310 | u655122274 | ruby |
p03578 | n = gets.to_i
d = gets.split.map(&:to_i)
m = gets.to_i
t = gets.split.map(&:to_i)
hd = Hash.new 0
d.each{|x| hd[x] += 1}
ht = Hash.new 0
t.each{|x| ht[x] += 1}
ht.keys.each{|k|
ht[k] -= hd[k]
}
puts ht.values.all?{|x| x <= 0} ? :YES : :No
| n = gets.to_i
d = gets.split.map(&:to_i)
m = gets.to_i
t = gets.split.map(&:to_i)
hd = Hash.new 0
d.each{|x| hd[x] += 1}
ht = Hash.new 0
t.each{|x| ht[x] += 1}
ht.keys.each{|k|
ht[k] -= hd[k]
}
puts ht.values.all?{|x| x <= 0} ? :YES : :NO
| [
"call.arguments.change"
] | 1,288,170 | 1,288,171 | u074147690 | ruby |
p03583 | N = gets.to_i
(1 .. 3500).each do |a|
(a .. 3500).each do |b|
next if (4 * a * b - N * b - N * a).zero?
c,m = (N * a * b).divmod(4 * a * b - N * b - N * a )
next if m > 0
puts [a,b,c].join(' ')
exit
end
end
| N = gets.to_i
(1 .. 3500).each do |a|
(1 .. 3500).each do |b|
next if (4 * a * b - N * b - N * a).zero?
c,m = (N * a * b).divmod(4 * a * b - N * b - N * a )
next if m > 0 || c <= 0
puts [a,b,c].join(' ')
exit
end
end
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 1,289,201 | 1,289,204 | u627981707 | ruby |
p03583 | N = gets.to_i
t = Rational(4, N)
(1..3500).each do |h|
(1..3500).each do |n|
a = N * h * n
b = 4 * h * n - N * n - N * h
next if b < 0
next if a < b
next if a % b != 0
w = a / b
puts [h, n, w.to_i].join(' ')
exit
end
end
| N = gets.to_i
t = Rational(4, N)
(1..3500).each do |h|
(1..3500).each do |n|
a = N * h * n
b = 4 * h * n - N * n - N * h
next if b <= 0
next if a < b
next if a % b != 0
w = a / b
puts [h, n, w.to_i].join(' ')
exit
end
end
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,289,377 | 1,289,378 | u740836226 | ruby |
p03579 | NV[Z='RUBY_THREAD_VM_STACK_SIZE']||exec({Z=>'10000000'},'ruby',$0)
N, M = gets.split.map(&:to_i)
$g = Array.new(N){ [] }
M.times do |i|
a, b = gets.split.map(&:to_i)
a -= 1
b -= 1
$g[a] << b
$g[b] << a
end
$color = Array.new(N, 0)
def is_bipartite_graph v, c
# p [v,c]
$color[v] = c
$g[v].each do |w|
return false if $color[w] == c
return false if $color[w] == 0 && !is_bipartite_graph(w, -c)
end
return true
end
# p $g
# p $color
if is_bipartite_graph(0, 1)
b = $color.count(1)
w = N - b
puts b * w - M
else
puts N * ( N - 1 ) / 2 - M
end | ENV[Z='RUBY_THREAD_VM_STACK_SIZE']||exec({Z=>'10000000'},'ruby',$0)
N, M = gets.split.map(&:to_i)
$g = Array.new(N){ [] }
M.times do |i|
a, b = gets.split.map(&:to_i)
a -= 1
b -= 1
$g[a] << b
$g[b] << a
end
$color = Array.new(N, 0)
def is_bipartite_graph v, c
# p [v,c]
$color[v] = c
$g[v].each do |w|
return false if $color[w] == c
return false if $color[w] == 0 && !is_bipartite_graph(w, -c)
end
return true
end
# p $g
# p $color
if is_bipartite_graph(0, 1)
b = $color.count(1)
w = N - b
puts b * w - M
else
puts N * ( N - 1 ) / 2 - M
end | [
"expression.operation.binary.change"
] | 1,289,562 | 1,289,563 | u693378622 | ruby |
p03587 | p gets.chop.char.count("1") | p gets.chop.chars.count("1") | [
"identifier.change",
"call.arguments.change"
] | 1,290,222 | 1,290,223 | u264508862 | ruby |
p03587 | num = S.chop
ary=num.split('')
result= 0
ary.each do |i|
if i=='1'
result+= 1
else
end
end
print result | num = gets.chop
ary=num.split('')
result= 0
ary.each do |i|
if i=='1'
result+= 1
else
end
end
print result | [
"assignment.value.change"
] | 1,290,276 | 1,290,277 | u432562757 | ruby |
p03587 | print "S="
num = gets.chop
ary=num.split('')
result= 0
ary.each do |i|
if i=='1'
result+= 1
else
end
end
print result | num = gets.chop
ary=num.split('')
result= 0
ary.each do |i|
if i=='1'
result+= 1
else
end
end
print result | [
"call.remove"
] | 1,290,278 | 1,290,277 | u432562757 | ruby |
p03587 | i = gets.split('')
c = 0
i.each do |s|
p s
c += 1 if s == "1"
end
p c | i = gets.chomp.split('')
c = 0
i.each do |s|
c += 1 if s == "1"
end
p c | [
"call.add",
"call.remove"
] | 1,290,295 | 1,290,296 | u354075848 | ruby |
p03588 | p (1..gets.to_i).map{gets.split.map &:to_i}.min.inject(:+)
| p (1..gets.to_i).map{gets.split.map &:to_i}.max.inject(:+) | [
"misc.opposites",
"identifier.change",
"call.arguments.change"
] | 1,290,459 | 1,290,460 | u503549962 | ruby |
p03588 | N = gets.chomp.to_i
ans = 0
num, score = [], []
0.upto(N-1) do |i|
num[i], score[i] = gets.chomp.split(' ').map(&:to_i)
end
num.sort!
score.sort!
ans += num[N-1] - num[0] + 1
ans += num[0] - 1
ans += score[0]
p an | N = gets.chomp.to_i
ans = 0
num, score = [], []
0.upto(N-1) do |i|
num[i], score[i] = gets.chomp.split(' ').map(&:to_i)
end
num.sort!
score.sort!
ans += num[N-1] - num[0] + 1
ans += num[0] - 1
ans += score[0]
p ans | [
"misc.typo",
"identifier.change",
"call.arguments.change"
] | 1,290,603 | 1,290,604 | u354075848 | ruby |
p03588 | a = gets.chomp
fline = readlines
len = fline.length
i = 0
while i < len
fline[i] = fline[i].chomp.split(" ")
i += 1
end
flinekai = fline.map{|item| item[0].to_i }
c = flinekai.max
d = flinekai.index(c)
flinekai2 = fline.map{|item| item[1].to_i }
p c + d | a = gets.chomp
fline = readlines
len = fline.length
i = 0
while i < len
fline[i] = fline[i].chomp.split(" ")
i += 1
end
flinekai = fline.map{|item| item[0].to_i }
c = flinekai.max
d = flinekai.index(c)
flinekai2 = fline.map{|item| item[1].to_i }
p c + flinekai2[d] | [
"call.arguments.change"
] | 1,290,613 | 1,290,614 | u794707792 | ruby |
p03591 | puts gets=~/^YAKI.*/?"YES":"NO" | puts gets=~/^YAKI.*/?"Yes":"No" | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,290,820 | 1,290,821 | u408023666 | ruby |
p03591 | str = gets.to_s
if str.index("YAKI") == 0 then
p "Yes"
else
p "No"
end | str = gets.to_s
if str.index("YAKI") == 0 then
print "Yes"
else
print "No"
end | [
"call.function.change",
"io.output.change"
] | 1,291,157 | 1,291,158 | u140205718 | ruby |
p03591 | a = gets
print a.start_with?("YAKI") ? 'yes' : 'no' | a = gets
print a.start_with?("YAKI") ? 'Yes' : 'No' | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,291,171 | 1,291,172 | u631383869 | ruby |
p03592 | N,M,K = gets.chomp.split(" ").map(&:to_i)
has = false
(N+1).times do |i|
(M+1).times do |j|
has = true if N*i + M*j - 2*i*j == K
end
end
puts has ? "Yes" : "No" | N,M,K = gets.chomp.split(" ").map(&:to_i)
has = false
(N+1).times do |i|
(M+1).times do |j|
has = true if M*i + N*j - 2*i*j == K
end
end
puts has ? "Yes" : "No" | [
"control_flow.branch.if.condition.change"
] | 1,291,430 | 1,291,431 | u265679940 | ruby |
p03592 | N,M,K = gets.chomp.split(" ").map(&:to_i)
has = false
(N+1).times do |i|
(M+1).times do |j|
has = true if (N-j)*i + (M-i)*j == K
end
end
puts has ? "Yes" : "No" | N,M,K = gets.chomp.split(" ").map(&:to_i)
has = false
(N+1).times do |i|
(M+1).times do |j|
has = true if (M-j)*i + (N-i)*j == K
end
end
puts has ? "Yes" : "No" | [
"control_flow.branch.if.condition.change"
] | 1,291,432 | 1,291,433 | u265679940 | ruby |
p03592 | require 'pp'
$DEBUG ? define_method(:dpp){|e|pp e} : define_method(:dpp){|e|}
# 空白区切の入力値を数値の配列で返却する
def gets_i_list()
gets.chomp.split(" ").map(&:to_i)
end
N, M, K = gets_i_list
1.upto(N) do |i|
1.upto(M) do |j|
b_count = i * (M - j) + j * (N - i)
if K == b_count
puts "Yes"
exit
end
end
end
puts "No"
| require 'pp'
$DEBUG ? define_method(:dpp){|e|pp e} : define_method(:dpp){|e|}
# 空白区切の入力値を数値の配列で返却する
def gets_i_list()
gets.chomp.split(" ").map(&:to_i)
end
N, M, K = gets_i_list
0.upto(N) do |i|
0.upto(M) do |j|
b_count = i * (M - j) + j * (N - i)
if K == b_count
puts "Yes"
exit
end
end
end
puts "No"
| [
"literal.number.integer.change",
"io.output.change"
] | 1,291,664 | 1,291,665 | u370977023 | ruby |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.