Submission #4528734

Source Code Expand

N,M,C = gets.split.map(&:to_i)
B = gets.split.map(&:to_i)
A = N.times.map{gets.split.map(&:to_i)}
count = 0
A.each_with_index do |a, j|
    sum = 0
    a.each_with_index do |v, k|
        tmp = 0
        tmp = B[k] * v
        sum += tmp
    end
    if sum - C > 0
        count += 1
    end
end
puts count

Submission Info

Submission Time
Task B - Can you solve this?
User yokoyan
Language Ruby (2.3.3)
Score 0
Code Size 323 Byte
Status WA
Exec Time 7 ms
Memory 1788 KiB

Judge Result

Set Name All Sample
Score / Max Score 0 / 200 0 / 0
Status
AC × 8
WA × 9
AC × 1
WA × 2
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 WA 7 ms 1788 KiB
sample_02 WA 7 ms 1788 KiB
sample_03 AC 7 ms 1788 KiB
testcase_01 AC 7 ms 1788 KiB
testcase_02 AC 7 ms 1788 KiB
testcase_03 WA 7 ms 1788 KiB
testcase_04 AC 7 ms 1788 KiB
testcase_05 WA 7 ms 1788 KiB
testcase_06 WA 7 ms 1788 KiB
testcase_07 WA 7 ms 1788 KiB
testcase_08 WA 7 ms 1788 KiB
testcase_09 AC 7 ms 1788 KiB
testcase_10 AC 7 ms 1788 KiB
testcase_11 WA 7 ms 1788 KiB
testcase_12 AC 7 ms 1788 KiB
testcase_13 WA 7 ms 1788 KiB
testcase_14 AC 7 ms 1788 KiB