Submission #1228349

#TimeUsernameProblemLanguageResultExecution timeMemory
1228349tahir98Ice Hockey World Championship (CEOI15_bobek)C++20
40 / 100
90 ms332 KiB
#include <bits/stdc++.h> using namespace std; //for randomization //mt19937 rng(chrono::system_clock::now().time_since_epoch().count()); #define int long long #define double long double #define big __int128_t #define ulong unsigned long long #define no cout<<"No"<<endl #define yes cout<<"Yes"<<endl #define YES cout<<"YES"<<endl #define NO cout<<"NO"<<endl #define pb push_back #define endl '\n' #define all(v) v.begin(),v.end() #define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); const int mod = 998244353; const int N = 4e5+5; const int INF = 1e18; void solve(){ int n,m; cin>>n>>m; int a[n+5], ans = 0; for(int i = 0;i<n;i++) cin>>a[i]; for(int bit = 0;bit<(1<<n);bit++){ int sum = 0; for(int i= 0;i<n;i++){ if(bit&(1<<i)) sum+=a[i]; } if(sum<=m) ans++; } cout<<ans<<endl; } signed main() { fastio; //freopen("closing.in", "r", stdin); //freopen("closing.out", "w", stdout); int T =1; //cin>>T; while(T--){ solve(); } } // tahir
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...