Submission #4031056


Source Code Expand

#include <iostream>
#include <cmath>
#include <bitset>
#include <sstream>
#include <string>
#include <algorithm>

using namespace std;

int N, X, A[25]={0};

void solve(){
    stringstream ss;
    ss << bitset<20>(X);
    string S = ss.str();
    // cout << S << endl;
    int range = S.size()-1;
    int cnt = 0, sum = 0;
    for(int i = range; i > range - N;i--){
        if(S[i] == '1'){
            // printf("%d: %d\n",i,A[cnt]);
            sum += A[cnt];
        } 
        cnt++;
    }
    cout << sum << endl;
}

int main(){
    cin >> N >> X;

    for(int i = 0; i < N; i++) cin >> A[i];

    solve();
}

Submission Info

Submission Time
Task B - 価格の合計
User Ricky_Ban
Language C++14 (GCC 5.4.1)
Score 100
Code Size 649 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 20
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 256 KB
subtask0_sample02.txt AC 1 ms 256 KB
subtask0_sample03.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 1 ms 256 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 1 ms 256 KB
subtask1_08.txt AC 1 ms 256 KB
subtask1_09.txt AC 1 ms 256 KB
subtask1_10.txt AC 1 ms 256 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 1 ms 256 KB
subtask1_13.txt AC 1 ms 256 KB
subtask1_14.txt AC 1 ms 256 KB
subtask1_15.txt AC 1 ms 256 KB
subtask1_16.txt AC 1 ms 256 KB
subtask1_17.txt AC 1 ms 256 KB