[5] csp simulation game Shopping (shopping.cpp) - General

　　Polynomials, because every time the same x, so the sum of a and b on the line, and then find the symmetry axis, the axis of symmetry to find the nearest whole point away, but I wrote a violent, did not see x

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
const int N = 100005;
inline int read()
{
	int x = 0 , f = 1;	char ch = getchar();
	while(ch < '0' || ch > '9')	{if(ch == '-')	f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') {x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();}
	return x * f;
}
int T , n , m;
long long a , b , c;
int main()
{
	freopen("shopping.in","r",stdin);
	freopen("shopping.out","w",stdout);
	T = read();
	while(T --> 0)
	{
		a = 0; b = 0; c = 0;
		n = read(); m = read();
		for(int i = 1;i <= n;i ++) {a += read(); b += read(); c += read();}
		double tmp = (double)b / ((double)a * (double)(-2));
		tmp = max(tmp,(double)1); tmp = min(tmp,(double)m);
		double res = floor(tmp);
		printf("%d\n",(tmp - res) < 0.50000000 ? (int)res : (int)res + 1);
	}
	fclose(stdin);
	fclose(stdout);
	return 0;
}