信息素养Python编程题

一

n = int(input())
count = 0
a = n//5
for x in range(a+1):
    for y in range(a+1):
        for z in range(a+1):
            if x*5+y*8+z*10 == n:
                count+=1
print(count)

二

三

n = int(input())
a = list(map(int,input().split()))
c = 0
for i in range(1,n):
    for j in range(i):
        if a[j]<a[i]:
            c+=1
print(c)

#include <iostream>
#include <vector>
using namespace std;

int main() {
	int a[] = {7,0,2,5,6,1,3,4};
	int s = 0;
	for(int i = 1;i<8;i++){
		for(int j = 0;j<i;j++){
			if(a[j]<a[i]){
				s+=1; 
			}
		}		
	} 
	cout<<s;
}

四

五

n = int(input())
a = list(map(float, input().split()))
c = 0
for i in range(n):
    for j in range(i):
        if a[i]>a[j]:
            c+=1
    print(c)
    c=0

六

n = int(input())

if n == 1:
    print(0)
elif n == 2:
    print(1)
else:
    d_prev_prev = 0  # D(1)
    d_prev = 1        # D(2)
    for i in range(3, n+1):
        d_current = (i-1) * (d_prev + d_prev_prev)
        d_prev_prev, d_prev = d_prev, d_current
    print(d_prev)

七

a = list(map(int,input().split()))
sum=0
for i in range(len(a)):
    for j in range(i+1,len(a)):
        if a[i]>a[j]:
            sum+=1
print(sum)

八

n = int(input())
a = 1
sum = 0
for i in range(1, n+1, 2):
    if a % 2 == 1:
        sum = sum+1/i
    else:
        sum = sum-1/i
    a+=1
print(round(sum,8))

九

def pascal_triangle(n):
    triangle = []
    for row in range(n):
        current_row = [1]  # 每行以1开始
        if row > 0:
            prev_row = triangle[row-1]
            for i in range(1, row):
                current_row.append(prev_row[i-1] + prev_row[i])
            current_row.append(1)  # 每行以1结束
        triangle.append(current_row)
    return triangle


# 打印前10行
for row in pascal_triangle(10):
    print(row)

# 创建一个5x5的矩阵
rows = 6
cols = 6
matrix = []
for i in range(rows):
    row = []
    for j in range(cols):
        row.append(0)
    matrix.append(row)

for i in range(rows):
    matrix[i][0] = 1
    for j in range(1,i+1):
        matrix[i][j] = matrix[i-1][j]+matrix[i-1][j-1]

for i in range(rows):
    for j in range(i+1):
        print(matrix[i][j], end=" ")
    print()

#include <iostream>
using namespace std;

int main() {
    int n;
    cin>>n;
    int triangle[n][n] = {};
    for (int i = 0; i < n; ++i) {
        triangle[i][0] = triangle[i][i] = 1;
        for (int j = 1; j < i; ++j) {
            triangle[i][j] = triangle[i-1][j-1] + triangle[i-1][j];
        }
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j <= i; ++j) {
            cout << triangle[i][j];
        }
        cout << endl;
    }
    
    return 0;
}

十

a = int(input())
for i in range(1,a+1):
    for j in range(1,2*i):
        if j<=i:
            print(j,end='')
        else:
            for z in range(j-2,0,-1):
                print(z, end='')
            break
    print()

#include<vector>
#include <iostream>
using namespace std;
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= 2*i; ++j) {
			if(j<=i){
				cout<<j<<",";
			}else{
				for (int z = j-2; z > 0; z--) {
					cout<<z<<",";
				}
				break;
			}
		}
		cout<<endl;
	}
}

#include <iostream>
#include <vector>
using namespace std;

void generateSequence(int n) {
    for (int i = 1; i <= n; ++i) {
        // 递增部分
        for (int j = 1; j <= i; ++j) {
            cout << j;
            if (i != 1) cout << ",";
        }
        
        // 递减部分（当i>1时）
        if (i > 1) {
            for (int j = i-1; j >= 1; --j) {
                cout << j;
                if (j != 1) cout << ",";
            }
        }
        
        cout << endl;
    }
}

int main() {
    int n;
    cin >> n;
    generateSequence(n);
    
    return 0;
}

十一

n = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
c = 0

for i in range(1, n[0]):
    for j in range(i):
        if a[i] - a[j] == n[1]:
            c += 1
print(c)

十二

n = int(input())
book_counts = {}

for i in range(n):
    book = input()
    if book in book_counts:
        book_counts[book] += 1
    else:
        book_counts[book] = 1

# 按字典序排序书名
sorted_books = sorted(book_counts.keys())

# 输出结果
print(len(sorted_books))
for book in sorted_books:
    print(f"{book} {book_counts[book]}")

十三

a = input()
n = int(input())
i = 0
b = []

while i < len(a):
    ge = 0
    for j in range(i, len(a)):
        if a[i] == a[j]:
            ge += 1
        else:
            break
    i += ge
    b.append(ge)

si = 0
for i in b:
    if i >= n:
        si += 1

print(si)

十四

sum=0
res = []
for x in range(11):
    for y in range(11):
        for z in range(31):
            if x+y+z==2:
                res.append((x,y,z))
print(res)

十五

n = int(input())
s = 1
for i in range(n):
    s=s*n%1000
print(s%1000)

十六

n = int(input())
s = []

for i in range(n):
    a = int(input())
    s.append(a)

s.sort()

# 修改变量名以避免与列表s混淆
result = 0
result = sum(s[-3:]) + s[-1] * 2

print(result)

十七

n = int(input())
print(n * (n - 1) * (n - 2))

十八

n = int(input())
L = list(map(int,input().split()))
t = 1
res = 0
for i in range(len(L)-1):
    if L[i]>L[i+1]:
        t+=1
    else:
        t = 1
    res = max(t,res)
print(res)

十九

n = int(input())
recipes = list(map(int, input().split()))
recipes.sort()

days = 0
current_day = 1

for food in recipes:
    if food >= current_day:
        days += 1
        current_day += 1

print(days)

二十

n = int(input())
m = int(input())
customers = []
for _ in range(m):
    a, b = map(int, input().split())
    customers.append((b, a))  # 存储为(价格, 重量)方便排序

# 按价格从高到低排序
customers.sort(reverse=True)

total_money = 0
remaining = n

for b, a in customers:
    if remaining <= 0:
        break
    sell = min(a, remaining)
    total_money += sell * b
    remaining -= sell

print(total_money)