江南信息学第七周练习20221021

比赛链接

 

 

6436计算表达式的值

 python:

a,b = map(int,input().split())
print(3*a+2*b)

C++:

#include <bits/stdc++.h>
using namespace std;
int main() {
    int x,y;
    cin>>x>>y;
    cout<<3*x+2*y;
    return 0;
}

 

6656 bth的年龄问题

 python:

x = int(input())
print(int(x/4))

C++:

#include<bits/stdc++.h>
using namespace std;
int main() {
    int a;
    cin>>a;
    cout<<a/4;
    return 0;
}

 

6989 比赛准备

 python:

a,b,c,d = map(int,(input().split()))
a = int(a/2)
b = int(b/2)
print(min(a,b,c,d))

c++:

#include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b,c,d,sum=0;
    cin>>a>>b>>c>>d;
    sum=min(min(min(a/2,b/2),c),d);
    cout<<sum;
    return 0;
}

 

7190 猜数游戏1

python:

a=66
i=int(input())
sum=0
if i>a:
    print('bigger')
elif i<a:
    print ('smaller')
else:
    print('right')

 

 C++:

#include <bits/stdc++.h>
using namespace std;
int main() {
    int a;
    cin>>a;
    if(a<66)
        cout<<"smaller";
    else if(a>66)
        cout<<"bigger";
    else
        cout<<"right";
    return 0;
}

 

7623 粗心的小L2.0

 

python:

n = int(input())
a = list(map(int,input().split()))
sum = 0
for i in range(n):
    if a[i]==1:
        sum+=1
p = sum/n 
if p>=0.5:
    print('Progress')
else:
    print('keep fighting')

 

C++：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,sum=0,k;
    cin>>n;
    k = n;
    while(k--) //循环k次 
    {
        int x;
        cin>>x;
        if(x==1)sum++; //如果x=1证明是正确，sum++ 
    }
    if(sum*1.0/n>=0.5)cout<<"Progress"; //sum*1.0转化为小数 
    else cout<<"keep fighting";
     return 0;
}

 

7501因子个数1

python:

n = int(input())
sum = 0
for i in range(1,n+1):
    if n%i==0:
        sum+=1
print(sum)

 

 C++:

#include<bits/stdc++.h>
using namespace std;
int main() {
    long long int n,sum=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        if(n%i==0)sum++;
    }
    cout<<sum<<endl;
    return 0;
}

 

7560 数字和

python:

s = input()
sum  = 0
for i in s:
        sum+=int(i)
print(sum)

 

 C++:

#include<bits/stdc++.h>
using namespace std;
int main() {
    int n,sum=0;
    cin>>n;
    while(n>0){
        sum+=n%10;
        n=n/10;
    }
    cout<<sum<<endl;
}

 

7585 兔子繁衍问题

 python:

n = int(input())
if n == 0:
    print(0)
elif n == 1:
    print(1)
else:
    r = [0, 1, 1]
    m = 0
    while r[-1] < n:
        r.append(r[-1] + r[-2])
        m += 1
    print(m + 2)

c++:

#include<bits/stdc++.h>
using namespace std;
int main() {
    int f[10005];
    f[1]=1;
    f[2]=1;
    for(int i=3;i<=10001;i++){
        f[i]=f[i-1]+f[i-2]; 
    }
    int n;
    cin>>n;
    for(int i=1;i<=10001;i++){
        if(f[i]>=n){
            cout<<i;
            break;
        }
    }
    return 0;
}

 

 

 

7838 最小差值

 python：

n = int(input())
a = list(map(int,input().split()))
x = int(input())
ans = None
minn = 999999999
for i in range(n):
    for j in range(n):
        if i!=j:
            c = a[i]+a[j]
            if c<=x and abs(c-x)<minn:
                minn = abs(c-x)
                ans = c
if ans!=None:
    print(ans)
else:
    print(-1)

C++:

#include<bits/stdc++.h>
using namespace std;

int a[10001];

int main(){
    int n,m;
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    cin>>m;
    int aa=-99999;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=i;j++){
            if(a[i]+a[j]<=m&&a[i]+a[j]>aa&&a[i]!=a[j])aa=a[i]+a[j];
        }
    }
    if(aa>0)cout<<aa;
    else cout<<-1;
    return 0;
}

 

7908 成绩查询

 c++:

#include<bits/stdc++.h>
using namespace std;
int n, cj, minn = 1000005, ans = 0;
int main(){
    cin >> n >> cj;
    int fs[1000005];
    for (int i = 1;i <= n;i++){
        cin >> fs[i];
    }
    for (int i = 1;i <= n;i++){
        int cz = max(fs[i], cj) - min(fs[i], cj);
        if (cz < minn){
            minn = cz;
            ans = fs[i];
        }
    }
    cout << ans;
    return 0;
}

 

 

 

7904 差分序列

 c++:

#include<bits/stdc++.h>
using namespace std;
int op, n;
int main(){
    cin >> op >> n;
    int a[10001];
    for (int i = 1;i <= n;i++){
        cin >> a[i];
    }
    int b[1001];
    b[1] = a[1];
    cout << b[1] << ' ';
    if (op == 1){
        for (int i = 2;i <= n;i++){
            b[i] = a[i] - a[i - 1];
            cout << b[i];
            if (i != n) cout << ' ';
        }
    }
    else{
        for (int i = 2;i <= n;i++){
            b[i] = b[i - 1] + a[i];
            cout << b[i];
            if (i != n) cout << ' '; 
        }
    }
    return 0;
}

 

 

 

7799 数组的删除

 python:

a=list(map(int,(input().split())))
x=int(input())
a.pop(x-1)
print(' '.join(str(i)for i in a))

 

7799 数组的删除

 python:

a=list(map(int,(input().split())))
p,x=map(int,(input().split()))
a.insert(p-1,x)
print(' '.join(str(i)for i in a))

C++:

#include <iostream>
#include<bits/stdc++.h>

using namespace std;
int a[15];
int main() {
    for (int i = 1; i <= 10; i++) {
        cin >> a[i];
    }
    int p, x;
    cin >> p >> x;
    if (p == 1) {
        cout << x;
        for (int i = 1; i <= 10; i++) {
            cout << " " << a[i];
        }
    }
    else if (p == 11) {
        for (int i = 1; i <= 10; i++) {
            cout << a[i] << " ";
        }
        cout << x;
    }
    else {
        for (int i = 1; i < p; i++) {
            cout << a[i] << " ";
        }
        cout << x << " ";
        for (int i = p; i <= 10; i++) {
            cout << a[i];
            if (i != 10)cout << " ";
        }
    }

}