NOIP模拟水题集锦

大蒟蒻又来水题啦

NOIP2016玩具谜题

#include<stdio.h>
#include<string>
#include<iostream>
using namespace std;
int n,m;
struct toy
{
    int dir;
    string name;
};
struct order
{
    int dir;
    int num;
};
toy toys[100005];
order orders[100005];
int main()
{
    scanf("%d%d",&n,&m);
    int i;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&toys[i].dir);
        cin>>toys[i].name;
    }
    for(i=1;i<=m;i++)
        scanf("%d%d",&orders[i].dir,&orders[i].num);
    int now = 1;
    for(i=1;i<=m;i++)//0 in 1 out 0 left 1 right
    {
        if(orders[i].dir)//right
        {
            if(toys[now].dir)//out
            {
                now-= orders[i].num;
                if(now<=0)now+=n;
            }
            else//in
            {
                now+=orders[i].num;
                if(now>n) now-=n;
            }
        }
        else//left
        {
            if(toys[now].dir)
            {
                now+=orders[i].num;
                if(now>n) now-=n;
            }
            else
            {
                now-= orders[i].num;
                if(now<=0)now+=n;
            }
        }
    }
    cout<<toys[now].name;
    return 0;
}

NOIP2015神奇的幻方

#include<stdio.h>
int hf[40][40],n,n2;
int main()
{
    scanf("%d",&n); n2 = n*n;
    hf[1][(n>>1)+1] = 1;
    int prex = 1,prey = (n>>1)+1;
    int nowx,nowy;
    int i,j;
    for(i=2;i<=n2;i++)
    {
        if(prex==1&&prey!=n)
        {nowx=n;nowy=prey+1;}
        else if(prey==n&&prex!=1)
        {nowy=1;nowx=prex-1;}
        else if(prex==1&&prey==n)
        {nowx=2;nowy=n;}
        else if(prex!=1&&prey!=n)
        {
            if(!hf[prex-1][prey+1])
            {nowx=prex-1;nowy=prey+1;}
            else{nowx=prex+1;nowy=prey;}
        }
        hf[nowx][nowy] = i;
        prex = nowx;prey = nowy;
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            printf("%d ",hf[i][j]);
        printf("
");
    }
    return 0;
}