码迷,mamicode.com
首页 > 其他好文 > 详细

URAL 2066 Simple Expression (水题,暴力)

时间:2016-08-22 21:27:18      阅读:147      评论:0      收藏:0      [点我收藏+]

标签:

题意:给定三个数,让你放上+-*三种符号,使得他们的值最小。

析:没什么好说的,全算一下就好。肯定用不到加,因为是非负数。

代码如下:

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <string>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cstring>
#include <set>
#include <queue>
#include <algorithm>
#include <vector>
#include <map>
#include <cctype>
#include <cmath>
#include <stack>
#define frer freopen("in.txt", "r", stdin)
#define frew freopen("out.txt", "w", stdout)
using namespace std;

typedef long long LL;
typedef pair<int, int> P;
const int INF = 0x3f3f3f3f;
const double inf = 0x3f3f3f3f3f3f;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int maxn = 8;
const int mod = 1e9 + 7;
const char *mark = "+-*";
const int dr[] = {-1, 0, 1, 0};
const int dc[] = {0, 1, 0, -1};
int n, m;
const int mon[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int monn[] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
inline int Min(int a, int b){ return a < b ? a : b; }
inline int Max(int a, int b){ return a > b ? a : b; }
inline LL Min(LL a, LL b){ return a < b ? a : b; }
inline LL Max(LL a, LL b){ return a > b ? a : b; }
inline bool is_in(int r, int c){
    return r >= 0 && r < n && c >= 0 && c < m;
}

int main(){
    int a, b, c;
    while(scanf("%d %d %d", &a, &b, &c) == 3){
        int ans = a - b * c;
        ans = Min(ans, b - a * c);
        ans = Min(ans, c - a * b);
        ans = Min(ans, a - b - c);
        ans = Min(ans, b - a - c);
        ans = Min(ans, c - b - a);
        printf("%d\n", ans);
    }
    return 0;
}

  

  

URAL 2066 Simple Expression (水题,暴力)

标签:

原文地址:http://www.cnblogs.com/dwtfukgv/p/5796787.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!