NYNU_ACM 实验室 招新第一周 周赛题解

A

#include<iostream>//#include<stdio.h>using namespace std;int main(){    int n,m;      cin>>n;// scanf("%d",&n);    int mx=0,mi=100009;      for(int j=0;j<n;j++){        cin>>m;   //scanf("%d",&m);          if(mx<m){            mx=m;        }        if(mi>m){            mi=m;        }    }    cout<<mi<<" "<<mx<<endl;//printf("%d %d\n",mi,mx)    return 0; }

B

#include<iostream>#include<fstream>using namespace std;int main(){    int n,i,j;    cin>>n;    //两个判定条件 两个墙的判定 和空格的判定    //ofstream outfile("10.txt");    for(i=0;i<n;i++){     //输出上面的倒三角 以及两边的墙 最后一行除一个*全都输出_        for(j=0;j<i;j++){            if(j==0) cout<<"#";            else if(i==n-1)cout<<"_";            else cout<<" ";        }        for(j=1;j<=2*(n-i)-1;j++) cout<<"*";        for(j=0;j<i;j++){            if(j==i-1) cout<<"#";            else if(i==n-1)  cout<<"_";            else cout<<" ";        }        cout<<endl;    }    for(i=1; i<=n;i++){//输出正三角 以及两边的墙        for(j=0;j<n-i;j++){            if(j==0) cout<<"#";            else cout<<" ";        }        for(j=0;j<2*i-1;j++) cout<<"*";        for(j=0;j<n-i;j++){            if(j==n-i-1)  cout<<"#";            else cout<<" ";        }        cout<<endl;    }    return 0;

C

#include<iostream>#include<cstdio>using namespace std;int main(){    int n,sum;    while(scanf("%d",&n)==1)    {    sum=n;int j=0;    while(n>=3)    {        n/=3;        sum+=n;        j++;        if(j==3)        {            sum+=3;            n+=3;        }    }    printf("%d\n",sum);    }}

D

#include<stdio.h>int main(){    int m,n,i,s1,s2;       scanf("%d",&m);       while(m--){           scanf("%d",&n);       for(i=3,s1=s2=1;i<=n;i++){            s1=s1+s2;s2=s1-s2;       }       printf("%d\n",s1);    } }

E

#include<stdio.h>int main(){    int a,b,n[10],m[10],t;    scanf("%d",&t);    for(int i=0; i<t; i++)        scanf("%d%d",&n[i],&m[i]);    for(int i=0; i<t; i++)    {        a = (4*n[i]-m[i])/2;        b = n[i] - a;        if ( m[i]%2 == 1 || a < 0 || b < 0)            printf("No answer\n");        else            printf("%d %d\n", a, b);    }    return 0;}

F

#include<bits/stdc++.h>using namespace std;int main(){   long long x,h,j,l=0,k;     cin>>x>>h;   l=1;//l记录总数   for(j=0;j<h;j++){       k=l*x;//k 记录每一次传播的数量       l+=k;   }   cout<<l<<endl;   return 0;}

G

#include<iostream>using namespace std;long long a[1000001];int main(){    int j,k,l=0,i;    while(cin>>k&&k){        a[l]=k;        l++;    }    for(j=l-1;j>=0;j--){        cout<<a[j]<<" ";    }    return 0;}

H

#include<bits/stdc++.h>using namespace std;long long a[10000001]={0};int main(){   int n,j,k=0,l=0,i=0;     cin>>n;   for(j=1;j<=n;j++){      cin>>a[j];      if(a[j]-a[j-1]==1){         k++;         if(k>l){           l=k;           //cout<<a[j]<<endl;         }      }      else k=1;   }   cout<<l<<endl;   return 0;}

I

#include<stdio.h>int a[100001];int main(){    int n,k,x;    scanf("%d%d%d",&n,&k,&x);        for(int j=0;j<n;j++){            scanf("%d",&a[j]);        }        //sort(a,a+n);        int s=0;        for(int j=0;j<n-k;j++){            s+=a[j];        }        s+=k*x;        printf("%d\n",s);    return 0;}