Go: package main

import (
	"fmt"
	"os"
	"strconv"
	"bufio"
	"strings"
)
func main2(){
ans(10,3,50,4,60)
ans(10 ,3, 100, 5, 180)//360
ans(6, 2, 200, 3, 300)// 600

}

func main() {



    sc := bufio.NewScanner(os.Stdin)
     sc.Scan()
        args := strings.Split(sc.Text(), " ")
      

	var n, a, b, c, d int

	n, _ = strconv.Atoi(args[0])
	a, _ = strconv.Atoi(args[1])
	b, _ = strconv.Atoi(args[2])
	c, _ = strconv.Atoi(args[3])
	d, _ = strconv.Atoi(args[4])

        ans(n,a,b,c,d)
}

func ans(n,a,b,c,d int){

	ans2 := 0
	for i := 0; i < 1000; i++ {
		if i*a >= n {
			ans2 = i * b
			break
		}
	}

	for i := 0; i < 1000; i++ {
	
		if i*c >= n {
			if ans2 > i*d {


				ans2 = i *  d
			}
			break
		}
	}

	fmt.Printf("%d\n", ans2)
}

C++: #include <iostream>
using namespace std;
int main(void){
    int n,a,b,c,d;
    int x,y;
    cin >> n,a,b,c,d;
    
    x=n/a;
    if(x!=0) x++;
    x=x*c;

    y=n/b;
    if(y!=0) y++;
    y=y*d;

    if(x<y){
     cout << x <<endl;
    }else{
     cout << y <<endl;
    }

return 0;
    
}

C++: #include "iostream"
#include "string"
#include "algorithm"
using namespace std;

int main() {
	int n, a, b, c, d;
	cin >> n >> a >> b >> c >> d;
	int cntX = 0, cntY = 0, priceX = 0, priceY = 0;
	while (cntX < n) {
		cntX += a;
		priceX += b;
	}
	while (cntY < n) {
		cntY += c;
		priceY += d;
	}
	cout << min(priceX, priceY) << endl;
}

C++: #include <iostream>
#include<math.h>
#include<algorithm>
using namespace std;

int main() {
	int n,a,b,c,d;
cin>>n>>a>>b>>c>>d;
int ans=min(((n+a-1)/a)*b,((n+c-1)/c)*d);
cout<<ans<<endl;
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n, a, b, c, d; cin >> n >> a >> b >> c >> d;
  int a_count = 0;
  int c_count = 0;
  for(int i = 1; i < 1000; i++){
    if(a*i >= n) a_count = b*i; break;
  }
  for(int j = 1; j < 1000; j++){
    if(c*j >= n) c_count = d*j; break;
  }
  cout << min(a_count, c_count) << endl;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,a,b,c,d,ans1,ans2;
  cin >> n >> a >> b >> c >> d;

  if(n%a==0) ans1 = b*(n/a);
  else{
  ans1 = n/a+1;
  ans1 = ans1*b;
  }
  if(n%c==0) ans2 = d*(n/c);
  else{
  ans2 = n/c+1;
  ans2 = ans2*d;
  }

  if(ans1<ans2) cout << ans1 << endl;
  if(ans1>ans2) cout << ans2 << endl;
  if(ans1==ans2) cout << ans1 << endl;

  return 0;
}

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

int main(){

  int n, a,b,c,d, X, Y;

  cin >> n >> a >> b >> c >> d;

  for(int i = 1; i > 0; ++i){
    if(n <= a * i){
      X = b * i;
      break;
    }
  }

  for(int i = 1; i > 0; ++i){
    if(n <= c * i){
      Y = d * i;
      break;
    }
  }
  if(X > Y){
    cout << Y << endl;
  }else cout << X << endl;


  
    
  return 0;
}

