Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

const qA, qB, qC = 200, 300, 500
const pA, pB, pC = 380, 550, 850
const dA, dB, dC = 5, 4, 3

func main() {
	stdin := bufio.NewScanner(os.Stdin)
	for stdin.Scan() {
		q, _ := strconv.Atoi(stdin.Text())
		if q == 0 {
			break
		}

		// A 0袋から始める
		curPrice, newPrice := 0, 0
		// B
		for a := 0; a <= int(q/qA); a++ {
			for b := 0; b <= int((q-qA*a)/qB); b++ {
				// 残り
				rem := q - qA*a - qB*b
				if rem == 0 || ((rem > 0) && ((rem % qC) == 0)) {
					// ちょうど買える
					newPrice = amount(a, b, int(rem/qC))
					if curPrice == 0 || newPrice < curPrice {
						// println(a, b, int(rem/qC), newPrice)
						curPrice = newPrice
					}
				}
			}
		}
		fmt.Println(curPrice)
	}
}

func amount(a, b, c int) int {
	tA := int(float64(int(a/dA)*dA*pA)*0.8) + (a%dA)*pA
	tB := int(float64(int(b/dB)*dB*pB)*0.85) + (b%dB)*pB
	tC := int(float64(int(c/dC)*dC*pC)*0.88) + (c%dC)*pC
	// println("amount:", a, b, c, tA, tB, tC, tA+tB+tC)
	return tA + tB + tC
}

C++: 
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < (k+n); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 

typedef long long ll;
typedef unsigned long long ull;

#define X real()
#define Y imag()
typedef double D;
typedef complex<D> P;
#define EPS (1e-9)

