>Link
luoguP7556
>Description
>解题思路
直接暴力选择+高斯消元判断,暴力判重
(我打的暴力判断+map判重才20分,暴力判断+暴力判重就70分了,果然暴力才是yyds😅
>代码
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define LL long long
#define db double
using namespace std;
const int x[4][3] = {
{
1, 1, 0}, {
1, 0, 1}, {
0, 1, 1}, {
1, 1, 1}};
int T, n;
LL A[10], ans, p[10], pp[10], k[10], ansk[1000000][3];
db a[10][10];
bool check ()
{
for (int i = 0; i < 3; i++) k[i] = p[i];
memset (a, 0, sizeof (a));
for (int i = 0; i < 4; i++)
{
if (pp[i]