HJ31~HJ40 华为机试题库

HJ31 单词倒排

题目：https://www.nowcoder.com/practice/81544a4989df4109b33c2d65037c5836?tpId=37&tqId=38366&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
using namespace std;
string s[10010];
char c;
int cnt=0;
bool DX(char c){
    if(c>='A'&&c<='Z')return 1;
    return 0;
}
bool XX(char c){
    if(c>='a'&&c<='z')return 1;
    return 0;
}
void init(){
    c=getchar();
    while(c!='\n'){
        while(!DX(c)&&!XX(c))c=getchar();
        cnt++;
        while(DX(c)||XX(c)){
            s[cnt]+=c;
            c=getchar();
        }
    }
    return;
}
void Output(){
    for(int i=cnt;i>=1;i--)
        cout<<s[i]<<" ";
    return;
}
int main(){
    init();
    Output();
    return 0;
}

 HJ32 密码截取

题目：https://www.nowcoder.com/practice/3cd4621963e8454594f00199f4536bb1?tpId=37&tqId=21255&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

题目范围n才2500，随便什么暴力都能做。（谢谢华为，你真善良）（如果是pdd你就等着写manacher吧）但是我顺便拿来当manacher模板题了。manacher效率是O(n)的。

这道题作为manacher模板题单独发了一篇博客。里面详细讲解了manacher算法。传送门：Manacher算法讲解||HJ32 密码截取

#include<bits/stdc++.h>
using namespace std;
string Preprocess(const string&s){
    string t;
    if(s.empty()){
        t="^$";
        return t;
    }
    t="^";
    int n=s.size();
    for(int i=0;i<n;i++)
        t=t+'#'+s[i];
    t=t+"#$";
    return t;
}
int Manacher(const string&t){
    int n=t.size();
    vector<int>p(n,0);
    int R=0,C=0;
    for(int i=1;i<n;i++){
        int mirr=C*2-i;//mirror
        if(R>i) p[i]=min(R-i,p[mirr]);
        while(t[i+p[i]+1]==t[i-p[i]-1]) p[i]++;
        if(i+p[i]>R){
            R=i+p[i];
            C=i;
        }
    }
    int ans=0;
    for(int i=1;i<n;i++) ans=max(ans,p[i]);
    return ans;
}
int main(){
    string s,t;
    cin>>s;
    t=Preprocess(s);
    cout<<Manacher(t);
    return 0;
}

 HJ33 整数与IP地址间的转换

题目：https://www.nowcoder.com/practice/66ca0e28f90c42a196afd78cc9c496ea?tpId=37&tqId=21256&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
    string s; cin>>s;
    ll n;     cin>>n;
    ll sum=0;
    for(int i=1;i<=4;i++){
        string sub=s.substr(0,s.find('.'));
        int t=stoi(sub);
        sum=(sum<<8)+t;
        s.erase(0,s.find('.')+1);
    }
    cout<<sum<<endl;
    int cnt=0,ans[5];
    for(int i=1;i<=4;i++){
        ans[++cnt]=n&((1<<8)-1);
        n>>=8;
    }
    for(int i=cnt;i>1;i--)cout<<ans[i]<<".";
    cout<<ans[1];
}

 HJ34 图片整理

题目：https://www.nowcoder.com/practice/2de4127fda5e46858aa85d254af43941?tpId=37&tqId=21257&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
using namespace std;
int main(){
    string s;cin>>s;
    sort(s.begin(),s.end());
    cout<<s;
}

 HJ35 蛇形矩阵

题目：https://www.nowcoder.com/practice/649b210ef44446e3b1cd1be6fa4cab5e?tpId=37&tqId=21258&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,cnt=0;
    cin>>n;
    vector<vector<int> >arr(n+1,vector<int>(n+1));
    for(int i=1;i<=n;i++){
        int x=i,y=1;
        for(;y<=i;y++,x--)
            arr[x][y]=++cnt;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n-i+1;j++)
            cout<<arr[i][j]<<" ";
        cout<<'\n';
    }
}

 HJ36 字符串加密

题目：https://www.nowcoder.com/practice/e4af1fe682b54459b2a211df91a91cf3?tpId=37&tqId=21259&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
using namespace std;
char key[110],mp[300];
bool book[300];
int main(){
    cin>>key;
    int l=strlen(key),now;
    now='a';
    for(int i=0;i<l;i++){
        if(book[(int)key[i]]==0){
            book[(int)key[i]]=1;
            mp[now]=key[i];
            now++;
        }
    }
    int cnt=0;
    for(int c='a';c<='z';c++){
        if(book[c]==0)mp[now++]=c,cnt++;
    }
    string s;
    cin>>s;
    for(auto i:s){
        cout<<mp[i];
    }
}

 HJ37 统计每个月兔子的总数

