Submission #1303267
Source Code Expand
#include<iostream> #include<string> #include<bitset> #include<iomanip> #include<math.h> using namespace std; int main(){ int n,x; cin >> n >> x; int a[n]={},count=0; for(int i=0;i<n;i++) cin >> a[i]; bitset<1048575> xx=x; for(int i=0;i<n;i++){ if(xx[i]==1)count+=a[i]; } cout << count << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - 価格の合計 |
User | Masumi |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 334 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 384 KB |
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 | 1 ms | 384 KB |
subtask0_sample02.txt | AC | 1 ms | 384 KB |
subtask0_sample03.txt | AC | 1 ms | 384 KB |
subtask1_01.txt | AC | 1 ms | 384 KB |
subtask1_02.txt | AC | 1 ms | 384 KB |
subtask1_03.txt | AC | 1 ms | 384 KB |
subtask1_04.txt | AC | 1 ms | 384 KB |
subtask1_05.txt | AC | 1 ms | 384 KB |
subtask1_06.txt | AC | 1 ms | 384 KB |
subtask1_07.txt | AC | 1 ms | 384 KB |
subtask1_08.txt | AC | 1 ms | 384 KB |
subtask1_09.txt | AC | 1 ms | 384 KB |
subtask1_10.txt | AC | 1 ms | 384 KB |
subtask1_11.txt | AC | 1 ms | 384 KB |
subtask1_12.txt | AC | 1 ms | 384 KB |
subtask1_13.txt | AC | 1 ms | 384 KB |
subtask1_14.txt | AC | 1 ms | 384 KB |
subtask1_15.txt | AC | 1 ms | 384 KB |
subtask1_16.txt | AC | 1 ms | 384 KB |
subtask1_17.txt | AC | 1 ms | 384 KB |