Submission #5485557
Source Code Expand
var a:array[0..100] of longint; n,m,j,sum,x,i:longint; begin readln(n,m); j:=0; while m<>0 do begin inc(j); a[j]:=m mod 2; m:=m div 2; end; for i:=1 to n do begin read(x); if a[i]=1 then sum:=sum+x; end; writeln(sum); end.
Submission Info
Submission Time | |
---|---|
Task | B - 価格の合計 |
User | luogu_bot3 |
Language | Pascal (FPC 2.6.2) |
Score | 100 |
Code Size | 268 Byte |
Status | AC |
Exec Time | 0 ms |
Memory | 128 KB |
Compile Error
/usr/bin/ld.bfd: warning: ./link.res contains output sections; did you forget -T?
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt |
All | subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample01.txt | AC | 0 ms | 128 KB |
subtask0_sample02.txt | AC | 0 ms | 128 KB |
subtask0_sample03.txt | AC | 0 ms | 128 KB |
subtask1_01.txt | AC | 0 ms | 128 KB |
subtask1_02.txt | AC | 0 ms | 128 KB |
subtask1_03.txt | AC | 0 ms | 128 KB |
subtask1_04.txt | AC | 0 ms | 128 KB |
subtask1_05.txt | AC | 0 ms | 128 KB |
subtask1_06.txt | AC | 0 ms | 128 KB |
subtask1_07.txt | AC | 0 ms | 128 KB |
subtask1_08.txt | AC | 0 ms | 128 KB |
subtask1_09.txt | AC | 0 ms | 128 KB |
subtask1_10.txt | AC | 0 ms | 128 KB |
subtask1_11.txt | AC | 0 ms | 128 KB |
subtask1_12.txt | AC | 0 ms | 128 KB |
subtask1_13.txt | AC | 0 ms | 128 KB |
subtask1_14.txt | AC | 0 ms | 128 KB |
subtask1_15.txt | AC | 0 ms | 128 KB |
subtask1_16.txt | AC | 0 ms | 128 KB |
subtask1_17.txt | AC | 0 ms | 128 KB |