ECUST 12级 Practise

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=26399#overview

果断开小号水过

CodeForces 58A

#include<string.h>
#include<iostream>
#include<stdio.h>
using namespace std;
char a[]="hello";
char s[];
int main()
{
    while(cin>>s)
    {
        int k=;
        for(int i=;i<strlen(s);i++)
        {
            if(s[i]==a[k])
            k++;
        }
        if(k==)
        printf("YES\n");
        else
        printf("NO\n");
    }
    return ;
}

CodeForces 58B

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        if(n==)
        {
            printf("1\n");
            continue;
        }
        int k=n;
        printf("%d ",n);
        while(n--)
        {
            if(n==)
            break;
            if(k%n==)
            {printf("%d ",n);k=n;}
        }
        printf("1\n");
    }
    return ;
}

CodeForces 216B

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<math.h>
#define MAXN 110
#define clr(a,b); memset(a,b,sizeof(a));
using namespace std;
int n,m;
int a,b;
int p[MAXN];
int circle[MAXN];
int sum;
int num[MAXN];
int find(int x)
{
    return x==p[x]?x:find(p[x]);
}
int main()
{
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        sum=;
        clr(circle,);
        clr(num,);
        int k=;
        for(int i=;i<n;i++)
        p[i]=i;
        for(int i=;i<m;i++)
        {
            scanf("%d%d",&a,&b);
            int x=find(a);
            int y=find(b);
            if(x!=y)
            p[x]=y;
            else
            circle[k++]=x;
        }
        for(int i=;i<=n;i++)
        {
            num[find(i)]++;
        }
        for(int i=;i<k;i++)
        {
            int tmp=find(circle[i]);
            if(num[tmp]%==)
            sum++;
        }
        if((n-sum)%==) sum++;
        printf("%d\n",sum);
    }
    return ;
}

HDU 4475

#include<stdio.h>
#include<math.h>
#define MAXN 1000003
using namespace std;
long long a[MAXN];
long long n;
int main()
{
    a[]=;
    for(int i=;i<MAXN;i++)
    {
        a[i]=a[i-]*i*%MAXN;
    }
    int t;
    while(scanf("%d",&t)!=EOF)
    {
        while(t--)
        {
            scanf("%I64d",&n);
            if(n>=MAXN)
            printf("0\n");
            else
            printf("%I64d\n",a[n]);
        }
    }
    return ;
}

CodeForces 58C

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int n;
int tmp;
int x[];
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        memset(x,,sizeof(x));
        for(int i=;i<n;i++)
        {
            scanf("%d",&tmp);
            if(i<=(n+)/-)
            {
            if((tmp-i)<)
            continue;
            x[tmp-i]++;
            }
            else
            {
            if((tmp-n++i)<)
            continue;
            x[tmp-n++i]++;
            }
        }
        sort(x+,x+);
        printf("%d\n",n-x[]);
    }
    return ;
}

POJ 2632

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
struct node
{
    int x;
    int y;
    int dir;
}robot[];
struct node1
{
    int rob;
    char action;
    int repeat;
}move[];

int A,B;int N,M;char tmp;
int dy[]={,,-,};
int dx[]={,,,-};
int map[][];
int flag;

void judge(int num,int x,int y)
{
    if(x<=||x>A||y<=||y>B)
    {
        printf("Robot %d crashes into the wall\n",num);
        flag=;return;
    }
    if(map[x][y]==)
    {
        map[x][y]=num;
        return;
    }
    else
    {
        printf("Robot %d crashes into robot %d\n",num,map[x][y]);
        flag=;return;
    }

}
int main()
{
    int t;
    while(scanf("%d",&t)!=EOF)
    {

        while(t--)
        {
            flag=;
            memset(map,,sizeof(map));
            scanf("%d%d",&A,&B);
            scanf("%d%d",&N,&M);
            for(int i=;i<=N;i++)
            {
                cin>>robot[i].x>>robot[i].y>>tmp;
                map[robot[i].x][robot[i].y]=i;
                if(tmp=='N')
                robot[i].dir=;
                else if(tmp=='E')
                robot[i].dir=;
                else if(tmp=='S')
                robot[i].dir=;
                else if(tmp=='W')
                robot[i].dir=;
            }
            for(int i=;i<=M;i++)
            {
                cin>>move[i].rob>>move[i].action>>move[i].repeat;
            }
            for(int i=;i<=M;i++)
            {
                if(move[i].action=='F')
                {
                    for(int j=;j<move[i].repeat;j++)
                    {
                        map[robot[move[i].rob].x][robot[move[i].rob].y]=;
                        robot[move[i].rob].x+=dx[robot[move[i].rob].dir];
                        robot[move[i].rob].y+=dy[robot[move[i].rob].dir];
                        judge(move[i].rob,robot[move[i].rob].x,robot[move[i].rob].y);
                        if(flag==)
                        break;
                    }
                    if(flag==)
                    break;
                }
                if(move[i].action=='L')
                {
                    for(int j=;j<move[i].repeat;j++)
                    {
                        robot[move[i].rob].dir-=;
                        if(robot[move[i].rob].dir==-)
                        robot[move[i].rob].dir=;
                    }
                }
                if(move[i].action=='R')
                {
                    for(int j=;j<move[i].repeat;j++)
                    {
                        robot[move[i].rob].dir+=;
                        robot[move[i].rob].dir%=;
                    }
                }
            }
            if(flag==)
            printf("OK\n");
        }
    }
    return ;
}