#ifdef _DEBUG
template<class _T>
inline void _prfe(const char *_n, _T _c, bool _p = false){
    ITER(_c) _it=_c.begin();
    if(_p){ cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{ cout<<_n<<" = [ "<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;cout<<" ]"<<endl; }
}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

int t[3][50];

int main(){
    REP(i,50){
        int w1 = i/5*5; t[0][i] = w1*380*80/100 + (i-w1)*380;
        int w2 = i/4*4; t[1][i] = w2*550*85/100 + (i-w2)*550;
        int w3 = i/3*3; t[2][i] = w3*850*88/100 + (i-w3)*850;
    }
    REP(j,3){
        REP(i,66){
            pf("%5d ", t[j][i]);
        }
        pf("\n");
    }

    int n;
    while(cin >> n && n){
        n /= 100;
        int min = INT_MAX;
        REP(i,50){
            REP(j,50){
                REP(k,50){
                    //if(i*2+j*3+k*5 < n) continue;
                    if(i*2+j*3+k*5 != n) continue;
                    int tt = t[0][i] + t[1][j] + t[2][k];
                    if(min >= tt){
                        min = tt;
                        pf("%d:%d:%d / %d+%d+%d / %d\n", i, j, k, t[0][i], t[1][j], t[2][k], tt);
                    }
                }
            }
        }
        cout << min << endl;
    }
    return 0;
}

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

int main()
{
	int kona,i;
	int money[51];
	money[0] = 0;
	int size[6] = {2,3,5,10,12,15};
	int cost[6] = {380,550,850,1520,1870,2244};
		
	for(i=1;i<51;i++) money[i] = INF;
	
	for(i=0;i<50;i++)
	{
		if( money[i] != INF)
		{
			for(int j=0;j<6;j++)
			{
				if( (i + size[j]) < 51)
				{
					if( money[i]+cost[j] < money[ i+size[j] ] )
					{
						money[ i+size[j] ] = money[i] + cost[j];
					}
				}
			}
		}
	}
	
cin>>kona;
cout<< money[kona/100] << endl;
	
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <climits>
#include <cfloat>

typedef long long ll;

using namespace std;

int main()
{
	int q[] = { 2, 3, 5 };
	int v[] = { 380, 550, 850 };
	int dq[] = { 5, 4, 3 };
	double dis[] = { 0.2, 0.15, 0.12 };
	const int MaxG = 100;
	int vv[3][MaxG];
	for (int i = 0; i < 3; ++i)
	{
		for (int j = 0; j < MaxG; ++j)
		{
			if (j % q[i] != 0)
			{
				vv[i][j] = 100000000;
				continue;
			}
			int sack = (j+q[i]-1) / q[i];
			int disSack = sack / dq[i] * dq[i];
			vv[i][j] = v[i]*sack - (int)(v[i]*disSack*dis[i] + 0.1);
		}
	}

	int dp[3+1][MaxG];
	for (int i = 0; i < 4; ++i)
		for (int j = 0; j < MaxG; ++j)
		dp[i][j] = 1000000;
	dp[0][0] = 0;

	for (int i = 0; i < 3; ++i)
		for (int j = 0; j < MaxG; ++j)
			for (int k = 0; k+j < MaxG; ++k)
				dp[i+1][j+k] = min(dp[i+1][j+k], dp[i][j] + vv[i][k]);

	int g;
	while (cin >> g && g)
		cout << dp[3][g/100] << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;
int w;
main()
{
	while(cin>>w,w)
	{
		int ans=1e9;
		w/=100;
		for(int i=0;i<51;i++)for(int j=0;j<51;j++)for(int k=0;k<51;k++)
		{
			if(i*2+j*3+k*5!=w)continue;
			int now=i/5*5*38*8+i%5*380+j/4*2*55*17+j%4*550+k/3*3*748+k%3*850;
			ans=ans<now?ans:now;
		}
		cout<<ans<<endl;
	}
}

C++: #include<iostream>
using namespace std;
int w;
main()
{
	while(cin>>w,w)
	{
		int ans=1e9;
		w/=100;
		for(int i=0;i<51;i++)for(int j=0;j<51;j++)for(int k=0;k<51;k++)
		{
			if(i*2+j*3+k*5<w)continue;
			int now=i/5*5*38*8+i%5*380+j/4*2*55*17+j%4*550+k/3*3*748+k%3*850;
			ans=ans<now?ans:now;
		}
		cout<<ans<<endl;
	}
}

C++: #include <iostream>
using namespace std;
#define INF (1 << 30) - 1

int main(){
	int a[6] = {2, 3, 5, 10, 12, 15}, dp[51], n;
	int b[6] = {380, 550, 850, 1520, 1870, 2244};
	for(int i = 0;i < 51;i++)dp[i] = INF;
	dp[0] = 0;
	
	for(int i =  0;i <= 50;i++){
		for(int j = 0;j < 6;j++){
			if(i >= a[j])dp[i] = min(dp[i], dp[i-a[j]] + b[j]);
		}
	}
	while(cin >> n, n)cout << dp[n/100] << endl;
	return 0;
}

C++: #include<stdio.h>
#include<limits.h>
#include<algorithm>
int main(void)
{
	int n,a,b,c,v,i,va,vb,vc;
	int costA[30], costB[30], costC[30];
	for(i=0;i*200<=5000;++i)
		costA[i] = i%5*380 + i/5*1520;
	for(i=0;i*300<=5000;++i)
		costB[i] = i%4*550 + i/4*1870;
	for(i=0;i*500<=5000;++i)
		costC[i] = i%3*850 + i/3*2244;
	while(scanf("%d",&n),n)
	{
		v=INT_MAX;
		for(a=0;(va=a*200)<=n;++a)
		{
			for(b=0;va+(vb=b*300) <= n; ++b)
			{
				for(c=0; va+vb+(vc=c*500) <= n; ++c)
				{
					if(va+vb+vc==n)
						v = std::min(v, costA[a] + costB[b] + costC[c]);
				}
			}
		}
		printf("%d\n", v);
	}
	return 0;
}

C++: ??¶???????????°???????????°