304 North Cardinal St.
Dorchester Center, MA 02124

# College Life 4 CodeChef Solution

## College Life 4 CodeChef Solution in C++17

``````#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vc vector
#define p(x) pair<x,x>
#define ff first
#define ss second

int main() {
int t;cin>>t;
while(t--) {
ll n,e,h,a,b,c;cin>>n>>e>>h>>a>>b>>c;
ll ans = LLONG_MAX;
for(ll i=0;i<=min(n,min(e,h));i++) {
ll res = n - i;
if(a <= b) {
ll y = (e-i)/2;
if(y >= res) y = res;
// y = min(y,res);
res -= y;
ll cost = res*b + y*a + i*c;
if((h-i)/3 >= res) ans = min(ans,cost);
}else {
ll y = (h-i)/3;
if(y >= res) y = res;
res -= y;
ll cost = res*a + y*b + i*c;
if((e-i)/2 >= res) ans = min(ans,cost);
}
}
if(ans == LLONG_MAX) ans = -1;
cout << ans << endl;

}
return 0;
}``````

## College Life 4 CodeChef Solution in C++14

``````#include <bits/stdc++.h>

#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")//Comment optimisations for interactive problems (use endl)
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

using namespace std;

struct PairHash {inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }};

// speed
#define Code ios_base::sync_with_stdio(false);
#define By ios::sync_with_stdio(0);
#define Sumfi cout.tie(NULL);

// alias
using ll = long long;
using ld = long double;
using ull = unsigned long long;

// constants
const ld PI = 3.14159265358979323846;  /* pi */
const ll INF = 1e18;
const ld EPS = 1e-9;
const ll MAX_N = 1e6;
const ll mod = 1e4;

// typedef
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<pll> vpll;
typedef array<ll,3> all3;
typedef array<ll,5> all5;
typedef vector<all3> vall3;
typedef vector<all5> vall5;
typedef vector<ld> vld;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef deque<ll> dqll;
typedef deque<pll> dqpll;
typedef pair<string, string> pss;
typedef vector<pss> vpss;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef unordered_set<ll> usll;
typedef unordered_set<pll, PairHash> uspll;
typedef unordered_map<ll, ll> umll;
typedef unordered_map<pll, ll, PairHash> umpll;

// macros
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,m,n) for(ll i=n;i>=m;i--)
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define INF(a) memset(a,0x3f3f3f3f3f3f3f3fLL,sizeof(a))
#define ASCEND(a) iota(all(a),0)
#define sz(x) ll((x).size())
#define BIT(a,i) (a & (1ll<<i))
#define BITSHIFT(a,i,n) (((a<<i) & ((1ll<<n) - 1)) | (a>>(n-i)))
#define pyes cout<<"YES\n";
#define pno cout<<"NO\n";
#define endl "\n"
#define pneg1 cout<<"-1\n";
#define ppossible cout<<"Possible\n";
#define pimpossible cout<<"Impossible\n";
#define TC(x) cout<<"Case #"<<x<<": ";
#define X first
#define Y second

// utility functions
template <typename T>
void print(T &&t)  { cout << t << "\n"; }
template<typename T>
void printv(vector<T>v){ll n=v.size();rep(i,0,n){cout<<v[i];if(i+1!=n)cout<<' ';}cout<<endl;}
template<typename T>
void printvln(vector<T>v){ll n=v.size();rep(i,0,n)cout<<v[i]<<endl;}
void fileIO(string in = "input.txt", string out = "output.txt") {freopen(in.c_str(),"r",stdin); freopen(out.c_str(),"w",stdout);}
template<typename T>
template<typename T, typename U>
template<typename T, typename U>

