Hihocoder 1272 买零食(签到)

题意:

中文题意

分析:

$忘记double可以+0.5了,sb了手动解析浮点数$
$数据很小直接暴力C_n^1,C_n^2,C_n^3,更新答案就可以了$

代码:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
//
// Created by TaoSama on 2016-03-13
// Copyright (c) 2016 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define pr(x) cout << #x << " = " << x << " "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n;
int a[55], b[55];
int main() {
#ifdef LOCAL
freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
// freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
int t; scanf("%d", &t);
while(t--) {
scanf("%d", &n);
for(int i = 1; i <= n; ++i) {
char s[100]; scanf("%s%d", s, b + i);
bool have = 0; int x = 0;
for(int j = 0; s[j]; ++j) {
if(s[j] == '.') {
have = true;
if(s[j + 1]) x = x * 10 + s[j + 1] - '0';
else x = x * 10;
break;
}
x = x * 10 + s[j] - '0';
}
if(!have) x = x * 10;
a[i] = x;
}
int ans = 0;
for(int i = 1; i <= n; ++i)
if(a[i] % 50 == 0) ans = max(ans, b[i]);
for(int i = 1; i <= n; ++i)
for(int j = i + 1; j <= n; ++j)
if((a[i] + a[j]) % 50 == 0) ans = max(ans, b[i] + b[j]);
for(int i = 1; i <= n; ++i)
for(int j = i + 1; j <= n; ++j)
for(int k = j + 1; k <= n; ++k)
if((a[i] + a[j] + a[k]) % 50 == 0)
ans = max(ans, b[i] + b[j] + b[k]);
printf("%d\n", ans);
}
return 0;
}


1. 除非注明,本博文即为原创,转载请注明链接地址
2. 本博文只代表博主当时的观点或结论,请不要恶意攻击
3. 如果本文帮到了您,不妨点一下 下面分享到 按钮,让更多的人看到