|洛谷|模拟|P1146 硬币翻转

https://www.luogu.org/problem/show?pid=1146

由样例可得，翻转第i次时，第i个硬币不翻，显然最小次数即为n

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define ms(i,j) memset(i, j, sizeof i);
int n;
int f[105];
int main()
{
scanf("%d", &n);printf("%d\n", n);
ms(f, 0);
for (int i=1;i<=n;i++)
{
for (int j=1;j<=n;j++)
if (j!=i) f[j] = !f[j];
for (int j=1;j<=n;j++) printf("%d", f[j]);
putchar('\n');
}
return 0;
}