baoshuo/S2OJ
baoshuo/S2OJ
1
1
Fork 0
mirror of https://github.com/renbaoshuo/S2OJ.git synced 2024-11-22 11:38:42 +00:00
Code Issues Actions Packages Releases Activity

chore(judger/formatter): sync from uoj.ac

Browse Source
This commit is contained in:
Baoshuo Ren 2022-11-07 14:03:47 +08:00
parent eecd40efd8
commit 64603588bb
Signed by: baoshuo
GPG Key ID: 00CB9680AB29F51A
1 changed files with 24 additions and 47 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

69
judger/uoj_judger/run/formatter.cpp
View File

@ -1,55 +1,32 @@
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long LL;
int main()
{
//freopen("1.in","r",stdin);
char c,last;
int nSpace=0,nR=0,first;
while(1)
{
last=c,c=getchar();
if(c==EOF)
{
if(last!='\n')
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
int main() {
int c = '?', last;
std::string buf;
while (true) {
last = c;
c = getchar();
if (c == EOF) {
if (last != '\n') {
putchar('\n');
}
break;
} else if (c == ' ' || c == '\r') {
buf.push_back((char)c);
} else {
if (!buf.empty()) {
if (c != '\n') {
printf("%s", buf.c_str());
}
else if(c!='\r'&&c!=' ')
{
if(c!='\n'&&first==0)
{
for(int j=1;j<=nSpace;++j)
putchar(' ');
for(int j=1;j<=nR;++j)
putchar('\r');
buf.clear();
}
else if(c!='\n')
{
for(int j=1;j<=nR;++j)
putchar('\r');
for(int j=1;j<=nSpace;++j)
putchar(' ');
}
nSpace=nR=0;
putchar(c);
}
else if(c==' ')
{
++nSpace;
if(nR==0)
first=0;
}
else
{
++nR;
if(nSpace==0)
first=1;
}
}
return 0;
}