简单数学算法

解题思路:

注意事项:

参考代码:

#include <iostream>

using namespace std;

#include <iomanip>

#include <cmath>

int main()

{

int yusuan[13];

int change =0;

int mom_change = 0;

bool flag = 1;

for (int i = 1;i <= 12;i++)

{

cin >> yusuan[i];

}

for (int i = 1;i <= 12;i++)

{

if (yusuan[i] <= 300)

{

change += (300 - yusuan[i]);

if (change >= 100)

{

mom_change += (change / 100) * 100;

change = change - (change / 100) * 100;

}

}

else if(yusuan[i] > (change + 300)) {

cout << "-"<<i;

flag = 0;

break;

}

else if(yusuan[i] <= (change + 300)&& (yusuan[i]>300)) {

change -= (yusuan[i] - 300);

}

}

if(flag)

cout << (mom_change) * 1.2 + change<< endl;

return 0;

}