网易2017年校招部分笔试题

#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>

using namespace std;

#if 0
int main(int argc,char *argv[])
{
    //string s1 = new string("abc");
    string s1("abc");
    string s2;
    s2="abc";
    if(s1==s2){
        printf("test success\n");
    }else{
        printf("test failed\n");
    }
    return 0;
}
#endif

///计算糖果多少
#if 0
int main(int argc,char *argv[])
{
    int AminusB,AplusB,BminusC,BplusC;
    cin>>AminusB>>AplusB>>BminusC>>BplusC;
    int A = (AminusB+AplusB)/2;
    int B = (AplusB-AminusB)/2;
    int C = (BplusC-B);
    if((AminusB==A-B) && (AplusB==A+B) && (BminusC==B-C) && (BplusC==B+C)){
        cout<<"A= "<<A<<"B= "<<B<<"C= "<<C<<endl;
    }else{
        cout<<"ON"<<endl;
    }
    return 0;

}
#endif // 0
///买苹果
#if 0
int main(int argc,char *argv[])
{

    int n=0;
    int ans=1000;
    cin>>n;
    int i=0,j=0;
    for(i=0;i<=20;i++){
        for(j=0;j<=20;j++){
            if(i*6+j*8==n){
              ans=min(ans,(i+j));
              cout<<"i="<<i<<"j="<<j<<endl;
            }
        }
    }
    if(ans==1000)
        ans=-1;
    cout<<ans<<endl;
    return 0;
}
#endif
///数字翻转
#if 0
int rec(int src)
{
    int dest=src;
    int source=0;
    while(dest){
        int tail=dest%10;
        source=source*10+tail;
        dest=dest/10;
    }
    return source;
}
int main()
{
    int var_int1=0;
    int var_int2=0;
    cin>>var_int1>>var_int2;
    cout<<rec(rec(var_int1)+rec(var_int2))<<endl;
    return 0;
}
#endif // 0
///计算暗黑字符串的g个数
#if 0
int main()
{
    long long dp1[35];
    long long dp2[35];

    int n=0;
    cin>>n;

    dp1[1]=0,dp1[2]=3;
    dp2[0]=1,dp2[1]=3,dp2[2]=6;
    for(int i=3;i<=n;i++){
        dp1[i]=dp1[i-1]+dp2[i-1];
        dp2[i]=dp1[i-1]*2+dp2[i-1];
    }
    cout<<"dp1[n]="<<dp1[n]+dp2[n]<<endl;

    return 0;
}
#endif
///回文序列
int main()
{
    int n;
    int a[50];
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>a[i];
    }
    int l=0,r=n-1;
    int res=0;
    while(l<r){
        if(a[l]<a[r]){
            a[l+1] +=a[l];
            ++l;
            ++res;
        }else if(a[l]>a[r]){
            a[r-1] +=a[l];
            ++l;
            ++r;
        }else {
            ++l,--r;
        }
    }
    cout<<res<<endl;
}