cf 1104 codeforces round#534(div2) C. Grid game

横快放在二三列，竖快放在第一列

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    cin>>s;
    int flag0=0,flag1=0;
    for(int i=0;s[i];i++)
    {
        if(s[i]=='0')
        {
            if(flag0==0)
            {
                printf("%d %d\n",1,1);
                flag0=1;
            }
            else
            {
                printf("%d %d\n",3,1);
                flag0=0;
            }
        }
        else
        {
            if(flag1==0)
            {
                printf("%d %d\n",1,2);
                flag1++;
            }
            else if(flag1==1)
            {
                printf("%d %d\n",2,2);
                flag1++;
            }
            else if(flag1==2)
            {
                printf("%d %d\n",3,2);
                flag1++;
            }
            else if(flag1==3)
            {
                printf("%d %d\n",4,2);
                flag1=0;
            }
        }
    }
}

 

转载于:https://www.cnblogs.com/lishengkangshidatiancai/p/10307357.html