struct Combination {
vll fac, inv;
ll n, MOD;

ll modpow(ll n, ll x, ll MOD = mod) { if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

Combination(ll _n, ll MOD = mod): n(_n + 1), MOD(MOD) {
inv = fac = vll(n,1);
rep(i,1,n) fac[i] = fac[i-1] * i % MOD;
inv[n - 1] = modpow(fac[n - 1], MOD - 2, MOD);
rrep(i,1,n - 2) inv[i] = inv[i + 1] * (i + 1) % MOD;
}

ll fact(ll n) {return fac[n];}
ll nCr(ll n, ll r) {
if(n < r or n < 0 or r < 0) return 0;
return fac[n] * inv[r] % MOD * inv[n-r] % MOD;
}
};

struct Matrix {
ll r,c;
vvll matrix;
Matrix(ll r, ll c, ll v = 0): r(r), c(c), matrix(vvll(r,vll(c,v))) {}

Matrix operator*(const Matrix& B) const {
Matrix res(r, B.c);
rep(i,0,r) rep(j,0,B.c) rep(k,0,B.r) {
res.matrix[i][j] = (res.matrix[i][j] + matrix[i][k] * B.matrix[k][j] % mod) % mod;
}
return res;
}

Matrix copy() {
Matrix copy(r,c);
copy.matrix = matrix;
return copy;
}

Matrix pow(ll n) {
assert(r == c);
Matrix res(r,r);
Matrix now = copy();
rep(i,0,r) res.matrix[i][i] = 1;
while(n) {
if(n & 1) res = res * now;
now = now * now;
n /= 2;
}
return res;
}
};

// geometry data structures
template <typename T>
struct Point {
T y,x;
Point(T y, T x) : y(y), x(x) {}
Point(pair<T,T> p) : y(p.first), x(p.second) {}
Point() {}
void input() {cin>>y>>x;}
friend ostream& operator<<(ostream& os, const Point<T>& p) { os<<p.y<<' '<<p.x<<'\n'; return os;}
Point<T> operator+(Point<T>& p) {return Point<T>(y + p.y, x + p.x);}
Point<T> operator-(Point<T>& p) {return Point<T>(y - p.y, x - p.x);}
Point<T> operator*(ll n) {return Point<T>(y*n,x*n); }
Point<T> operator/(ll n) {return Point<T>(y/n,x/n); }
bool operator<(const Point &other) const {if (x == other.x) return y < other.y;return x < other.x;}
Point<T> rotate(Point<T> center, ld angle) {
ld si = sin(angle * PI / 180.), co = cos(angle * PI / 180.);
ld y = this->y - center.y;
ld x = this->x - center.x;

return Point<T>(y * co - x * si + center.y, y * si + x * co + center.x);
}
ld distance(Point<T> other) {
T dy = abs(this->y - other.y);
T dx = abs(this->x - other.x);
return sqrt(dy * dy + dx * dx);
}

T norm() { return x * x + y * y; }
};

template<typename T>
struct Line {
Point<T> A, B;
Line(Point<T> A, Point<T> B) : A(A), B(B) {}
Line() {}

void input() {
A = Point<T>();
B = Point<T>();
A.input();
B.input();
}

T ccw(Point<T> &a, Point<T> &b, Point<T> &c) {
T res = a.x * b.y + b.x * c.y + c.x * a.y;
res -= (a.x * c.y + b.x * a.y + c.x * b.y);
return res;
}

bool isIntersect(Line<T> o) {
T p1p2 = ccw(A,B,o.A) * ccw(A,B,o.B);
T p3p4 = ccw(o.A,o.B,A) * ccw(o.A,o.B,B);
if (p1p2 == 0 && p3p4 == 0) {
pair<T,T> p1(A.y, A.x), p2(B.y,B.x), p3(o.A.y, o.A.x), p4(o.B.y, o.B.x);
if (p1 > p2) swap(p2, p1);
if (p3 > p4) swap(p3, p4);
return p3 <= p2 && p1 <= p4;
}
return p1p2 <= 0 && p3p4 <= 0;
}

pair<bool,Point<ld>> intersection(Line<T> o) {
if(!this->intersection(o)) return {false, {}};
ld det = 1. * (o.B.y-o.A.y)*(B.x-A.x) - 1.*(o.B.x-o.A.x)*(B.y-A.y);
ld t = ((o.B.x-o.A.x)*(A.y-o.A.y) - (o.B.y-o.A.y)*(A.x-o.A.x)) / det;
return {true, {A.y + 1. * t * (B.y - A.y), B.x + 1. * t * (B.x - A.x)}};
}

//@formula for : y = ax + b
//@return {a,b};
pair<ld, ld> formula() {
T y1 = A.y, y2 = B.y;
T x1 = A.x, x2 = B.x;
if(y1 == y2) return {1e9, 0};
if(x1 == x2) return {0, 1e9};
ld a = 1. * (y2 - y1) / (x2 - x1);
ld b = -x1 * a + y1;
return {a, b};
}
};

template<typename T>
struct Circle {
Point<T> center;
Circle() {}

void input() {
center = Point<T>();
center.input();
}

bool circumference(Point<T> p) {
return (center.x - p.x) * (center.x - p.x) + (center.y - p.y) * (center.y - p.y) == radius * radius;
}

bool intersect(Circle<T> c) {
T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
}

bool include(Circle<T> c) {
T d = (center.x - c.center.x) * (center.x - c.center.x) + (center.y - c.center.y) * (center.y - c.center.y);
}
};

ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
all3 __exgcd(ll x, ll y) { if(!y) return {x,1,0}; auto [g,x1,y1] = __exgcd(y, x % y); return {g, y1, x1 - (x/y) * y1}; }
ll __lcm(ll x, ll y) { return x / __gcd(x,y) * y; }
ll modpow(ll n, ll x, ll MOD = mod) { n%=MOD; if(!x) return 1; ll res = modpow(n,x>>1,MOD); res = (res * res) % MOD; if(x&1) res = (res * n) % MOD; return res; }

ll solve(ll n, ll x, ll y, ll a, ll b, ll c) {
ll res = INF;
rep(i,0,min({n,x,y}) + 1) {
ll now = n - i;
if(a <= b) {
ll rem = min((x-i) / 2, now);
now -= rem;
ll cost = now * b + rem * a + i * c;
if((y - i) / 3 >= now) res = min(res, cost);
} else {
ll rem = min((y-i)/3,now);
now -= rem;
ll cost = now * a + rem * b + i * c;
if((x - i) / 2 >= now) res = min(res, cost);
}
}
return res == INF ? -1 : res;
}
int main() {
Code By Sumfi
cout.precision(12);
ll tc = 1;
cin>>tc;
rep(i,1,tc+1) {
ll n,x,y,a,b,c;
cin>>n>>x>>y>>a>>b>>c;
print(solve(n,x,y,a,b,c));
}
return 0;
}``````

## College Life 4 CodeChef Solution in PYTH 3

``````# cook your dish here

from math import inf

for __ in range(int(input())):
n, e, h, a, b, c = map(int, input().split())
min_cost = inf
for chocolate_cake in range(min(n, min(e, h)) + 1):
total_cost = chocolate_cake * c
remaining = n - chocolate_cake
egg = max(0, e - chocolate_cake)
choco_bar = max(0, h - chocolate_cake)
if a < b:
total_cost += min(egg // 2, remaining) * a
remaining -= min(egg // 2, remaining)
total_cost += min(choco_bar // 3, remaining) * b
remaining -= min(choco_bar // 3, remaining)
else:
total_cost += min(choco_bar // 3, remaining) * b
remaining -= min(choco_bar // 3, remaining)
total_cost += min(egg // 2, remaining) * a
remaining -= min(egg // 2, remaining)
if not remaining:
min_cost = min(min_cost, total_cost)

if min_cost == inf:
print(-1)
else:
print(min_cost)``````

## College Life 4 CodeChef Solution in C

``````#include <stdio.h>

int min( int a, int b){
if(a>b){
return b;
}else{return a;}
}
int main(void) {
long long int t;
scanf("%lld",&t);
while(t--){
long long int n,e,h,a,b,c,cost=0,fin=1e18,reqo,reqm,maxo,maxm;
scanf("%lld %lld %lld %lld %lld %lld",&n,&e,&h,&a,&b,&c);
for(int k=0; k<=n; k++){
if(e<k || h<k){
continue;
}else{
maxo=(e-k)/2;
maxm=(h-k)/3;
if((maxo+maxm+k)<n){
continue;
}else{
if(a<b){
reqo=min(maxo,n-k);
reqm=n-reqo-k;
}else{
reqm=min(maxm,n-k);
reqo=n-reqm-k;
}
}
cost=reqo*a+k*c+reqm*b;
if(cost<fin){
fin=cost;
}
}
}
if(fin==1e18){printf("-1\n");}else{printf("%lld\n",fin);}
}
return 0;
}``````

## College Life 4 CodeChef Solution in JAVA

``````/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;
class Solution{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
while(t-- > 0){
int items = sc.nextInt();
int eggs = sc.nextInt();
int chocs = sc.nextInt();
int A = sc.nextInt();
int B = sc.nextInt();
int C = sc.nextInt();
long ans = Long.MAX_VALUE;
for(int c = 0;c<=items;c++){
if(eggs<c || chocs<c) break;
int maxO = (eggs-c)/2;
int maxM = (chocs-c)/3;
int reqO=0;
int reqM=0;
if(c+maxO+maxM < items) continue;
if(A<B){
reqO = Math.min(maxO, items-c);
reqM = (items-c-reqO);
}
else{
reqM = Math.min(maxM, items-c);
reqO = (items-c-reqM);
}
long cost = (long)((long)A*(long)reqO) + (long)((long)B*(long)reqM) + (long)((long)C*(long)c);
ans = Math.min(ans, cost);
}
if(ans == Long.MAX_VALUE){
System.out.println(-1);
}
else System.out.println(ans);
}
}
}``````

## College Life 4CodeChef Solution in PYPY 3

``````from math import inf

for __ in range(int(input())):
n, e, h, a, b, c = map(int, input().split())
min_cost = inf
for chocolate_cake in range(min(n, min(e, h)) + 1):
total_cost = chocolate_cake * c
remaining = n - chocolate_cake
egg = max(0, e - chocolate_cake)
choco_bar = max(0, h - chocolate_cake)
if a < b:
total_cost += min(egg // 2, remaining) * a
remaining -= min(egg // 2, remaining)
total_cost += min(choco_bar // 3, remaining) * b
remaining -= min(choco_bar // 3, remaining)
else:
total_cost += min(choco_bar // 3, remaining) * b
remaining -= min(choco_bar // 3, remaining)
total_cost += min(egg // 2, remaining) * a
remaining -= min(egg // 2, remaining)
if not remaining:
min_cost = min(min_cost, total_cost)

if min_cost == inf:
print(-1)
else:
print(min_cost)``````

## College Life 4 CodeChef Solution in PYTH

``````# cook your code here
t = int(raw_input())
while t > 0:
t -= 1
n, eggs, bars, price_ome, price_milk, price_cake = map(int, raw_input().split(' '))
w_eggs, w_bars = 2, 3
if price_ome > price_milk:
price_ome, price_milk = price_milk, price_ome
w_eggs, w_bars = w_bars, w_eggs
eggs, bars = bars, eggs

ans = 10**18
for cake in range(0, n + 1):
if eggs >= cake and bars >= cake:
used_ome = min(n - cake, (eggs - cake) / w_eggs)
used_milk = min(n - cake - used_ome, (bars - cake) / w_bars)
if cake + used_ome + used_milk == n:
ans = min(ans, cake * price_cake + used_ome * price_ome + used_milk * price_milk)

if ans == 10**18:
ans = -1

print(ans)``````

## College Life 4 CodeChef Solution in C#

``````using System;

public class Test
{
public static void Main()
{
while (t-- > 0)
{
int num_required = Convert.ToInt32(tokens[0]);
int num_eggs = Convert.ToInt32(tokens[1]);
int num_chocs = Convert.ToInt32(tokens[2]);
long per_omlt = Convert.ToInt32(tokens[3]);
long per_mshk = Convert.ToInt32(tokens[4]);
long per_cake = Convert.ToInt32(tokens[5]);

long cost_min = long.MaxValue;

if (num_eggs + num_chocs >= 2 * num_required)
{
for (int num_cakes = Math.Min(num_required, Math.Min(num_eggs, num_chocs)); num_cakes >= 0; --num_cakes)
{
long cost_so_far = num_cakes * per_cake;
int num_further = num_required - num_cakes;

int eggs_left = num_eggs - num_cakes;
int chocs_left = num_chocs - num_cakes;

if (num_further > 0)
{
int num_omlts = Math.Min(num_further, eggs_left / 2);
int num_mshks = Math.Min(num_further, chocs_left / 3);

if (num_omlts + num_mshks < num_further)
continue;

if (per_omlt <= per_mshk)
num_mshks = num_further - num_omlts;
else
num_omlts = num_further - num_mshks;

cost_so_far += num_omlts * per_omlt + num_mshks * per_mshk;
}

if (cost_so_far < cost_min)
cost_min = cost_so_far;
}
}

if (cost_min == long.MaxValue)
Console.WriteLine("-1");
else
Console.WriteLine(cost_min);

}
}
}``````

## College Life 4 CodeChef Solution in GO

``````package main

import (
"bufio"
"bytes"
"fmt"
"math"
"os"
)

func main() {

var buf bytes.Buffer
for tc > 0 {
tc--
res := solve(line[0], line[1], line[2], line[3], line[4], line[5])
buf.WriteString(fmt.Sprintf("%d\n", res))
}
fmt.Print(buf.String())
}

func readUint64(bytes []byte, from int, val *uint64) int {
i := from

var tmp uint64
for i < len(bytes) && bytes[i] >= '0' && bytes[i] <= '9' {
tmp = tmp*10 + uint64(bytes[i]-'0')
i++
}
*val = tmp

return i
}

func readInt(bytes []byte, from int, val *int) int {
i := from
sign := 1
if bytes[i] == '-' {
sign = -1
i++
}
tmp := 0
for i < len(bytes) && bytes[i] >= '0' && bytes[i] <= '9' {
tmp = tmp*10 + int(bytes[i]-'0')
i++
}
*val = tmp * sign
return i
}

for i := 0; i < len(s); i++ {
if s[i] == '\n' {
return s[:i]
}
}
return s
}

return
}

a, b = res[0], res[1]
return
}

a, b, c = res[0], res[1], res[2]
return
}

res := make([]int, n)
x := 0
for i := 0; i < n; i++ {
for x < len(bs) && (bs[x] < '0' || bs[x] > '9') && bs[x] != '-' {
x++
}
}
return res
}

func solve(N int, E int, H int, A, B, C int) int64 {
// x + y + z = N
// 2 * x + z <= E
// 3 * y + z <= H
// x * A + y * B + z * C

var best int64 = math.MaxInt64

for z := 0; z <= N && z <= E && z <= H; z++ {
x := (E - z) / 2
y := (H - z) / 3

if A <= B {
// more x more better
x = min(N-z, x)
y = min(y, max(0, N-z-x))
if x+y+z == N {
best = min2(best, int64(x)*int64(A)+int64(y)*int64(B)+int64(z)*int64(C))
}
} else {
y = min(N-z, y)
x = min(x, max(0, N-z-y))
if x+y+z == N {
best = min2(best, int64(x)*int64(A)+int64(y)*int64(B)+int64(z)*int64(C))
}
}
}

if best == math.MaxInt64 {
return -1
}

return best
}

func min(a, b int) int {
if a <= b {
return a
}
return b
}

func max(a, b int) int {
if a >= b {
return a
}
return b
}

func min2(a, b int64) int64 {
if a <= b {
return a
}
return b
}``````
##### College Life 4 CodeChef Solution Review:

In our experience, we suggest you solve this College Life 4 CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

If you are stuck anywhere between any coding problem, just visit Queslers to get the College Life 4 CodeChef Solution.

Find on CodeChef

##### Conclusion:

I hope this College Life 4 CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Coding Solutions.

This Problem is intended for audiences of all experiences who are interested in learning about Programming Language in a business context; there are no prerequisites.

Keep Learning!