Submission #229438


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define dump(n) cout<<"# "<<#n<<'='<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;

const int INF=1e9;
const int MOD=1e9+7;
const double EPS=1e-9;

template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
	return os<<'('<<p.first<<','<<p.second<<')';
}
template<typename T>
ostream& operator<<(ostream& os,const vector<T>& a){
	os<<'[';
	rep(i,a.size()) os<<(i?" ":"")<<a[i];
	return os<<']';
}

int main()
{
	for(int n,x;cin>>n>>x && n|x;){
		int res=0;
		rep(i,n){
			int a; cin>>a;
			if(x>>i&1) res+=a;
		}
		cout<<res<<endl;
	}
}

Submission Info

Submission Time
Task B - 価格の合計
User lyoz
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1143 Byte
Status AC
Exec Time 26 ms
Memory 924 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 24 ms 796 KB
subtask0_sample02.txt AC 24 ms 796 KB
subtask0_sample03.txt AC 25 ms 796 KB
subtask1_01.txt AC 25 ms 800 KB
subtask1_02.txt AC 26 ms 800 KB
subtask1_03.txt AC 26 ms 676 KB
subtask1_04.txt AC 24 ms 804 KB
subtask1_05.txt AC 24 ms 664 KB
subtask1_06.txt AC 24 ms 796 KB
subtask1_07.txt AC 24 ms 672 KB
subtask1_08.txt AC 24 ms 668 KB
subtask1_09.txt AC 24 ms 924 KB
subtask1_10.txt AC 25 ms 796 KB
subtask1_11.txt AC 26 ms 804 KB
subtask1_12.txt AC 24 ms 672 KB
subtask1_13.txt AC 23 ms 676 KB
subtask1_14.txt AC 25 ms 920 KB
subtask1_15.txt AC 23 ms 732 KB
subtask1_16.txt AC 26 ms 796 KB
subtask1_17.txt AC 25 ms 800 KB