很显然一道模拟,但是空格、回车什么的很麻烦
由于string处理比较慢,所以我之前用char打的,本地测试全都对,但是WA20
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,p,k,s;
char x[100001][10],xx[100001][10];
int main()
{
// freopen("wa.txt","w",stdout);
scanf("%lld%lld%lld%lld",&n,&k,&m,&p);
if(k<n*4)
{
printf("Error:cards not enough");
exit(0);
}
k=k/2*2;
for(int i(1);i<=k;i++)
{
x[i][1]=getchar();
while(x[i][1]==' '||x[i][1]=='\n'||x[i][1]=='\r')
x[i][1]=getchar();
int j(1);
while(1)
{
j++;
x[i][j]=getchar();
if(x[i][j]=='\n')
break;
}
}
while(m--)
{
if(k%2==0)
for(int i(1);i<=k;i++)
{
if(i%2==1)
for(int j(1);j<=5;j++)
xx[i][j]=x[(k/2+(i+1)/2)][j];
else
for(int j(1);j