//
// Created by Sween'e'y on 2022/8/6.
//
//P1089 [NOIP2004 提高组] 津津的储蓄计划
//
// Created by Sween'e'y on 2022/8/6.
//
//P5725 【深基4.习8】求三角形
#include <iostream>
#include <iostream>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <climits>
#include <string>
#include <cstring>
using namespace std;
template<class T>
int length(T &array) {
return sizeof(array) / sizeof(array[0]);
}
bool is_prime[100007];
void ai() {
for (int i = 2; i <= 100000; i++) {
is_prime[i] = 1;
}
for (int i = 2; i <= 100000; i++) {
if (is_prime[i]) {
for (int j = 2 * i; j <= 100000; j += i) {
is_prime[j] = 0;
}
}
}
}
int numberInversion(int x) {
int num = 0;
while (x != 0) {
num = num * 10 + x % 10;
x /= 10;
}
return num;
}
int main() {
int budget, sum_money = 0, reserve_money = 0;//自己手中的钱 存的钱
for (int i = 1; i <= 12; i++) {
scanf("%d", &budget);
sum_money += 300;
if (sum_money < budget) {
printf("%d", -i);
return 0;
}
//减去花销
sum_money -= budget;
if (sum_money >= 100) { //这步也可以不用写 可以直接写下面的语句 逻辑理解下面的
reserve_money = reserve_money + (sum_money / 100) * 100;
sum_money %= 100;//不能写减去reserve_money 因为是存下的钱,也会减去之前的,不是这次的
}
}
printf("%d", (int) (reserve_money * 1.2 + sum_money));
return 0;
}
P1089 [NOIP2004 提高组] 津津的储蓄计划
于 2022-08-06 21:47:39 首次发布