• 洛谷P1563 玩具谜题 简单模拟


    没意义,注意方向别判错。
    Code:

    #include<cstdio>
    #include<cstring>
    using namespace std;
    const int maxn = 100000 + 3;
    char A[maxn][100];
    int face[maxn];
    int main()
    {
       // freopen("in.txt","r",stdin);
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i = 0;i < n; ++i)
        {
            scanf("%d",&face[i]);
            scanf("%s",A[i]);
        }
        int cur = 0;
        while(m--)
        {
            int a,s;
            scanf("%d%d",&a,&s);
            int flag = (face[cur] + a) % 2;
            if(flag == 1) cur = (cur + s + n) % n;
            if(flag == 0) cur = (cur - s + n) % n;
        }
        for(int i = 0;i < strlen(A[cur]); ++i)printf("%c",A[cur][i]);
        return 0;
    }
  • 相关阅读:
    礼物
    Hibernate 笔记 HQL查询 条件查询,聚集函数,子查询,导航查询
    Hibernate get 和 load区别
    JS
    JS
    JS
    JS
    JS
    JS
    JS
  • 原文地址:https://www.cnblogs.com/guangheli/p/9845174.html
Copyright © 2020-2023  润新知