比赛
think-weige
这个作者很懒,什么都没留下…
展开
-
python蓝桥杯从入门到~
输入与输出输入数组输入:可以提前定义a = [0 for i in range(1000)]或者arr = list(map(int,input().split()))输出import mathpi = math.pip = -1*piprint(pi)print('%.4f' % pi)# 2,前面补充前导0表示月份a = 2 # 2月输出02b = 11 # 11月输出11print('%02d' % a)print('%02d' % b)print('%d %d'原创 2021-10-28 09:42:00 · 652 阅读 · 0 评论 -
蓝桥杯python组国赛复盘
却道一句当时只道是寻常python国赛复盘我是个c++选手,python就国赛前学了半个下午加晚上,省赛前学了半天。所以填空题部分还是选择了,用c++编程,机房提供了DEV还是很不错的print(200/8)# 答案是25#include <iostream>#include <cstring>#include <algorithm>#include <stdio.h>using namespace std;typedef long原创 2021-06-17 13:02:57 · 3019 阅读 · 21 评论 -
牛客挑战赛47
牛客挑战赛47A**多维的更相减损术得gcd(x,y,z) = gcd(x,y-x,z-y) **则gcd(a1+k,a2+k,a3+k…,an+k) = gcd(a1+k,a2-a1,a3-a2,a4-a3…,an-an-1)提前排好序#include <iostream>#include <algorithm>using namespace std;const int maxn = 1e5+10;long long a[maxn],n;int main(){原创 2021-01-10 12:11:20 · 267 阅读 · 0 评论 -
“红旗杯“第十四届东北地区大学生程序设计竞赛-热身赛
Problem AProblem DescriptionMo’s algorithm can solve some difficult data structure problems. Like this: You are given an array a1,a2,…,an and m queries. In each query, we want to get the mode number(the value that appears most often in a set of data) of原创 2020-10-10 14:15:23 · 1540 阅读 · 0 评论