AcWing 3544. 寻找变化前的01序列
原题链接
简单
作者:
CYHMMZDAN
,
2023-03-23 23:58:10
,
所有人可见
,
阅读 142
import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;
public class Main {
static long[] a=new long[1000005];
static long[] b=new long[1000005];
static int[] c=new int[200005];
static int[] d=new int[500005];
static int[] e=new int[200005];
static int[] f=new int[200005];
static int t=520;
static int ans=0;
static int max=-1;
static int min=(int)2e+9;
static int n=0;
static int m=0;
static int sum=0;
static int l=0;
static int r=0;
static HashMap<Integer,Integer> map=new HashMap<>();
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
while(n-->0) {
String s=sc.next();
ans=0;
for(int i=0;i<s.length();i++) {
if(s.charAt(i)=='1') {
ans++;
System.out.print(s.charAt(i));
}
else {
ans=0;
System.out.print(s.charAt(i));
}
if (ans==5) {
i++;
ans=0;
}
}
System.out.println();
}
}
}