제출 #1089184

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1089184		vjudge1	은행 (IZhO14_bank)	C++17	19 / 100	2 ms	348 KiB

bank

/* 
 * imaN
 * 49
 * 
**/
#include <bits/stdc++.h>
using namespace std;
     
//#define ll long long
#define FF first
#define SS second
#define pb push_back
#define bp pop_back()
#define int long long
#define ld long double
#define pf push_front
#define Imansoska ios_base::sync_with_stdio(0);cin.tie(0); cout.tie(0);
#define endl cout << "\n"
#define all(x) x.begin(),x.end()
#define lb lower_bound
 
/*int binpow (int a, int n, int m) {
    if (n == 0)
        return 1%m;
    if (n % 2 == 1)
        return binpow (a, n-1,m) * a%m;
    else {
        int b = binpow (a, n/2,m);
        return b * b%m;
    }
}
 
int lcm(int a, int b) {
    return (a / __gcd(a, b)) * b;
}*/

const int N = (1e5+13);
const int maxn= 1e6+100;
const int MOD = 1e9 + 7;
const int INF = 1e18 + 7;

int a[30],z[30],n,k,tf;

void rec(int pos,int sum) {
	if ( tf ) {
		return;
	}
	for ( int i=pos; i<=k; i++ ) {
		if ( sum+z[i]==a[1] ) {
			tf=1;
			return;
		}
		rec(i+1,sum+z[i]);
	}
}

signed main (/*Imansoska*/) {
//	Imansoska//	freopen("lepus.in","r",stdin);
//	freopen("lepus.out","w",stdout);
	cin >> n >> k;
	for ( int i=1; i<=n; i++ ) {
		cin >> a[i];
	}
	for ( int i=1; i<=k; i++ ) {
		cin >> z[i];
	}
	rec(1,0);
	if ( tf ) cout << "YES";
	else cout << "NO";
}

• Subtask 1: 19 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29