青少年趣味编程

1926：【04NOIP 普及组】不高兴的津津

http://noi.openjudge.cn/ch0109/07/"""1.9 编程基础之顺序查找 07 不与最大数相同的数字之和 方法二（python3实现）http://noi.openjudge.cn/ch0109/07/Python List max()方法https://www.runoob.com/python/att-list-max.html"""n=int(input())a=list(map(int,input().split()))maxa=max(a)

http://noi.openjudge.cn/ch0109/07//*1.9 编程基础之顺序查找 07 不与最大数相同的数字之和http://noi.openjudge.cn/ch0109/07/*/#include<iostream>using namespace std;int a[10000];int main(){ int N,C=-1000000-10,F=0; cin>>N; for(int i=1;i<=N;i++){

http://noi.openjudge.cn/ch0109/01/"""1.9 编程基础之顺序查找 01 查找特定的值 AChttp://noi.openjudge.cn/ch0109/01/"""import sysn=int(input())a=list(map(int,input().split()))x=int(input())"""i=0while i<len(a)-1: if a[i]==a[len(a)-1]:

http://noi.openjudge.cn/ch0109/solution/32418671//*1.9编程基础之顺序查找 01查找特定的值 王曙翰（五年级） 2021.12.27 AChttp://noi.openjudge.cn/ch0109/solution/32418671/*/#include<iostream>using namespace std;int main(){ int n; cin>>n; int *p=

http://noi.openjudge.cn/ch0109/13/"""1.9 编程基础之二分查找 13:整数去重http://noi.openjudge.cn/ch0109/13/Python字符串去重https://www.jianshu.com/p/b9162f389b5chttps://www.cnblogs.com/zhenghiber/p/15110871.htmlPython：对输入的单词进行字典序排序输出https://www.cnblogs.com/JodieR

http://noi.openjudge.cn/ch0109/02/参考：python输出姓名和最高成绩_【Python】1004分排名（20分）,Python1004,成绩排名https://blog.csdn.net/weixin_39649614/article/details/111440842"""1.9 编程基础之顺序查找 02 输出最高分数的学生姓名http://noi.openjudge.cn/ch0109/02/python输出姓名和最高成绩_【Python】100

http://noi.openjudge.cn/ch0109/01//*1.9 编程基础之顺序查找 01 查找特定的值http://noi.openjudge.cn/ch0109/01/ */#include <bits/stdc++.h>using namespace std;int a[10000+10];int main(){ int n,x; cin>>n; for(int i=1;i<=n;i++) { cin>>

http://noi.openjudge.cn/ch0109/05/"""1.9 编程基础之顺序查找 05 最大值和最小值的差http://noi.openjudge.cn/ch0109/05/"""import sysn=int(input())a=list(map(int,input().split()))maxa=-(10000+10)mina=10000+10lena=len(a)i=0while i<lena:

http://noi.openjudge.cn/ch0109/03/

http://noi.openjudge.cn/ch0109/07/"""1.9 编程基础之顺序查找 07 不与最大数相同的数字之和http://noi.openjudge.cn/ch0109/07/"""n=int(input())a=list(map(int,input().split()))lena=len(a)#print(lena)max=-1000000-10i=0while i<lena:

http://noi.openjudge.cn/ch0109/08/"""1.9 编程基础之顺序查找 08 白细胞计数http://noi.openjudge.cn/ch0109/08/"""import sysimport mathn=int(input())a=[]j=0while j<n: x=float(input()) a.append(x) j+=1a.sort()#print

http://noi.openjudge.cn/ch0109/09/"""1.9 编程基础之顺序查找 09 直方图 9分http://noi.openjudge.cn/ch0109/09/"""n=int(input())a=list(map(int,input().split()))lena=len(a)#print(lena)max=0i=0while i<lena: if a[i]&gt

http://noi.openjudge.cn/ch0109/11/"""1.9 编程基础之顺序查找 11 连续出现的字符http://noi.openjudge.cn/ch0109/11/"""import sysimport osn=int(input()) a=input()a=list(a)lena=len(a)#print(lena)p=a[0]#print(p)count=1i=0while i<lena-1:

http://noi.openjudge.cn/ch0109/10/"""1.9 编程基础之顺序查找 10 找最大数序列(5分)http://noi.openjudge.cn/ch0109/10/使用python创建一个n*空的二维数组https://blog.csdn.net/weixin_40378404/article/details/93214422//k是第二维数组的个数arr=[[] for i in range(k)]python创建二维列表的两种方法https:

http://noi.openjudge.cn/ch0109/12/"""1.9 编程基础之二分查找 12 最长平台http://noi.openjudge.cn/ch0109/12/Python字符串去重https://www.jianshu.com/p/b9162f389b5chttps://www.cnblogs.com/zhenghiber/p/15110871.htmlPython：对输入的单词进行字典序排序输出https://www.cnblogs.com/JodieR

http://noi.openjudge.cn/ch0109/05//*1.9编程基础之顺序查找 05 最大值和最小值的差http://noi.openjudge.cn/ch0109/05/*/#include <bits/stdc++.h>using namespace std;int a[10000+10];int main(){ int m,max=-10001,min=10001; cin>>m; for(int i=1;i<=m