C++: #include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main(void)
{
	int n,a,b,c,d,i,x,y,z;
	cin>>n>>a>>b>>c>>d;
	for(i=1;i<=n;i++){
		x=a*i;
		if(n-x<=0){
			z=i;
			break;
		}
	}
	x=b*z;
	for(i=1;i<=n;i++){
		y=c*i;
		if(n-y<=0){
			z=i;
			break;
		}
	}
	y=d*z;
	if(x<y) cout<<x<<endl;
	else cout<<y<<endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main() {
  int N,A,B,C,D;
  cin >> N >> A >> B >> C >> D ;
  int x,y;
  if(N%A==0){
    x=N/A*B;    
  }else{
    x=((N/A)+1)*B;    
  }
  if(N%C==0){
    y=(N/C)*D;
    
  }else{
    y=((N/C)+1)*D;
  }
   if(x<y){
     cout << x << endl;
   }
   else{
    cout << y << endl;   }
   
   
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
    int n,a,b,c,d,i,ans;
    cin>>n>>a>>b>>c>>d;
    if(n%a==0){
        if(n%c==0){
            if(n/a*b>n/c*d)ans=n/c*d;
            else ans=n/a*b;
        }else{
            if(n/a*b>(n/c+1)*d)ans=(n/c+1)*d;
            else ans=n/a*b;
        }
    }else{
        if(n%c==0){
            if((n/a+1)*b>n/c*d)ans=n/c*d;
            else ans=(n/a+1)*b;
        }else{
            if((n/a+1)*b>(n/c+1)*d)ans=(n/c+1)*d;
            else ans=(n/a+1)*b;
        }
    }
    cout<<ans<<endl;

}

C++: #include <iostream>
using namespace std;
int main(void){
    int n,a,b,c,d;
    int x,y;
    cin >> n,a,b,c,d;
    
    x=n/a;
    if(x!=1) x++;
    x=x*c;

    y=n/b;
    if(y!=1) y++;
    y=y*d;

    if(x<y){
     cout << x <<endl;
    }else{
     cout << y <<endl;
    }

return 0;
    
}

C++: // #pragma GCC target("avx")  // CPU 処理並列化
// #pragma GCC optimize("O3")  // CPU 処理並列化
// #pragma GCC optimize("unroll-loops")  // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ = malloc(size);void * stack_extend_origin_memory_;char * stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm volatile("mov %%rsp, %%rbx\nmov %%rax, %%rsp":"=b"(stack_extend_origin_memory_):"a"((char*)stack_extend_memory_+(size)-1024));
// #define END_STACK_EXTEND asm volatile("mov %%rax, %%rsp"::"a"(stack_extend_origin_memory_));free(stack_extend_memory_);

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include<numeric>
#include<unordered_set>
#include<unordered_map>
#include<complex>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const long double EPS=1e-20;
const double INF=1e+10;
const double PI=acos(-1.0);
const int C_SIZE = 3100000;
const int UF_SIZE = 3100000;
namespace{
	long long fact[C_SIZE];
	long long finv[C_SIZE];
	long long inv[C_SIZE];
	long long Comb(int a,int b){
	 	if(a<b||b<0)return 0;
	 	return fact[a]*finv[b]%mod*finv[a-b]%mod;
	}
	void init_C(int n){
		fact[0]=finv[0]=inv[1]=1;
		for(int i=2;i<n;i++){
			inv[i]=(mod-(mod/i)*inv[mod%i]%mod)%mod;
		}
		for(int i=1;i<n;i++){
			fact[i]=fact[i-1]*i%mod;
			finv[i]=finv[i-1]*inv[i]%mod;
		}
	}
	long long pw(long long a,long long b){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%mod;
			a=a*a%mod;
			b/=2;
		}
		return ret;
	}
	long long pw_mod(long long a,long long b,long long M){
		if(a<0LL)return 0;
		if(b<0LL)return 0;
		long long ret=1;
		while(b){
			if(b%2)ret=ret*a%M;
			a=a*a%M;
			b/=2;
		}
		return ret;
	}
	int pw_mod_int(int a,int b,int M){
		if(a<0)return 0;
		if(b<0)return 0;
		int ret=1;
		while(b){
			if(b%2)ret=(long long)ret*a%M;
			a=(long long)a*a%M;
			b/=2;
		}
		return ret;
	}
	int ABS(int a){return max(a,-a);}
	long long ABS(long long a){return max(a,-a);}
	double ABS(double a){return max(a,-a);}
	int sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }
	int UF[UF_SIZE];
	void init_UF(int n){
		for(int i=0;i<n;i++)UF[i]=-1;
	}
	int FIND(int a){
		if(UF[a]<0)return a;
		return UF[a]=FIND(UF[a]);
	}
	void UNION(int a,int b){
		a=FIND(a);b=FIND(b);if(a==b)return;
		if(UF[a]>UF[b])swap(a,b);
		UF[a]+=UF[b];UF[b]=a;
	}
}
// ここから編集しろ

int main(){
	int n,a,b,c,d;scanf("%d%d%d%d%d",&n,&a,&b,&c,&d);
	int ret=min((n+a-1)/a*b,(n+c-1)/c*d);
	printf("%d\n",ret);
}

C++: #include <iostream>
using namespace std;

int main(){
	int n,a,b,c,d,x,y,x1,y1;
	cin>>n>>a>>b>>c>>d;
	x=y=x1=y1=0;
	while(x<n){
		x+=a;
		x1++;
	}
	while(y<n){
		y+=c;
		y1++;
	}
	if(x1*b<=y1*d) cout<<x1*b<<endl;
	else cout<<y1*d<<endl;
	return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int N, A, B, C, D; cin >> N >> A >> B >> C >> D;
	int ans_X = B * ((int)(N / A) + (N % A == 0 ? 0 : 1));
	int ans_Y = D * ((int)(N / C) + (N % C == 0 ? 0 : 1));
	cout << min(ans_X, ans_Y) << endl;
	return 0;
}