哈尔滨理工大学第七届程序设计竞赛决赛（现场赛-低年级组）（重现赛）

比赛地址
A.

#include<iostream>
#include<cstring>

using namespace std;

typedef long long ll;

int main()
{
    ll a,b;
    while(cin>>a>>b){
        cout<<a+b<<endl;
    }
    return 0;
}

B.

#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

typedef long long ll;

int main()
{
    ll n;
    while(~scanf("%lld",&n)){
        ll ans=-1e18;
        while(n--){
            ll x;
            scanf("%lld",&x);
            ans=max(ans,x);
        }
        printf("%lld\n",ans);
    }
    return 0;
}

C.

#include<iostream>
#include<string>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

int main()
{
    int n;
    while(~scanf("%d",&n)){
        for(int i=1;i<=n;i++){
            for(int j=n-i;j>=1;j--){
                printf(" ");
            }
            for(int j=1;j<=2*i-1;j++){
                printf("*");
            }
            printf("\n");
        }
    }
    
    return 0;
}

D.

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

const int N=110;
int a[N][N],sum[N][N];

int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k)){
        memset(a,0,sizeof(a));
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                scanf("%d",&a[i][j]);
            }
        }
        int ans=-1e18;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                sum[i][j]=a[i][j]+sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
            }
        }
        for(int i=k;i<=n;i++){
            for(int j=k;j<=n;j++){
                ans=max(ans,sum[i][j]-sum[i][j-k]-sum[i-k][j]+sum[i-k][j-k]);
            }
        }
        printf("%d\n",ans);
    }
    
    return 0;
}

E.

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

const int N=1e6+10;
int a[11]={1,0,0,0,1,0,1,0,2,1,1};

int main()
{
    int t;
    cin>>t;
    while(t--){
        int l,r;
        cin>>l>>r;
        int sum=0;
        for(int i=l;i<=r;i++){
            int p=i;
            while(p){
                sum+=a[p%10];
                p/=10;
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}

F.

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<vector>

using namespace std;

typedef long long ll;
const int N=200010;
int a[N];

int main()
{
    int n;
    while(~scanf("%d",&n)){
        memset(a,0,sizeof(a));
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
        double ans=-1e18;
        for(int i=1;i<n;i++){
            ans=max(ans,(double)(a[i+1]-a[i]));
        }
        //sort(a,a+n);
        //ans=(double)(a[n]-a[0])/n;
        printf("%.2lf\n",ans);
    }
    return 0;
}

H.
思路：数学思维题

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>

using namespace std;

typedef long long ll;
const ll mod=1e9+7;

ll quick_mul(ll x,ll y)
{
    ll ans=0;
    while(y){
        if(y&1)ans=(ans+x)%mod;
        x=(x+x)%mod;
        y>>=1;
    }
    return ans%mod;
}

int main()
{
    int n;
    while(~scanf("%d",&n)){
        ll ans=1;
        int a,b;
        for(int i=1;i<=n;i++){
            scanf("%d%d",&a,&b);
            ans=quick_mul(ans,(ll)(a+b));
        }
        printf("%lld\n",ans%mod);
    }
    return 0;
}