#include<bits/stdc++.h>
using namespace std; 
const int INF=1e9;
const int MAXN=25;
int d[MAXN]; 
int n;
int min_hp=INF,min_cnt=INF; 
void dfs(int cnt,int hp)
{
    if(d[1]>=hp) 
    {
        if(hp<min_hp) 
        {
            min_hp=hp;
            min_cnt=cnt;
        }
    }
    for(int i=1;i<=n;i++) 
    { 
        dfs(cnt+1,hp-d[i]);
    }
}
int main()
{ 
    int hp;
    cin>>hp>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>d[i];
    }
    dfs(0,hp);
    cout<<min_hp<<endl<<min_cnt; 
}

#include<bits/stdc++.h> using namespace std; const int INF=1e9; const int MAXN=25; int d[MAXN]; int n; int min_hp=INF,min_cnt=INF; void dfs(int cnt,int hp) { if(d[1]>=hp) { if(hp<min_hp) { min_hp=hp; min_cnt=cnt; } } for(int i=1;i<=n;i++) { dfs(cnt+1,hp-d[i]); } } int main() { int hp; cin>>hp>>n; for(int i=1;i<=n;i++) { cin>>d[i]; } dfs(0,hp); cout<<min_hp<<endl<<min_cnt; }

#include<bits/stdc++.h> using namespace std; const int INF=1e9; const int MAXN=25; int d[MAXN]; int n; int min_hp=INF,min_cnt=INF; void dfs(int cnt,int hp) { if(d[1]>=hp) { if(hp<min_hp) { min_hp=hp; min_cnt=cnt; } } for(int i=1;i<=n;i++) { dfs(cnt+1,hp-d[i]); } } int main() { int hp; cin>>hp>>n; for(int i=1;i<=n;i++) { cin>>d[i]; } dfs(0,hp); cout<<min_hp<<endl<<min_cnt; }

#include<iostream>
using namespace std;
int a[25];int hp,n;
int ar=2147483647,ac=2147483647;
void dfs(int hp,int ans,int dep){
	if(dep==n){
		
	}
	for(int i=0;hp-i*a[dep]>0;i++){
		
	}
}
int main(){
	 cin>>hp>>n;
	 for(int i=0;i<n;i++){
	 	cin>>a[i];
	 }
	 dfs(hp,0,0);
	cout<<ar<<"\n"<<ac<<'\n';
}

include <bits/stdc++.h> using namespace std; int d[25]; int n; int min_hp=1e9,min_cnt=1e9; void dfs(int cnt,int hp) { if(d[1]>=hp) { if(hp<min_hp) { min_hp=hp; min_cnt=cnt; } else if(hp==min_hp) { if(min_cnt>cnt)min_cnt=cnt; } return; } for(int i=1;i<=n;i++) { if(d[i]<hp) { dfs(cnt+1,hp-d[i]); } } } int main() { int hp; cin>>hp>>n; for(int i=1;i<=n;i++) { cin>>d[i]; } sort(d+1,d+1+n); dfs(0,hp); cout<<min_hp<<endl<<min_cnt; return 0; }