백준 15726번: 이칙연산

https://www.acmicpc.net/problem/15726

1. 문제

곱셈과 나눗셈을 각 1회 사용하여 가장 큰 값을 출력하는 문제

2. 알고리즘

키워드 - 사칙연산, 부동소수점

* 자료형 범위 조심 할 것

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
 
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
double max(double a,double b)
{
    if(a>b)return a;
    else return b;
}
 
int main() {
 
    //cin.tie(0);
    //std::ios::sync_with_stdio(false);
 
    vector<ll> arr(3);
 
    for (int i=0; i<3; i++) {
        cin >> arr[i];
    }
 
    printf("%lld",(long long)max((double) arr[0] * arr[1] / arr[2],(double)arr[0] / arr[1] * arr[2]));
 
    return 0;
}

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
 
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    vector<ll> arr(3);
 
    for (int i=0; i<3; i++) {
        cin >> arr[i];
    }
    
    ll sol_a = (double)arr[0] * arr[1] / arr[2];
    ll sol_b = (double)arr[0] / arr[1] * arr[2];
 
    cout << max(sol_a, sol_b) << CENDL;
 
    return 0;
}