304 North Cardinal St.
Dorchester Center, MA 02124

# Dinner by Candlelight CodeChef Solution

## Dinner by Candlelight CodeChef Solution in C++17

``````#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main() {
int t;
cin >> t;
while(t--)
{
ll a,y,x;
cin >> a >> y >> x;

if(a >= y)
cout << y*x;
else
cout << a*x+1;
cout << endl;
}
return 0;
}``````

## Dinner by Candlelight CodeChef Solution in C++14

``````#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main()
{
ll t;
cin>>t;
while(t--)
{
ll a,y,x;
cin>>a>>y>>x;
if(a>=y)
{
if(y==1)
{
cout<<x<<endl;
}
else
{
if(a==1)
{
cout<<x+1<<endl;
}
else
{
cout<<y*x<<endl;
}
}
}
else
{
cout<<1+a*x<<endl;
}
}
}``````

## Dinner by Candlelight CodeChef Solution in PYTH 3

``````# cook your dish here
for _ in range(int(input())):
a,y,x = map(int,input().split())
if a>=y:
print(x*y)
else:
print(x*a+1)``````

## Dinner by Candlelight CodeChef Solution in C

``````#include <stdio.h>
#include<math.h>
int main(void) {int t;
scanf("%d",&t);
for(int i=0;i<t;i++)
{
long long int a,y,x,c;
scanf("%lld%lld%lld",&a,&y,&x);
if(y<a)
{c=x*(y);
printf("%lld\n",c);
continue;
}
if(y>a)
{printf("%lld\n",x*a+1);
continue;}
if(y==a)
printf("%lld\n",x*a);
}
return 0;
}
``````

## Dinner by Candlelight CodeChef Solution in JAVA

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

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
public static void main (String[] args) throws java.lang.Exception
{
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();

while(t-- > 0 ){
long a = sc.nextInt();
long y = sc.nextInt();
long x = sc.nextInt();

long ans = 0;
if(a<y){
ans = a*x + 1;
}else{
ans = y*x;
}

System.out.println(ans);
}
}
}``````

## Dinner by Candlelight CodeChef Solution in PYPY 3

``````for t in range(int(input())):
a, y, x = map(int, input(). split())
if a >= y:
print(x * y)
else:
print(a * x + 1)``````

## Dinner by Candlelight CodeChef Solution in PYTH

``````t = int(raw_input())
for i in range(t):
st = raw_input().split()
A = int(st[0])
Y = int(st[1])
X = int(st[2])
if A >= Y:
r = X*Y
else:
r = A*X +1
# endif
print r
# endfor i
``````

## Dinner by Candlelight CodeChef Solution in C#

``````//Author: wolvie_logan
//Convert.ToInt32 (int), Convert.ToInt64 (long), Convert.TocChar(), Convert.ToBoolean, Convert.ToDouble, Convert.ToString(variable)
//var input = Console.ReadLine().Split(); int A = int.Parse(input[0])
//Console.WriteLine(\$"{0} {1}", _0, _1)
//str.IndexOf(), str.ToCharArray(), str.Substring(index,length), string.Join(delimiter, charArray), string.concat(arr)
//datatype[] arr = {}; foreach (datatype var in arr) {}
//return new int[] {c1,c2,c3};
//2D array => type[,] identifier = <new type[,]> {{},{}}
//Array.Sort(arr), Array.Reverse(arr); Math.Min(), Math.Max()
//foreach(KeyValuePair<string, string> kvp in myDict){ (kvp.Key, kvp.Value) }; .Count(), .Add(K,V), .ContainsKey(K), .Remove(K)

using System;
using System.Linq; //arr.Max(), arr.Min(), arr.Sum(), arr.Length
using System.Collections; //ArrayList
using System.Collections.Generic; //Dictionary<TK,TV>, List<T>, HashSet<T>

//list.Add(E), .Contains(E), .ElementAt(index), .Insert(index_Int32,E), .Remove(E), .RemoveAt(index)
//list.Reverse(), .Reverse(index,count), .Sort(), .ToArray(), .ToString(), .Count()

public class Test {
public static void Main()
{
for(var test=0; test < TestCases ; test++){
long A = long.Parse(input[0]), Y = long.Parse(input[1]), X = long.Parse(input[2]);
Console.WriteLine(A == Y ? X * A : (A > Y ? X * Y : X * A + 1));
}
}
}``````

## Dinner by Candlelight CodeChef Solution in GO

``````package main

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

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
}

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 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 main() {

var buf bytes.Buffer

for tc > 0 {
tc--
res := solve(A, Y, X)
buf.WriteString(fmt.Sprintf("%d\n", res))
}

fmt.Print(buf.String())
}

func solve(A, Y, X int) int64 {
if A < Y {
return int64(A)*int64(X) + 1
}
return int64(X) * int64(Y)
}``````
##### Dinner by Candlelight CodeChef Solution Review:

In our experience, we suggest you solve this Dinner by Candlelight 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 Dinner by Candlelight CodeChef Solution.

Find on CodeChef

##### Conclusion:

I hope this Dinner by Candlelight 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!