牛客440904392号

分类

/ 注册

全部文章（共258篇）

题解 | 2023_AQIP 操作_1567

#include<iostream> #include<algorithm> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); string...

2026-01-13

0 33

题解 | 选择排序

n,k=map(int,input().split()) nums=list(map(int,input().split())) for i in range(k): index=i+1 for j in range(i+1,n): if nums[j]<num...

2026-01-13

0 34

题解 | 阶梯电费

x = int(input()) if x <= 100: print(x * 0.5) elif x <= 200: print(50 + (x - 100) * 0.6) else: print(110 + (x - 200) * 0.75)

2026-01-13

0 33

题解 | 计算样本峰度

n=int(input()) nums=list(map(int,input().split())) avg=sum(nums)/n print(f'{sum((x-avg)**4 for x in nums)*n/(sum((x-avg)**2 for x in nums))**2-3:.2f}'...

2026-01-13

0 30

题解 | 股票交易

input() nums = list(map(int, input().split())) a, ans = nums[0], -nums[0] for x in nums: if x - a > ans: ans = x - a elif x < a:...

2026-01-13

0 32

题解 | 排列删除

input() nums = list(map(int, input().split())) for _ in range(int(input())): x, y = map(int, input().split()) if x < y: print("...

2026-01-13

0 26

题解 | 最小字符串

s = input() ans = [] i = len(s) - 2 ans = [s[-1]] while i >= 0: if s[i] < s[i + 1]: ans.append(s[i] * 2) i -= 1 whil...

2026-01-13

0 18

题解 | 整数分解

import java.util.Arrays; import java.util.LinkedList; import java.util.List; import java.util.Scanner; public class Main { public static void main...

2026-01-13

0 25

题解 | 数组排序

#include<iostream> #include<algorithm> using namespace std; int main() { int n; cin >> n; double nums[n]; for (int i...

2026-01-13

0 25

题解 | 数字猜想

x = int(input()) ans = 0 while x != 1: if x % 2 == 1: x = x * 3 + 1 else: x //= 2 ans += 1 print(ans)

2026-01-13

0 28