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 |
|---|---|---|---|---|---|---|---|
p02546
|
s = gets
if s[s.size-1]=='s'
s = s + 'e'
end
puts s + 's'
|
s = gets.chomp
if s[s.size-1]=='s'
s = s + 'e'
end
puts s + 's'
|
[
"call.add"
] | 242,733
| 242,734
|
u054798759
|
ruby
|
p02546
|
s = gets
if s[s.size - 1] == "s"
puts s + "es"
else
puts s + "s"
end
|
s = gets.chomp
if s[-1] == "s"
puts s + "es"
else
puts s + "s"
end
|
[
"call.add",
"call.remove"
] | 242,921
| 242,922
|
u560124635
|
ruby
|
p02546
|
s = gets.to_s
if s[-1] == "s"
puts s + "es"
else
puts s + "s"
end
|
s = gets.chomp
if s[-1] == "s"
puts s + "es"
else
puts s + "s"
end
|
[
"assignment.value.change",
"identifier.change"
] | 242,923
| 242,922
|
u560124635
|
ruby
|
p02546
|
s = gets
if s[-1] == "s"
puts s + "es"
else
puts s + "s"
end
|
s = gets.chomp
if s[-1] == "s"
puts s + "es"
else
puts s + "s"
end
|
[
"call.add"
] | 242,924
| 242,922
|
u560124635
|
ruby
|
p02546
|
s = gets.to_s
if s[-1] == "s"
puts s + "es"
else
puts s + "s"
end
|
s = gets.chomp
if s[-1] == "s"
puts s + "es"
else
puts s + "s"
end
|
[
"assignment.value.change",
"identifier.change"
] | 242,991
| 242,990
|
u182277075
|
ruby
|
p02546
|
S = gets.chomp.to_s
rev = S.reverse!
judge = rev.index("s")
puts judge
if judge == 0
puts rev.reverse! + "es"
else
puts rev.reverse! + "s"
end
|
S = gets.chomp.to_s
rev = S.reverse!
judge = rev.index("s")
if judge == 0
puts rev.reverse! + "es"
else
puts rev.reverse! + "s"
end
|
[
"call.remove"
] | 243,049
| 243,050
|
u231155602
|
ruby
|
p02546
|
a = gets
puts a[-1] == "s" ? a + "es" : a + "s"
|
a = gets.chomp
puts a[-1] == "s" ? a + "es" : a + "s"
|
[
"call.add"
] | 243,162
| 243,163
|
u994502918
|
ruby
|
p02546
|
a = gets
p a[-1] == "s" ? a + "es" : a + "s"
|
a = gets.chomp
puts a[-1] == "s" ? a + "es" : a + "s"
|
[
"assignment.value.change",
"call.add",
"io.output.change"
] | 243,164
| 243,163
|
u994502918
|
ruby
|
p02546
|
s = gets.chomp
result = s[-1] == 's' ? 'es' : 's'
p s + result
|
s = gets.chop
result = s[-1] == 's' ? 'es' : 's'
puts s + result
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 243,277
| 243,278
|
u401047847
|
ruby
|
p02546
|
s = gets
result = s[-1] == 's' ? 'es' : 's'
p s + result
|
s = gets.chop
result = s[-1] == 's' ? 'es' : 's'
puts s + result
|
[
"call.add",
"call.function.change",
"io.output.change"
] | 243,279
| 243,278
|
u401047847
|
ruby
|
p02546
|
s = gets.chop
result = s[-1] == 's' ? 'es' : 's'
p s + result
|
s = gets.chop
result = s[-1] == 's' ? 'es' : 's'
puts s + result
|
[
"call.function.change",
"io.output.change"
] | 243,280
| 243,278
|
u401047847
|
ruby
|
p02546
|
s = gets.chop
result = s[-1] == 's' ? 'es' : 's'
p s + resultruby
|
s = gets.chop
result = s[-1] == 's' ? 'es' : 's'
puts s + result
|
[
"call.function.change",
"io.output.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 243,281
| 243,278
|
u401047847
|
ruby
|
p02546
|
s = gets.split("").map(&:to_s)
print s.join
if s.last == "s" then
print "es"
else
print "s"
end
|
s = gets.chomp.split("").map(&:to_s)
print s.join
if s.last == "s" then
print "es"
else
print "s"
end
|
[
"call.add"
] | 243,337
| 243,338
|
u312264597
|
ruby
|
p02546
|
s = gets
if s[-1] == "s"
puts "#{s}es"
else
puts "#{s}s"
end
|
s = gets.chomp
if s[-1] == "s"
puts "#{s}es"
else
puts "#{s}s"
end
|
[
"call.add"
] | 243,341
| 243,342
|
u702652578
|
ruby
|
p02546
|
s = gets
if s[s.length-1] == "s"
s += "es"
else
s += "s"
end
puts s
|
s = gets.chomp
if s[s.length-1] == "s"
s += "es"
else
s += "s"
end
puts s
|
[
"call.add"
] | 243,363
| 243,364
|
u244203620
|
ruby
|
p02546
|
word = gets.to_s
if word[-1] == 's'
puts word + 'es'
else
puts word + 's'
end
|
word = gets.chomp
if word[-1] == 's'
puts word + 'es'
else
puts word + 's'
end
|
[
"assignment.value.change",
"identifier.change"
] | 243,392
| 243,393
|
u602384426
|
ruby
|
p02546
|
s = gets
puts s + (s[-1]=='s' ? 'es' : 's')
|
s = gets.chomp
puts s + (s[-1]=='s' ? 'es' : 's')
|
[
"call.add"
] | 243,672
| 243,673
|
u093931084
|
ruby
|
p02547
|
puts`dd`[/(.) \1.(.) \2.(.) \3/]?:Yes: :No
|
puts`dd`[/(.) \1
(.) \2
(.) \3/]?:Yes: :No
|
[
"control_flow.branch.if.condition.change"
] | 244,387
| 244,388
|
u657913472
|
ruby
|
p02547
|
n = gets.to_i
ds = []
n.times {
d1, d2 = gets.split.map &:to_i
if d1 == d2 then
ds << true
end
}
ds.each_cons(3){ |x|
if x.all? then
puts 'Yes'
exit
end
}
puts 'No'
|
n = gets.to_i
ds = []
n.times {
d1, d2 = gets.split.map &:to_i
if d1 == d2 then
ds << true
else
ds << false
end
}
ds.each_cons(3){ |x|
if x.all? then
puts 'Yes'
exit
end
}
puts 'No'
|
[
"expression.operation.binary.add"
] | 244,540
| 244,541
|
u874414087
|
ruby
|
p02547
|
N = gets.to_i
D = N.times.map{gets.split.map(&:to_i)}
count = 0
N.times do |i|
if D[i][0] == D[i][1]
if D[i+1][0] == D[i+1][1]
if D[i+2][0] == D[i+2][1]
count += 1
end
end
end
end
if count > 0
puts "Yes"
else
puts "No"
end
|
N = gets.to_i
D = N.times.map{gets.split.map(&:to_i)}
count = 0
(N-2).times do |i|
if D[i][0] == D[i][1]
if D[i+1][0] == D[i+1][1]
if D[i+2][0] == D[i+2][1]
count += 1
end
end
end
end
if count > 0
puts "Yes"
else
puts "No"
end
|
[] | 244,965
| 244,966
|
u190378842
|
ruby
|
p02547
|
N=gets.to_i
c=0
r="No"
N.times{
x,y=gets.split.map(&:to_i)
if x==y
c+=1
if c>=3
r="Yes"
end
end
}
puts r
|
N=gets.to_i
c=0
r="No"
N.times{
x,y=gets.split.map(&:to_i)
if x==y
c+=1
if c>=3
r="Yes"
end
else
c=0
end
}
puts r
|
[
"assignment.add"
] | 245,205
| 245,206
|
u488526012
|
ruby
|
p02547
|
n=gets.to_i
c=0
n.times do
d=gets.split.map(&:to_i)
if d[0]==d[1]
c+=1
if c==3
puts "Yes"
end
else
c=0
end
end
puts "No"
|
n=gets.to_i
c=0
n.times do
d=gets.split.map(&:to_i)
if d[0]==d[1]
c+=1
if c==3
puts "Yes"
exit
end
else
c=0
end
end
puts "No"
|
[
"control_flow.exit.add"
] | 245,372
| 245,373
|
u744908753
|
ruby
|
p02548
|
n = gets.to_i - 1
count = 0
for i in 1..n do
count += (n-1)/i
end
p count
|
n = gets.to_i - 1
count = 0
for i in 1..n do
count += n/i
end
p count
|
[] | 245,595
| 245,596
|
u364739763
|
ruby
|
p02549
|
M = 998_244_353
n, k = gets.chomp.split(' ').map(&:to_i)
lr = k.times.map { gets.chomp.split(' ').map(&:to_i) }.sort_by
dp = (0..n).map { 0 }
dp[1] = 1
(2..n).each do |i|
temp = lr.map { |l, r| dp[[0, i - l].max] - dp[[0, i - r - 1].max] }.sum
dp[i] = (dp[i - 1] + temp) % M
end
puts dp[n] - dp[n - 1]
|
M = 998_244_353
n, k = gets.chomp.split(' ').map(&:to_i)
lr = k.times.map { gets.chomp.split(' ').map(&:to_i) }.sort_by
dp = (0..n).map { 0 }
dp[1] = 1
(2..n).each do |i|
temp = lr.map { |l, r| dp[[0, i - l].max] - dp[[0, i - r - 1].max] }.sum
dp[i] = (dp[i - 1] + temp) % M
end
puts (dp[n] - dp[n - 1]) % M
|
[
"call.arguments.change"
] | 245,745
| 245,746
|
u253759478
|
ruby
|
p02549
|
require "byebug"
a = gets.split(" ")
$n = a[0].to_i
$k = a[1].to_i
$f = [1]
$prefix_f = [1]
$l = []
$r = []
$k.times do
a = gets.split(" ")
ll = a[0].to_i
rr = a[1].to_i
$l.push(ll)
$r.push(rr)
end
def sum_from(ll, rr)
if rr < 0
0
else
ret = $prefix_f[rr]
if ll > 0
ret -= $prefix_f[ll - 1]
end
ret
end
end
$mod = 998244353
$n.times do |i|
ff = 0
$k.times do |j|
ff = (ff + sum_from(i + 1 - $r[j], i + 1 - $l[j])) % $mod
end
# byebug
$f.push(ff)
# p ff
$prefix_f.push($prefix_f[i] + ff)
end
# p $f[4]
puts $f[$n - 1]
|
a = gets.split(" ")
$n = a[0].to_i
$k = a[1].to_i
$f = [1]
$prefix_f = [1]
$l = []
$r = []
$k.times do
a = gets.split(" ")
ll = a[0].to_i
rr = a[1].to_i
$l.push(ll)
$r.push(rr)
end
def sum_from(ll, rr)
if rr < 0
0
else
ret = $prefix_f[rr]
if ll > 0
ret -= $prefix_f[ll - 1]
end
ret
end
end
$mod = 998244353
$n.times do |i|
ff = 0
$k.times do |j|
ff = (ff + sum_from(i + 1 - $r[j], i + 1 - $l[j])) % $mod
end
# byebug
$f.push(ff)
# p ff
$prefix_f.push($prefix_f[i] + ff)
end
# p $f[4]
puts $f[$n - 1]
|
[
"call.remove"
] | 246,018
| 246,019
|
u624520031
|
ruby
|
p02549
|
N, K = gets.split.map(&:to_i)
mod = 998244353
dp = Array.new(n, 0)
dp[0] = 1
lr = k.times.map {gets.split.map(&:to_i)}
n.times do |i|
dp[i + 1] += dp[i] if 0 < i && i + 1 < N
lr.each do |l, r|
dp[i + l] = (dp[i + l] + dp[i]) % m if i + l < N
dp[i + r + 1] = (dp[i + r + 1] - dp[i]) if i + r + 1 < N
end
end
puts dp[-1] % mod
|
N, K = gets.split.map(&:to_i)
mod = 998244353
dp = Array.new(N, 0)
dp[0] = 1
lr = K.times.map {gets.split.map(&:to_i)}
N.times do |i|
dp[i + 1] += dp[i] if 0 < i && i + 1 < N
lr.each do |l, r|
dp[i + l] = (dp[i + l] + dp[i]) % mod if i + l < N
dp[i + r + 1] = (dp[i + r + 1] - dp[i]) if i + r + 1 < N
end
end
puts dp[-1] % mod
|
[
"assignment.value.change",
"call.arguments.change",
"identifier.change",
"expression.operation.binary.change"
] | 246,027
| 246,028
|
u244257825
|
ruby
|
p02550
|
N, X, M = gets.split.map(&:to_i)
as = Array.new(M, nil)
c = X
m = 0
i = 0
g = false
while true do
i += 1
m += c
if i == N then
g = true
puts m
break
end
if as[c] == nil then
as[c] = [i, m]
else
aa = as[c]
ro = i - aa[0]
rb = m - aa[1]
loc = (N - i) / ro
# pp [aa, i, m]
i += loc * ro
m += loc * rb
break
end
c = c * c % M
end
if i == N then
puts m
g = true
end
unless g then
while true do
# puts i
c = c * c % M
i += 1
m += c
if i == N then
puts m
break
end
end
end
|
N, X, M = gets.split.map(&:to_i)
as = Array.new(M, nil)
c = X
m = 0
i = 0
g = false
while true do
i += 1
m += c
if i == N then
g = true
puts m
break
end
if as[c] == nil then
as[c] = [i, m]
else
aa = as[c]
ro = i - aa[0]
rb = m - aa[1]
loc = (N - i) / ro
# pp [aa, i, m]
i += loc * ro
m += loc * rb
break
end
c = c * c % M
end
if !g && i == N then
puts m
g = true
end
if !g then
while true do
# puts i
c = c * c % M
i += 1
m += c
if i == N then
puts m
break
end
end
end
|
[
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 246,393
| 246,394
|
u990758634
|
ruby
|
p02552
|
n=gets.to=i
puts n==0 ? 1 : 0
|
n=gets.to_i
puts n==0 ? 1 : 0
|
[
"assignment.value.change",
"identifier.change"
] | 248,199
| 248,200
|
u744908753
|
ruby
|
p02553
|
eval'A,B,C,D='+`tr ' ' ,`
p [A*C,A*D,B*C,B*C].max
|
eval'A,B,C,D='+`tr ' ' ,`
p [A*C,A*D,B*C,B*D].max
|
[
"call.arguments.change"
] | 250,200
| 250,202
|
u657913472
|
ruby
|
p02553
|
a,b,c,d=gets.to_i
puts [a*c, a*d, b*c, b*d].max
|
a,b,c,d=gets.split.map(&:to_i)
puts [a*c, a*d, b*c, b*d].max
|
[
"assignment.value.change",
"identifier.change",
"call.add"
] | 250,208
| 250,210
|
u056944756
|
ruby
|
p02554
|
n = gets.chomp.to_i
MOD = 10 ** 9 + 7
puts (10 ** n - 9 ** n + 8 ** n) % MOD
|
n = gets.chomp.to_i
MOD = 10 ** 9 + 7
puts (10 ** n - 9 ** n - 9 ** n + 8 ** n) % MOD
|
[
"expression.operation.binary.add"
] | 250,796
| 250,797
|
u257668305
|
ruby
|
p02554
|
N = gets.chomp.to_i
waru = 10 ** 9 + 7
puts 10.pow(N, waru) - 2 * (9.pow(N, waru)) + 8.pow(N, waru)
|
N = gets.chomp.to_i
waru = 10 ** 9 + 7
puts (10.pow(N, waru) - 2 * (9.pow(N, waru)) + 8.pow(N, waru)) % waru
|
[
"call.arguments.change"
] | 250,970
| 250,971
|
u547155989
|
ruby
|
p02554
|
n = gets.to_i
if n <= 2
puts n * (n - 1)
return
end
puts (9 ** n - (8 ** n * 2 - 7 ** n)) % (10 ** 9 + 7)
|
n = gets.to_i
if n <= 2
puts n * (n - 1)
return
end
puts (10 ** n - (9 ** n * 2 - 8 ** n)) % (10 ** 9 + 7)
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 251,519
| 251,520
|
u771770008
|
ruby
|
p02554
|
N = gets.to_i
# $stdout = File.open(File::NULL, "w")
def main
max = 10 ** 9 + 7
all = 1
zero = 1
nine = 1
zn = 1
N.times.each do
all = all * 10 % max
zero = zero * 9 % max
nine = nine * 9 % max
zn = zn * 8 % max
end
return all - zero - nine + zn
end
STDOUT.puts main
|
N = gets.to_i
# $stdout = File.open(File::NULL, "w")
def main
max = 10 ** 9 + 7
all = 1
zero = 1
nine = 1
zn = 1
N.times.each do
all = all * 10 % max
zero = zero * 9 % max
nine = nine * 9 % max
zn = zn * 8 % max
end
return (all - zero - nine + zn) % max
end
STDOUT.puts main
|
[
"call.arguments.change",
"function.return_value.change"
] | 251,566
| 251,567
|
u447268473
|
ruby
|
p02554
|
n = gets.to_i
M = 1_000_000_007
if n == 1
p 0
else
p 10.pow(n, M) - 2 * 9.pow(n, M) + 8.pow(n, M)
end
|
n = gets.to_i
M = 1_000_000_007
if n == 1
p 0
else
p (10.pow(n, M) - 2 * 9.pow(n, M) + 8.pow(n, M)) % M
end
|
[
"call.arguments.change"
] | 252,205
| 252,206
|
u692254521
|
ruby
|
p02556
|
n = gets.to_i
a, b = n.times.map{gets.split.map(&:to_i)}.transpose
max_ab = 0
min_ab = 100000000000
max_a_b = 0
min_a_b = 100000000000
n.times do |i|
max_ab = [max_ab,a[i]+b[i]].max
min_ab = [min_ab,a[i]+b[i]].min
max_a_b = [max_a_b,a[i]-b[i]].max
min_a_b = [min_a_b,a[i]-b[i]].min
end
puts [max_ab-min_ab,max_a_b-min_a_b].max
|
n = gets.to_i
a, b = n.times.map{gets.split.map(&:to_i)}.transpose
max_ab = -100000000000
min_ab = 100000000000
max_a_b = -100000000000
min_a_b = 100000000000
n.times do |i|
max_ab = [max_ab,a[i]+b[i]].max
min_ab = [min_ab,a[i]+b[i]].min
max_a_b = [max_a_b,a[i]-b[i]].max
min_a_b = [min_a_b,a[i]-b[i]].min
end
puts [max_ab-min_ab,max_a_b-min_a_b].max
|
[
"assignment.value.change",
"expression.operation.unary.add"
] | 253,599
| 253,600
|
u265679940
|
ruby
|
p02556
|
n = gets.to_i
a, b = n.times.map{gets.split.map(&:to_i)}.transpose
max_ab = 0
min_ab = 10000000000
max_a_b = 0
min_a_b = 10000000000
n.times do |i|
max_ab = [max_ab,a[i]+b[i]].max
min_ab = [min_ab,a[i]+b[i]].min
max_a_b = [max_a_b,a[i]-b[i]].max
min_a_b = [min_a_b,a[i]-b[i]].min
end
puts [max_ab-min_ab,max_a_b-min_a_b].max
|
n = gets.to_i
a, b = n.times.map{gets.split.map(&:to_i)}.transpose
max_ab = -100000000000
min_ab = 100000000000
max_a_b = -100000000000
min_a_b = 100000000000
n.times do |i|
max_ab = [max_ab,a[i]+b[i]].max
min_ab = [min_ab,a[i]+b[i]].min
max_a_b = [max_a_b,a[i]-b[i]].max
min_a_b = [min_a_b,a[i]-b[i]].min
end
puts [max_ab-min_ab,max_a_b-min_a_b].max
|
[
"assignment.value.change",
"expression.operation.unary.add",
"literal.number.integer.change"
] | 253,601
| 253,600
|
u265679940
|
ruby
|
p02570
|
d,t,s = gets.chomp.split(' ').map(&:to_i)
p t * s >= d ? 'Yes' : 'No'
|
d,t,s = gets.chomp.split(' ').map(&:to_i)
puts t * s >= d ? 'Yes' : 'No'
|
[
"call.function.change",
"io.output.change"
] | 255,613
| 255,614
|
u081954647
|
ruby
|
p02570
|
d,t,s = gets.split(" ").map(&:to_i)
if d >= t * s
puts "No"
else
puts "Yes"
end
|
d,t,s = gets.split(" ").map(&:to_i)
if d > t * s
puts "No"
else
puts "Yes"
end
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 255,760
| 255,761
|
u306198828
|
ruby
|
p02570
|
D, T, S = gets.split.map(&:to_i)
puts (D / S) <= T ? 'Yes' : 'No'
|
D, T, S = gets.split.map(&:to_i)
puts D <= T * S ? 'Yes' : 'No'
|
[
"control_flow.branch.if.condition.change"
] | 255,900
| 255,901
|
u326562452
|
ruby
|
p02570
|
d, t, s = gets.split.map &:to_i
puts s*t > d ? :Yes: :No
|
d, t, s = gets.split.map &:to_i
puts s*t >= d ? :Yes: :No
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 256,444
| 256,445
|
u489339677
|
ruby
|
p02570
|
a = gets.split(" ")
d = a[0].to_i
t = a[1].to_i
s = a[2].to_i
puts (s);
puts( (s * t >= d) ? "Yes" : "No")
|
a = gets.split(" ")
d = a[0].to_i
t = a[1].to_i
s = a[2].to_i
puts( ((s * t) >= d) ? "Yes" : "No")
|
[
"io.output.change",
"call.remove",
"control_flow.branch.if.condition.change"
] | 256,855
| 256,856
|
u624520031
|
ruby
|
p02570
|
d, t, s = gets.split.map(&:to_f)
puts t <= d/s ? "Yes" : "No"
|
d, t, s = gets.split.map(&:to_f)
puts t >= d/s ? "Yes" : "No"
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 256,907
| 256,908
|
u358554431
|
ruby
|
p02570
|
d, t, s = gets.split.map(&:to_i)
time = (d/s).to_f
if t >= time.to_f
puts "Yes"
else
puts "No"
end
|
d, t, s = gets.split.map(&:to_i)
time = d/s.to_f
if t >= time.to_f
puts "Yes"
else
puts "No"
end
|
[] | 256,909
| 256,910
|
u626831469
|
ruby
|
p02570
|
d, t, s = gets.split.map(&:to_i)
time = (d/s).to_f
if t >= time
puts "Yes"
else
puts "No"
end
|
d, t, s = gets.split.map(&:to_i)
time = d/s.to_f
if t >= time.to_f
puts "Yes"
else
puts "No"
end
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 256,911
| 256,910
|
u626831469
|
ruby
|
p02570
|
d,t,s = gets.chomp.split.map(&:to_i)
if d >= (s*t)
puts 'Yes'
else
puts 'No'
end
|
d,t,s = gets.chomp.split.map(&:to_i)
if d <= (s*t)
puts 'Yes'
else
puts 'No'
end
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 257,498
| 257,499
|
u347258208
|
ruby
|
p02570
|
d, t, s = gets.chomp.split(" ").map{|num| num = num.to_i}
print d <= t * s ? "YES" : "NO"
|
d, t, s = gets.chomp.split(" ").map{|num| num = num.to_i}
print d <= t * s ? "Yes" : "No"
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 257,930
| 257,931
|
u923387164
|
ruby
|
p02570
|
d, t, s = gets.chomp.split(" ").map{|num| num = num.to_i}
return d <= t * s ? "YES" : "NO"
|
d, t, s = gets.chomp.split(" ").map{|num| num = num.to_i}
print d <= t * s ? "Yes" : "No"
|
[
"function.return_value.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 257,932
| 257,931
|
u923387164
|
ruby
|
p02570
|
D, T, S = gets.split.map(&:to_i)
puts D/S <= T ? 'Yes' : 'No'
|
D, T, S = gets.split.map(&:to_i)
puts Rational(D,S) <= T ? 'Yes' : 'No'
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 257,950
| 257,951
|
u326440422
|
ruby
|
p02570
|
d,t,s=gets.split.map(&:to_i)
if d/s<=t
puts "Yes"
else
puts "No"
end
|
d,t,s=gets.split.map(&:to_f)
v=d/s
if v<=t
puts "Yes"
else
puts "No"
end
|
[
"assignment.value.change",
"call.arguments.change",
"assignment.variable.change"
] | 258,570
| 258,571
|
u590472228
|
ruby
|
p02570
|
d, t, s = gets.chomp.split.map(&:to_i)
ans = d/s <= t ? 'Yes' : 'No'
puts ans
|
d, t, s = gets.chomp.split.map(&:to_i)
ans = d/s.to_f <= t ? 'Yes' : 'No'
puts ans
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 258,615
| 258,616
|
u449004312
|
ruby
|
p02570
|
d,t,s=gets.split.map &:to_i
puts d/s<=t ? "Yes" : "No"
|
d,t,s=gets.split.map &:to_i
puts d/s.to_f<=t ? "Yes" : "No"
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 258,654
| 258,655
|
u128694188
|
ruby
|
p02570
|
d,t,s = gets.split.map(&:to_i)
if d / s.to_f <= s
puts 'Yes'
else
puts 'No'
end
|
d,t,s = gets.split.map(&:to_i)
if d / s.to_f <= t
puts 'Yes'
else
puts 'No'
end
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 259,023
| 259,024
|
u895926909
|
ruby
|
p02570
|
a, b, c = gets.split.map(&:to_i)
d = a / c
puts d <= b ? "Yes" : "No"
|
a, b, c = gets.split.map(&:to_f)
d = a / c
puts d <= b ? "Yes" : "No"
|
[
"assignment.value.change",
"call.arguments.change"
] | 259,145
| 259,146
|
u684458716
|
ruby
|
p02570
|
D, T, S = gets.chop.split.map(&:to_f)
if(D/S>T)
puts 'Yes'
else
puts 'No'
end
|
D, T, S = gets.chop.split.map(&:to_f)
if(D/S<=T)
puts 'Yes'
else
puts 'No'
end
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 259,243
| 259,244
|
u281982182
|
ruby
|
p02570
|
d,t,s = gets.split.map(&:to_i)
puts d/s <= t ? "Yes" : "No"
|
d,t,s = gets.split.map(&:to_i)
puts d/s.to_f <= t ? "Yes" : "No"
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 259,279
| 259,280
|
u244257825
|
ruby
|
p02570
|
d,t,s = gets.split.map(&:to_i)
puts d/s.to_f <= s ? "Yes" : "No"
|
d,t,s = gets.split.map(&:to_i)
puts d/s.to_f <= t ? "Yes" : "No"
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 259,281
| 259,280
|
u244257825
|
ruby
|
p02570
|
d, t, s = gets.split.map(&:to_i)
puts d / s <= t ? "Yes" : "No"
|
d, t, s = gets.split.map(&:to_i)
puts d.to_f / s <= t ? "Yes" : "No"
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 259,290
| 259,291
|
u658910570
|
ruby
|
p02570
|
D,T,S = gets.split.map(&:to_i)
puts (D/S <= T ? "Yes" : "No")
|
D,T,S = gets.split.map(&:to_i)
puts (D <= S*T ? "Yes" : "No")
|
[
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 259,369
| 259,370
|
u616360029
|
ruby
|
p02571
|
s = gets.strip
t = gets.strip
result = t.length
0.upto(s.length - t.length).times do |start|
c = 0
t.length.times do |i|
c += 1 if t[i] != s[start+i]
end
result = [c, result].min
end
p result
|
s = gets.strip
t = gets.strip
result = t.length
0.upto(s.length - t.length) do |start|
c = 0
t.length.times do |i|
c += 1 if t[i] != s[start+i]
end
result = [c, result].min
end
p result
|
[
"call.remove"
] | 260,973
| 260,974
|
u458429268
|
ruby
|
p02571
|
S, T = readlines.map(&:chomp)
ss, ts = S.split(''), T.split('')
sl, tl = S.length, T.length
puts (0 ... sl - tl).map{|i| ss[i, tl].zip(ts).count{_1 != _2}}.min
|
S, T = readlines.map(&:chomp)
ss, ts = S.split(''), T.split('')
sl, tl = S.length, T.length
puts (0 .. sl - tl).map{|i| ss[i, tl].zip(ts).count{_1 != _2}}.min
|
[
"call.arguments.change"
] | 261,260
| 261,261
|
u304198114
|
ruby
|
p02571
|
s=gets.chomp.split("").map(&:to_s)
v=gets.chomp.split("").map(&:to_s)
count=Array.new(v.length){0}
for i in 0..(s.length-v.length-1)
vv=s[i..i+v.length]
check=0
for j in 0..vv.length-1
if vv[j]==v[j]
check+=1
end
end
count[i]=check
end
p v.length-count.max
|
s=gets.chomp.split("").map(&:to_s)
v=gets.chomp.split("").map(&:to_s)
count=Array.new(v.length){0}
for i in 0..(s.length-v.length)
vv=s[i..i+v.length-1]
check=0
for j in 0..vv.length-1
if vv[j]==v[j]
check+=1
end
end
count[i]=check
end
p v.length-count.max
|
[
"expression.operation.binary.remove"
] | 261,425
| 261,426
|
u590472228
|
ruby
|
p02571
|
s = gets.chomp
t = gets.chomp
delta = s.length - t.length
ans = 9999
def difference(s, t)
tmp = 0
s.length.times do |i|
tmp += 1 if s[i] != t[i]
end
return tmp
end
delta.times do |i|
tmp = difference(s[i..(i+t.length - 1)], t)
ans = [ans, tmp].min
end
puts ans
|
s = gets.chomp
t = gets.chomp
delta = s.length - t.length
ans = 9999
def difference(s, t)
tmp = 0
s.length.times do |i|
tmp += 1 if s[i] != t[i]
end
return tmp
end
(delta+1).times do |i|
tmp = difference(s[i..(i+t.length - 1)], t)
ans = [ans, tmp].min
end
puts ans
|
[] | 261,454
| 261,455
|
u358554431
|
ruby
|
p02571
|
s, t = readlines.map(&:chomp)
kekka = t.size
schar = s.chars
tchar = t.chars
(s.size - t.size).times do |i|
diff = 0
tchar.each_with_index do |str, j|
diff += 1 if str != schar[j+i]
end
kekka = [kekka, diff].min
end
p kekka
|
s, t = readlines.map(&:chomp)
kekka = t.size
schar = s.chars
tchar = t.chars
((s.size + 1) - t.size).times do |i|
diff = 0
tchar.each_with_index do |str, j|
diff += 1 if str != schar[j+i]
end
kekka = [kekka, diff].min
end
p kekka
|
[] | 261,510
| 261,511
|
u677555714
|
ruby
|
p02571
|
s = gets.strip
t = gets.strip
sl = s.length
tl = t.length
sc = s.chars
tc = t.chars
max = 0
(sl - tl).times do |i|
a = 0
tl.times do |j|
a += 1 if sc[i + j] == tc[j]
end
max = a if max < a
end
puts tl - max
|
s = gets.strip
t = gets.strip
sl = s.length
tl = t.length
sc = s.chars
tc = t.chars
max = 0
(sl - tl + 1).times do |i|
a = 0
tl.times do |j|
a += 1 if sc[i + j] == tc[j]
end
max = a if max < a
end
puts tl - max
|
[
"expression.operation.binary.add"
] | 261,674
| 261,675
|
u462852807
|
ruby
|
p02571
|
s = gets.chomp
t = gets.chomp
ans = 10 ** 20
m = s.size
n = t.size
(0..m-n+1).each do |i|
tmp = 0
(0..n-1).each do |j|
if s[i..i+n-1][j] != t[j]
tmp += 1
end
end
ans = [ans, tmp].min
end
puts ans
|
s = gets.chomp
t = gets.chomp
ans = 10 ** 20
m = s.size
n = t.size
(0..m-n).each do |i|
tmp = 0
(0..n-1).each do |j|
if s[i..i+n-1][j] != t[j]
tmp += 1
end
end
ans = [ans, tmp].min
end
puts ans
|
[
"expression.operation.binary.remove"
] | 261,686
| 261,687
|
u729246375
|
ruby
|
p02571
|
S = gets.chomp
T = gets.chomp
len_s = S.length
len_t = T.length
same = 0
0.upto(len_s - len_t - 1){ |i|
tmp_same = 0
T.length.times{ |j|
if S[i+j] == T[j]
tmp_same += 1
end
}
if tmp_same > same
same = tmp_same
end
}
puts (len_t - same)
|
S = gets.chomp
T = gets.chomp
len_s = S.length
len_t = T.length
same = 0
0.upto(len_s - len_t){ |i|
tmp_same = 0
T.length.times{ |j|
if S[i+j] == T[j]
tmp_same += 1
end
}
if tmp_same > same
same = tmp_same
end
}
puts (len_t - same)
|
[
"expression.operation.binary.remove"
] | 262,061
| 262,062
|
u810064020
|
ruby
|
p02571
|
s = gets.chomp.split("")
t = gets.chomp.split("")
result=[]
(s.length - t.length).times do |i|
a = 0
t.length.times do |j|
unless t[j] == s[i+j]
a += 1
end
end
result << a
end
p result.min
|
s = gets.chomp.split("")
t = gets.chomp.split("")
result=[]
(s.length - t.length + 1).times do |i|
a = 0
t.length.times do |j|
unless t[j] == s[i+j]
a += 1
end
end
result << a
end
p result.min
|
[
"expression.operation.binary.add"
] | 262,078
| 262,079
|
u190378842
|
ruby
|
p02571
|
s = gets.chomp.split("").map(&:to_s);
t = gets.chomp.split("").map(&:to_s);
n = (s.length) - (t.length)+1
time=Array.new(n+1,0)
for i in 0..n do
for j in 0..(t.length-1) do
if s[i+j] == t[j] then
time[i]+=1
end
end
end
p (t.length) - time.max
|
s = gets.chomp.split("").map(&:to_s);
t = gets.chomp.split("").map(&:to_s);
n = (s.length) - (t.length)+1
time=Array.new(n,0)
for i in 0..n-1 do
for j in 0..(t.length-1) do
if s[i+j] == t[j] then
time[i]+=1
end
end
end
p (t.length) - time.max
|
[
"expression.operation.binary.remove"
] | 262,223
| 262,224
|
u663882298
|
ruby
|
p02570
|
#n= gets.to_i
d,t,s = gets.split(" ").map(&:to_i)
puts d / s <= t ? "Yes" : "No"
|
#n= gets.to_i
d,t,s = gets.split(" ").map(&:to_f)
puts d / s <= t ? "Yes" : "No"
|
[
"assignment.value.change",
"call.arguments.change"
] | 262,629
| 262,628
|
u217358301
|
ruby
|
p02570
|
d,t,s = gets.split.map(&:to_i)
puts (d / s).to_f - t <= 0 ? "Yes" : "No"
|
d,t,s = gets.split.map(&:to_i)
puts (d / s.to_f) - t <= 0 ? "Yes" : "No"
|
[
"control_flow.branch.if.condition.change"
] | 262,708
| 262,709
|
u966810027
|
ruby
|
p02570
|
d,t,s = gets.split.map(&:to_i)
puts d / s - t <= 0 ? "Yes" : "No"
|
d,t,s = gets.split.map(&:to_i)
puts (d / s.to_f) - t <= 0 ? "Yes" : "No"
|
[
"control_flow.branch.if.condition.change"
] | 262,710
| 262,709
|
u966810027
|
ruby
|
p02571
|
S = gets
T = gets
max = 0
(0..(S.size - T.size)).each do |n|
str = S[n..(T.size-1 + n)]
same_count = str.split("").filter.with_index do |s, i|
s == T[i]
end.size
max = same_count if max < same_count
end
puts T.size - max
|
S = gets.chomp
T = gets.chomp
max = 0
(0..(S.size - T.size)).each do |n|
str = S[n..(T.size-1 + n)]
same_count = str.split("").filter.with_index do |s, i|
s == T[i]
end.size
max = same_count if max < same_count
end
puts T.size - max
|
[
"call.add"
] | 262,810
| 262,811
|
u326440422
|
ruby
|
p02571
|
S = gets.chomp
T = gets.chomp
m = T.size
(0 .. S.size - T.size).each do |i|
c = 0
(0..T.size).each do |j|
if T[j]!=S[i+j]
c += 1
break if c > m
end
end
m = c if c < m
end
puts m
|
S = gets.chomp
T = gets.chomp
m = T.size
(0 .. S.size - T.size).each do |i|
c = 0
(0...T.size).each do |j|
if T[j]!=S[i+j]
c += 1
break if c > m
end
end
m = c if c < m
end
puts m
|
[] | 263,153
| 263,154
|
u901068031
|
ruby
|
p02571
|
s = gets.chomp.split("")
t = gets.chomp.split("")
maxfit = []
s.length.times do |si|
tempcnt = 0
break if s.length < si+1 + t.length
t.length.times do |ti|
break if si >= s.length
if s[si] == t[ti]
tempcnt += 1
end
si += 1
end
maxfit.push(tempcnt)
end
p t.length - maxfit.max
|
s = gets.chomp.split("")
t = gets.chomp.split("")
maxfit = [0]
s.length.times do |si|
tempcnt = 0
break if s.length < si + t.length
t.length.times do |ti|
break if si >= s.length
if s[si] == t[ti]
tempcnt += 1
end
si += 1
end
maxfit.push(tempcnt)
end
p t.length - maxfit.max
|
[
"expression.operation.binary.remove"
] | 263,206
| 263,207
|
u644533034
|
ruby
|
p02571
|
S = gets.chomp
T = gets.chomp
t = T.chars
SZ = t.size
ans = 1000
S.size.times do |i|
cnt = SZ - t.each_with_index.count {|c,j| c == S[i+j] }
ans = cnt if cnt < ans
end
puts ans
|
S = gets.chomp
T = gets.chomp
t = T.chars
SZ = t.size
ans = 1000
(S.size-SZ+1).times do |i|
cnt = SZ - t.each_with_index.count {|c,j| c == S[i+j] }
ans = cnt if cnt < ans
end
puts ans
|
[] | 263,371
| 263,372
|
u064100484
|
ruby
|
p02571
|
s = gets.chomp.split('')
t = gets.chomp.split('')
motosize = t.size
max = 0
def hoge(a, b)
count = 0
for i in 0...(a.size) do
count += 1 if (a[i] == b[i])
end
count
end
for i in 0...(s.size - t.size) do
tmp = hoge(s[i..(i+t.size)], t)
if (tmp > max)
max = tmp
end
end
puts motosize - max
|
s = gets.chomp.split('')
t = gets.chomp.split('')
motosize = t.size
max = 0
def hoge(a, b)
count = 0
for i in 0...(a.size) do
count += 1 if (a[i] == b[i])
end
count
end
for i in 0..(s.size - t.size) do
tmp = hoge(s[i...(i+t.size)], t)
if (tmp > max)
max = tmp
end
end
puts motosize - max
|
[
"call.arguments.change"
] | 263,824
| 263,825
|
u546441021
|
ruby
|
p02571
|
S = gets
T = gets
ns = S.length
nt = T.length
n_try = ns - nt + 1
i = 0
mm = 0
n_try.times do
j = 0
m = 0
nt.times do
if S[i+j] == T[j]
m+=1
end
j += 1
end
if m > mm
mm = m
end
i += 1
end
puts nt - mm
|
S = gets.strip
T = gets.strip
ns = S.length
nt = T.length
n_try = ns - nt + 1
i = 0
mm = 0
n_try.times do
j = 0
m = 0
nt.times do
if S[i+j] == T[j]
m+=1
end
j += 1
end
if m > mm
mm = m
end
i += 1
end
puts nt - mm
|
[
"call.add"
] | 264,417
| 264,418
|
u979684411
|
ruby
|
p02571
|
S,T = $<.read.split
m = N = T.size
(S.size-m).times {|i|
n = 0
N.times {|j| n+=1 if S[i+j]!=T[j]; break if n>=m }
m > n && m = n
}
p m
|
S,T = $<.read.split
m = N = T.size
(S.size-m+1).times {|i|
n = 0
N.times {|j| n+=1 if S[i+j]!=T[j]; break if n>=m }
m > n && m = n
}
p m
|
[
"expression.operation.binary.add"
] | 264,559
| 264,560
|
u720281401
|
ruby
|
p02571
|
s = gets.chop
t = gets.chop
d = t.length
(s.length - t.length).times do |idx|
count = 0
s[idx, t.length].chars.each.with_index do |c, cidx|
count += 1 if c != t[cidx]
end
d = [d, count].min
end
puts d
|
s = gets.chop
t = gets.chop
d = t.length
(s.length - t.length + 1).times do |idx|
count = 0
s[idx, t.length].chars.each.with_index do |c, cidx|
count += 1 if c != t[cidx]
end
d = [d, count].min
end
puts d
|
[
"expression.operation.binary.add"
] | 265,177
| 265,178
|
u604352408
|
ruby
|
p02571
|
S = gets.chomp
T = gets.chomp
# $stdout = File.open(File::NULL, "w")
def main
t = S.length - T.length - 1
min = S.length
t.times.each do |s|
count = 0
T.chars.each.with_index do |c, i|
if S[s + i] != c
count += 1
end
end
if count < min
min = count
end
end
return min
end
STDOUT.puts main
|
S = gets.chomp
T = gets.chomp
# $stdout = File.open(File::NULL, "w")
def main
t = S.length - T.length + 1
min = S.length
t.times.each do |s|
count = 0
T.chars.each.with_index do |c, i|
if S[s + i] != c
count += 1
end
end
if count < min
min = count
end
end
return min
end
STDOUT.puts main
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 265,473
| 265,474
|
u447268473
|
ruby
|
p02571
|
s = gets.chomp.split("")
t = gets.chomp.split("")
n = s.size
m = t.size
ans = 114514
(n-m).times do |i|
c = 0
m.times do |j|
c += 1 if s[i+j] != t[j]
end
ans = ans > c ? c : ans
end
puts ans
|
s = gets.chomp.split("")
t = gets.chomp.split("")
n = s.size
m = t.size
ans = 114514
(n-m+1).times do |i|
c = 0
m.times do |j|
c += 1 if s[i+j] != t[j]
end
ans = ans > c ? c : ans
end
puts ans
|
[
"expression.operation.binary.add"
] | 265,718
| 265,719
|
u466332671
|
ruby
|
p02572
|
n = gets.chomp.to_i
arr = gets.chomp.split.map(&:to_i)
bigmod = 10 ** 9 + 7
sum = arr[0] + arr[1]
mod = arr[0] * arr[1]
2.upto(arr.length-1) do |i|
mod += sum * arr[i]
mod %= bigmod
sum += arr[i]
end
puts mod
|
n = gets.chomp.to_i
arr = gets.chomp.split.map(&:to_i)
bigmod = 10 ** 9 + 7
sum = arr[0] + arr[1]
mod = arr[0] * arr[1]
mod %= bigmod
2.upto(arr.length-1) do |i|
mod += sum * arr[i]
mod %= bigmod
sum += arr[i]
end
puts mod
|
[] | 266,807
| 266,808
|
u409390792
|
ruby
|
p02572
|
mod = 1e9 + 7
n = gets.chomp.to_i
arr = gets.chomp.split(' ').map(&:to_i)
sum = arr.inject(:+) % mod
res = 0
n.times do |i|
sum -= arr[i]
res += arr[i] * sum
res %= mod
end
puts res.to_i
|
mod = (1e9 + 7).to_i
n = gets.chomp.to_i
arr = gets.chomp.split(' ').map(&:to_i)
sum = arr.inject(:+) % mod
res = 0
n.times do |i|
sum -= arr[i]
res += arr[i] * sum
res %= mod
end
puts res.to_i
|
[
"call.add"
] | 267,317
| 267,318
|
u857510905
|
ruby
|
p02572
|
mod = 1_000_000_007
gets
a = gets.split.map &:to_i
tmp0 = a.sum ** 2
tmp1 = a.sum { |e| e ** 2 }
puts (tmp0 - tmp1) % mod
|
mod = 1_000_000_007
gets
a = gets.split.map &:to_i
tmp0 = a.sum ** 2
tmp1 = a.sum { |e| e ** 2 }
puts (tmp0 - tmp1) / 2 % mod
# tmp0 = a.sum
# tmp0 = ((tmp0 % mod) ** 2) % mod
# tmp1 = a.sum { |e| e ** 2 }
# tmp1 %= mod
# ans = tmp0 < tmp1 ? tmp0 - tmp1 + mod : tmp0 - tmp1
# if ans.odd?
# puts (ans + mod) / 2
# else
# puts ans / 2
# end
|
[
"expression.operation.binary.add"
] | 267,608
| 267,609
|
u534249406
|
ruby
|
p02572
|
N = gets.to_i
As = gets.split.map &:to_i
MOD = 10**9 + 7
sums = []
As.reverse.each do |a|
sums << ((sums.last || 0) + a) % MOD
end
sums.reverse!
p sums
ans = 0
(N-1).times do |i|
ans += (As[i] * sums[i+1]) % MOD
ans %= MOD
end
p ans
|
N = gets.to_i
As = gets.split.map &:to_i
MOD = 10**9 + 7
sums = []
As.reverse.each do |a|
sums << ((sums.last || 0) + a) % MOD
end
sums.reverse!
ans = 0
(N-1).times do |i|
ans += (As[i] * sums[i+1]) % MOD
ans %= MOD
end
p ans
|
[
"call.remove"
] | 268,337
| 268,338
|
u009976559
|
ruby
|
p02573
|
N,M,*P = $<.read.split.map &:to_i
A = [[]]*(N+1)
m = 0
M.times {|i|
r,a = [],P[i+i,2]
x,y = a.map {|i;j| (r<< i; i=j) while (j=A[i])[0]; r<< i; i}.sort
g,h = [A[x],A[y]].map{|h| h.empty? ? a.to_h{[_1,0]} : h}.sort_by{_1.size}
h.merge! g if h.object_id != g.object_id
r.each {A[_1] = y}
A[y] = h
m < h.size && m = h.size
}
p m
|
N,M,*P = $<.read.split.map &:to_i
A = [[]]*(N+1)
m = 1
M.times {|i|
r,a = [],P[i+i,2]
x,y = a.map {|i;j| (r<< i; i=j) while (j=A[i])[0]; r<< i; i}.sort
g,h = [A[x],A[y]].map{|h| h.empty? ? a.to_h{[_1,0]} : h}.sort_by{_1.size}
h.merge! g if h.object_id != g.object_id
r.each {A[_1] = y}
A[y] = h
m < h.size && m = h.size
}
p m
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 269,104
| 269,105
|
u720281401
|
ruby
|
p02573
|
N,M,*P = $<.read.split.map &:to_i
C = [1]*(N+1)
A = C.map {[]}
m = 0
(0...M).map {|i| a=P[i+=i]; b=P[i+1]; a<b ? [a,b] : [b,a]}.sort.each{|a,b| A[a] << b}
1.upto(N) {|i|
a = A[j=i]
a.each {k = A[_1][-1]||_1; j<k && j=k}
next if j == i
a.each {b=A[_1]; b << j if b[-1]!=j}
m < C[j]+=C[i] and m = C[j]
}
p m
|
N,M,*P = $<.read.split.map &:to_i
C = [m=1]*(N+1)
A = C.map {[]}
(0...M).map {|i| a=P[i+=i]; b=P[i+1]; a<b ? [a,b] : [b,a]}.sort.each{|a,b| A[a] << b}
1.upto(N) {|i|
a = A[j=i]
a.each {k = A[_1][-1]||_1; j<k && j=k}
next if j == i
a.each {b=A[_1]; b << j if b[-1]!=j}
m < C[j]+=C[i] and m = C[j]
}
p m
|
[
"assignment.add",
"assignment.remove"
] | 269,106
| 269,107
|
u720281401
|
ruby
|
p02573
|
n, m = gets.split.map(&:to_i)
relations = []
m.times do
relations << gets.split.map(&:to_i)
end
graph = Array.new(n) { [] }
relations.each do |a, b|
graph[a - 1] << b - 1
graph[b - 1] << a - 1
end
groups = []
0.upto(n - 1) do |leader|
next if groups[leader]
queue = [leader]
until queue.empty?
current = queue.shift
next if groups[current]
graph[current].each do |friend|
next if groups[friend]
groups[friend] = leader
queue << friend
end
groups[current] = leader
end
end
puts groups.tally.values.max
|
n, m = gets.split.map(&:to_i)
relations = []
m.times do
relations << gets.split.map(&:to_i)
end
graph = Array.new(n) { [] }
relations.each do |a, b|
graph[a - 1] << b - 1
graph[b - 1] << a - 1
end
groups = []
0.upto(n - 1) do |leader|
next if groups[leader]
queue = [leader]
until queue.empty?
current = queue.shift
next if groups[current]
graph[current].each do |friend|
next if groups[friend]
queue << friend
end
groups[current] = leader
end
end
puts groups.tally.values.max
|
[
"assignment.remove"
] | 269,307
| 269,308
|
u623402808
|
ruby
|
p02574
|
n = $stdin.readline.to_i
a = $stdin.readline.chomp.split.map(&:to_i)
m = 10 ** 6
d = Array.new(m + 1)
2.step(m) do |i|
next if !d[i].nil?
d[i] = i
(m / i).times do |j|
k = (j + 1) * i
next if !d[k].nil?
d[k] = i
end
end
g = a[0]
pc = true
h = Hash.new(true)
n.times do |i|
g = g.gcd(a[i])
x = a[i]
q = []
while pc && x > 1
if h[d[x]]
pc = false
break
end
q << d[x]
x /= d[x]
end
q.uniq.each do |y|
h[y] = true
end
end
if pc
puts "pairwise coprime"
elsif g == 1
puts "setwise coprime"
else
puts "not coprime"
end
|
n = $stdin.readline.to_i
a = $stdin.readline.chomp.split.map(&:to_i)
m = 10 ** 6
d = Array.new(m + 1)
2.step(m) do |i|
next if !d[i].nil?
d[i] = i
(m / i).times do |j|
k = (j + 1) * i
next if !d[k].nil?
d[k] = i
end
end
g = a[0]
pc = true
h = Hash.new(false)
n.times do |i|
g = g.gcd(a[i])
x = a[i]
q = []
while pc && x > 1
if h[d[x]]
pc = false
break
end
q << d[x]
x /= d[x]
end
q.uniq.each do |y|
h[y] = true
end
end
if pc
puts "pairwise coprime"
elsif g == 1
puts "setwise coprime"
else
puts "not coprime"
end
|
[
"misc.opposites",
"assignment.value.change",
"call.arguments.change"
] | 269,927
| 269,928
|
u482840940
|
ruby
|
p02574
|
n = $stdin.readline.to_i
a = $stdin.readline.chomp.split.map(&:to_i)
m = 10 ** 6
d = Array.new(m + 1)
2.step(m) do |i|
next if !d[i].nil?
d[i] = i
(m / i).times do |j|
k = (j + 1) * i
next if !d[k].nil?
d[k] = i
end
end
g = a[0]
pc = true
h = Hash.new(true)
n.times do |i|
g = g.gcd(a[i])
x = a[i]
q = []
while pc && x > 1
if h[d[x]] > 0
pc = false
break
end
q << d[x]
x /= d[x]
end
q.uniq.each do |y|
h[y] = true
end
end
if pc
puts "pairwise coprime"
elsif g == 1
puts "setwise coprime"
else
puts "not coprime"
end
|
n = $stdin.readline.to_i
a = $stdin.readline.chomp.split.map(&:to_i)
m = 10 ** 6
d = Array.new(m + 1)
2.step(m) do |i|
next if !d[i].nil?
d[i] = i
(m / i).times do |j|
k = (j + 1) * i
next if !d[k].nil?
d[k] = i
end
end
g = a[0]
pc = true
h = Hash.new(false)
n.times do |i|
g = g.gcd(a[i])
x = a[i]
q = []
while pc && x > 1
if h[d[x]]
pc = false
break
end
q << d[x]
x /= d[x]
end
q.uniq.each do |y|
h[y] = true
end
end
if pc
puts "pairwise coprime"
elsif g == 1
puts "setwise coprime"
else
puts "not coprime"
end
|
[
"misc.opposites",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.remove"
] | 269,929
| 269,928
|
u482840940
|
ruby
|
p02574
|
_n = gets.to_i
a = gets.split.map(&:to_i)
max = a.max
sieve = Array.new(max + 1) { |i| i }
prime_division = Array.new(max + 1)
2.upto(Math.sqrt(max).to_i) do |i|
(max / i).times do |j|
sieve[i * (j + 1)] = i if i < sieve[i * (j + 1)]
end
end
2.upto(max) do |i|
h = Hash.new(0)
j = i
while j != 1
h[sieve[j]] += 1
j /= sieve[j]
end
prime_division[i] = h
end
h = {}
a.each do |e|
prime_division[e].each_key do
if h[_1]
puts a.inject(:gcd) == 1 ? 'setwise coprime' : 'not coprime'
exit
end
h[_1] = 1
end
end
puts 'pairwise coprime'
|
_n = gets.to_i
a = gets.split.map(&:to_i)
max = a.max
sieve = Array.new(max + 1) { |i| i }
prime_division = Array.new(max + 1)
2.upto(Math.sqrt(max).to_i) do |i|
(max / i).times do |j|
sieve[i * (j + 1)] = i if i < sieve[i * (j + 1)]
end
end
2.upto(max) do |i|
h = Hash.new(0)
j = i
while j != 1
h[sieve[j]] += 1
j /= sieve[j]
end
prime_division[i] = h
end
h = {}
a.each do |e|
next if e == 1
prime_division[e].each_key do
if h[_1]
puts a.inject(:gcd) == 1 ? 'setwise coprime' : 'not coprime'
exit
end
h[_1] = 1
end
end
puts 'pairwise coprime'
|
[] | 269,950
| 269,951
|
u104886851
|
ruby
|
p02574
|
N=gets.to_i
array=gets.chomp.split(" ").map(&:to_i)
maxim=array.max
ARRAY=Array.new(maxim+1, 0)
array.each do |a|
ARRAY[a]=1
end
setwise=false
c=2
while c<=maxim do
count=0
n=c
while n<=maxim do
count+=ARRAY[n]
n+=c
end
if count == N
puts "not coprime"
exit
end
if count > 1
setwise=true
end
c+=1
end
if setwise
puts "setwise coprime"
else
puts "pairwise coprime"
end
|
N=gets.to_i
array=gets.chomp.split(" ").map(&:to_i)
maxim=array.max
ARRAY=Array.new(maxim+1, 0)
array.each do |a|
ARRAY[a]+=1
end
setwise=false
c=2
while c<=maxim do
count=0
n=c
while n<=maxim do
count+=ARRAY[n]
n+=c
end
if count == N
puts "not coprime"
exit
end
if count > 1
setwise=true
end
c+=1
end
if setwise
puts "setwise coprime"
else
puts "pairwise coprime"
end
|
[
"assignment.value.change"
] | 270,295
| 270,296
|
u058568575
|
ruby
|
p02574
|
N=gets.to_i
array=gets.chomp.split(" ").map(&:to_i)
maxim=array.max
ARRAY=Array.new(maxim+1, false)
array.each do |a|
ARRAY[a]=true
end
setwise=false
c=2
while c<=maxim do
count=0
n=c
while n<=maxim do
count+=1 if ARRAY[n]
n+=c
end
if count == N
puts "not coprime"
exit
end
if count > 1
setwise=true
end
c+=1
end
if setwise
puts "setwise coprime"
else
puts "pairwise coprime"
end
|
N=gets.to_i
array=gets.chomp.split(" ").map(&:to_i)
maxim=array.max
ARRAY=Array.new(maxim+1, 0)
array.each do |a|
ARRAY[a]+=1
end
setwise=false
c=2
while c<=maxim do
count=0
n=c
while n<=maxim do
count+=ARRAY[n]
n+=c
end
if count == N
puts "not coprime"
exit
end
if count > 1
setwise=true
end
c+=1
end
if setwise
puts "setwise coprime"
else
puts "pairwise coprime"
end
|
[
"assignment.value.change",
"call.arguments.change"
] | 270,297
| 270,296
|
u058568575
|
ruby
|
p02574
|
# 素因数だけをnまで計算する
class EnumElements
def initialize(n)
@sieve = []
@elements = {}
(2..n).each do |i|
next if @elements[i]
@sieve << i
@elements[i] = [i]
sieve_target = i * 2
while sieve_target <= n do
if @elements[sieve_target]
@elements[sieve_target].push(i)
else
@elements[sieve_target] = [i]
end
sieve_target += i
end
end
end
def elements(num)
@elements[num] || []
end
end
_n = gets.chomp.split.map(&:to_i)
arr = gets.chomp.split.map(&:to_i)
divisor = EnumElements.new(1_000_000)
common_elms = divisor.element(arr[0])
all_elms = {}
common_elms.each do |i|
all_elms[i] = true
end
pair = true
set = false
arr[1..-1].each do |i|
crr_elms = divisor.element(i)
if pair
crr_elms.each do |i|
break pair = false if all_elms[i]
all_elms[i] = true
end
end
if !set
common_elms = (common_elms & crr_elms)
set = common_elms.empty?
end
end
if pair
puts "pairwise coprime"
elsif set
puts "setwise coprime"
else
puts "not coprime"
end
|
# 素因数だけをnまで計算する
class EnumElements
def initialize(n)
@sieve = []
@elements = {}
(2..n).each do |i|
next if @elements[i]
@sieve << i
@elements[i] = [i]
sieve_target = i * 2
while sieve_target <= n do
if @elements[sieve_target]
@elements[sieve_target].push(i)
else
@elements[sieve_target] = [i]
end
sieve_target += i
end
end
end
def elements(num)
@elements[num] || []
end
end
_n = gets.chomp.split.map(&:to_i)
arr = gets.chomp.split.map(&:to_i)
divisor = EnumElements.new(1_000_000)
common_elms = divisor.elements(arr[0])
all_elms = {}
common_elms.each do |i|
all_elms[i] = true
end
pair = true
set = false
arr[1..-1].each do |i|
crr_elms = divisor.elements(i)
if pair
crr_elms.each do |i|
break pair = false if all_elms[i]
all_elms[i] = true
end
end
if !set
common_elms = (common_elms & crr_elms)
set = common_elms.empty?
end
end
if pair
puts "pairwise coprime"
elsif set
puts "setwise coprime"
else
puts "not coprime"
end
|
[
"assignment.value.change",
"identifier.change"
] | 271,802
| 271,803
|
u987208743
|
ruby
|
p02574
|
# エラトステネスの篩で素数列挙して高速に素因数分解したい！
# ref: https://atcoder.jp/contests/abc177/editorial/82
class PrimeDivWithSieve
def initialize(n)
@sieve = []
@elements = {}
(2..n).each do |i|
next if @elements[i]
@sieve << i
@elements[i] = [i]
sieve_target = i * 2
while sieve_target <= n do
if @elements[sieve_target]
@elements[sieve_target].push(i)
else
@elements[sieve_target] = [i]
end
sieve_target += i
end
end
end
def element(num)
@elements[num] || [num]
end
end
_n = gets.chomp.split.map(&:to_i)
arr = gets.chomp.split.map(&:to_i)
divisor = PrimeDivWithSieve.new(1_000_000)
common_elms = divisor.element(arr[0])
all_elms = {}
common_elms.each do |i|
all_elms[i] = true
end
pair = true
set = false
arr[1..-1].each do |i|
crr_elms = divisor.element(i)
if pair
crr_elms.each do |i|
break pair = false if all_elms[i]
all_elms[i] = true
end
end
if !set
common_elms = (common_elms & crr_elms)
set = common_elms.empty?
end
break if set && !pair
end
if pair
puts "pairwise coprime"
elsif set
puts "setwise coprime"
else
puts "setwise coprime"
end
|
# エラトステネスの篩で素数列挙して高速に素因数分解したい！
# ref: https://atcoder.jp/contests/abc177/editorial/82
class PrimeDivWithSieve
def initialize(n)
@sieve = []
@elements = {}
(2..n).each do |i|
next if @elements[i]
@sieve << i
@elements[i] = [i]
sieve_target = i * 2
while sieve_target <= n do
if @elements[sieve_target]
@elements[sieve_target].push(i)
else
@elements[sieve_target] = [i]
end
sieve_target += i
end
end
end
def element(num)
@elements[num] || []
end
end
_n = gets.chomp.split.map(&:to_i)
arr = gets.chomp.split.map(&:to_i)
divisor = PrimeDivWithSieve.new(1_000_000)
common_elms = divisor.element(arr[0])
all_elms = {}
common_elms.each do |i|
all_elms[i] = true
end
pair = true
set = false
arr[1..-1].each do |i|
crr_elms = divisor.element(i)
if pair
crr_elms.each do |i|
break pair = false if all_elms[i]
all_elms[i] = true
end
end
if !set
common_elms = (common_elms & crr_elms)
set = common_elms.empty?
end
break if set && !pair
end
if pair
puts "pairwise coprime"
elsif set
puts "setwise coprime"
else
puts "not coprime"
end
|
[
"literal.string.change",
"call.arguments.change"
] | 271,804
| 271,805
|
u987208743
|
ruby
|
p02574
|
#require 'pp'
require 'prime'
MAX = 10 ** 6
n = gets.to_i
a_n = gets.split.map(&:to_i)
memo = Array.new(10 ** 6 + 1, 0)
primes = Array.new(10 ** 6 + 1, 0)
Prime.each(MAX) do |i|
primes[i] = 1
end
#pp primes.tally
all_gcd = a_n[0]
1.upto(n-1) do |i|
all_gcd = all_gcd.gcd(a_n[i])
end
# 全GCDが1でない場合どちらでもない
if all_gcd > 1
puts "not coprime"
exit 0
end
## ============
## 以下は全GCDは常に1前提
## ============
a_n.sort!
# 同じ数字が含まれている場合setwise
a_n.each_cons(2) do |a, b|
if a == b
puts "setwise coprime"
exit 0
end
end
ok = true
a_n.each do |a|
if primes[a] == 1
if memo[a] == 1
puts "setwise coprime"
exit 0
end
memo[a] = 1
else
Prime.prime_division(a).each do |x, cnt|
if memo[x] == 1
puts "setwise coprime"
exit 0
end
memo[x] = 1
end
end
end
puts "pairwise coprime"
|
#require 'pp'
require 'prime'
MAX = 10 ** 6
n = gets.to_i
a_n = gets.split.map(&:to_i)
memo = Array.new(10 ** 6 + 1, 0)
primes = Array.new(10 ** 6 + 1, 0)
Prime.each(MAX) do |i|
primes[i] = 1
end
#pp primes.tally
all_gcd = a_n[0]
1.upto(n-1) do |i|
all_gcd = all_gcd.gcd(a_n[i])
end
# 全GCDが1でない場合どちらでもない
if all_gcd > 1
puts "not coprime"
exit 0
end
## ============
## 以下は全GCDは常に1前提
## ============
a_n.sort!
# 同じ数字が含まれている場合setwise
a_n.each_cons(2) do |a, b|
if a == b && a != 1
puts "setwise coprime"
exit 0
end
end
ok = true
a_n.each do |a|
if primes[a] == 1
if memo[a] == 1
puts "setwise coprime"
exit 0
end
memo[a] = 1
else
Prime.prime_division(a).each do |x, cnt|
if memo[x] == 1
puts "setwise coprime"
exit 0
end
memo[x] = 1
end
end
end
puts "pairwise coprime"
|
[
"control_flow.branch.if.condition.change"
] | 271,837
| 271,838
|
u754375546
|
ruby
|
p02574
|
require 'prime'
def max(a,b); a > b ? a : b; end
N = gets.to_i
A = gets.split.map(&:to_i)
Amax = A.max
dp = Array.new(Amax + 1, 0)
A.each do |a|
dp[a] += 1
end
ans = Prime.each(Amax).inject(-1) do |s, i|
cnt = 0
j = i
while j <= Amax
cnt += dp[j]
j += i
end
max(s, cnt)
end
if ans <= 1
puts "pairwise coprime"
elsif ans < N
puts "setwise coprime"
else
puts "non coprime"
end
|
require 'prime'
def max(a,b); a > b ? a : b; end
N = gets.to_i
A = gets.split.map(&:to_i)
Amax = A.max
dp = Array.new(Amax + 1, 0)
A.each do |a|
dp[a] += 1
end
ans = Prime.each(Amax).inject(-1) do |s, i|
cnt = 0
j = i
while j <= Amax
cnt += dp[j]
j += i
end
max(s, cnt)
end
if ans <= 1
puts "pairwise coprime"
elsif ans < N
puts "setwise coprime"
else
puts "not coprime"
end
|
[
"literal.string.change",
"call.arguments.change"
] | 271,961
| 271,962
|
u627981707
|
ruby
|
p02576
|
input = gets.split(" ").map(&:to_i)
n = input[0]
x = input[1]
t = input[2]
time = n / x
if(!(time * x == n))
time += 1
end
puts time
|
input = gets.split(" ").map(&:to_i)
n = input[0]
x = input[1]
t = input[2]
time = n / x
if(!(time * x == n))
time += 1
end
puts time * t
|
[
"expression.operation.binary.add"
] | 272,259
| 272,260
|
u152712578
|
ruby
|
p02576
|
n, x, t = gets.split.map &:to_i
p (n / x).ceil * t
|
n, x, t = gets.split.map &:to_i
p (n.to_f / x).ceil * t
|
[
"call.add"
] | 272,765
| 272,766
|
u489339677
|
ruby
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.