good,十分

P1319 压缩技术

Cossack @ 2024-07-22 15:06:37


by pmkmzfuzsotqotmzs @ 2024-07-23 16:58:27

@Cossack

#include<iostream>
#include<string>
using namespace std;
int main()
{

    int n,k;
    cin >> n;
    int a=0;
    int b[40001];
    int c=1;
    while (cin >> k)
    {
        for(int i=1;i<=k;i++)
        {
            b[c]=a;
            c++;
        }
        a = !a;
    }
    for(int i=1;i<c;i++)
    {
        cout<<b[i];
        if(i%n==0)
            cout<<endl;
    }
    return 0;
}

|