题目：https://www.nowcoder.com/practice/1221ec77125d4370833fd3ad5ba72395?tpId=37&tqId=21260&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

就是硬模拟，sum[i]表示第i天的总数，lao[i]表示截至第i天的老兔子数，cha1[i]表示差一个月成年的兔子数，cha2[i]表示差2个月成年的兔子数。

#include<bits/stdc++.h>
using namespace std;
long long sum[32],cha1[32],cha2[32],lao[32];
int main(){
    int n;
    cin>>n;
    sum[1]=sum[2]=1;
    cha2[1]=1;
    cha1[2]=1;
    for(int i=3;i<=n;i++){
        lao[i]=lao[i-1]+cha1[i-1];
        cha1[i]=cha2[i-1];
        cha2[i]=lao[i];
        sum[i]=lao[i]+cha1[i]+cha2[i];
    }
    cout<<sum[n];
}

 HJ38 求小球落地5次后所经历的路程和第5次反弹的高度

https://www.nowcoder.com/practice/2f6f9339d151410583459847ecc98446?tpId=37&tqId=21261&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
using namespace std;
void Work(int n){
    double h=n,sum=h;
    for(int i=1;i<=5;i++){
        h/=2;
        if(i!=5)sum+=2*h;
    }
    cout<<sum<<endl<<h;
}
int main(){
    int n;cin>>n;
    Work(n);
}

 HJ39 判断两个IP是否属于同一子网

https://www.nowcoder.com/practice/34a597ee15eb4fa2b956f4c595f03218?tpId=37&tqId=21262&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
using namespace std;
char s[3][20];
int num[3][10],cnt[3];
void init(){
    for(int i=0;i<3;i++)
        scanf("%s",s[i]);
    return;
}
int Work(int a,int b){
    int x=0,i=a,j=b,f=1;
    while(s[i][j]<'0'||s[i][j]>'9'){
        if(s[i][j]=='-')f=-1;
        j++;
    }
    while(s[i][j]>='0'&&s[i][j]<='9'){
        x=x*10+s[i][j]-'0';
        j++;
    }
    return f*x;
}
void GetNum(){
    for(int i=0;i<3;i++){
        int l=strlen(s[i]);
        for(int j=0;j<l;j++)
            if(s[i][j]=='-'||(s[i][j]>='0'&&s[i][j]<='9')){
                if(j==0||(s[i][j-1]<'0'||s[i][j-1]>'9')){
//                    printf("!%c",s[i][j]);
                    num[i][++cnt[i]]=Work(i,j);
//                    printf("%d ",num[i][cnt[i]]);
                }
            }
    }
    return;
}
bool Check3(){
    int e[40],cnt=0;
    for(int i=1;i<=4;i++){
        for(int j=7;j>=0;j--){
            int t=1<<j;
            cnt++;
            if(t&num[0][i]) e[cnt]=1;
            else e[cnt]=0;
        }
    }
    if(e[1]==0||e[cnt]==1)return 0;
    for(int i=2;i<=cnt;i++)
        if(e[i]==1&&e[i-1]==0)return 0;
    return 1;
}
bool Check(){
    for(int i=0;i<3;i++)
        if(cnt[i]!=4)return 0;
    for(int i=0;i<3;i++)
        for(int j=1;j<=4;j++)
            if(num[i][j]<0||num[i][j]>255)return 0;
    if(!Check3())return 0;
    return 1;
}
bool CheckZW(){
    for(int i=1;i<=4;i++){
        int a=num[1][i]&num[0][i];
        int b=num[2][i]&num[0][i];
//        printf("%d %d\n",a,b);
        if(a!=b)return 0;
    }
    return 1;
}
int main(){
    init();
//    puts("OK");
    GetNum();
    if(!Check()){
        puts("1");
        return 0;
    }
    if(CheckZW()){
        puts("0");
    }
    else puts("2");
    return 0;
}

 HJ40 统计字符

https://www.nowcoder.com/practice/539054b4c33b4776bc350155f7abd8f5?tpId=37&tqId=21263&rp=1&ru=/exam/oj/ta&qru=/exam/oj/ta&sourceUrl=%2Fexam%2Foj%2Fta%3FtpId%3D37&difficulty=undefined&judgeStatus=undefined&tags=&title=

#include<bits/stdc++.h>
using namespace std;
int main(){
    string s;
    getline(cin,s);
    int zm=0,kg=0,sz=0,qt=0;
    for(auto&i:s){
        if((i>='a'&&i<='z')||(i>='A'&&i<='Z'))zm++;
        else if(i==' ')kg++;
        else if(i>='0'&&i<='9')sz++;
        else qt++;
    }
    cout<<zm<<'\n'<<kg<<'\n'<<sz<<'\n'<<qt;
}

string s;getline(cin,s);

---

by:AlenaNuna