2012年北京邮电大学网研考研机试试题及答案

#include<bits/stdc++.h>
using namespace std;
/*
2
a
absd
b
bbssb
*/
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        char a;
        cin>>a;
        string s;
        cin>>s;
        int num=0;
        for(int i=0;i<s.length();i++)
        {
            if(s[i]==a)
            {
                num++;
            }
        }
        printf("%d\n",num);
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
/*
感觉是层次遍历
2
4 5
2 1
3 1
4 2
5 4

1 2
2 1
*/
//没有用树的结构
typedef struct
{
    int lchild,rchild;
    int father;
} A;

void level_order(A t[],int num)
{
    queue<int>q;
    q.push(num);
    int get=num;
    int key=num;
    while(!q.empty())
    {
        int n=q.front();
        q.pop();
        if(t[n].lchild!=0)
        {
            q.push(t[n].lchild);
            key = t[n].lchild;
        }
        if(t[n].rchild!=0)
        {
            q.push(t[n].rchild);
            key=t[n].rchild;
        }
        if(n==get)
        {
            get = key;
            cout<<n<<endl;
        }
        else
        {
            cout<<n<<" ";
        }
    }
}

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int N,M;
        cin>>N>>M;
        A t[M+1];
        for(int i=1; i<=M; i++)
        {
            t[i].lchild=0;
            t[i].rchild=0;
            t[i].father=0;
        }
        while(N--)
        {
            int a,b;
            cin>>a>>b;
            if(t[b].lchild!=0)
            {
                t[b].rchild=a;
            }
            else
            {
                t[b].lchild=a;
            }
            t[a].father=b;
        }
        //找根节点
        int num=1;
        while(t[num].father!=0)
        {
            num = t[num].father;
        }
        //层次遍历
        level_order(t,num);
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
/*
3
59.64.130.18
1.23.45.678
f.a.t.e
*/

int string_to_int(string s)
{
    int len = s.length();
    int sum = 0;
    for(int i=len-1;i>=0;i--)
    {
        if(s[i]-'0'>9||s[i]-'0'<0)
            return -1;
        int num=i;
        int key=1;
        while(num--)
        {
            key*=10;
        }
        sum+=(s[len-i-1]-'0')*key;
    }
    return sum;
}

int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        string s;
        cin>>s;
        int len = s.length();
        string s1="";
        string s2="";
        string s3="";
        string s4="";
        int num=0;
        for(int i=0; i<len; i++)
        {
            if(num==0&&s[i]!='.')
            {
                s1+=s[i];
                continue;
            }
            if(num==0&&s[i]=='.')
            {
                num=1;
                continue;
            }
            if(num==1&&s[i]!='.')
            {
                s2+=s[i];
                continue;
            }
            if(num==1&&s[i]=='.')
            {
                num=2;
                continue;
            }
            if(num==2&&s[i]!='.')
            {
                s3+=s[i];
                continue;
            }
            if(num==2&&s[i]=='.')
            {
                num=3;
                continue;
            }
            if(num==3)
            {
                s4+=s[i];
                continue;
            }
        }
//        const char *p1  = s1.c_str();
//        int f1 = atoi(p1);
          int f1=string_to_int(s1);
          int f2=string_to_int(s2);
          int f3=string_to_int(s3);
          int f4=string_to_int(s4);

        if((f1>=0&&f1<=255)&&(f2>=0&&f2<=255)&&(f3>=0&&f3<=255)&&(f4>=0&&f4<=255))
        {
            cout<<"Yes"<<endl;
        }
        else{
            cout<<"No"<<endl;
        }
    }
    return 0;
}

不会