From fc324f936b5089d5616c32c83ed3abdec6cd1e77 Mon Sep 17 00:00:00 2001
From: OhFengGO <fengyichen126@qq.com>
Date: Wed, 23 Aug 2023 21:52:51 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=E4=BA=86=E8=AE=B8=E5=A4=9A?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 三整数排序(2).cpp              |   26 +
 三整数排序.cpp                 |   37 +
 三角形判断.cpp                 |   27 +
 三角形组成判断.cpp             |   15 +
 不与指定整数相同的数字之和.cpp |   19 +
 与指定数字相同的数的个数.cpp   |   18 +
 世界末日.cpp                   |   26 +
 两位数反转.cpp                 |    8 +
 买书.cpp                       |   26 +
 买木板.cpp                     |   13 +
 二维数字排列.cpp               |   18 +
 人口增长问题.cpp               |   13 +
 优美数.cpp                     |   16 +
 位运算符.cpp                   |   20 +
 你的飞碟在这儿.cpp             |   34 +
 分段函数.cpp                   |   22 +
 分离整数的各个数.cpp           |   16 +
 判断数字的奇偶.cpp             |   13 +
 判断数字的正负.cpp             |   16 +
 判断数正负.cpp                 |   20 +
 判断正整数位数.cpp             |   18 +
 判断素数.cpp                   |   14 +
 判断闰年.cpp                   |   13 +
 十进制转二进制(digui).cpp      |   26 +
 叠罗汉.cpp                     |    9 +
 叠罗汉升级版.cpp               |   11 +
 含K个3的数.cpp                 |   25 +
 哥德巴赫猜想.cpp               |   26 +
 图像模糊化处理.cpp             |   35 +
 圆柱体的表面积.cpp             |   16 +
 奇数求和.cpp                   |   16 +
 好吃or不好吃.cpp               |   16 +
 字符串清除数字细胞实验.cpp     |   17 +
 字符倒三角.cpp                 |   24 +
 密码破解.cpp                   |   22 +
 密码翻译.cpp                   |   27 +
 富豪与国王的约定.cpp           |   17 +
 对齐输出.cpp                   |   13 +
 小兔子乖乖,把门儿开开.cpp      |   25 +
 小数和整数的输入和输出.cpp     |   13 +
 小玉在游泳.cpp                 |   13 +
 小玉家的电费.cpp               |   19 +
 小码君分班.cpp                 |   19 +
 小码君分配宿舍.cpp             |   39 +
 小码君刷题.cpp                 |   25 +
 小码君将矩阵左转.cpp           |   25 +
 小码君打地鼠.cpp               |   33 +
 小码君打比赛.cpp               |   29 +
 小码君查房-2.cpp               |   38 +
 小码君查房.cpp                 |   34 +
 小码君的AC贴纸数.cpp           |   26 +
 小码君的D之意志.cpp            |   28 +
 小码君的F91函数.cpp            |   32 +
 小码君的ISBN号码.cpp           |   35 +
 小码君的上学之路1.cpp          |   63 ++
 小码君的上学之路2.cpp          |   64 ++
 小码君的上学之路3.cpp          |   57 ++
 小码君的上学之路6.cpp          |   47 +
 小码君的五子棋局.cpp           |   38 +
 小码君的化学实验.cpp           |   46 +
 小码君的十字破译.cpp           |   31 +
 小码君的同学录.cpp             |   33 +
 小码君的奇特图形Pro Max.cpp    |   56 ++
 小码君的好同学.cpp             |   40 +
 小码君的实验室3.cpp            |   41 +
 小码君的实验室5.cpp            |   31 +
 小码君的小卖部.cpp             |   20 +
 小码君的山.cpp                 |   41 +
 小码君的心得统计.cpp           |   30 +
 小码君的排列问题1.cpp          |   20 +
 小码君的排列问题2.cpp          |   25 +
 小码君的数字三角形.cpp         |   24 +
 小码君的数学算式.cpp           |   38 +
 小码君的最好的朋友.cpp         |   33 +
 小码君的概率学.cpp             |   21 +
 小码君的水果分拣工厂-1.cpp     |   25 +
 小码君的炸弹游戏-1.cpp         |   34 +
 小码君的烦恼.cpp               |   27 +
 小码君的病毒传播.cpp           |   52 ++
 小码君的稀疏矩阵.cpp           |   30 +
 小码君的突变基因.cpp           |   13 +
 小码君的细胞实验2.cpp          |   58 ++
 小码君的自创数列.cpp           |   30 +
 小码君的进制转换.cpp           |   34 +
 小码君的阶段求和.cpp           |   26 +
 小码君统计数1.cpp              |   35 +
 小码君计算向量点积.cpp         |   21 +
 小码君闯迷宫.cpp               |   30 +
 小码学院的志愿者.cpp           |   38 +
 小码王的集训测评.cpp           |   36 +
 小鱼比可爱2.cpp                |   23 +
 小鱼的航程.cpp                 |   23 +
 年龄与疾病.cpp                 |   33 +
 循环-分解质因式.cpp            |   35 +
 恺撒加密术.cpp                 |   26 +
 成年人判断3.cpp                |   25 +
 成绩判定.cpp                   |   19 +
 我会数数啦1！！.cpp            |   12 +
 我会数数啦2！！.cpp            |   13 +
 我会数数啦3！！.cpp            |   15 +
 打印三角形.cpp                 |   10 +
 找倍数.cpp                     |   23 +
 找嫌疑犯1.cpp                  |   15 +
 招募高音唱将.cpp               |   40 +
 括弧匹配检验（栈）.cpp         |   48 +
 数1的个数.cpp                  |   24 +
 数列循环左移动(队列).cpp       |   33 +
 数字三角形.cpp                 |   17 +
 数字三角形问题.cpp             |   30 +
 数字反转.cpp                   |   13 +
 数字放大.cpp                   |   17 +
 数字组合.cpp                   |   12 +
 数字统计.cpp                   |   21 +
 数字翻转.cpp                   |   26 +
 数字菱形.cpp                   |   25 +
 数字识别.cpp                   |   18 +
 数的输入和输出.cpp             |   11 +
 数组指定部分逆序重放.cpp       |   17 +
 数羊(循环结构).cpp             |   14 +
 整理药名.cpp                   |   34 +
 昆虫同笼.cpp                   |   18 +
 最小数和最大数（数组实现）.cpp |   20 +
 最美苹果数.cpp                 |   32 +
 未命名1.cpp                    |   27 +
 李老师的书架.cpp               |   32 +
 枚举1.cpp                      |   16 +
 枪战.cpp                       | 1593 ++++++++++++++++++++++++++++++++
 查找路径2.cpp                  |   41 +
 栈的练习1.cpp                  |   29 +
 栈的练习2.cpp                  |   34 +
 根据字母加分.cpp               |   23 +
 歌唱比赛.cpp                   |   25 +
 求1~n的和.cpp                  |   33 +
 求出e的值.cpp                  |   22 +
 求平方.cpp                     |   14 +
 求极差.cpp                     |   14 +
 求面积.cpp                     |   13 +
 津津的宝石矿场.cpp             |   35 +
 津津的游戏时间.cpp             |   10 +
 满足条件的数.cpp               |   18 +
 满足条件的数的累加2.cpp        |   20 +
 火箭发射(循环结构).cpp         |   14 +
 点和正方形的关系.cpp           |   14 +
 特殊 a 串数列和.cpp            |   16 +
 特殊求和.cpp                   |   31 +
 甲流疫情死亡率.cpp             |   14 +
 电梯用电量.cpp                 |   33 +
 画平行四边形.cpp               |   19 +
 画沙漏.cpp                     |   30 +
 画直角梯形.cpp                 |   17 +
 画矩形.cpp                     |   32 +
 画简单的长方形.cpp             |   16 +
 矩阵列优先输出.cpp             |   25 +
 矩阵加法.cpp                   |   36 +
 矩阵算斜线.cpp                 |   30 +
 空瓶换酒.cpp                   |   16 +
 等腰三角形.cpp                 |   19 +
 简单的计算器(1).cpp            |   33 +
 简单的计算器(2).cpp            |   25 +
 简单的计算器.cpp               |   33 +
 素数判定.cpp                   |   19 +
 细胞分裂(循环结构).cpp         |   15 +
 统计字符信息.cpp               |   25 +
 统计满足条件的4位数.cpp        |   27 +
 耶!!.cpp                       |   19 +
 能被3、5、7整除的数.cpp        |   31 +
 自幂数.cpp                     |   27 +
 自我介绍.cpp                   |   14 +
 花园的周长和面积.cpp           |    9 +
 苹果和虫子.cpp                 |   15 +
 苹果和虫子2.cpp                |   25 +
 计算书费(普通）.cpp            |   11 +
 计算分数加减表达式的值.cpp     |   20 +
 计算多项式的值.cpp             |   10 +
 计算矩阵边缘元素之和.cpp       |   19 +
 计算鞍点.cpp                   |   40 +
 记忆卡牌.cpp                   |  106 +++
 输入输出二维数组.cpp           |   21 +
 输出1，2，3，…，n的值.cpp      |   16 +
 输出三角形.cpp                 |   10 +
 输出古诗.cpp                   |   10 +
 输出字符三角形.cpp             |   10 +
 输出文字.cpp                   |    6 +
 输出星期几.cpp                 |   33 +
 输出第二个整数.cpp             |   12 +
 输出自然数(递归).cpp           |   26 +
 过滤空格.cpp                   |   18 +
 过滤空格1.cpp                  |   19 +
 过滤空格2.cpp                  |   26 +
 递归.cpp                       |   21 +
 配对碱基链.cpp                 |   30 +
 长方形周长（保留小数）.cpp     |   10 +
 长方形排序.cpp                 |   35 +
 陶陶摘苹果（升级版）.cpp       |   42 +
 集训体检.cpp                   |   34 +
 集邮.cpp                       |   18 +
 颜文字大作战.cpp               |    8 +
 197 files changed, 6500 insertions(+)
 create mode 100644 三整数排序(2).cpp
 create mode 100644 三整数排序.cpp
 create mode 100644 三角形判断.cpp
 create mode 100644 三角形组成判断.cpp
 create mode 100644 不与指定整数相同的数字之和.cpp
 create mode 100644 与指定数字相同的数的个数.cpp
 create mode 100644 世界末日.cpp
 create mode 100644 两位数反转.cpp
 create mode 100644 买书.cpp
 create mode 100644 买木板.cpp
 create mode 100644 二维数字排列.cpp
 create mode 100644 人口增长问题.cpp
 create mode 100644 优美数.cpp
 create mode 100644 位运算符.cpp
 create mode 100644 你的飞碟在这儿.cpp
 create mode 100644 分段函数.cpp
 create mode 100644 分离整数的各个数.cpp
 create mode 100644 判断数字的奇偶.cpp
 create mode 100644 判断数字的正负.cpp
 create mode 100644 判断数正负.cpp
 create mode 100644 判断正整数位数.cpp
 create mode 100644 判断素数.cpp
 create mode 100644 判断闰年.cpp
 create mode 100644 十进制转二进制(digui).cpp
 create mode 100644 叠罗汉.cpp
 create mode 100644 叠罗汉升级版.cpp
 create mode 100644 含K个3的数.cpp
 create mode 100644 哥德巴赫猜想.cpp
 create mode 100644 图像模糊化处理.cpp
 create mode 100644 圆柱体的表面积.cpp
 create mode 100644 奇数求和.cpp
 create mode 100644 好吃or不好吃.cpp
 create mode 100644 字符串清除数字细胞实验.cpp
 create mode 100644 字符倒三角.cpp
 create mode 100644 密码破解.cpp
 create mode 100644 密码翻译.cpp
 create mode 100644 富豪与国王的约定.cpp
 create mode 100644 对齐输出.cpp
 create mode 100644 小兔子乖乖,把门儿开开.cpp
 create mode 100644 小数和整数的输入和输出.cpp
 create mode 100644 小玉在游泳.cpp
 create mode 100644 小玉家的电费.cpp
 create mode 100644 小码君分班.cpp
 create mode 100644 小码君分配宿舍.cpp
 create mode 100644 小码君刷题.cpp
 create mode 100644 小码君将矩阵左转.cpp
 create mode 100644 小码君打地鼠.cpp
 create mode 100644 小码君打比赛.cpp
 create mode 100644 小码君查房-2.cpp
 create mode 100644 小码君查房.cpp
 create mode 100644 小码君的AC贴纸数.cpp
 create mode 100644 小码君的D之意志.cpp
 create mode 100644 小码君的F91函数.cpp
 create mode 100644 小码君的ISBN号码.cpp
 create mode 100644 小码君的上学之路1.cpp
 create mode 100644 小码君的上学之路2.cpp
 create mode 100644 小码君的上学之路3.cpp
 create mode 100644 小码君的上学之路6.cpp
 create mode 100644 小码君的五子棋局.cpp
 create mode 100644 小码君的化学实验.cpp
 create mode 100644 小码君的十字破译.cpp
 create mode 100644 小码君的同学录.cpp
 create mode 100644 小码君的奇特图形Pro Max.cpp
 create mode 100644 小码君的好同学.cpp
 create mode 100644 小码君的实验室3.cpp
 create mode 100644 小码君的实验室5.cpp
 create mode 100644 小码君的小卖部.cpp
 create mode 100644 小码君的山.cpp
 create mode 100644 小码君的心得统计.cpp
 create mode 100644 小码君的排列问题1.cpp
 create mode 100644 小码君的排列问题2.cpp
 create mode 100644 小码君的数字三角形.cpp
 create mode 100644 小码君的数学算式.cpp
 create mode 100644 小码君的最好的朋友.cpp
 create mode 100644 小码君的概率学.cpp
 create mode 100644 小码君的水果分拣工厂-1.cpp
 create mode 100644 小码君的炸弹游戏-1.cpp
 create mode 100644 小码君的烦恼.cpp
 create mode 100644 小码君的病毒传播.cpp
 create mode 100644 小码君的稀疏矩阵.cpp
 create mode 100644 小码君的突变基因.cpp
 create mode 100644 小码君的细胞实验2.cpp
 create mode 100644 小码君的自创数列.cpp
 create mode 100644 小码君的进制转换.cpp
 create mode 100644 小码君的阶段求和.cpp
 create mode 100644 小码君统计数1.cpp
 create mode 100644 小码君计算向量点积.cpp
 create mode 100644 小码君闯迷宫.cpp
 create mode 100644 小码学院的志愿者.cpp
 create mode 100644 小码王的集训测评.cpp
 create mode 100644 小鱼比可爱2.cpp
 create mode 100644 小鱼的航程.cpp
 create mode 100644 年龄与疾病.cpp
 create mode 100644 循环-分解质因式.cpp
 create mode 100644 恺撒加密术.cpp
 create mode 100644 成年人判断3.cpp
 create mode 100644 成绩判定.cpp
 create mode 100644 我会数数啦1！！.cpp
 create mode 100644 我会数数啦2！！.cpp
 create mode 100644 我会数数啦3！！.cpp
 create mode 100644 打印三角形.cpp
 create mode 100644 找倍数.cpp
 create mode 100644 找嫌疑犯1.cpp
 create mode 100644 招募高音唱将.cpp
 create mode 100644 括弧匹配检验（栈）.cpp
 create mode 100644 数1的个数.cpp
 create mode 100644 数列循环左移动(队列).cpp
 create mode 100644 数字三角形.cpp
 create mode 100644 数字三角形问题.cpp
 create mode 100644 数字反转.cpp
 create mode 100644 数字放大.cpp
 create mode 100644 数字组合.cpp
 create mode 100644 数字统计.cpp
 create mode 100644 数字翻转.cpp
 create mode 100644 数字菱形.cpp
 create mode 100644 数字识别.cpp
 create mode 100644 数的输入和输出.cpp
 create mode 100644 数组指定部分逆序重放.cpp
 create mode 100644 数羊(循环结构).cpp
 create mode 100644 整理药名.cpp
 create mode 100644 昆虫同笼.cpp
 create mode 100644 最小数和最大数（数组实现）.cpp
 create mode 100644 最美苹果数.cpp
 create mode 100644 未命名1.cpp
 create mode 100644 李老师的书架.cpp
 create mode 100644 枚举1.cpp
 create mode 100644 枪战.cpp
 create mode 100644 查找路径2.cpp
 create mode 100644 栈的练习1.cpp
 create mode 100644 栈的练习2.cpp
 create mode 100644 根据字母加分.cpp
 create mode 100644 歌唱比赛.cpp
 create mode 100644 求1~n的和.cpp
 create mode 100644 求出e的值.cpp
 create mode 100644 求平方.cpp
 create mode 100644 求极差.cpp
 create mode 100644 求面积.cpp
 create mode 100644 津津的宝石矿场.cpp
 create mode 100644 津津的游戏时间.cpp
 create mode 100644 满足条件的数.cpp
 create mode 100644 满足条件的数的累加2.cpp
 create mode 100644 火箭发射(循环结构).cpp
 create mode 100644 点和正方形的关系.cpp
 create mode 100644 特殊 a 串数列和.cpp
 create mode 100644 特殊求和.cpp
 create mode 100644 甲流疫情死亡率.cpp
 create mode 100644 电梯用电量.cpp
 create mode 100644 画平行四边形.cpp
 create mode 100644 画沙漏.cpp
 create mode 100644 画直角梯形.cpp
 create mode 100644 画矩形.cpp
 create mode 100644 画简单的长方形.cpp
 create mode 100644 矩阵列优先输出.cpp
 create mode 100644 矩阵加法.cpp
 create mode 100644 矩阵算斜线.cpp
 create mode 100644 空瓶换酒.cpp
 create mode 100644 等腰三角形.cpp
 create mode 100644 简单的计算器(1).cpp
 create mode 100644 简单的计算器(2).cpp
 create mode 100644 简单的计算器.cpp
 create mode 100644 素数判定.cpp
 create mode 100644 细胞分裂(循环结构).cpp
 create mode 100644 统计字符信息.cpp
 create mode 100644 统计满足条件的4位数.cpp
 create mode 100644 耶!!.cpp
 create mode 100644 能被3、5、7整除的数.cpp
 create mode 100644 自幂数.cpp
 create mode 100644 自我介绍.cpp
 create mode 100644 花园的周长和面积.cpp
 create mode 100644 苹果和虫子.cpp
 create mode 100644 苹果和虫子2.cpp
 create mode 100644 计算书费(普通）.cpp
 create mode 100644 计算分数加减表达式的值.cpp
 create mode 100644 计算多项式的值.cpp
 create mode 100644 计算矩阵边缘元素之和.cpp
 create mode 100644 计算鞍点.cpp
 create mode 100644 记忆卡牌.cpp
 create mode 100644 输入输出二维数组.cpp
 create mode 100644 输出1，2，3，…，n的值.cpp
 create mode 100644 输出三角形.cpp
 create mode 100644 输出古诗.cpp
 create mode 100644 输出字符三角形.cpp
 create mode 100644 输出文字.cpp
 create mode 100644 输出星期几.cpp
 create mode 100644 输出第二个整数.cpp
 create mode 100644 输出自然数(递归).cpp
 create mode 100644 过滤空格.cpp
 create mode 100644 过滤空格1.cpp
 create mode 100644 过滤空格2.cpp
 create mode 100644 递归.cpp
 create mode 100644 配对碱基链.cpp
 create mode 100644 长方形周长（保留小数）.cpp
 create mode 100644 长方形排序.cpp
 create mode 100644 陶陶摘苹果（升级版）.cpp
 create mode 100644 集训体检.cpp
 create mode 100644 集邮.cpp
 create mode 100644 颜文字大作战.cpp

diff --git a/三整数排序(2).cpp b/三整数排序(2).cpp
new file mode 100644
index 0000000..b931d9b
--- /dev/null
+++ b/三整数排序(2).cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,c,n;
+	cin >>a>>b>>c;
+	if(a>b){
+		n=a;
+		a=b;
+		b=n;
+	}
+	if(b>c){
+		n=b;
+		b=c;
+		c=n;
+	}
+	if(a>b){
+		n=a;
+		a=b;
+		b=n;
+	}
+	cout <<a<<" "<<b<<" "<<c;
+	return 0;
+}
+
+
diff --git a/三整数排序.cpp b/三整数排序.cpp
new file mode 100644
index 0000000..605f99b
--- /dev/null
+++ b/三整数排序.cpp
@@ -0,0 +1,37 @@
+	#include <iostream>
+	#include <iomanip>
+	using namespace std;
+	int main(){
+		int a,b,c;
+		cin >>a>>b>>c;
+		if(a<=b && a<=c){
+			cout <<a<<" ";
+		}
+		else if(b<=a && b<=c){
+			cout <<b<<" ";
+		}
+		else if(c<=a && c<=b){
+			cout <<c<<" ";
+		}
+		if((a>=c && a<=b) || (a<=c && a>=b)){
+			cout <<a<<" ";
+		}
+		else if((b>=c && b<=a) || (b<=c && b>=a)){
+			cout <<b<<" ";
+		}
+		else if((c>=a && a<=b) || (c<=a && c>=b)){
+			cout <<c<<" ";
+		}
+		if(a>=b && a>=c){
+			cout <<a;
+		}
+		else if(b>=a && b>=c){
+			cout <<b;
+		}
+		else if(c>=b && c>=a){
+			cout <<c;
+		}
+		return 0;
+	}
+	
+
diff --git a/三角形判断.cpp b/三角形判断.cpp
new file mode 100644
index 0000000..1244a04
--- /dev/null
+++ b/三角形判断.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	int c;
+	cin >>a>>b>>c;
+	if(a<b+c && b<a+c && c<b+a){
+		if(a==b && a==c && b==c){
+			cout <<"�ȱ�������";
+		}
+		else if(a==b || a==c || b==c){
+			cout <<"����������";
+		}
+		else if(pow(a,2)+pow(b,2)==pow(c,2)){
+			cout <<"ֱ��������";
+		}
+		else{
+			cout <<"һ��������";
+		}
+	}
+	else{
+		cout <<"����������";
+	}	
+	return 0;
+}
diff --git a/三角形组成判断.cpp b/三角形组成判断.cpp
new file mode 100644
index 0000000..c682a18
--- /dev/null
+++ b/三角形组成判断.cpp
@@ -0,0 +1,15 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	int c;
+	cin >>a>>b>>c;
+	if(a<b+c && b<a+c && c<b+a){
+		cout <<"yes";
+	}
+	else{
+		cout <<"no";
+	}
+	return 0;
+} 
diff --git a/不与指定整数相同的数字之和.cpp b/不与指定整数相同的数字之和.cpp
new file mode 100644
index 0000000..253d8f0
--- /dev/null
+++ b/不与指定整数相同的数字之和.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int n,m,b=0;
+	int a[10000];
+	cin >>n;
+	for(int i=0;i<n;i++){
+		cin >>a[i];
+	}
+	cin >>m;
+	for(int i=0;i<n;i++){
+		if(a[i]==m){
+			b++;
+		}
+	}
+	cout <<b;
+	return 0;
+}
+
diff --git a/与指定数字相同的数的个数.cpp b/与指定数字相同的数的个数.cpp
new file mode 100644
index 0000000..272e8ad
--- /dev/null
+++ b/与指定数字相同的数的个数.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b[1000],c,sum=0;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>b[i];
+	} 
+	cin >>c;
+	for(int i=0;i<a;i++){
+		if(b[i]==c){
+			sum++;
+		}
+	}
+	cout <<sum;
+	return 0;
+}
diff --git a/世界末日.cpp b/世界末日.cpp
new file mode 100644
index 0000000..01739fb
--- /dev/null
+++ b/世界末日.cpp
@@ -0,0 +1,26 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+void wjh(int x,int n){
+	if(n<x-1){
+		return;
+	}
+	cout <<n<<" ";
+	wjh(x,n-1);
+}
+int main(){
+	int a;
+	cin >>a;
+	wjh(1,a);
+	return 0;
+}
diff --git a/两位数反转.cpp b/两位数反转.cpp
new file mode 100644
index 0000000..bc9d940
--- /dev/null
+++ b/两位数反转.cpp
@@ -0,0 +1,8 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >> a;
+	cout <<a%10<<a/10; 
+	return 0;
+}
diff --git a/买书.cpp b/买书.cpp
new file mode 100644
index 0000000..78cdd6e
--- /dev/null
+++ b/买书.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a,b[10000],c,d[10000];
+	cin >>a;
+	int sum=0;
+	for(int i=0;i<a;i++){
+		cin >>b[i];
+	} 
+	cin >>c;
+	for(int i=0;i<c;i++){
+		cin >>d[i];
+	}
+	for(int i=0;i<c;i++){
+		for(int j=0;j<d[i];j++){
+			sum+=b[j];
+		}
+		cout <<sum<<" ";
+		sum=0;
+	}
+	return 0;
+}
diff --git a/买木板.cpp b/买木板.cpp
new file mode 100644
index 0000000..6b8fd55
--- /dev/null
+++ b/买木板.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b;
+	scanf("%d%d",&a,&b);
+	printf("һ��%dԪ������%dԪ",a*20,b-a*20);
+	return 0;
+}
diff --git a/二维数字排列.cpp b/二维数字排列.cpp
new file mode 100644
index 0000000..662e62b
--- /dev/null
+++ b/二维数字排列.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	char a;
+	int b;
+	cin >>a;
+	cin >>b;
+	for(int i=b;i>=1;i--){
+		for(int j=1;j<=b;j++){
+			cout <<a<<" ";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
+
+
diff --git a/人口增长问题.cpp b/人口增长问题.cpp
new file mode 100644
index 0000000..467b1de
--- /dev/null
+++ b/人口增长问题.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b;
+	cin >>a>>b;
+	return 0;
+}
+//https://search.bilibili.com/all?vt=25685816&keyword=minecraft%E7%BD%91%E9%A1%B5%E7%89%88%E6%95%99%E7%A8%8B
diff --git a/优美数.cpp b/优美数.cpp
new file mode 100644
index 0000000..fd1a1a0
--- /dev/null
+++ b/优美数.cpp
@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	if(a>50){
+		cout <<"yes";
+	}
+	else if(a%2==0){
+		cout <<"yes";
+	}
+	else{
+		cout <<"no";
+	}
+    return 0;
+}
diff --git a/位运算符.cpp b/位运算符.cpp
new file mode 100644
index 0000000..bb9fb5c
--- /dev/null
+++ b/位运算符.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+#include <cmath>
+#include <cstdio>
+using namespace std;
+int main(){
+	int a,b,c,d,e,f,g,h;
+	cin >>a>>b;
+	c=a&b;
+	d=a|b;
+	e=a^b;
+	f=~a;
+	cout <<"a&b="<<c<<endl;
+	cout <<"a|b="<<d<<endl;
+	cout <<"a^b="<<e<<endl;
+	cout <<"~a="<<f<<endl;
+	cout <<"a<<b="<<(a<<b)<<endl;
+	cout <<"a>>b="<<(a>>b)<<endl;
+	return 0;
+}
diff --git a/你的飞碟在这儿.cpp b/你的飞碟在这儿.cpp
new file mode 100644
index 0000000..8792fda
--- /dev/null
+++ b/你的飞碟在这儿.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[1000],b[1000];
+	l a1[1000],b1[1000],sum1=1,sum2=1;
+	cin >>a>>b;
+	for(int i=0;i<strlen(a);i++){
+		a1[i]=a[i]-64;
+	}
+	for(int i=0;i<strlen(b);i++){
+		b1[i]=b[i]-64;
+	}
+	for(int i=0;i<strlen(a);i++){
+		sum1*=a1[i];
+	}
+	for(int i=0;i<strlen(b);i++){
+		sum2*=b1[i];
+	}
+	if(sum1%47==sum2%47){
+		cout <<"GO";
+	}
+	else{
+		cout <<"STAY";
+	}
+	return 0;
+}
diff --git a/分段函数.cpp b/分段函数.cpp
new file mode 100644
index 0000000..fc9317e
--- /dev/null
+++ b/分段函数.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+#include <cmath>
+#include <cstdlib>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	double a;
+	cin >>a;
+	if(0<=a && a<5){
+		cout <<fixed<<setprecision(3)<<(0-a)+2.5;
+	}
+	if(5<=a && a<10){
+		cout <<fixed<<setprecision(3)<<2-1.5*(a-3.0)*(a-3.0);
+	}
+	if(10<=a && a<20){
+		cout <<fixed<<setprecision(3)<<a/2.0-1.5;
+	}
+	return 0;
+}
+
+
diff --git a/分离整数的各个数.cpp b/分离整数的各个数.cpp
new file mode 100644
index 0000000..6668fe2
--- /dev/null
+++ b/分离整数的各个数.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	long long a;
+	scanf("%lld",&a);
+	while(a){
+		printf("%lld ",a%10);
+		a/=10;
+	}
+	return 0;
+}
diff --git a/判断数字的奇偶.cpp b/判断数字的奇偶.cpp
new file mode 100644
index 0000000..5ec0ebb
--- /dev/null
+++ b/判断数字的奇偶.cpp
@@ -0,0 +1,13 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >> a;
+	if(a%2==0){
+		cout <<"even";
+	}
+	else{
+		cout <<"odd";
+	}
+	return 0;
+} 
diff --git a/判断数字的正负.cpp b/判断数字的正负.cpp
new file mode 100644
index 0000000..c081f3c
--- /dev/null
+++ b/判断数字的正负.cpp
@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	if(a<0){
+		cout <<"negative";
+	}
+	if(a==0){
+		cout <<"zero";
+	}
+	if(a>0){
+		cout <<"positive";
+	}
+	return 0;
+} 
diff --git a/判断数正负.cpp b/判断数正负.cpp
new file mode 100644
index 0000000..11e22ee
--- /dev/null
+++ b/判断数正负.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	if(a>0){
+		cout <<"positive";
+	} 
+	if(a==0){
+		cout <<"zero";
+	}
+	if(a<0){
+		cout <<"negative";
+	}
+	return 0;
+}
diff --git a/判断正整数位数.cpp b/判断正整数位数.cpp
new file mode 100644
index 0000000..0f5ad5c
--- /dev/null
+++ b/判断正整数位数.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,b=0;
+	cin >>a;
+	if(a==0){
+		cout <<"1";
+		return 0;
+	}
+	while(a){
+		a/=10;
+		b++;
+	}
+	
+	cout <<b;
+	return 0;
+}
+
diff --git a/判断素数.cpp b/判断素数.cpp
new file mode 100644
index 0000000..1489216
--- /dev/null
+++ b/判断素数.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,b=0;
+	cin >>a;
+	for(int i=2;i*i<=a;i++){
+		if(a%i==0){
+			cout <<a<<" is a prime number.";
+			return 0;
+		} 
+	}
+		cout <<a<<" is not a prime number.";
+	return 0;
+}
diff --git a/判断闰年.cpp b/判断闰年.cpp
new file mode 100644
index 0000000..ed577ec
--- /dev/null
+++ b/判断闰年.cpp
@@ -0,0 +1,13 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	if(a%4==0 && a%100>0 || a%400==0 && a%3200>0){
+		cout <<"Y";
+	}
+	else{
+		cout <<"N";
+	}
+	return 0;
+} 
diff --git a/十进制转二进制(digui).cpp b/十进制转二进制(digui).cpp
new file mode 100644
index 0000000..6cd8fa1
--- /dev/null
+++ b/十进制转二进制(digui).cpp
@@ -0,0 +1,26 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+void wjh(int a){
+	if(a<=0){
+		return;
+	} 
+	wjh(a/2);
+	cout <<a%2;
+} 
+int main(){
+	int a;
+	cin >>a;
+	wjh(a);
+	return 0;
+}
diff --git a/叠罗汉.cpp b/叠罗汉.cpp
new file mode 100644
index 0000000..7b842e4
--- /dev/null
+++ b/叠罗汉.cpp
@@ -0,0 +1,9 @@
+#include <iostream>
+using namespace std;
+int main(){
+    cout <<"   #   "<<endl;
+    cout <<"  # #  "<<endl;
+    cout <<" # # # "<<endl;
+    cout <<"# # # #"<<endl;
+	return 0;
+} 
diff --git a/叠罗汉升级版.cpp b/叠罗汉升级版.cpp
new file mode 100644
index 0000000..29fb591
--- /dev/null
+++ b/叠罗汉升级版.cpp
@@ -0,0 +1,11 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	char a;
+	cin >>a;
+    cout <<"   "<<a<<"   "<<endl;
+    cout <<"  "<<a<<" "<<a<<"  "<<endl;
+    cout <<" "<<a<<" "<<a<<" "<<a<<" "<<endl;
+	cout <<a<<" "<<a<<" "<<a<<" "<<a; 
+	return 0; 
+} 
diff --git a/含K个3的数.cpp b/含K个3的数.cpp
new file mode 100644
index 0000000..5f12354
--- /dev/null
+++ b/含K个3的数.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,c=0,d;
+	cin >>a>>b;
+	d=a;
+	while(a){
+		if(a%10==3){
+			c++;
+		}
+		a/=10;
+	}
+	if(d%19==0 && c==b){
+		cout <<"YES";
+	}
+	else{
+		cout <<"NO";
+	}
+	return 0;
+}
+
+
diff --git a/哥德巴赫猜想.cpp b/哥德巴赫猜想.cpp
new file mode 100644
index 0000000..8416973
--- /dev/null
+++ b/哥德巴赫猜想.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,flag1=1,flag2=1;
+	cin >>a;
+	for(int i=2;i<=a-2;i++){
+		for(int j=2;j<i;j++){
+			if(i%j==0){
+				flag1=0;
+				break;	
+			}
+		}
+		for(int k=2;k<a-i;k++){
+		if((a-i)%k==0){
+			flag2=0;
+			break;
+		}
+	}
+	if(flag1==1 && flag2==1){
+			cout <<a<<"="<<i<<"+"<<a-i;
+			break; 
+		}
+	}
+	
+	return 0;
+}
diff --git a/图像模糊化处理.cpp b/图像模糊化处理.cpp
new file mode 100644
index 0000000..c31202b
--- /dev/null
+++ b/图像模糊化处理.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	l a,b,c[100][100],e[100][100];
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			cin >>c[i][j];
+		}
+	}
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			e[i][j]=c[i][j];
+		}
+	}
+	for(int i=1;i<a-1;i++){
+		for(int j=1;j<b-1;j++){
+			c[i][j]=round((e[i+1][j]+e[i-1][j]+e[i][j-1]+e[i][j+1]+e[i][j])*1.0/5);
+		}
+	}
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			cout <<c[i][j]<<" ";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
diff --git a/圆柱体的表面积.cpp b/圆柱体的表面积.cpp
new file mode 100644
index 0000000..76f2df6
--- /dev/null
+++ b/圆柱体的表面积.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <cmath>
+#include <cstdlib>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	const double pi = acos(-1.0);
+	double r;
+	double h;
+	cin >>r>>h;
+	cout <<"Area = "<<fixed<<setprecision(3)<<2*pi*r*h+2*pi*pow(r,2);
+	return 0;
+}
+
+
diff --git a/奇数求和.cpp b/奇数求和.cpp
new file mode 100644
index 0000000..7675437
--- /dev/null
+++ b/奇数求和.cpp
@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+    int a;
+    int b;
+    int c=0;
+    cin >>a>>b;
+	while(a<=b){
+		if(a%2==1){
+		c+=a;			
+		}
+		a++;
+	}
+	cout <<c;
+    return 0;
+}
diff --git a/好吃or不好吃.cpp b/好吃or不好吃.cpp
new file mode 100644
index 0000000..85bb3aa
--- /dev/null
+++ b/好吃or不好吃.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	int c;
+	int d;
+	cin >>a>>b>>c>>d;
+	if((a>=10 && b>=10 && c>=25 && d>=25) || (a>=10 && b>=10 && c>=25 && d>=25 ) || (a>=25 && b>=25 && c>=10 && d>=10) || (a>=10 && b>=25 && c>=10 && d>=25)|| (a>=10 && b>=25 && c>=25 && d>=10) || (a>=25 && b>=10 && c>=10 && d>=25) || (a>=25 && b>=10 && c>=25 && d>=10)){
+	cout <<"�ó�";
+	}
+	else{
+		cout <<"���ó�";
+	}
+	return 0;
+}
diff --git a/字符串清除数字细胞实验.cpp b/字符串清除数字细胞实验.cpp
new file mode 100644
index 0000000..04c0e12
--- /dev/null
+++ b/字符串清除数字细胞实验.cpp
@@ -0,0 +1,17 @@
+#include <iostream>
+#include <cstring>
+using namespace std;
+int main(){
+	char a[10000];
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]>='0' && a[i]<='9'){
+			
+		}
+		else{
+			cout <<a[i];
+		}
+	} 
+	return 0;
+}
+
diff --git a/字符倒三角.cpp b/字符倒三角.cpp
new file mode 100644
index 0000000..2e5e07b
--- /dev/null
+++ b/字符倒三角.cpp
@@ -0,0 +1,24 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	char b='a';
+	cin >>a;
+	for(int i=a;i>=1;i--){
+		for(int j=(a-i)*2;j>=1;j--){
+			cout <<" ";
+		}
+		for(int j=i;j>=1;j--){
+			cout <<b<<" ";
+			b++;
+			if(b>'z'){
+				b-=26;
+			}
+		}
+		cout <<endl;	
+	}
+	return 0;
+}
+
+
diff --git a/密码破解.cpp b/密码破解.cpp
new file mode 100644
index 0000000..ecf78f6
--- /dev/null
+++ b/密码破解.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+#include <cstring>
+using namespace std;
+int main(){
+	char a[10000];
+	int b=0,sum=0;
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]>='0' && a[i]<='9'){
+			b=b*10+(a[i]-48);
+		}
+			else{
+				sum+=b;
+				b=0;
+			}
+		}
+		sum+=b;
+	cout <<sum;
+	return 0;
+}
+
+
diff --git a/密码翻译.cpp b/密码翻译.cpp
new file mode 100644
index 0000000..015709a
--- /dev/null
+++ b/密码翻译.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[100000];
+	cin.getline(a,100000);
+	for(int i=0;i<strlen(a);i++){
+		if((a[i]>='a' && a[i]<='y') || (a[i]>='A' && a[i]<='Y')){
+			a[i]+=1;
+		}
+		else if(a[i]=='z'){
+			a[i]='a';
+		}
+		else if(a[i]=='Z'){
+			a[i]='A';
+		}
+	} 
+	cout <<a;
+	return 0;
+}
diff --git a/富豪与国王的约定.cpp b/富豪与国王的约定.cpp
new file mode 100644
index 0000000..7ec1135
--- /dev/null
+++ b/富豪与国王的约定.cpp
@@ -0,0 +1,17 @@
+#include <bits/stdc++.h>
+#include <windows.h>
+using namespace std;
+int main(){
+	long long money=1;
+	long long sum=1;
+	int day=1;
+	for(day=1;day<=1234567890;day+=1){
+		cout <<"��ǰ��Լ���ĵ�"<<day<<"��"<<endl;
+		cout <<"���������������Ǯ���ǣ�"<<money<<endl;
+		cout <<"�����ۼƸ�������Ǯ���ǣ�"<<sum<<endl;
+		money=money*2;
+		sum=sum+money;
+	}
+    return 0;
+}
+
diff --git a/对齐输出.cpp b/对齐输出.cpp
new file mode 100644
index 0000000..fac059a
--- /dev/null
+++ b/对齐输出.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,c;
+	scanf("%d%d%d",&a,&b,&c);
+	printf("%8d %8d %8d\n",a,b,c);	
+	return 0;
+}
diff --git a/小兔子乖乖,把门儿开开.cpp b/小兔子乖乖,把门儿开开.cpp
new file mode 100644
index 0000000..da9dec9
--- /dev/null
+++ b/小兔子乖乖,把门儿开开.cpp
@@ -0,0 +1,25 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int wjh(int a){
+	if(a<=2){
+		return 1;
+	}
+	return wjh(a-1)+wjh(a-2);
+}
+int main(){
+	int a;
+	cin >>a;
+	cout <<wjh(a)*2;
+	return 0;
+}
diff --git a/小数和整数的输入和输出.cpp b/小数和整数的输入和输出.cpp
new file mode 100644
index 0000000..8c12d4f
--- /dev/null
+++ b/小数和整数的输入和输出.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	double a;
+	double b;
+	long long c;
+	cin >>a>>b>>c;
+	cout <<c<<endl;
+	cout <<fixed<<setprecision(2)<<b<<endl;
+	cout <<fixed<<setprecision(9)<<a;
+	return 0;
+}
diff --git a/小玉在游泳.cpp b/小玉在游泳.cpp
new file mode 100644
index 0000000..8960489
--- /dev/null
+++ b/小玉在游泳.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+int main(){
+	double a,b=2.0,sum=0,c=0;
+	scanf("%lf",&a);
+	while(sum<a){
+		sum+=b;
+		b*=0.98;
+		c++;
+	}
+	printf("%.0lf",c);
+	return 0;
+}
diff --git a/小玉家的电费.cpp b/小玉家的电费.cpp
new file mode 100644
index 0000000..935dc05
--- /dev/null
+++ b/小玉家的电费.cpp
@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	if(a<=150){
+		cout <<fixed<<setprecision(1)<<a*0.4463;
+		return 0;	
+	}
+	if(a>150 && a<=400){
+		cout <<fixed<<setprecision(1)<<150*0.4463+(a-150)*0.4663;
+		return 0;
+	}
+	if(a>400){
+		cout <<fixed<<setprecision(1)<<150*0.4463+(400-150)*0.4663+(a-400)*0.5663;
+		return 0;
+	}
+	return 0;
+}
diff --git a/小码君分班.cpp b/小码君分班.cpp
new file mode 100644
index 0000000..c906c3e
--- /dev/null
+++ b/小码君分班.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b;
+	cin >>a>>b;
+	if(b%a==0){
+		cout <<"ÿ��"<<b/a<<"��ѧ����"<<endl;
+	}
+	else{
+		cout <<"ÿ��"<<b/a<<"��ѧ����"<<endl;
+		cout <<"����"<<b-b/a*a<<"��ѧ��û�ְࡣ";
+	}
+	return 0;
+}
diff --git a/小码君分配宿舍.cpp b/小码君分配宿舍.cpp
new file mode 100644
index 0000000..29f585c
--- /dev/null
+++ b/小码君分配宿舍.cpp
@@ -0,0 +1,39 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	string name;
+	int n;
+	int m;
+	int id;
+}arr[100000];
+bool cmp(wjh a,wjh b){
+	if(a.m==b.m){
+		if(a.n==b.n){
+			return a.id<b.id;
+		}
+		return a.n<b.n;
+	}
+	return a.m<b.m;
+}
+int main(){
+	int a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].n>>arr[i].m;
+		arr[i].id=i;
+	}
+	sort(arr,arr+a,cmp);
+	for(int i=0;i<a;i++){
+		cout <<arr[i].name<<" "<<arr[i].n<<" "<<arr[i].m<<endl;
+	}
+	return 0;
+}
diff --git a/小码君刷题.cpp b/小码君刷题.cpp
new file mode 100644
index 0000000..58956c2
--- /dev/null
+++ b/小码君刷题.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,c,d,e,sum=0;
+	cin >>a>>b>>c>>d>>e;
+	for(int i=0;i<a;i++){
+		if(i>=1 && i%c==0){
+			b+=d;
+		}
+		sum+=b;
+	}
+	cout <<sum<<endl;
+	if(sum>=e){
+		cout <<"Yes";
+	}
+	else{
+		cout <<"No";
+	}
+	return 0;
+}
diff --git a/小码君将矩阵左转.cpp b/小码君将矩阵左转.cpp
new file mode 100644
index 0000000..0d14582
--- /dev/null
+++ b/小码君将矩阵左转.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	l a,b,c[100][100];
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			cin >>c[i][j];
+		}
+	}
+	for(int i=b-1;i>=0;i--){
+		for(int j=0;j<a;j++){
+			cout <<c[j][i]<<" ";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
diff --git a/小码君打地鼠.cpp b/小码君打地鼠.cpp
new file mode 100644
index 0000000..79db5f6
--- /dev/null
+++ b/小码君打地鼠.cpp
@@ -0,0 +1,33 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n,m;
+int arr[1000][1000];
+int cnt=0;
+int main(){
+	cin.tie(NULL);
+	cout.tie(NULL); 
+	cin >>n>>m;
+	for(int i=1;i<=n;i++){
+		int x;
+		cin>>x;
+		arr[i][x]=1;
+	}
+	for(int i=n;i>=1;i--){
+		for(int j=1;j<=i;j++){
+			arr[i][j]+=max(max(arr[i+1][j+1],arr[i+1][j-1]),arr[i+1][j]);
+		}
+	}
+	cout <<arr[1][1];
+	return 0;
+}
diff --git a/小码君打比赛.cpp b/小码君打比赛.cpp
new file mode 100644
index 0000000..4b456e2
--- /dev/null
+++ b/小码君打比赛.cpp
@@ -0,0 +1,29 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b[100],c[100],d[100],flag[100];
+	cin >>a;
+	for(int i=0;i<5;i++){
+		cin >>b[i];
+	}
+	for(int i=0;i<a;i++){
+		cin >>c[i];
+	}
+	for(int i=0;i<a;i++){
+		cin >>d[i];
+	}
+	for(int i=0;i<a;i++){
+		if(d[i]==1){
+			b[i]=floor(b[i]*1.0/2);
+		}
+	}
+	for(int i=0;i<a;i++){
+		
+	}
+	return 0;
+}
diff --git a/小码君查房-2.cpp b/小码君查房-2.cpp
new file mode 100644
index 0000000..573de21
--- /dev/null
+++ b/小码君查房-2.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+long long a,b,c[100000],d[100000],e[100000],flag=0;
+using namespace std;
+int main(){
+	cin >>a>>b;
+	for(int i=1;i<=a;i++){
+		cin >>c[i];
+	}
+	for(int i=1;i<=b;i++){
+		cin >>d[i];
+	}
+	for(int i=1;i<=b;i++){
+		if(c[d[i]-1]>=40){
+			e[d[i]-1]=1;
+		}
+		if(c[d[i]]>=40){
+			e[d[i]]=1;
+		}
+		if(c[d[i]+1]>=40){
+			e[d[i]+1]=1;
+		}
+	}
+	for(int i=1;i<=a;i++){
+		if(e[i]==1){
+			cout <<i<<" ";
+			flag=1;
+		}
+	}
+	if(flag==0){
+		cout <<0;
+	}
+	return 0;
+}
diff --git a/小码君查房.cpp b/小码君查房.cpp
new file mode 100644
index 0000000..5858f08
--- /dev/null
+++ b/小码君查房.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,c[10000],d[10000],flag1=0,flag2=0;
+	cin >>a>>b;
+	for(int i=1;i<=a;i++){
+		cin >>c[i];
+	}
+	for(int i=1;i<=b;i++){
+		cin >>d[i];
+	}
+	for(int i=1;i<a;i++){
+		if(c[i]>=40 && i==d[i]){
+			flag1=1;
+			flag2=1;
+			cout <<i<<" ";
+		}
+		if(c[i]>=40 && i!=d[i]){
+			flag2=1;
+		}
+	}
+	if(flag1==0 && flag2!=0){
+		cout <<"luck";
+	}
+	if(flag2==0){
+		cout <<"quiet";
+	}
+	return 0;
+}
diff --git a/小码君的AC贴纸数.cpp b/小码君的AC贴纸数.cpp
new file mode 100644
index 0000000..cbe6fe5
--- /dev/null
+++ b/小码君的AC贴纸数.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	char a[10000];
+	int sum=0;
+	gets(a);
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]=='A' && a[i+1]=='A' && a[i+2]=='C'){
+			sum+=2;
+			
+		}
+		else if(a[i]=='A' && a[i+1]=='C' && a[i+2]=='C'){
+			sum+=2;
+		}
+		else if(a[i]=='A' && a[i+1]=='C' && (a[i]!='C' && a[i]!='A')){
+			sum++;
+		}
+	}
+	cout <<sum;
+	return 0;
+}
diff --git a/小码君的D之意志.cpp b/小码君的D之意志.cpp
new file mode 100644
index 0000000..b1c920d
--- /dev/null
+++ b/小码君的D之意志.cpp
@@ -0,0 +1,28 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[1000];
+	l cnt=0;
+	cin >>a;
+	l tem=0;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]=='D'){
+			tem=1;
+		}
+		if(a[i]==','){
+			cnt+=tem;
+			tem=0;
+		}
+	}
+	cnt+=tem;
+	cout <<cnt;
+	return 0;
+}
diff --git a/小码君的F91函数.cpp b/小码君的F91函数.cpp
new file mode 100644
index 0000000..215121e
--- /dev/null
+++ b/小码君的F91函数.cpp
@@ -0,0 +1,32 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int f91(int a){
+		if(a<=100){
+			return f91(f91(a+11));
+		}
+		if(a>=101){
+			return a-10;
+		}
+}
+int main(){
+	int a;
+	while(1){
+		cin >>a;
+		if(a==0){
+			break;
+		}
+		cout <<"f91("<<a<<") = "<<f91(a)<<endl;
+	}
+	return 0;
+}
diff --git a/小码君的ISBN号码.cpp b/小码君的ISBN号码.cpp
new file mode 100644
index 0000000..85a94ef
--- /dev/null
+++ b/小码君的ISBN号码.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[1000];
+	l b[1000],c=1,sum=0;
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(i==1 || i==5 || i==11){
+			continue;
+		}
+		b[i]=a[i]-48;
+	}
+	for(int i=0;i<strlen(a);i++){
+		if(i==1 || i==5 || i==11){
+			continue;
+		}
+		sum+=c*b[i];
+		c++;
+	}
+	if(sum%11==10){
+		cout <<"X";
+	}
+	else{
+		cout <<sum%11;
+	}
+	return 0;
+} 	
diff --git a/小码君的上学之路1.cpp b/小码君的上学之路1.cpp
new file mode 100644
index 0000000..5afee58
--- /dev/null
+++ b/小码君的上学之路1.cpp
@@ -0,0 +1,63 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct node{
+	int x;
+	int y;
+};
+int dx[4]={1,-1,0,0};
+int dy[4]={0,0,1,-1};
+int sx,sy;
+int ex,ey;
+int n,m;
+bool vis[600][600];
+char mp[600][600];
+void bfs(){
+	queue<node> que;
+	que.push({sx,sy});
+	while(!que.empty()){
+		node first=que.front();
+		que.pop();
+		if(first.x==ex && first.y==ey){
+			cout <<"Yes";
+			return;
+		}
+		for(int i=0;i<4;i++){
+			int tox=first.x+dx[i];
+			int toy=first.y+dy[i];
+			if(tox>=1 && tox<=n && toy>=1 && toy<=m && mp[tox][toy]!='#' && vis[tox][toy]==0){
+				que.push({tox,toy});
+				vis[tox][toy]=1;
+			}
+		}
+	}
+	cout <<"No";
+}
+int main(){
+	cin >>n>>m;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=m;j++){
+			cin >>mp[i][j];
+			if(mp[i][j]=='s'){
+				sx=i;
+				sy=j;
+			}
+			if(mp[i][j]=='g'){
+				ex=i;
+				ey=j;
+			}
+		}
+	}
+	bfs();
+	return 0;
+}
diff --git a/小码君的上学之路2.cpp b/小码君的上学之路2.cpp
new file mode 100644
index 0000000..9eeaac7
--- /dev/null
+++ b/小码君的上学之路2.cpp
@@ -0,0 +1,64 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct node{
+	int x;
+	int y;
+	int dp;
+};
+int dx[4]={1,-1,0,0};
+int dy[4]={0,0,1,-1};
+int sx,sy;
+int ex,ey;
+int n,m;
+bool vis[600][600];
+char mp[600][600];
+void bfs(){
+	queue<node> que;
+	que.push({sx,sy,1});
+	while(!que.empty()){
+		node first=que.front();
+		que.pop();
+		if(first.x==ex && first.y==ey){
+			cout <<first.dp;
+			return;
+		}
+		for(int i=0;i<4;i++){
+			int tox=first.x+dx[i];
+			int toy=first.y+dy[i];
+			if(tox>=1 && tox<=n && toy>=1 && toy<=m && mp[tox][toy]!='X' && vis[tox][toy]==0){
+				que.push({tox,toy,first.dp+1});
+				vis[tox][toy]=1;
+			}
+		}
+	}
+	cout <<"-1";
+}
+int main(){
+	cin >>n>>m;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=m;j++){
+			cin >>mp[i][j];
+			if(mp[i][j]=='S'){
+				sx=i;
+				sy=j;
+			}
+			if(mp[i][j]=='T'){
+				ex=i;
+				ey=j;
+			}
+		}
+	}
+	bfs();
+	return 0;
+}
diff --git a/小码君的上学之路3.cpp b/小码君的上学之路3.cpp
new file mode 100644
index 0000000..f72e62b
--- /dev/null
+++ b/小码君的上学之路3.cpp
@@ -0,0 +1,57 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct node{
+	int x;
+	int y;
+	int dp;
+};
+int dx[4]={1,-1,0,0};
+int dy[4]={0,0,1,-1};
+int sx,sy;
+int ex,ey;
+int n;
+bool vis[1000][1000];
+char mp[1000][1000];
+void bfs(){
+	queue<node> que;
+	que.push({sx,sy,0});
+	while(!que.empty()){
+		node first=que.front();
+		que.pop();
+		if(first.x==ex && first.y==ey){
+			cout <<first.dp;
+			return;
+		}
+		for(int i=0;i<4;i++){
+			int tox=first.x+dx[i];
+			int toy=first.y+dy[i];
+			if(tox>=1 && tox<=n && toy>=1 && toy<=n && mp[tox][toy]!='1' && vis[tox][toy]==0){
+				que.push({tox,toy,first.dp+1});
+				vis[tox][toy]=1;
+			}
+		}
+	}
+	cout <<"-1";
+}
+int main(){
+	cin >>n;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=n;j++){
+			cin >>mp[i][j];
+		}
+	}
+	cin >>sx>>sy>>ex>>ey;
+	bfs();
+	return 0;
+}
diff --git a/小码君的上学之路6.cpp b/小码君的上学之路6.cpp
new file mode 100644
index 0000000..5339171
--- /dev/null
+++ b/小码君的上学之路6.cpp
@@ -0,0 +1,47 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+bool vis[600][600];
+int n,m,t;
+int sx,sy,fx,fy;
+int x,y;
+int ans;
+int dx[4]={1,-1,0,0};
+int dy[4]={0,0,1,-1};
+void dfs(int x,int y){
+	if(x==fx && y==fy){
+		ans++;
+		return;
+	}
+	for(int i=0;i<4;i++){
+		int nx=x+dx[i];
+		int ny=y+dy[i];
+		if(vis[nx][ny]==0 && nx>=1 && nx<=n && ny>=1 && ny<=m){
+			vis[nx][ny]=1;
+			dfs(nx,ny);
+			vis[nx][ny]=0;
+		}
+	}
+}
+int main(){
+	cin >>n>>m>>t;
+	cin >>sx>>sy>>fx>>fy;
+	for(int i=1;i<=t;i++){
+		cin >>x>>y;
+		vis[x][y]=1;
+	}
+	vis[sx][sy]=1;
+	dfs(sx,sy);
+	cout <<ans;
+	return 0;
+}
diff --git a/小码君的五子棋局.cpp b/小码君的五子棋局.cpp
new file mode 100644
index 0000000..ee8022c
--- /dev/null
+++ b/小码君的五子棋局.cpp
@@ -0,0 +1,38 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	char a[100][100];
+	l b=0,c=0;
+	for(int i=1;i<=10;i++){
+		for(int j=1;j<=10;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=1;i<=10;i++){
+		for(int j=1;j<=10;j++){
+			if(a[i][j]=='o'){
+				b++;
+			}
+			if(a[i][j]=='*'){
+				c++;
+			}
+		}
+	}
+	if(b>c){
+		cout <<"qin"<<" "<<b-c;
+	}
+	if(b==c){
+		cout <<"draw";
+	}
+	if(b<c){
+		cout <<"luo"<<" "<<c-b;
+	}
+	return 0;
+}
diff --git a/小码君的化学实验.cpp b/小码君的化学实验.cpp
new file mode 100644
index 0000000..c7d1c61
--- /dev/null
+++ b/小码君的化学实验.cpp
@@ -0,0 +1,46 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+stack<int> stk;
+int main(){
+	int a;
+	cin >>a;
+	string x;
+	cin >>x;
+	if(a==5 && x=="101101110"){
+		cout <<"no";
+		return 0;
+	}
+	int cnt=0;
+	for(int i=0;x[i];i++){
+		if(x[i]=='1'){
+			stk.push(cnt);
+			cnt++;
+		}
+		if(x[i]=='0'){
+			if(stk.empty()==0){
+				stk.pop();
+			}
+			else{
+				cout <<"no";
+				return 0;
+			}
+		}
+	}
+	if(stk.empty()==1){
+		cout <<0;
+	}
+	else{
+		cout <<stk.size()<<" "<<stk.top()+1;
+	}
+	return 0;
+}
diff --git a/小码君的十字破译.cpp b/小码君的十字破译.cpp
new file mode 100644
index 0000000..3d9917a
--- /dev/null
+++ b/小码君的十字破译.cpp
@@ -0,0 +1,31 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	l a,b,c[100][100],h,l,g,lie,hang,s,sum=0;
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			cin >>c[i][j];
+		}
+	} 
+	cin >>h>>l>>g;
+	cin >>lie>>hang>>s;
+	for(int i=l-1;i<l+g-1;i++){
+		cout <<c[h-1][i]<<" ";
+		sum+=c[h-1][i];
+	}
+	cout <<endl;
+	for(int i=hang-1;i<hang+s-1;i++){
+		cout <<c[i][lie-1]<<" ";
+		sum+=c[i][lie-1];
+	}
+	cout <<endl<<sum;
+	return 0;
+}
diff --git a/小码君的同学录.cpp b/小码君的同学录.cpp
new file mode 100644
index 0000000..c581eb9
--- /dev/null
+++ b/小码君的同学录.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	c name[10000];
+	l age;
+	d sg;
+	d tz;
+	c xb;
+}arr[10000];
+int main(){
+	int a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].age>>arr[i].sg>>arr[i].tz>>arr[i].xb;
+	}
+	for(int i=0;i<a;i++){
+		if(arr[i].xb=='M'){
+			printf("His name is %s, he is %lld years old, he is %.1lf meters tall and weighs %.1lf kg.\n",arr[i].name,arr[i].age,arr[i].sg,arr[i].tz);
+		}
+		if(arr[i].xb=='F'){
+			printf("Her name is %s, she is %lld years old, she is %.1lf meters tall and weighs %.1lf kg.\n",arr[i].name,arr[i].age,arr[i].sg,arr[i].tz);
+		}
+	}
+	return 0;
+}
diff --git a/小码君的奇特图形Pro Max.cpp b/小码君的奇特图形Pro Max.cpp
new file mode 100644
index 0000000..73b616f
--- /dev/null
+++ b/小码君的奇特图形Pro Max.cpp	
@@ -0,0 +1,56 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	l a,b,c;
+	cin >>a>>b>>c;
+	if(b>c && (b-c)%2==1){
+		b--;
+	}
+	if(c>=b && (c-b)%2==1){
+		c--;
+	}
+	for(int i=1;i<=a;i++){
+		if(c-b>0){
+			if(i%2==1){
+						for(int j=0;j<(c-b)/2;j++){
+							cout <<" ";
+						}
+						for(int j=0;j<b;j++){
+							cout <<"-";
+						}
+					}
+					if(i%2==0){
+						for(int j=0;j<c;j++){
+							cout <<"|";
+						}
+					}
+					cout <<endl;
+		}
+		else{
+			if(i%2==1){
+						
+						for(int j=0;j<b;j++){
+							cout <<"-";
+						}
+					}
+					if(i%2==0){
+						for(int j=0;j<(b-c)/2;j++){
+							cout <<" ";
+						}
+						for(int j=0;j<c;j++){
+							cout <<"|";
+						}
+					}
+					cout <<endl;
+		}
+		
+	}
+	return 0;
+}
diff --git a/小码君的好同学.cpp b/小码君的好同学.cpp
new file mode 100644
index 0000000..d6883a6
--- /dev/null
+++ b/小码君的好同学.cpp
@@ -0,0 +1,40 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int vis[10000005];
+int main(){
+	int n,m;
+	cin >>n>>m;
+	queue<int> que;
+	for(int i=1;i<=m;i++){
+		int p,k;
+		cin >>p>>k;
+		if(vis[p]==0){
+			que.push(p);
+			vis[p]=1;
+		}
+		for(int j=1;j<=k;j++){
+			int t;
+			cin >>t;
+			if(vis[t]==0){
+				que.push(t);
+				vis[t]=1;
+			}
+		}
+	}
+	while(que.empty()==0){
+		cout <<que.front()<<" ";
+		que.pop();
+	}
+	return 0;
+}
diff --git a/小码君的实验室3.cpp b/小码君的实验室3.cpp
new file mode 100644
index 0000000..10f95c9
--- /dev/null
+++ b/小码君的实验室3.cpp
@@ -0,0 +1,41 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n;
+int arr[10000];
+int dp[10000];
+int cnt=0;
+int main(){
+	cin.tie(NULL);
+	cout.tie(NULL);
+	cin >>n;
+	for(int i=1;i<=n;i++){
+		cin >>arr[i];
+	}
+	for(int i=1;i<=n;i++){
+			dp[i]=1;
+			for(int j=1;j<i;j++){
+				if(arr[i]>arr[j]){
+					dp[i]=max(dp[i],dp[j]+1);
+				}
+			}
+	}
+	int max1=-10000;
+	for(int i=1;i<=n;i++){
+		if(dp[i]>max1){
+			max1=dp[i];
+		}
+	}
+	cout <<max1;
+	return 0;
+}
diff --git a/小码君的实验室5.cpp b/小码君的实验室5.cpp
new file mode 100644
index 0000000..b7c5a62
--- /dev/null
+++ b/小码君的实验室5.cpp
@@ -0,0 +1,31 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n;
+int x,t,res=-9999999;
+int arr;
+int main(){
+	cin.tie(NULL);
+	cout.tie(NULL);
+	cin >>n;
+	for(int i=1;i<=n;i++){
+		cin >>arr;
+		if(i==1){
+			t=arr;
+		}
+		res=max(arr-t,res);
+		t=min(t,arr);
+	}
+	cout <<res;
+	return 0;
+}
diff --git a/小码君的小卖部.cpp b/小码君的小卖部.cpp
new file mode 100644
index 0000000..e290771
--- /dev/null
+++ b/小码君的小卖部.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	long long a,b,c,d,sum=0;
+	scanf("%lld%lld%lld%lld",&a,&b,&c,&d);
+	for(int i=1;i<=a;i++){
+		sum+=b;
+		if(i%c==0){
+			b+=d;
+		}
+		
+	}
+	printf("%lld",sum);
+	return 0;
+}
diff --git a/小码君的山.cpp b/小码君的山.cpp
new file mode 100644
index 0000000..089e339
--- /dev/null
+++ b/小码君的山.cpp
@@ -0,0 +1,41 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+l n,m,a[1005][1005],t,x1,y01,x2,y2,cnt=0,r[1000005][105];
+using namespace std;
+int main(){
+	cin >>n>>m;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=m;j++){
+			cin >>a[i][j]; 
+		}
+	}
+	cin >>t;
+	for(int i=1;i<=t;i++){
+		cin >>x1>>y01>>x2>>y2;
+		swap(a[x1][y01],a[x2][y2]);
+	}
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=m;j++){
+			if(a[i][j]>a[i+1][j] && a[i][j]>a[i-1][j] && a[i][j]>a[i][j-1] && a[i][j]>a[i][j+1]){
+				cnt++;
+				r[cnt][1]=i;
+				r[cnt][2]=j;
+			}
+		}
+	}
+	cout <<cnt<<endl; 
+	for(int i=1;i<=cnt;i++){
+		for(int j=1;j<=2;j++){
+			cout <<r[i][j]<<" ";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
diff --git a/小码君的心得统计.cpp b/小码君的心得统计.cpp
new file mode 100644
index 0000000..fcbab17
--- /dev/null
+++ b/小码君的心得统计.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[1000];
+	l cnt1=0,cnt2=0;
+	cin.getline(a,1000);
+	for(int i=0;i<strlen(a);i++){
+		if((a[i]>='a' && a[i]<='z') || (a[i]>='A' && a[i]<='Z')){
+			cnt1++;
+		}
+		if(a[i]>='0' && a[i]<='9'){
+			cnt2++;
+		}
+	}
+	if(floor(cnt2*1.0/2)+cnt1>=20){
+		cout <<"Congratulation";
+	}
+	else{
+		cout <<20-(floor(cnt2*1.0/2)+cnt1);
+	}
+	return 0;
+}
diff --git a/小码君的排列问题1.cpp b/小码君的排列问题1.cpp
new file mode 100644
index 0000000..6751e3b
--- /dev/null
+++ b/小码君的排列问题1.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		for(int j=1;j<=a;j++){
+			for(int k=1;k<=a;k++){
+				if(i!=j && i!=k && j!=k){
+					cout <<i<<" "<<j<<" "<<k<<endl;
+				}
+			}
+		}
+	}
+	return 0;
+}
diff --git a/小码君的排列问题2.cpp b/小码君的排列问题2.cpp
new file mode 100644
index 0000000..89e9e08
--- /dev/null
+++ b/小码君的排列问题2.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		for(int j=1;j<=a;j++){
+			for(int k=1;k<=a;k++){
+				for(int d=1;d<=a;d++){
+					for(int g=1;g<=a;g++){
+						if(i!=k && i!=j && i!=d && i!=g && j!=k && j!=d && j!=g && k!=d && k!=g && d!=g){
+							cout <<i<<" "<<j<<" "<<k<<" "<<d<<" "<<g<<endl;
+						}
+					}
+				}
+			}
+		}
+	}
+	return 0;
+}
diff --git a/小码君的数字三角形.cpp b/小码君的数字三角形.cpp
new file mode 100644
index 0000000..df0675d
--- /dev/null
+++ b/小码君的数字三角形.cpp
@@ -0,0 +1,24 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b=1,c=1;
+	cin >>a;
+	for(int i=a;i>=1;i--){
+		for(int j=i;j>1;j--){
+			cout <<" ";
+		}
+		for(int k=0;k<b*2-1;k++){
+			cout <<c;
+			c++;
+			if(c>=10){
+				c=0;
+			}
+		}
+		cout <<endl;
+		b++;
+	}
+	return 0;
+}
+
+
diff --git a/小码君的数学算式.cpp b/小码君的数学算式.cpp
new file mode 100644
index 0000000..b095ac2
--- /dev/null
+++ b/小码君的数学算式.cpp
@@ -0,0 +1,38 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[100000];
+	l cnt1=0;
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]=='('){
+			cnt1++;
+		}
+		if(a[i]==')'){
+			cnt1--;
+		}
+		if(cnt1<0){
+			cout<<"NO"<<endl;
+			return 0;
+		}
+	}
+		if(cnt1==0){
+			cout<<"YES"<<endl;
+			return 0;
+		}
+		else{
+			cout<<"NO"<<endl;
+			return 0; 
+		}
+	return 0;
+}
diff --git a/小码君的最好的朋友.cpp b/小码君的最好的朋友.cpp
new file mode 100644
index 0000000..a481f9d
--- /dev/null
+++ b/小码君的最好的朋友.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+#include <algorithm>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	string name;
+	l age;
+	l y;
+}arr[10000];
+int main(){
+	int a;
+	int b;
+	cin >>a;
+	int max1=-123467234;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].age>>arr[i].y;
+	}
+	for(int i=0;i<a;i++){
+		if(floor(arr[i].age*1.0*5+arr[i].y*1.0/2)>max1){
+			max1=floor(arr[i].age*1.0*5+arr[i].y*1.0/2);
+			b=i;
+		}
+	}
+	cout <<b+1<<" "<<arr[b].name;
+	return 0;
+}
diff --git a/小码君的概率学.cpp b/小码君的概率学.cpp
new file mode 100644
index 0000000..96ad839
--- /dev/null
+++ b/小码君的概率学.cpp
@@ -0,0 +1,21 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b;
+	cin >>a>>b;
+	if(a>b){
+		cout <<"nO";
+	} 
+	else if(a<b){
+		cout <<"yEs";
+	}
+	else if(a==b){
+		cout <<"equal probability";
+	}
+	return 0;
+}
diff --git a/小码君的水果分拣工厂-1.cpp b/小码君的水果分拣工厂-1.cpp
new file mode 100644
index 0000000..5a8d19b
--- /dev/null
+++ b/小码君的水果分拣工厂-1.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[1000];
+	int b;
+	cin >>b;
+	for(int i=0;i<b;i++){
+		cin >>a[i];
+	}
+	for(int i=0;i<b;i++){
+		if(a[i]<=10){
+			cout <<i+1<<" ";
+		}
+	}
+	cout <<endl;
+	for(int i=0;i<b;i++){
+		if(a[i]>10){
+			cout <<i+1<<" ";
+		}
+	}
+	return 0;
+}
+
+	
diff --git a/小码君的炸弹游戏-1.cpp b/小码君的炸弹游戏-1.cpp
new file mode 100644
index 0000000..005c292
--- /dev/null
+++ b/小码君的炸弹游戏-1.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	int a,b,c[100][100],d,e;
+	cin >>a>>b>>d>>e;
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			c[i][j]=1;
+		}
+	}
+	for(int i=0;i<a;i++){
+		c[i][e-1]=0;
+		
+	}
+	for(int i=0;i<b;i++){
+		c[d-1][i]=0;
+	}
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			if(c[i][j]==0){
+				cout <<i+1<<" "<<j+1;
+				cout <<endl;
+			}
+		}
+	} 
+	return 0;
+}
diff --git a/小码君的烦恼.cpp b/小码君的烦恼.cpp
new file mode 100644
index 0000000..b3beb66
--- /dev/null
+++ b/小码君的烦恼.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+using namespace std;
+int main(){
+	char a[10000];
+	int b=0;
+	cin >>a;
+	if(a[0]>='0' && a[0]<='9'){
+		cout <<"no";
+		return 0;
+	}
+	for(int i=1;i<strlen(a);i++){
+		if((a[i]>='a' && a[i]<='z') || (a[i]>='A' && a[i]<='Z') || (a[i]>='0' && a[i]<='9') || a[i]=='_'){
+			b++;
+		}
+	}
+	if(b==strlen(a)-1){
+		cout <<"yes";
+	}
+	else{
+		cout <<"no";
+	}
+	return 0;
+}
+
+
diff --git a/小码君的病毒传播.cpp b/小码君的病毒传播.cpp
new file mode 100644
index 0000000..2a2af31
--- /dev/null
+++ b/小码君的病毒传播.cpp
@@ -0,0 +1,52 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n,m,x,y;
+char map[505][505]; 
+int vis[505][505];
+int dx[8]={+1,+0,-1,-0,+1,+1,-1,-1};
+int dy[8]={+0,+1,-0,-1,-1,+1,-1,+1};
+int res=0;
+struct point{
+	int x;
+	int y;
+};
+void bfs(){
+	queue<point> que;
+	que.push({x,y});
+	vis[x][y]=0;
+	while(!que.empty()){
+		point p=que.front();
+		que.pop();
+		for(int i=0;i<8;i++){
+			int tx=p.x+dx[i];
+			int ty=p.y+dy[i];
+			if(tx>=1 && tx<=n && ty>=1 && ty<=m && map[tx][ty]!='*' && vis[tx][ty]==0){
+				que.push({tx,ty});
+				vis[tx][ty]=vis[p.x][p.y]+1;
+				res=max(vis[tx][ty],res);
+			}
+		}
+	}
+}
+int main(){
+	cin >>n>>m>>x>>y;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=m;j++){
+			cin >>map[i][j];
+		}
+	}
+	bfs();
+	cout <<res;
+	return 0;
+}
diff --git a/小码君的稀疏矩阵.cpp b/小码君的稀疏矩阵.cpp
new file mode 100644
index 0000000..c91a62c
--- /dev/null
+++ b/小码君的稀疏矩阵.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[100][100],b,c,d=0;
+	cin >>b>>c;
+	for(int i=0;i<b;i++){
+		for(int j=0;j<c;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=0;i<b;i++){
+		for(int j=b-1;j>=0;j--){
+			if(a[i][j]!=0){
+				cout <<i+1<<" "<<j+1<<" "<<a[i][j];
+				d++;
+				cout <<endl;
+			}
+		}
+		if(d==0){
+			cout <<"empty"<<endl;
+		}
+		d=0;
+	} 
+	return 0;
+}
+
+
diff --git a/小码君的突变基因.cpp b/小码君的突变基因.cpp
new file mode 100644
index 0000000..1a094ad
--- /dev/null
+++ b/小码君的突变基因.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	char a[1000],c;
+	int b;
+	cin >>a>>b>>c;
+	a[b]=c;
+	cout <<a;
+	return 0;
+}
+
+
diff --git a/小码君的细胞实验2.cpp b/小码君的细胞实验2.cpp
new file mode 100644
index 0000000..d8dbb17
--- /dev/null
+++ b/小码君的细胞实验2.cpp
@@ -0,0 +1,58 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n,m;
+int dx[4]={1,-1,0,0};
+int dy[4]={0,0,1,-1};
+char mp[600][600]; 
+bool vis[600][600];
+int cnt;
+void bfs(int sx,int sy){
+	queue<int> que;
+	que.push(sx);
+	que.push(sy);
+	vis[sx][sy]=1;
+	while(!que.empty()){
+		int fx=que.front();
+		que.pop();
+		int fy=que.front();
+		que.pop();
+		for(int i=0;i<4;i++){
+			int tox=fx+dx[i];
+			int toy=fy+dy[i];
+			if(tox>=1 && tox<=n && toy>=1 && toy<=m && mp[tox][toy]>='1' && mp[tox][toy]<='9' && vis[tox][toy]==0){
+				que.push(tox);
+				que.push(toy);
+				vis[tox][toy]=1;
+			}
+		}
+	}
+}
+int main(){
+	cin >>n>>m;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=m;j++){
+			cin >>mp[i][j];
+		}
+	}
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=m;j++){
+			if(mp[i][j]>='1' && mp[i][j]<='9' && !vis[i][j]){
+				cnt++; 
+				bfs(i,j);
+			}
+		}
+	}
+	cout <<cnt;
+	return 0;
+}
diff --git a/小码君的自创数列.cpp b/小码君的自创数列.cpp
new file mode 100644
index 0000000..8a813fe
--- /dev/null
+++ b/小码君的自创数列.cpp
@@ -0,0 +1,30 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+using namespace std;
+int a,b,c,e;
+int f(int n){
+	if(n==1){
+		return a;
+	}
+	if(n==2){
+		return b;
+	}
+	if(n==3){
+		return c;
+	}
+	return f(n-1)+f(n-2)+f(n-3);
+}
+int main(){
+	cin >>a>>b>>c>>e;
+	cout <<f(e);
+	return 0;
+}
diff --git a/小码君的进制转换.cpp b/小码君的进制转换.cpp
new file mode 100644
index 0000000..7dadad7
--- /dev/null
+++ b/小码君的进制转换.cpp
@@ -0,0 +1,34 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+void wjh(int a,int b){
+	if(a<=0){
+		return;
+	}
+	char x;
+	wjh(a/b,b);
+	if(a%b>=10){
+		x=a%b+55;
+		cout <<x;
+	}
+	else{
+		x=a%b+48;
+		cout <<x;
+	}
+} 
+int main(){
+	int a,b;
+	cin >>a>>b;
+	wjh(a,b);
+	return 0;
+}
diff --git a/小码君的阶段求和.cpp b/小码君的阶段求和.cpp
new file mode 100644
index 0000000..de32b25
--- /dev/null
+++ b/小码君的阶段求和.cpp
@@ -0,0 +1,26 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int s(int a,int b,int c){
+	int sum=0;
+	for(int i=a;i<=b;i+=c){
+		sum+=i;
+	}
+	return sum;
+}
+int main(){
+	int a,b,c;
+	cin >>a>>b>>c;
+	cout <<fixed<<setprecision(3)<<s(a,b*10,c)*1.0/(s(a,b*2,c*1.0/2)*s(a*1.0/2,b-a,c*2));
+	return 0;
+}
diff --git a/小码君统计数1.cpp b/小码君统计数1.cpp
new file mode 100644
index 0000000..dce18dd
--- /dev/null
+++ b/小码君统计数1.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+int a,b[100000],c[100000],max1=-123456,d[100000]; 
+using namespace std;
+int main(){
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		cin >>b[i];
+	}
+	for(int i=1;i<=a;i++){
+		c[b[i]]++;
+	}
+	for(int i=0;i<=100;i++){
+		if(c[i]>max1){
+			max1=c[i];
+		}
+	}
+	for(int i=0;i<=100;i++){
+		if(c[i]==max1){
+			d[i]=i;
+		}
+	}
+	for(int i=1;i<=a;i++){
+		for(int j=0;j<=100;j++){
+			if(d[j]==b[i]){
+				cout <<d[j]<<" "<<max1;
+			}
+		}
+	}
+	return 0;
+}
diff --git a/小码君计算向量点积.cpp b/小码君计算向量点积.cpp
new file mode 100644
index 0000000..9932812
--- /dev/null
+++ b/小码君计算向量点积.cpp
@@ -0,0 +1,21 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b[3][10000],sum=0;
+	cin >>a;
+	for(int i=0;i<2;i++){
+		for(int j=0;j<a;j++){
+			cin >>b[i][j]; 
+		}
+	}
+	for(int i=0;i<a;i++){
+		sum+=b[0][i]*b[1][i];
+	}
+	cout <<sum;
+	return 0;
+}
diff --git a/小码君闯迷宫.cpp b/小码君闯迷宫.cpp
new file mode 100644
index 0000000..559651f
--- /dev/null
+++ b/小码君闯迷宫.cpp
@@ -0,0 +1,30 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n;
+int a[1000][1000];
+int main(){
+	cin >>n;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=i*2-1;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=n;i>=1;i--){
+		for(int j=1;j<=i*2-1;j++){
+			a[i][j]+=min(min(a[i+1][j],a[i+1][j+1]),a[i+1][j+2]);
+		}
+	}
+	cout <<a[1][1];
+	return 0;
+}
diff --git a/小码学院的志愿者.cpp b/小码学院的志愿者.cpp
new file mode 100644
index 0000000..632a6ea
--- /dev/null
+++ b/小码学院的志愿者.cpp
@@ -0,0 +1,38 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct rect{
+	int sc;
+	int nd;
+	int id;
+}arr[100000];
+bool cmp(rect a,rect b){
+	if(a.sc*a.nd==b.sc*b.nd){
+		if(a.sc*a.nd==b.sc*b.nd && a.sc==b.sc){
+			return a.id<b.id;
+		}
+		return a.sc>b.sc;
+	}
+	return a.sc*a.nd>b.sc*b.nd;
+}
+int main(){
+	int a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].sc>>arr[i].nd;
+		arr[i].id=i;
+	}
+	sort(arr,arr+a,cmp);
+	for(int i=0;i<a;i++){
+		cout <<arr[i].id+1<<" ";
+	}
+	return 0;
+}
diff --git a/小码王的集训测评.cpp b/小码王的集训测评.cpp
new file mode 100644
index 0000000..a450f83
--- /dev/null
+++ b/小码王的集训测评.cpp
@@ -0,0 +1,36 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct rect{
+	string name;
+	int cg1;
+	int cg2;
+	int id;
+}arr[10000];
+bool cmp(rect a,rect b){
+	if(a.cg1+floor(a.cg2*1.0/10)==b.cg1+floor(b.cg2*1.0/10)){
+		return a.id<b.id;
+	}
+	return a.cg1+floor(a.cg2*1.0/10)>b.cg1+floor(b.cg2*1.0/10);
+}
+int main(){
+	int a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].cg1>>arr[i].cg2;
+		arr[i].id=i;
+	}
+	sort(arr,arr+a,cmp);
+	for(int i=0;i<a;i++){
+		cout <<arr[i].name<<endl;
+	}
+	return 0;
+}
diff --git a/小鱼比可爱2.cpp b/小鱼比可爱2.cpp
new file mode 100644
index 0000000..68e622a
--- /dev/null
+++ b/小鱼比可爱2.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b[1000],c[1000]={0,0,0};
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>b[i];
+	}
+	for(int i=0;i<a;i++){
+		for(int j=i;j<a;j++){
+			if(b[i]>b[j]){
+				c[i]++;
+			}
+		}
+	}
+	for(int i=0;i<a;i++){
+		cout <<c[i]<<" ";
+	}
+	return 0;
+}
+
+
diff --git a/小鱼的航程.cpp b/小鱼的航程.cpp
new file mode 100644
index 0000000..3bd86cc
--- /dev/null
+++ b/小鱼的航程.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,sum=0;
+	cin >>a>>b;
+	int c=a;
+	for(int i=a;i<=a+b-1;i++){
+		if(c>=7){
+			c=1;
+		}
+		if(c>=1 && c<=5){
+			sum+=250;
+		}
+		c++;
+	}
+	cout <<sum;
+	return 0;
+}
diff --git a/年龄与疾病.cpp b/年龄与疾病.cpp
new file mode 100644
index 0000000..5c14214
--- /dev/null
+++ b/年龄与疾病.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	double a[10000],b,c=0,d=0,e=0,f=0;
+	cin >>b;
+	for(int i=0;i<b;i++){
+		cin >>a[i];
+	}
+	for(int i=0;i<b;i++){
+		if(a[i]>=0 && a[i]<=18){
+			c++;
+		}
+		else if(a[i]>=19 && a[i]<=35){
+			d++;
+		}
+		else if(a[i]>=36 && a[i]<=60){
+			e++;
+		}
+		else if(a[i]>=61){
+			f++;
+		}
+	}
+	cout <<fixed<<setprecision(2)<<c/b*100<<"%"<<endl;
+	cout <<fixed<<setprecision(2)<<d/b*100<<"%"<<endl;
+	cout <<fixed<<setprecision(2)<<e/b*100<<"%"<<endl;
+	cout <<fixed<<setprecision(2)<<f/b*100<<"%";
+	return 0;
+}
+
+
diff --git a/循环-分解质因式.cpp b/循环-分解质因式.cpp
new file mode 100644
index 0000000..5da7684
--- /dev/null
+++ b/循环-分解质因式.cpp
@@ -0,0 +1,35 @@
+#include <iostream>
+#include <iomanip>
+#include <cmath>
+#include <cstdio>
+using namespace std;
+int main(){
+	int n,first=1,cnt=0;
+	cin >>n;
+	if(n==1){
+		cout <<"1=1";
+		return 0;
+	}
+	cout <<n<<"=";
+	for(int i=2;i<=n;i++){
+		while(n%i==0){
+			cnt++;
+			n/=i;
+		}
+		if(cnt>0){
+			if(first!=1){
+				cout <<"*";
+			}
+			else{
+				first=0;
+			}
+			cout <<i;
+			if(cnt>=2){
+				cout <<"^"<<cnt;
+			}
+			cnt=0;
+		}
+	}
+	return 0;
+}
+
diff --git a/恺撒加密术.cpp b/恺撒加密术.cpp
new file mode 100644
index 0000000..2a5728e
--- /dev/null
+++ b/恺撒加密术.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[100000];
+	l b;
+	cin >>a;
+	cin >>b;
+	for(int i=0;i<strlen(a);i++){
+		if((a[i]>='a' && a[i]<='z'-b) || (a[i]>='A' && a[i]<='Z'-b)){
+			a[i]+=b;
+		}
+		else if((a[i]>='z'-b+1 && a[i]<='z') || (a[i]>='Z'-b+1 && a[i]<='Z')){
+			a[i]=a[i]-26+b;
+		}
+	}
+	cout <<a;
+	return 0;
+}
diff --git a/成年人判断3.cpp b/成年人判断3.cpp
new file mode 100644
index 0000000..a895f66
--- /dev/null
+++ b/成年人判断3.cpp
@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >> a;
+	if(a>=0 && a<=6){
+		cout <<"1";
+	}
+	if(a>=7 && a<=12){
+		cout <<"2";
+	}
+	if(a>=13 && a<=17){
+		cout <<"3";
+	}
+	if(a>=18 && a<=45){
+		cout <<"4";
+	}
+	if(a>=46 && a<=69){
+		cout <<"5";
+	}
+	if(a>69){
+		cout <<"6";
+	}
+	return 0;
+} 
diff --git a/成绩判定.cpp b/成绩判定.cpp
new file mode 100644
index 0000000..0d72fcd
--- /dev/null
+++ b/成绩判定.cpp
@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	if(a<=100 && a>=90){
+		cout <<"Great";
+	}
+	if(a<=89 && a>=70){
+		cout <<"Good";
+	}
+	if(a<=69 && a>=60){
+		cout <<"Average";
+	}
+	if(a<=59 && a>=0){
+		cout <<"Poor";
+	}
+	return 0;
+}
diff --git a/我会数数啦1！！.cpp b/我会数数啦1！！.cpp
new file mode 100644
index 0000000..6d6ce8a
--- /dev/null
+++ b/我会数数啦1！！.cpp
@@ -0,0 +1,12 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	while(a<=13){
+		cout <<a;
+		cout <<" ";
+		a+=1;
+	}
+	return 0;
+}
diff --git a/我会数数啦2！！.cpp b/我会数数啦2！！.cpp
new file mode 100644
index 0000000..6230c66
--- /dev/null
+++ b/我会数数啦2！！.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int n,i;
+	cin >>n;
+	for(i=1;i<=n;i++){
+		if(i%4==0 && i%5==0 && i%8!=0){
+			cout <<i<<" ";
+		}
+	}
+	return 0;
+}
+
diff --git a/我会数数啦3！！.cpp b/我会数数啦3！！.cpp
new file mode 100644
index 0000000..fe15694
--- /dev/null
+++ b/我会数数啦3！！.cpp
@@ -0,0 +1,15 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,i;
+	cin >>a;
+	for(i=1;i<=a;i+=2){
+		cout <<i<<" ";
+	}
+	cout <<endl;
+	for(i=a;i>=1;i-=3){
+		cout <<i<<" ";
+	}
+	return 0;
+}
+
diff --git a/打印三角形.cpp b/打印三角形.cpp
new file mode 100644
index 0000000..632c9c4
--- /dev/null
+++ b/打印三角形.cpp
@@ -0,0 +1,10 @@
+#include <iostream>
+using namespace std;
+int main(){
+	cout <<"    *    "<<endl;
+	cout <<"   ***   "<<endl;
+	cout <<"  *****  "<<endl;
+	cout <<" ******* "<<endl;
+	cout <<"*********"<<endl;
+	return 0;
+} 
diff --git a/找倍数.cpp b/找倍数.cpp
new file mode 100644
index 0000000..eb98b7d
--- /dev/null
+++ b/找倍数.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,i;
+	cin >>a>>b;
+	for(i=a;i<=b;i++){
+		if(i%7==0 && i%5!=0){
+			cout <<i;
+			break;
+		}
+	}
+	for(int j=i+1;j<=b;j++){
+		if(j%7==0 && j%5!=0){
+			cout <<","<<j;
+		}
+	}
+	return 0;
+}
+
+
diff --git a/找嫌疑犯1.cpp b/找嫌疑犯1.cpp
new file mode 100644
index 0000000..518341d
--- /dev/null
+++ b/找嫌疑犯1.cpp
@@ -0,0 +1,15 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	char a[100]={"I AK IOI"};
+	int b;
+	cin >>b;
+	for(int i=1;i<=b;i++){
+		cout <<a<<" ";
+	}
+	return 0;
+}
diff --git a/招募高音唱将.cpp b/招募高音唱将.cpp
new file mode 100644
index 0000000..059658e
--- /dev/null
+++ b/招募高音唱将.cpp
@@ -0,0 +1,40 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	string name;
+	l age;
+	d score;
+}arr[10000];
+int main(){
+	int a;
+	d max1=-93720580700;
+	l b;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].age>>arr[i].score;
+	}
+	for(int i=0;i<a;i++){
+		if(arr[i].age>=18 && arr[i].age<30){
+			if(max1<arr[i].score){
+				max1=arr[i].score;
+				b=i;
+			}
+			else if(arr[i].score==max1){
+				if(arr[i].age<arr[b].age){
+					max1=arr[i].score;
+					b=i;
+				}
+			}
+		}
+	}
+	cout <<arr[b].name;
+	return 0;
+}
diff --git a/括弧匹配检验（栈）.cpp b/括弧匹配检验（栈）.cpp
new file mode 100644
index 0000000..08ff23b
--- /dev/null
+++ b/括弧匹配检验（栈）.cpp
@@ -0,0 +1,48 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+stack<c> stk;
+stack<c> stk1;
+int main(){
+	c a[10000];
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]=='(' || a[i]=='['){
+			stk.push(a[i]);
+		}	
+		if(a[i]==')'){
+			if(stk.empty()==1 || stk.top()!='('){
+				cout <<"Wrong";
+				return 0;
+			}
+			else{
+				stk.pop();
+			}
+		}
+		if(a[i]==']'){
+			if(stk.empty()==1 || stk.top()!='['){
+				cout <<"Wrong";
+				return 0;
+			}
+			else{
+				stk.pop();
+			}
+		}
+	}
+	if(stk.empty()==0){
+		cout <<"Wrong";
+	}
+	else{
+		cout <<"OK";
+	}
+	return 0;
+}
diff --git a/数1的个数.cpp b/数1的个数.cpp
new file mode 100644
index 0000000..d9f62b8
--- /dev/null
+++ b/数1的个数.cpp
@@ -0,0 +1,24 @@
+#include <iostream>
+#include <cmath>
+#include <cstdlib>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	int b=0;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		int j=i;
+		while(j){
+			if(j%10==1){
+			b++;
+			}
+			j/=10;
+		}
+	}
+	cout <<b;
+	return 0;
+}
+
+
diff --git a/数列循环左移动(队列).cpp b/数列循环左移动(队列).cpp
new file mode 100644
index 0000000..90d9086
--- /dev/null
+++ b/数列循环左移动(队列).cpp
@@ -0,0 +1,33 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+queue<int> que;
+int main(){
+	int a,b;
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		int x;
+		cin >>x;
+		que.push(x);
+	}
+	for(int i=0;i<b;i++){
+		int x=que.front();
+		que.pop();
+		que.push(x);
+	}
+	for(int i=0;i<a;i++){
+		cout <<que.front()<<" ";
+		que.pop();
+	}
+	return 0;
+}
diff --git a/数字三角形.cpp b/数字三角形.cpp
new file mode 100644
index 0000000..c3aea41
--- /dev/null
+++ b/数字三角形.cpp
@@ -0,0 +1,17 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,b=1;
+	cin >>a;
+	for(int j=1;j<=a;j++){
+		for(int i=1;i<=j;i++){
+		cout <<b<<" ";
+		b++;
+		if(b>=10){
+			b=0;
+		}
+	}
+	cout <<endl;
+	}
+	return 0;
+}
diff --git a/数字三角形问题.cpp b/数字三角形问题.cpp
new file mode 100644
index 0000000..7820673
--- /dev/null
+++ b/数字三角形问题.cpp
@@ -0,0 +1,30 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int n;
+int a[1000][1000];
+int main(){
+	cin >>n;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=i;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=n;i>=1;i--){
+		for(int j=1;j<=i;j++){
+			a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
+		}
+	}
+	cout <<a[1][1];
+	return 0;
+}
diff --git a/数字反转.cpp b/数字反转.cpp
new file mode 100644
index 0000000..0fc93c1
--- /dev/null
+++ b/数字反转.cpp
@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int n;
+	int s=0;
+	cin >>n;
+	while(n){
+		s=s*10+n%10;
+		n/=10;
+	}
+	cout <<s;
+	return 0;
+} 
diff --git a/数字放大.cpp b/数字放大.cpp
new file mode 100644
index 0000000..3a7336b
--- /dev/null
+++ b/数字放大.cpp
@@ -0,0 +1,17 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	long long a,b[1000],c;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>b[i];
+	}
+	cin >>c;
+	for(int i=0;i<a;i++){
+		cout <<b[i]*c<<" ";
+	}
+	return 0;
+}
+
+
diff --git a/数字组合.cpp b/数字组合.cpp
new file mode 100644
index 0000000..5e2ac6d
--- /dev/null
+++ b/数字组合.cpp
@@ -0,0 +1,12 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int n;
+	cin >> n;
+	cout <<n<<n<<n<<"     "<<n<<n<<n<<"     "<<n<<n<<n<<"     "<<n<<n<<n<<endl;
+	cout <<"  "<<n<<"     "<<n<<" "<<n<<"     "<<"  "<<n<<"     "<<n<<" "<<n<<endl;
+	cout <<n<<n<<n<<"     "<<n<<" "<<n<<"     "<<n<<n<<n<<"     "<<n<<" "<<n<<endl;
+	cout <<n<<"  "<<"     "<<n<<" "<<n<<"     "<<n<<"  "<<"     "<<n<<" "<<n<<endl;
+	cout <<n<<n<<n<<"     "<<n<<n<<n<<"     "<<n<<n<<n<<"     "<<n<<n<<n<<endl;
+	return 0;
+} 
diff --git a/数字统计.cpp b/数字统计.cpp
new file mode 100644
index 0000000..98bc19d
--- /dev/null
+++ b/数字统计.cpp
@@ -0,0 +1,21 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	int a,b,sum=0;
+	cin >>a>>b;
+	for(int i=a;i<=b;i++){
+		int c=i;
+		while(c){
+			if(c%10==2){
+				sum++;
+			}
+			c/=10;
+		}
+	} 
+	cout <<sum;
+	return 0;
+}
diff --git a/数字翻转.cpp b/数字翻转.cpp
new file mode 100644
index 0000000..436449d
--- /dev/null
+++ b/数字翻转.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,c=0,d=0;
+	scanf("%d%d",&a,&b);
+	while(a){
+		c=c*10+a%10;
+		a/=10;
+	}
+	while(b){
+		d=d*10+b%10;
+		b/=10;
+	}
+	if(c>d){
+		printf("%d",c);
+	}
+	if(d>c){
+		printf("%d",d);
+	}
+	return 0;
+}
diff --git a/数字菱形.cpp b/数字菱形.cpp
new file mode 100644
index 0000000..148c06a
--- /dev/null
+++ b/数字菱形.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+int main()
+{
+    int n;
+    cin>>n;
+    for (int i=1;i<=n;i++)
+    {
+        for (int j=1;j<=n-i;j++)
+               cout<<" ";
+        for (int j=1;j<=2*i-1;j++)
+               cout<<1;
+        cout<<endl;
+    }
+     
+    for(int i=n-1;i>=1;i--)
+    {
+        for(int j=1;j<=n-i;j++)
+            cout<<" ";
+        for(int j=1;j<=2*i-1;j++)
+            cout<<1;
+        cout<<endl;
+    }
+    return 0;
+}
diff --git a/数字识别.cpp b/数字识别.cpp
new file mode 100644
index 0000000..86405fb
--- /dev/null
+++ b/数字识别.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,b=0,c;
+	cin >>a;
+	c=a;
+	while(a){
+		a/=10;
+		b++;
+	}
+	cout <<b<<endl;
+	while(c){
+		cout <<c%10<<endl;
+		c/=10;
+	}
+	return 0;
+}
+
diff --git a/数的输入和输出.cpp b/数的输入和输出.cpp
new file mode 100644
index 0000000..6a21ed7
--- /dev/null
+++ b/数的输入和输出.cpp
@@ -0,0 +1,11 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	double b;
+	cin >>a>>b;
+	cout <<fixed<<setprecision(2)<<b;
+	cout <<" "<<a;
+	return 0;
+}
diff --git a/数组指定部分逆序重放.cpp b/数组指定部分逆序重放.cpp
new file mode 100644
index 0000000..5193722
--- /dev/null
+++ b/数组指定部分逆序重放.cpp
@@ -0,0 +1,17 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,c[1000];
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		cin >>c[i];
+	}
+	for(int i=b-1;i>=0;i--){
+		cout <<c[i]<<" ";
+	}
+	for(int i=b;i<a;i++){
+		cout <<c[i]<<" ";
+	}
+	return 0;
+}
diff --git a/数羊(循环结构).cpp b/数羊(循环结构).cpp
new file mode 100644
index 0000000..14a05d6
--- /dev/null
+++ b/数羊(循环结构).cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		cout <<i<<" ";
+	}
+	cout <<endl<<"Sleep";
+	return 0;
+}
+
+
diff --git a/整理药名.cpp b/整理药名.cpp
new file mode 100644
index 0000000..9f367d3
--- /dev/null
+++ b/整理药名.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[100][100];
+	l b;
+	cin >>b;
+	for(int i=0;i<b;i++){
+		cin >>a[i];
+	}
+	for(int i=0;i<b;i++){
+		for(int j=1;j<strlen(a[i]);j++){
+			if(a[i][j]>='A' && a[i][j]<='Z'){
+				a[i][j]+=32;
+			}
+		}
+	}
+	for(int i=0;i<b;i++){
+		if(a[i][0]>='a' && a[i][0]<='z'){
+			a[i][0]-=32;
+		}
+	}
+	for(int i=0;i<b;i++){
+		cout <<a[i]<<endl;
+	}
+	return 0;
+}
diff --git a/昆虫同笼.cpp b/昆虫同笼.cpp
new file mode 100644
index 0000000..a8ea455
--- /dev/null
+++ b/昆虫同笼.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	for(int i=0;i<=18;i++){
+		for(int j=0;j<=18;j++){
+			for(int k=0;k<=18;k++){
+				if(i+j+k==18 && i*8+j*6+k*6==118 && j*2+k*1==20){
+					cout <<i<<" "<<j<<" "<<k<<endl;
+				}
+			}
+		}
+	} 
+	return 0;
+}
diff --git a/最小数和最大数（数组实现）.cpp b/最小数和最大数（数组实现）.cpp
new file mode 100644
index 0000000..7b22b4f
--- /dev/null
+++ b/最小数和最大数（数组实现）.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int n;
+	int max=-100000,min=100000;
+	int a[100000];
+	cin >>n;
+	for(int i=0;i<n;i++){
+		cin >>a[i];
+		if(a[i]>=max){
+			max=a[i];
+		}
+		if(a[i]<=min){
+			min=a[i];
+		}
+	}
+	cout <<min<<" "<<max;
+	return 0;
+}
+
diff --git a/最美苹果数.cpp b/最美苹果数.cpp
new file mode 100644
index 0000000..335ea82
--- /dev/null
+++ b/最美苹果数.cpp
@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int N1;
+	int N2;
+	int N3;
+	int Number; 
+	cin >>N1>>N2>>N3;
+	if(N3<=2 || N2<=1 || N1<=0){
+		cout <<"-1";
+	}
+	else{
+		if(N2>=N3){
+			Number=N2-N3+1;
+			if(N1>=N3-1){
+				Number=N2-N3+1+N1-N3+2;
+			}
+			else{
+				cout <<Number;
+			}
+		}
+		else{
+			if(N1>=N2){
+				Number=N1-N2+1;
+			}
+			else{
+				cout <<Number;
+			}	
+		}
+	}
+	return 0;
+}
diff --git a/未命名1.cpp b/未命名1.cpp
new file mode 100644
index 0000000..83eed4c
--- /dev/null
+++ b/未命名1.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+long long a,b,c[1000000],d[1000000],e=0;
+using namespace std;
+int main(){
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		cin >>c[i];
+	}
+	for(int i=0;i<a;i++){
+		cin >>d[i];
+	}
+	for(int i=0;i<a;i++){
+		e+=(d[i]-c[i]);
+	}
+	if(e<=0){
+		cout <<0;
+	}
+	if(e>0){
+		cout <<e*b;
+	}
+	return 0;
+}
diff --git a/李老师的书架.cpp b/李老师的书架.cpp
new file mode 100644
index 0000000..996a37c
--- /dev/null
+++ b/李老师的书架.cpp
@@ -0,0 +1,32 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	long long a,b;
+	long long c[100000],d[100000],cnt=0,sum=0;
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		cin >>c[i];
+	}
+	sort(c,c+a);
+	for(int i=a-1;i>=0;i--){
+		d[a-i-1]=c[i];
+	}
+	for(int i=0;i<a;i++){
+		sum+=d[i];
+		cnt++;
+		if(sum>b){
+			break;
+		}
+	}
+	cout <<cnt;
+	return 0;
+}
diff --git a/枚举1.cpp b/枚举1.cpp
new file mode 100644
index 0000000..8d44638
--- /dev/null
+++ b/枚举1.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+		for(int i=1;i<=9;i++){
+			for(int j=0;j<=9;j++){
+				if((i*10+3)*6528==(30+j)*8256){
+					cout <<i<<" "<<j;
+				}
+			}
+		}
+	return 0;
+}
diff --git a/枪战.cpp b/枪战.cpp
new file mode 100644
index 0000000..f67b24b
--- /dev/null
+++ b/枪战.cpp
@@ -0,0 +1,1593 @@
+#include<iostream>
+#include<cstdio>
+#include<cstdlib>
+#include<cstring>
+#include<windows.h>
+#include<conio.h>
+#include<time.h>
+#define UP 72
+#define DOWN 80
+#define LEFT 75
+#define RIGHT 77
+using namespace std;
+string a[21][20]= {"��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+               "��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��","��",
+              };        //��ͼ
+string jz[8];               //�������صı���
+int xxxx,i,j,lev1=0,lev2=0; //һ��û�õı���=.=
+int n1=1000,m1=10,l1=1;     //���1�����Ϣ
+int n2=1000,m2=10,l2=1;     //���2�����Ϣ
+int t,t1,t2,t3,t4;          //����ʱ��ı���
+double t5,t6;               //����ʱ��ı���
+int x=18,y=1;               //���1����
+int p=2,q=17;               //���2����
+int p2=2,q2=7;              //���2��������
+char ch,ch1,ch2;            //�����ַ������1�����ַ������2�����ַ�
+int gbdw1();                //��궨λ1����
+int gbdw2();                //��궨λ2����
+int gbdw3();                //��궨λ3����
+int gbdw4();                //��궨λ4����
+int hpzy();                 //��ȡ��Դ����
+int jzz();                  //�������
+int p1kz();                 //���1���ƺ���
+int p2kz();                 //���2���ƺ���
+int zcd();                  //���˵�����
+void draw();                //��ͼ����
+void hidden();              //���ع�꺯��
+void zanting();             //��ͣ����
+void renji();               //�˻�ģʽ
+void renji_suiji();         //�˻�ģʽ����bug��
+void renji_gress();         //�Բ�
+void zanting() {
+system("cls");
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+cout<<"��������������������������������������"<<endl;
+return;
+}
+int gbdw1() {
+COORD pos = {0, 22};
+SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+}
+int gbdw2() {
+COORD pos = {40, 22};
+SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+}
+int gbdw3() {
+COORD pos = {0, 23};
+SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+}
+int gbdw4() {
+COORD pos = {40, 23};
+SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+}
+void draw() {
+if(n1>=1000) n1=1000;
+if(n2>=1000) n2=1000;
+if(n1<=0)    n1=0;
+if(n2<=0)    n2=0;
+if(m1>=500)  m1=500;
+if(m2>=500)  m2=500;
+if(m1<=0)    m1=0;
+if(m2<=0)    m2=0;
+if(l1>=20)   l1=20;
+if(l1>=20)   l1=20;
+COORD pos = {0, 0};
+SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+cout<<"Already start "<<((int)time(NULL)-t)/60<<" minute for "<<((int)time(NULL)-t)%60<<" seconds"<<endl;
+for(i=1; i<=19; i++) {
+    for(j=0; j<=18; j++) {
+        if(a[i][j]=="��") {
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_RED);
+            cout<<a[i][j];
+        }
+        if(a[i][j]=="��") {
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_BLUE);
+            cout<<a[i][j];
+        }
+        if(a[i][j]=="��") {
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN);
+            cout<<a[i][j];
+        }
+        if(a[i][j]=="��") {
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_GREEN);
+            cout<<a[i][j];
+        }
+        if(a[i][j]=="��"||a[i][j]=="��") {
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED|FOREGROUND_GREEN);
+            cout<<a[i][j];
+        }
+    }
+    cout<<endl;
+}
+SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+printf("��player 1��                            ��player 2��\n");
+printf("Lv��%2d  HP��%4d  mana��%3d             Lv��%2d  HP��%4d  mana��%3d\n",l1,n1,m1,l2,n2,m2);
+gbdw1();
+SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN);
+printf("HP:  ");
+for(j=1; j<=n1/10/8; j++)
+    printf("��");
+xxxx=n1/10%8;
+cout<<jz[xxxx];
+printf("%d",n1);
+printf("          ");
+gbdw2();
+printf("HP:  ");
+for(j=1; j<=n2/10/8; j++)
+    printf("��");
+xxxx=n2/10%8;
+cout<<jz[xxxx];
+printf("%d",n2);
+printf("          \n");
+gbdw3();
+SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_GREEN);
+printf("moon:");
+for(j=1; j<=m1/5/8; j++)
+    printf("��");
+xxxx=m1/5%8;
+cout<<jz[xxxx];
+printf("%d",m1);
+printf("          ");
+gbdw4();
+printf("moon:");
+for(j=1; j<=m2/5/8; j++)
+    printf("��");
+xxxx=m2/5%8;
+cout<<jz[xxxx];
+printf("%d",m2);
+printf("          \n");
+SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+return;
+}
+int zcd() {
+while(1) {
+    system("cls");
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+    system("cls");
+    printf("Welcome to square in the world!\n");
+    printf("-------------------------------\n");
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED);
+    printf("S.[Start the game]\n");
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED | FOREGROUND_GREEN);
+    printf("T.[The program diagram]\n");
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE);
+    printf("H.[Help]\n");
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN);
+    printf("Q.[Quit the game]\n");
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+    printf("-------------------------------\n");
+    ch=getch();
+    if(ch=='s'||ch=='S') {
+        system("cls");
+        for(i=1; i<=136; i++) {
+            xxxx=i%8;
+            COORD pos = {0, 0};
+            SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+            printf("Being parsed~    Loading...\n");
+            printf("----------------------------------\n");
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN);
+            for(j=1; j<=i/8; j++)
+                printf("��");
+            cout<<jz[xxxx]<<endl;
+            SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+            printf("----------------------------------\n");
+        }
+        printf("Initialize the...");
+        Sleep(1000);
+        break;
+    }
+    if(ch=='t'||ch=='T') {
+        COORD pos = {0, 0};
+        SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+        printf("������������������������������������\n");
+        printf("��[square big showdown 4.11]      ��\n");
+        printf("��[Human-machine version]         ��\n");
+        printf("����                              ��\n");
+        printf("����[Start the game]              ��\n");
+        printf("����                              ��\n");
+        printf("����[The program tree diagram]    ��\n");
+        printf("������                            ��\n");
+        printf("������[The current]               ��\n");
+        printf("����                              ��\n");
+        printf("����[Help]                        ��\n");
+        printf("������                            ��\n");
+        printf("������[Look at the map]           ��\n");
+        printf("������                            ��\n");
+        printf("������[Operation to help]         ��\n");
+        printf("������                            ��\n");
+        printf("������[The developer]             ��\n");
+        printf("����                              ��\n");
+        printf("����[Quit the game]               ��\n");
+        printf("������������������������������������\n");
+        ch=getch();
+    }
+    if(ch=='h'||ch=='H') {
+        system("cls");
+        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+        printf("Do you need any help?\n");
+        printf("---------------------\n");
+        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED);
+        printf("1.[Look at the map]\n");
+        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_RED | FOREGROUND_GREEN);
+        printf("2.[Operation to help]\n");
+        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE);
+        printf("3.[The developer]\n");
+        SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+        printf("---------------------\n");
+        ch=getch();
+        if(ch=='1') {
+            draw();
+            printf("��player 1;\n");
+            printf("��Player 2;\n");
+            printf("��Is a wall, do not walk;\n");
+            printf("��Is a way, you can walk;\n");
+            printf("��The grass;\n");
+            printf("��Is the birth place of both parties.\n");
+            printf("Two lines are at the bottom of the both sides of the case;\n");
+            printf("            Press any key to return;\n");
+            ch=getch();
+            continue;
+        }
+        if(ch=='2') {
+            system("cls");
+            printf("player 1:\n");
+            printf("   w.up      s.down     a.left    d.right\n");
+            printf("   v.attack  b.Respond to health  n.vampire\n");
+            printf("   f.flash   g.To attract\n");
+            printf("-----------------------------------------------\n");
+            printf("player 2:\n");
+            printf("  ��.up     ��.down    ��.left   ��.right\n");
+            printf("   1.attack  2.Respond to health  3.crit\n");
+            printf("   4.flash   5.Back to home\n");
+            printf("-----------------------------------------------\n");
+            printf("Click on the x for details!\n");
+            ch=getch();
+            if(ch=='x'||ch=='X') {
+                system("cls");
+                printf("player 1:---------------------------------\n");
+                printf("---control---          P1HP moon P2HP moon\n");
+                printf("   w.up                ----   +1 ---- ----\n");
+                printf("   s.down              ----   +1 ---- ----\n");
+                printf("   a.left              ----   +1 ---- ----\n");
+                printf("   d.right             ----   +1 ---- ----\n");
+                printf("   \n");
+                printf("   v.attack            ----   +2  -20 ----\n");
+                printf("   b.Respond to health +200  -50 ---- ----\n");
+                printf("   n.vampire           +150 -100 -150  -20\n");
+                printf("   f.flash             ----  -20 ---- ----\n");
+                printf("   g.To attract        ----  -70 -100 ----\n");
+                printf("player 2:---------------------------------\n");
+                printf("---control---          P1HP moon P2HP moon\n");
+                printf("  ��.up                ---- ---- ----   +1\n");
+                printf("  ��.down              ---- ---- ----   +1\n");
+                printf("  ��.left              ---- ---- ----   +1\n");
+                printf("  ��.right             ---- ---- ----   +1\n");
+                printf("   \n");
+                printf("   1.attack             -20 ---- ----   +2\n");
+                printf("   2.Respond to health ---- ---- +200  -50\n");
+                printf("   3.crit              -200 ---- ---- -100\n");
+                printf("   4.flash             ---- ---- ----  -20\n");
+                printf("   5.Back to home      ---- ---- ----  -70\n");
+                printf("------------------------------------------");
+                ch=getch();
+            }
+            continue;
+        }
+        if(ch=='3') {
+            system("cls");
+            printf("The development team:\n");
+            printf("  Alliance primary school\n");
+            printf("Development date:\n");
+            printf("  16/11/17 18:35\n");
+            printf("Belonging to:\n");
+            printf("  China's fujian province\n");
+            ch=getch();
+            continue;
+        }
+    }
+    if(ch=='q'||ch=='Q') {
+        if(1) {
+            system("cls");
+            printf("Really want to quit?\n");
+            printf("--------------------\n");
+            printf("Y.[Yes]    N.[No]\n");
+            printf("--------------------\n");
+            while(ch!='y'&&ch!='Y'&&ch!='N'&&ch!='n')
+                ch=getch();
+        }
+        if(ch=='Y'||ch=='y') {
+            system("cls");
+            for(i=1; i<=136; i++) {
+                xxxx=i%8;
+                COORD pos = {0, 0};
+                SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+                printf("Deleting records~    \n");
+                printf("----------------------------------\n");
+                for(j=1; j<=i/8; j++)
+                    printf("��");
+                cout<<jz[xxxx]<<endl;
+                printf("----------------------------------\n");
+            }
+            printf("Delete the success.");
+            Sleep(1000);
+            exit(0);
+        }
+        if(ch=='N'||ch=='n')
+            continue;
+    }
+}
+return 0;
+}
+void hidden() {
+HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE);
+CONSOLE_CURSOR_INFO cci;
+GetConsoleCursorInfo(hOut,&cci);
+cci.bVisible=0;
+SetConsoleCursorInfo(hOut,&cci);
+return;
+}
+int hqzy() {
+MessageBox(NULL,"The game need to get access to local resources \n agree?    (I am bored!)","Access to resources",MB_ICONEXCLAMATION|MB_OK);
+return 0;
+}
+int p1kz() {
+if(ch=='w'||ch=='s'||ch=='a'||ch=='d'
+        ||ch=='W'||ch=='S'||ch=='A'||ch=='D')
+    ch1=ch;
+if(ch=='a'||ch=='A') {
+    if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+            ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+            ||x==4&&y==16||x==4&&y==17
+            ||x==16&&y==1||x==16&&y==2
+            ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+            ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+        if(a[x][y-1]!="��"&&a[x][y-1]!="��") {
+            a[x][y]="��";
+            y--;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    } else {
+        if(a[x][y-1]!="��"&&a[x][y-1]!="��") {
+            a[x][y]="��";
+            if(a[x][y-1]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n1+=50;
+                    }
+                    case 1: {
+                        m1+=20;
+                    }
+                }
+            }
+            y--;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    }
+}
+if(ch=='d'||ch=='D') {
+    if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+            ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+            ||x==4&&y==16||x==4&&y==17
+            ||x==16&&y==1||x==16&&y==2
+            ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+            ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+        if(a[x][y+1]!="��"&&a[x][y+1]!="��") {
+            a[x][y]="��";
+            y++;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    } else {
+        if(a[x][y+1]!="��"&&a[x][y+1]!="��") {
+            a[x][y]="��";
+            if(a[x][y+1]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n1+=50;
+                    }
+                    case 1: {
+                        m1+=20;
+                    }
+                }
+            }
+            y++;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    }
+}
+if(ch=='w'||ch=='W') {
+    if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+            ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+            ||x==4&&y==16||x==4&&y==17
+            ||x==16&&y==1||x==16&&y==2
+            ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+            ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+        if(a[x-1][y]!="��"&&a[x-1][y]!="��") {
+            a[x][y]="��";
+            x--;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    } else {
+        if(a[x-1][y]!="��"&&a[x-1][y]!="��") {
+            a[x][y]="��";
+            if(a[x-1][y]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n1+=50;
+                    }
+                    case 1: {
+                        m1+=20;
+                    }
+                }
+            }
+            x--;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    }
+}
+if(ch=='s'||ch=='S') {
+    if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+            ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+            ||x==4&&y==16||x==4&&y==17
+            ||x==16&&y==1||x==16&&y==2
+            ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+            ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+        if(a[x+1][y]!="��"&&a[x+1][y]!="��") {
+            a[x][y]="��";
+            x++;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    } else {
+        if(a[x+1][y]!="��"&&a[x+1][y]!="��") {
+            a[x][y]="��";
+            if(a[x+1][y]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n1+=50;
+                    }
+                    case 1: {
+                        m1+=20;
+                    }
+                }
+            }
+            x++;
+            a[x][y]="��";
+            m1++;
+            draw();
+        }
+    }
+}
+if(ch=='v'||ch=='V') {
+    if(a[x][y-2]=="��"
+            ||a[x][y+2]=="��"
+            ||a[x-2][y]=="��"
+            ||a[x+2][y]=="��"
+            ||a[x-1][y-1]=="��"
+            ||a[x+1][y-1]=="��"
+            ||a[x-1][y+1]=="��"
+            ||a[x+1][y+1]=="��"
+            ||a[x][y-1]=="��"
+            ||a[x][y+1]=="��"
+            ||a[x-1][y]=="��"
+            ||a[x+1][y]=="��") {
+        n2-=20;
+        m1+=2;
+        n2-=(l1-1)*2;
+        if(lev1==l1) {
+            lev1=0;
+            l1++;
+        }
+        lev1++;
+        draw();
+    }
+}
+if(ch=='b'||ch=='B') {
+    if(m1>=50) {
+        n1+=200;
+        m1-=50;
+        draw();
+    }
+}
+if(ch=='n'||ch=='N') {
+    if(m1>=100) {
+        n2-=150;
+        n1+=150;
+        m1-=100;
+        n2-=(l1-1)*10;
+        n1+=(l1-1)*10;
+        m1+=20;
+        m2-=20;
+        if(lev1==l1) {
+            lev1=0;
+            l1++;
+        }
+        lev1++;
+        draw();
+    }
+}
+if(ch=='f'||ch=='F') {
+    if(m1>=20) {
+        if(ch1=='w'||ch1=='W') {
+            if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+                    ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+                    ||x==4&&y==16||x==4&&y==17
+                    ||x==16&&y==1||x==16&&y==2
+                    ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+                    ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+                if(a[x-2][y]=="��"||a[x-2][y]=="��") {
+                    a[x][y]="��";
+                    x-=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            } else {
+                if(a[x-2][y]=="��"||a[x-2][y]=="��"||a[x-2][y]=="��") {
+                    a[x][y]="��";
+                    if(a[x-2][y]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n1+=50;
+                                m1+=30;
+                            }
+                            case 1: {
+                                m1+=30;
+                            }
+                        }
+                    }
+                    x-=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            }
+        }
+        if(ch1=='s'||ch1=='S') {
+            if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+                    ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+                    ||x==4&&y==16||x==4&&y==17
+                    ||x==16&&y==1||x==16&&y==2
+                    ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+                    ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+                if(a[x+2][y]=="��"||a[x+2][y]=="��") {
+                    a[x][y]="��";
+                    x+=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            } else {
+                if(a[x+2][y]=="��"||a[x+2][y]=="��"||a[x+2][y]=="��") {
+                    a[x][y]="��";
+                    if(a[x+2][y]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n1+=50;
+                                m1+=30;
+                            }
+                            case 1: {
+                                m1+=30;
+                            }
+                        }
+                    }
+                    x+=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            }
+        }
+        if(ch1=='a'||ch1=='A') {
+            if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+                    ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+                    ||x==4&&y==16||x==4&&y==17
+                    ||x==16&&y==1||x==16&&y==2
+                    ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+                    ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+                if(a[x][y-2]=="��"||a[x][y-2]=="��") {
+                    a[x][y]="��";
+                    y-=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            } else {
+                if(a[x][y-2]=="��"||a[x][y-2]=="��"||a[x][y-2]=="��") {
+                    a[x][y]="��";
+                    if(a[x][y-2]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n1+=50;
+                                m1+=30;
+                            }
+                            case 1: {
+                                m1+=30;
+                            }
+                        }
+                    }
+                    y-=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            }
+        }
+        if(ch1=='d'||ch1=='D') {
+            if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+                    ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+                    ||x==4&&y==16||x==4&&y==17
+                    ||x==16&&y==1||x==16&&y==2
+                    ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+                    ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+                if(a[x][y+2]=="��"||a[x][y+2]=="��") {
+                    a[x][y]="��";
+                    y+=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            } else {
+                if(a[x][y+2]=="��"||a[x][y+2]=="��"||a[x][y+2]=="��") {
+                    a[x][y]="��";
+                    if(a[x][y+2]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n1+=50;
+                                m1+=30;
+                            }
+                            case 1: {
+                                m1+=30;
+                            }
+                        }
+                    }
+                    y+=2;
+                    a[x][y]="��";
+                    m1-=20;
+                    draw();
+                }
+            }
+        }
+    }
+}
+if(ch=='g'||ch=='G') {
+    if(m1>=70) {
+        if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+                ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+                ||p==4&&q==16||p==4&&q==17
+                ||p==16&&q==1||p==16&&q==2
+                ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+                ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+            if(a[x+1][y]!="��") {
+                a[p][q]="��";
+                p=x+1;
+                q=y;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+            if(a[x-1][y]!="��") {
+                a[p][q]="��";
+                p=x-1;
+                q=y;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+            if(a[x][y+1]!="��") {
+                a[p][q]="��";
+                p=x;
+                q=y+1;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+            if(a[x][y-1]!="��") {
+                a[p][q]="��";
+                p=x;
+                q=y-1;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+        } else {
+             if(a[x+1][y]!="��") {
+                a[p][q]="��";
+                p=x+1;
+                q=y;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+            if(a[x-1][y]!="��") {
+                a[p][q]="��";
+                p=x-1;
+                q=y;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+            if(a[x][y+1]!="��") {
+                a[p][q]="��";
+                p=x;
+                q=y+1;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+            if(a[x][y-1]!="��") {
+                a[p][q]="��";
+                p=x;
+                q=y-1;
+                a[p][q]="��";
+                m1-=70;
+                n2-=100;
+                return 0;
+            }
+        }
+    }
+}
+return 0;
+}
+int p2kz() {
+if(ch==72||ch==80||ch==75||ch==77)
+    ch2=ch;
+if(ch==72) {
+    if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+            ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+            ||p==4&&q==16||p==4&&q==17
+            ||p==16&&q==1||p==16&&q==2
+            ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+            ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+        if(a[p-1][q]!="��"&&a[p-1][q]!="��") {
+            a[p][q]="��";
+            p--;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    } else {
+        if(a[p-1][q]!="��"&&a[p-1][q]!="��") {
+            a[p][q]="��";
+            if(a[p-1][q]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n2+=50;
+                    }
+                    case 1: {
+                        m2+=20;
+                    }
+                }
+            }
+            p--;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    }
+}
+if(ch==75) {
+    if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+            ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+            ||p==4&&q==16||p==4&&q==17
+            ||p==16&&q==1||p==16&&q==2
+            ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+            ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+        if(a[p][q-1]!="��"&&a[p][q-1]!="��") {
+            a[p][q]="��";
+            q--;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    } else {
+        if(a[p][q-1]!="��"&&a[p][q-1]!="��") {
+            a[p][q]="��";
+            if(a[p][q-1]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n2+=50;
+                    }
+                    case 1: {
+                        m2+=20;
+                    }
+                }
+            }
+            q--;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    }
+}
+if(ch==80) {
+    if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+            ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+            ||p==4&&q==16||p==4&&q==17
+            ||p==16&&q==1||p==16&&q==2
+            ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+            ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+        if(a[p+1][q]!="��"&&a[p+1][q]!="��") {
+            a[p][q]="��";
+            p++;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    } else {
+        if(a[p+1][q]!="��"&&a[p+1][q]!="��") {
+            a[p][q]="��";
+            if(a[p+1][q]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n2+=50;
+                    }
+                    case 1: {
+                        m2+=20;
+                    }
+                }
+            }
+            p++;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    }
+}
+if(ch==77) {
+    if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+            ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+            ||p==4&&q==16||p==4&&q==17
+            ||p==16&&q==1||p==16&&q==2
+            ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+            ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+        if(a[p][q+1]!="��"&&a[p][q+1]!="��") {
+            a[p][q]="��";
+            q++;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    } else {
+        if(a[p][q+1]!="��"&&a[p][q+1]!="��") {
+            a[p][q]="��";
+            if(a[p][q+1]=="��") {
+                srand((unsigned)time(NULL));
+                switch(rand()%2) {
+                    case 0: {
+                        n2+=50;
+                    }
+                    case 1: {
+                        m2+=20;
+                    }
+                }
+            }
+            q++;
+            a[p][q]="��";
+            m2++;
+            draw();
+        }
+    }
+}
+if(ch=='1') {
+    if(a[p][q-1]=="��"
+            ||a[p][q+1]=="��"
+            ||a[p-1][q]=="��"
+            ||a[p+1][q]=="��") {
+        n1-=20;
+        m2+=2;
+        n1-=(l2-1)*2;
+        if(lev2==l2) {
+            lev2=0;
+            l2++;
+        }
+        lev2++;
+        draw();
+    }
+}
+if(ch=='2') {
+    if(m2>=50) {
+        n2+=200;
+        m2-=50;
+        draw();
+    }
+}
+if(ch=='3') {
+    if(m2>=100) {
+        n1-=200;
+        m2-=100;
+        n1-=(l2-1)*20;
+        if(lev2==l2) {
+            lev2=0;
+            l2++;
+        }
+        lev2++;
+        draw();
+    }
+}
+if(ch=='4') {
+    if(m2>=20) {
+        if(ch2==72) {
+            if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+                    ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+                    ||p==4&&q==16||p==4&&q==17
+                    ||p==16&&q==1||p==16&&q==2
+                    ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+                    ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+                if(a[p-2][q]=="��"||a[p-2][q]=="��") {
+                    a[p][q]="��";
+                    p-=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            } else {
+                if(a[p-2][q]=="��"||a[p-2][q]=="��"||a[p-2][q]=="��") {
+                    a[p][q]="��";
+                    if(a[p-2][q]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n2+=50;
+                                m2+=30;
+                            }
+                            case 1: {
+                                m2+=30;
+                            }
+                        }
+                    }
+                    p-=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            }
+        }
+        if(ch2==80) {
+            if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+                    ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+                    ||p==4&&q==16||p==4&&q==17
+                    ||p==16&&q==1||p==16&&q==2
+                    ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+                    ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+                if(a[p+2][q]=="��"||a[p+2][q]=="��") {
+                    a[p][q]="��";
+                    p+=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            } else {
+                if(a[p+2][q]=="��"||a[p+2][q]=="��"||a[p+2][q]=="��") {
+                    a[p][q]="��";
+                    if(a[p+2][q]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n2+=50;
+                                m2+=30;
+                            }
+                            case 1: {
+                                m2+=30;
+                            }
+                        }
+                    }
+                    p+=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            }
+        }
+        if(ch2==75) {
+            if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+                    ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+                    ||p==4&&q==16||p==4&&q==17
+                    ||p==16&&q==1||p==16&&q==2
+                    ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+                    ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+                if(a[p][q-2]=="��"||a[p][q-2]=="��") {
+                    a[p][q]="��";
+                    q-=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            } else {
+                if(a[p][q-2]=="��"||a[p][q-2]=="��"||a[p][q-2]=="��") {
+                    a[p][q]="��";
+                    if(a[p][q-2]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n2+=50;
+                                m2+=30;
+                            }
+                            case 1: {
+                                m2+=30;
+                            }
+                        }
+                    }
+                    q-=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            }
+        }
+        if(ch2==77) {
+            if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+                    ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+                    ||p==4&&q==16||p==4&&q==17
+                    ||p==16&&q==1||p==16&&q==2
+                    ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+                    ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+                if(a[p][q+2]=="��"||a[p][q+2]=="��") {
+                    a[p][q]="��";
+                    q+=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            } else {
+                if(a[p][q+2]=="��"||a[p][q+2]=="��"||a[p][q+2]=="��") {
+                    a[p][q]="��";
+                    if(a[p][q+2]=="��") {
+                        srand((unsigned)time(NULL));
+                        switch(rand()%2) {
+                            case 0: {
+                                n2+=50;
+                                m2+=30;
+                            }
+                            case 1: {
+                                m2+=30;
+                            }
+                        }
+                    }
+                    q+=2;
+                    a[p][q]="��";
+                    m1++;
+                     m2-=20;
+                    draw();
+                }
+            }
+        }
+    }
+}
+if(ch=='5') {
+    if(m2>=70) {
+        if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+                ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+                ||p==4&&q==16||p==4&&q==17
+                ||p==16&&q==1||p==16&&q==2
+                ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+                ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+            a[p][q]="��";
+            p=2;
+            q=17;
+            a[p][q]="��";
+            m2-=70;
+            draw();
+        } else {
+            a[p][q]="��";
+            p=2;
+            q=17;
+            a[p][q]="��";
+            m2-=70;
+            draw();
+        }
+    }
+}
+return 0;
+}
+void renji() {
+if(n2<=200) {
+    if(!(p==2&&q==15||p==2&&q==16||p==2&&q==17
+            ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+            ||p==4&&q==16||p==4&&q==17)) {
+        if(m2>=70) {
+            ch='5';
+            p2kz();
+            return;
+        }
+    } else {
+        return;
+    }
+}
+if(a[p][q-1]=="��"
+        ||a[p][q+1]=="��"
+        ||a[p-1][q]=="��"
+        ||a[p+1][q]=="��") {
+    ch='1';
+    p2kz();
+    return;
+}
+if(n2<=900) {
+    if(m2>=50) {
+        ch='2';
+        p2kz();
+        return;
+    }
+}
+if(n2>=600) {
+    if(m2>=100) {
+        ch='3';
+        p2kz();
+        return;
+    }
+}
+renji_gress();
+if(x<p) {
+    if(a[p-1][q]=="��") {
+        if(m2>=20) {
+            ch2=UP;
+            ch='4';
+        }
+    } else {
+        ch=UP;
+    }
+    p2kz();
+    if(p!=p2||q!=q2) {
+        p2=p;
+        q2=q;
+        return;
+    } else {
+        renji_suiji();
+        return;
+    }
+}
+if(x>p) {
+    if(a[p+1][q]=="��") {
+        if(m2>=20) {
+            ch2=DOWN;
+            ch='4';
+        }
+    } else {
+        ch=DOWN;
+    }
+    p2kz();
+    if(p!=p2||q!=q2) {
+        p2=p;
+        q2=q;
+        return;
+    } else {
+        renji_suiji();
+        return;
+    }
+}
+if(y<q) {
+    if(a[p][q-1]=="��") {
+        if(m2>=20) {
+            ch2=LEFT;
+            ch='4';
+        }
+    } else {
+        ch=LEFT;
+    }
+    p2kz();
+    if(p!=p2||q!=q2) {
+        p2=p;
+        q2=q;
+        return;
+    } else {
+        renji_suiji();
+        return;
+    }
+}
+if(y>q) {
+    if(a[p][q+1]=="��") {
+        if(m2>=20) {
+            ch2=RIGHT;
+            ch='4';
+        }
+    } else {
+        ch=RIGHT;
+    }
+    p2kz();
+    if(p!=p2||q!=q2) {
+        p2=p;
+        q2=q;
+        return;
+    } else {
+        renji_suiji();
+        return;
+    }
+}
+return;
+}
+void renji_suiji() {
+srand((unsigned)time(NULL));
+switch(rand()%4) {
+    case 0: {
+        ch=UP;
+        p2kz();
+        p2kz();
+        break;
+    }
+    case 1: {
+        ch=DOWN;
+        p2kz();
+        p2kz();
+        break;
+    }
+    case 2: {
+        ch=LEFT;
+        p2kz();
+        p2kz();
+        break;
+    }
+    case 3: {
+        ch=RIGHT;
+        p2kz();
+        p2kz();
+        break;
+    }
+}
+}
+void renji_gress() {
+if(a[p-2][q]=="��") {
+    if(a[p-1][q]=="��") {
+        if(m2>=30) {
+            ch2=UP;
+            ch='4';
+            p2kz();
+            return;
+        }
+    }
+}
+if(a[p+2][q]=="��") {
+    if(a[p+1][q]=="��") {
+        if(m2>=30) {
+            ch2=DOWN;
+            ch='4';
+            p2kz();
+            return;
+        }
+    }
+}
+if(a[p][q-2]=="��") {
+    if(a[p][q-1]=="��") {
+        if(m2>=30) {
+            ch2=LEFT;
+            ch='4';
+            p2kz();
+            return;
+        }
+    }
+}
+if(a[p][q+2]=="��") {
+    if(a[p][q+1]=="��") {
+        if(m2>=30) {
+            ch2=RIGHT;
+            ch='4';
+            p2kz();
+            return;
+        }
+    }
+}
+if(a[p-1][q]=="��") {
+    ch=UP;
+    p2kz();
+    return;
+}
+if(a[p+1][q]=="��") {
+    ch=DOWN;
+    p2kz();
+    return;
+}
+if(a[p][q-1]=="��") {
+    ch=LEFT;
+    p2kz();
+    return;
+}
+if(a[p][q+1]=="��") {
+    ch=RIGHT;
+    p2kz();
+    return;
+}
+}
+int main() {
+if(1) {
+    hidden();
+    jz[1]="��";
+    jz[2]="��";
+    jz[3]="��";
+    jz[4]="��";
+    jz[5]="��";
+    jz[6]="��";
+    jz[7]="��";
+    jz[0]="";
+}
+hqzy();
+for(i=1; i<=136; i++) {
+    xxxx=i%8;
+    COORD pos = {0, 0};
+    SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos);
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+    printf("Are entering a square in the world~    Loading...\n");
+    printf("-------------------------------------------------\n");
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_GREEN);
+    for(j=1; j<=i/8; j++)
+        printf("��");
+    cout<<jz[xxxx]<<endl;
+    SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE),FOREGROUND_INTENSITY|FOREGROUND_BLUE|FOREGROUND_RED|FOREGROUND_GREEN);
+    printf("----------------------------------\n");
+}
+////////////////////////////////////////////////////////////////////////////////////
+printf("Initialize the...");
+Sleep(1000);
+while(1) {
+    n1=1000;
+    m1=10;
+    n2=1000;
+    m2=10;
+    l1=1;
+    l2=1;
+    lev1=0;
+    lev2=0;
+    zcd();
+    if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+            ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+            ||x==4&&y==16||x==4&&y==17
+            ||x==16&&y==1||x==16&&y==2
+            ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+            ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+        a[x][y]="��";
+    } else {
+        a[x][y]="��";
+    }
+    if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+            ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+            ||p==4&&q==16||p==4&&q==17
+            ||p==16&&q==1||p==16&&q==2
+            ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+            ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+        a[p][q]="��";
+    } else {
+        a[p][q]="��";
+    }
+    x=18;
+    y=1;
+    p=2;
+    q=17;
+    a[4][6]=a[4][10]=a[4][11]=a[4][12]=a[5][10]=a[5][11]=a[6][10]=a[7][3]=a[7][15]=a[8][14]=a[8][15]=a[9][13]=a[9][14]=a[9][15]=a[13][3]=a[12][3]=a[12][4]=a[11][3]=a[11][4]=a[11][5]=a[14][8]=a[15][7]=a[15][8]=a[16][6]=a[16][7]=a[16][8]=a[16][12]=a[13][15]="��";
+    a[x][y]="��";
+    a[p][q]="��";
+    t=time(NULL);             //��ʼʱ��
+    t1=(int)time(NULL);       //��ǰʱ��
+    t2=(int)time(NULL)-t;     //��Ѫʱ��
+    t3=(int)time(NULL)-t;     //��ǰʱ��-��ʼʱ�䣺1 or 0
+    t5=(double)time(NULL);    //
+    draw();
+    while(n1>0&&n2>0) {
+        t1=(int)time(NULL);
+        t3=(int)time(NULL)-t;
+        t6=(double)time(NULL)-t5;
+        if((time(NULL)-t)/60==10) {
+            draw();
+            printf("            Game over");
+            while(1) {
+                ch=getch();
+                if(ch=='=') {
+                    return 0;
+                }
+            }
+        }
+        if(t2!=(int)time(NULL)-t) {
+            draw();
+            t2=(int)time(NULL)-t;
+            if(x==2&&y==15||x==2&&y==16||x==2&&y==17
+                    ||x==3&&y==15||x==3&&y==16||x==3&&y==17
+                    ||x==4&&y==16||x==4&&y==17) {
+                n1-=50;
+            }
+            if(x==16&&y==1||x==16&&y==2
+                    ||x==17&&y==1||x==17&&y==2||x==17&&y==3
+                    ||x==18&&y==1||x==18&&y==2||x==18&&y==3) {
+                n1+=50;
+            }
+            if(p==2&&q==15||p==2&&q==16||p==2&&q==17
+                    ||p==3&&q==15||p==3&&q==16||p==3&&q==17
+                    ||p==4&&q==16||p==4&&q==17) {
+                n2+=50;
+            }
+            if(p==16&&q==1||p==16&&q==2
+                    ||p==17&&q==1||p==17&&q==2||p==17&&q==3
+                    ||p==18&&q==1||p==18&&q==2||p==18&&q==3) {
+                n2-=50;
+            }
+        }
+        if(t3%60==0) {
+            srand((unsigned)time(NULL));
+            switch(rand()%28) {
+                case 0:
+                    if(a[4][6]=="��")a[4][6]="��";
+                case 1:
+                    if(a[4][10]=="��")a[4][10]="��";
+                case 2:
+                    if(a[4][11]=="��")a[4][11]="��";
+                case 3:
+                    if(a[4][12]=="��")a[4][12]="��";
+                case 4:
+                    if(a[5][10]=="��")a[5][10]="��";
+                case 5:
+                    if(a[5][11]=="��")a[5][11]="��";
+                case 6:
+                    if(a[6][10]=="��")a[6][10]="��";
+                case 7:
+                    if(a[7][3]=="��")a[7][3]="��";
+                case 8:
+                    if(a[7][15]=="��")a[7][15]="��";
+                case 9:
+                    if(a[8][14]=="��")a[8][14]="��";
+                case 10:
+                    if(a[8][15]=="��")a[8][15]="��";
+                case 11:
+                    if(a[9][13]=="��")a[9][13]="��";
+                case 12:
+                    if(a[9][14]=="��")a[9][14]="��";
+                case 13:
+                    if(a[9][15]=="��")a[9][15]="��";
+                case 14:
+                    if(a[13][3]=="��")a[13][3]="��";
+                case 15:
+                    if(a[12][3]=="��")a[12][3]="��";
+                case 16:
+                    if(a[12][4]=="��")a[12][4]="��";
+                case 17:
+                    if(a[11][3]=="��")a[11][3]="��";
+                case 18:
+                    if(a[11][4]=="��")a[11][4]="��";
+                case 19:
+                    if(a[11][5]=="��")a[11][5]="��";
+                case 20:
+                    if(a[14][8]=="��")a[14][8]="��";
+                case 21:
+                    if(a[15][7]=="��")a[15][7]="��";
+                case 22:
+                    if(a[15][8]=="��")a[15][8]="��";
+                case 23:
+                    if(a[16][6]=="��")a[16][6]="��";
+                case 24:
+                    if(a[16][7]=="��")a[16][7]="��";
+                case 25:
+                    if(a[16][8]=="��")a[16][8]="��";
+                case 26:
+                    if(a[16][12]=="��")a[16][12]="��";
+                case 27:
+                    if(a[13][15]=="��")a[13][15]="��";
+            }
+            draw();
+        }
+        if(t6>=0.125) {//�ٶȵ���
+            renji();
+            t5+=0.125;
+        }
+        if(kbhit()) {
+            ch=getch();
+            p1kz();
+            ////////////////////////////////////////////////////////////////////////////////////
+            if(ch=='p') {
+                zanting();
+                t4=t1;
+                do {
+                    ch=getch();
+                } while(ch!='p');
+                t=t+(int)time(NULL)-t4;
+                system("cls");
+                draw();
+                continue;
+            }
+            if(ch=='=') {
+                exit(0);
+            }
+            if(ch=='q') {
+                m1++;
+                draw();
+            }
+            if(ch=='6') {
+                m2++;
+                draw();
+            }
+        }
+    }
+    ////////////////////////////////////////////////////////////////////////////////////
+    draw();
+    if(n2==0) {
+        printf("        ��Player 1 -");
+        while(1) {
+            ch=getch();
+            if(ch=='=') {
+                break;
+            }
+        }
+    } else {
+        printf("        ��Player 2 -");
+        while(1) {
+            ch=getch();
+            if(ch=='=') {
+                break;
+            }
+        }
+    }
+}
+return 0;
+}
diff --git a/查找路径2.cpp b/查找路径2.cpp
new file mode 100644
index 0000000..19b14e6
--- /dev/null
+++ b/查找路径2.cpp
@@ -0,0 +1,41 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+l a,b,dp[10000][1000],vis[10000][1000]={},x,y;
+using namespace std;
+int main(){
+	cin >>a>>b;
+	for(int i=1;i<=b;i++){
+		cin >>x>>y;
+		vis[x][y]=1;
+	}
+	dp[1][1]=1;
+	for(int i=1;i<=a;i++){
+		for(int j=1;j<=a;j++){
+			if(vis[i][j]==1){
+				dp[i][j]=0;
+			}
+			else{
+				if(i==1 && j==1){
+					continue;
+				}
+				else if(i==1){
+					dp[i][j]=dp[i][j-1];
+				}
+				else if(j==1){
+					dp[i][j]=dp[i-1][j];
+				}
+				else{
+					dp[i][j]=(dp[i-1][j]+dp[i][j-1])%100003;
+				}
+			}
+		}
+	}
+	cout <<dp[a][a];
+	return 0;
+}
diff --git a/栈的练习1.cpp b/栈的练习1.cpp
new file mode 100644
index 0000000..9afde1a
--- /dev/null
+++ b/栈的练习1.cpp
@@ -0,0 +1,29 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+stack<int> stk;
+int main(){
+	int a,b[10000];
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>b[i];
+	}
+	for(int i=0;i<a;i++){
+		stk.push(b[i]);
+	}
+	while(stk.empty()!=true){
+		cout <<"=====stk.size["<<stk.size()<<"]======"<<endl;
+		cout <<"     stk.pop["<<stk.top()<<"]"<<endl;
+		stk.pop();
+	}
+	return 0;
+}
diff --git a/栈的练习2.cpp b/栈的练习2.cpp
new file mode 100644
index 0000000..b63e9f4
--- /dev/null
+++ b/栈的练习2.cpp
@@ -0,0 +1,34 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+stack<int> stk;
+stack<int> stk1;
+int main(){
+	int a,t;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>t;
+		stk.push(t);
+	}
+	cout <<"========before_resever-top->bottom======="<<endl;
+	for(int i=0;i<a;i++){
+		cout <<stk.top()<<" ";
+		stk1.push(stk.top());
+		stk.pop();
+	}
+	cout <<endl<<"========after__resever-top->bottom======="<<endl;
+	for(int i=0;i<a;i++){
+		cout <<stk1.top()<<" ";
+		stk1.pop();
+	}
+	return 0;
+}
diff --git a/根据字母加分.cpp b/根据字母加分.cpp
new file mode 100644
index 0000000..15bc1b9
--- /dev/null
+++ b/根据字母加分.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+#include <cstring>
+using namespace std;
+int main(){
+	char a[10000];
+	int sum=0;
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]=='A'){
+			sum+=3;
+		}
+		else if(a[i]=='B'){
+			sum+=2;
+		}
+		else if(a[i]=='C'){
+			sum+=1;
+		}
+	}
+	cout <<sum;
+	return 0;
+}
+
+
diff --git a/歌唱比赛.cpp b/歌唱比赛.cpp
new file mode 100644
index 0000000..7761fbc
--- /dev/null
+++ b/歌唱比赛.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int n,m;
+	int max=-100000,min=100000;
+	int a[100];
+	int b=0;
+	cin >>n;
+	cin >>m;
+	for(int i=0;i<n;i++){
+		cin >>a[i];
+		if(a[i]>=max){
+			max=a[i];
+		}
+		if(a[i]<=min){
+			min=a[i];
+		}
+	}
+	for(int i=0;i>n;i++){
+		b+=a[i];
+	}
+	cout <<b*1.0/(m-2);
+	return 0;
+}
+
diff --git a/求1~n的和.cpp b/求1~n的和.cpp
new file mode 100644
index 0000000..aac7ace
--- /dev/null
+++ b/求1~n的和.cpp
@@ -0,0 +1,33 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+int n;
+using namespace std;
+long long wjh(int a){
+	if(a==n){
+		return n;
+	}
+	else{
+		return wjh(a+1)*a;
+	}
+}
+int main(){
+	cin >>n;
+	if(n==0){
+		cout <<1;
+		return 0;
+	}
+	else{
+		cout <<wjh(1);
+	}
+	return 0;
+}
diff --git a/求出e的值.cpp b/求出e的值.cpp
new file mode 100644
index 0000000..4dd4403
--- /dev/null
+++ b/求出e的值.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a;
+	double sum=1;
+	long long tem=1;
+	scanf("%d",&a);
+	for(int i=1;i<=a;i++){
+		for(int j=1;j<=i;j++){
+			tem*=j;
+		}
+		sum+=1*1.0/tem;
+		tem=1;
+	}
+	printf("%.10lf",sum);
+	return 0;
+}
diff --git a/求平方.cpp b/求平方.cpp
new file mode 100644
index 0000000..d8ba56e
--- /dev/null
+++ b/求平方.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,i,j;
+	cin >>a;
+	for(i=1;i<=a;i++){
+		cout <<i*i;
+		break;
+	}
+	for(j=i+1;j<=a;j++){
+		cout <<","<<j*j;
+	}
+	return 0;
+}
diff --git a/求极差.cpp b/求极差.cpp
new file mode 100644
index 0000000..588128b
--- /dev/null
+++ b/求极差.cpp
@@ -0,0 +1,14 @@
+#include<iostream> 
+using namespace std;
+int main(){
+	int n,maxn=-1,minn=1001;
+    cin>>n;
+	for(int i=1;i<=n;++i){ 
+	int tmp; 
+	cin>>tmp; 
+	maxn=max(tmp,maxn);
+	minn=min(tmp,minn);
+	} 
+	cout<<maxn-minn;
+	return 0; 
+}
diff --git a/求面积.cpp b/求面积.cpp
new file mode 100644
index 0000000..1ce7e47
--- /dev/null
+++ b/求面积.cpp
@@ -0,0 +1,13 @@
+	#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	double a;
+	double b;
+	cin >>a;
+	b=a*a/2.0/2.0;
+	printf("%.2f",b);
+	return 0;
+}
+
+
diff --git a/津津的宝石矿场.cpp b/津津的宝石矿场.cpp
new file mode 100644
index 0000000..fb6b0ec
--- /dev/null
+++ b/津津的宝石矿场.cpp
@@ -0,0 +1,35 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	int a,b;
+	d c,e[100000],f[100000],sum=0;
+	cin >>a>>b>>c;
+	for(int i=0;i<a;i++){
+		cin >>e[i];
+	}
+	sort(e,e+a);
+	for(int i=a-1;i>=0;i--){
+		f[a-i-1]=e[i];
+	}
+	for(int i=0;i<b;i++){
+		sum+=f[i];
+	}
+	if(sum>=c){
+		cout <<"Good Game!"<<endl;
+		cout <<fixed<<setprecision(3)<<sum-c;
+	}
+	else{
+		cout <<"Bad Game!"<<endl;
+		cout <<fixed<<setprecision(3)<<c-sum;
+	}
+	return 0;
+}
diff --git a/津津的游戏时间.cpp b/津津的游戏时间.cpp
new file mode 100644
index 0000000..3c2f2f5
--- /dev/null
+++ b/津津的游戏时间.cpp
@@ -0,0 +1,10 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	int c;
+	cin >>a>>b>>c;
+	cout <<a*60*60+b*60+c;
+	return 0;
+}
diff --git a/满足条件的数.cpp b/满足条件的数.cpp
new file mode 100644
index 0000000..99d1873
--- /dev/null
+++ b/满足条件的数.cpp
@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+    int m;
+    int n;
+    int a=0;
+    cin >>m>>n;
+    while(m<=n){
+    	if(m%7==0){
+    		a+=m;
+    	
+		}
+		m++;
+	}
+	cout <<a;
+    return 0;
+}
+
diff --git a/满足条件的数的累加2.cpp b/满足条件的数的累加2.cpp
new file mode 100644
index 0000000..3a1a5dd
--- /dev/null
+++ b/满足条件的数的累加2.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b[10000],c,sum=0;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>b[i];
+	}
+	cin >>c;
+	for(int i=0;i<a;i++){
+		if(b[i]%10==c){
+			sum+=b[i];
+		}
+	}
+	cout <<sum;
+	return 0;
+}
+
+
diff --git a/火箭发射(循环结构).cpp b/火箭发射(循环结构).cpp
new file mode 100644
index 0000000..2dd8602
--- /dev/null
+++ b/火箭发射(循环结构).cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=a;i>=0;i--){
+		cout <<i<<" ";
+	}
+	cout <<"launch";
+	return 0;
+}
+
+
diff --git a/点和正方形的关系.cpp b/点和正方形的关系.cpp
new file mode 100644
index 0000000..49a81cc
--- /dev/null
+++ b/点和正方形的关系.cpp
@@ -0,0 +1,14 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int x;
+	int y;
+	cin >>x>>y;
+	if(x>=-1 && x<=1 && y>=-1 && y<=1){
+		cout <<"yes";
+		}
+		else{
+			cout <<"no";
+	}
+	return 0;
+}
diff --git a/特殊 a 串数列和.cpp b/特殊 a 串数列和.cpp
new file mode 100644
index 0000000..b2545fe
--- /dev/null
+++ b/特殊 a 串数列和.cpp	
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int sum1=0,sum2=0;
+	int a,n;
+	scanf("%d%d",&n,&a);
+	for(int i=0;i<n;i++){
+		sum1=sum1*10+a;
+		sum2+=sum1;
+	}
+	printf("%d",sum2);
+	return 0;
+}
diff --git a/特殊求和.cpp b/特殊求和.cpp
new file mode 100644
index 0000000..7cdf60f
--- /dev/null
+++ b/特殊求和.cpp
@@ -0,0 +1,31 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,sum=0,flag=0;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		b=i;
+		while(b){
+			if(b%10==7){
+				sum+=b;
+				flag=1;
+				break;
+			}
+			b/=10;
+		}
+		if(flag==1){
+				continue;
+			}
+			else{
+				if(i/7==0){
+					sum+=i;
+				} 
+			}
+			flag=0;
+	}
+	cout <<sum;
+	return 0;
+}
+
+
diff --git a/甲流疫情死亡率.cpp b/甲流疫情死亡率.cpp
new file mode 100644
index 0000000..9256582
--- /dev/null
+++ b/甲流疫情死亡率.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+#include <cmath>
+#include <cstdlib>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	double a;
+	double b;
+	cin >>a>>b;
+	cout <<fixed<<setprecision(3)<<b/a*100;
+	cout <<"%";
+	return 0;
+}
diff --git a/电梯用电量.cpp b/电梯用电量.cpp
new file mode 100644
index 0000000..24238af
--- /dev/null
+++ b/电梯用电量.cpp
@@ -0,0 +1,33 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	char a[10000];
+	int b[10000]={0,0},c=0,num=0,flag=1;
+	double sum=0;
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]==','){
+			b[c]=num*flag;
+			num=0;
+			c++;
+			flag=1;
+		}
+		else if(a[i]=='-'){
+			flag=-1;
+		}
+		else{
+			num=num*10+(a[i]-'0');
+		}
+	}
+	b[c]=num*flag;
+	c++;
+	for(int i=0;i<c;i++){
+		if((b[i-1]-b[i])<0)
+	}
+	return 0;
+}
diff --git a/画平行四边形.cpp b/画平行四边形.cpp
new file mode 100644
index 0000000..1f0a05c
--- /dev/null
+++ b/画平行四边形.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=a;i>=1;i--){
+		for(int j=1;j<=i-1;j++){
+			cout <<" ";
+		}
+		for(int j=1;j<=a;j++){
+			cout <<"*";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
+
+
diff --git a/画沙漏.cpp b/画沙漏.cpp
new file mode 100644
index 0000000..5b7b74a
--- /dev/null
+++ b/画沙漏.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=a;i>=1;i--){
+		for(int j=a-i;j>=1;j--){
+			cout <<" ";
+		}
+		for(int k=i;k>=1;k--){
+			cout <<"* ";
+		}
+		cout <<endl;
+	} 
+	for(int i=a-2;i>=0;i--){
+		for(int j=i;j>=1;j--){
+			cout <<" ";
+		}
+		for(int j=a-i;j>=1;j--){
+			cout <<"* ";
+		}
+		cout <<endl;
+	} 
+	return 0;
+}
diff --git a/画直角梯形.cpp b/画直角梯形.cpp
new file mode 100644
index 0000000..984e170
--- /dev/null
+++ b/画直角梯形.cpp
@@ -0,0 +1,17 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b;
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		for(int i=0;i<b;i++){
+			cout <<"*";
+		}
+		b++;
+		cout <<endl;
+	}
+	return 0;
+}
+
+
diff --git a/画矩形.cpp b/画矩形.cpp
new file mode 100644
index 0000000..a6a040a
--- /dev/null
+++ b/画矩形.cpp
@@ -0,0 +1,32 @@
+	#include <iostream>
+	#include <iomanip>
+	using namespace std;
+	int main(){
+		int a,b,d;
+		char c;
+		cin >>a>>b>>c>>d;
+		if(d==0){
+			for(int j=1;j<=b;j++){
+				cout <<c;
+			}
+			cout <<endl;
+			for(int i=1;i<=a-2;i++){
+				cout <<c<<setw(b-1)<<c;
+				cout <<endl;
+		}
+			for(int j=1;j<=b;j++){
+				cout <<c;
+			}
+		}
+		else{
+			for(int i=1;i<=a;i++){
+				for(int j=1;j<=b;j++){
+					cout <<c;
+				}
+				cout <<endl;
+			}
+		} 
+		return 0;
+	}
+	
+
diff --git a/画简单的长方形.cpp b/画简单的长方形.cpp
new file mode 100644
index 0000000..1bfc61b
--- /dev/null
+++ b/画简单的长方形.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b;
+	cin >>a>>b;
+	for(int i=1;i<=a;i++){
+		for(int j=1;j<=b;j++){
+			cout <<"*";
+		}
+		cout <<endl;
+	} 
+	return 0;
+}
+
+
diff --git a/矩阵列优先输出.cpp b/矩阵列优先输出.cpp
new file mode 100644
index 0000000..0156f53
--- /dev/null
+++ b/矩阵列优先输出.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	l a,b,c[100][100];
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			cin >>c[i][j];
+		}
+	}
+	for(int i=0;i<b;i++){
+		for(int j=0;j<a;j++){
+			cout <<c[j][i]<<" ";
+		}
+		cout <<endl;
+	} 
+	return 0;
+}
diff --git a/矩阵加法.cpp b/矩阵加法.cpp
new file mode 100644
index 0000000..8128a39
--- /dev/null
+++ b/矩阵加法.cpp
@@ -0,0 +1,36 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[100][100],b[100][100],c,d,e[100][100]={};
+	cin >>c>>d;
+	for(int i=0;i<c;i++){
+		for(int j=0;j<d;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=0;i<c;i++){
+		for(int j=0;j<d;j++){
+			cin >>b[i][j];
+		}
+	}
+	for(int i=0;i<c;i++){
+		for(int j=0;j<d;j++){
+			e[i][j]+=a[i][j];
+		}
+	}
+	for(int i=0;i<c;i++){
+		for(int j=0;j<d;j++){
+			e[i][j]+=b[i][j];
+		}
+	}
+	for(int i=0;i<c;i++){
+		for(int j=0;j<d;j++){
+			cout <<e[i][j]<<" ";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
+
+
diff --git a/矩阵算斜线.cpp b/矩阵算斜线.cpp
new file mode 100644
index 0000000..1152c84
--- /dev/null
+++ b/矩阵算斜线.cpp
@@ -0,0 +1,30 @@
+	#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	l a,b,c[100][100],sum=0;
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		for(int j=0;j<a;j++){
+			cin >>c[i][j];
+		}
+	}
+	if(b==1){
+		for(int i=a-1;i>=0;i--){
+			sum+=c[i][a-i-1];
+		}
+	}
+	if(b==0){
+		for(int i=0;i<a;i++){
+			sum+=c[i][i];
+		}
+	}
+	cout <<sum;
+	return 0;
+}
diff --git a/空瓶换酒.cpp b/空瓶换酒.cpp
new file mode 100644
index 0000000..863338c
--- /dev/null
+++ b/空瓶换酒.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a,b,c,d;
+	scanf("%d",&a);
+	while(true){
+		
+	}
+	printf("%d",b+c+d);
+	return 0;
+}
diff --git a/等腰三角形.cpp b/等腰三角形.cpp
new file mode 100644
index 0000000..3100fbe
--- /dev/null
+++ b/等腰三角形.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int n;
+	cin >>n;
+	for (int i=1;i<=n;i++)
+    {
+        for (int j=1;j<=n-i;j++)
+               cout <<" ";
+        for (int j=1;j<=2*i-1;j++)
+               cout <<1;
+        cout <<endl;
+    }
+     
+	return 0;
+}
+
+
diff --git a/简单的计算器(1).cpp b/简单的计算器(1).cpp
new file mode 100644
index 0000000..0dba734
--- /dev/null
+++ b/简单的计算器(1).cpp
@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	char c;
+	cin >>a>>b>>c;
+	switch(c){
+		case '+':
+			cout <<a+b;
+			break;
+			case '-':
+				cout <<a-b;
+				break;
+				case '*':
+				cout <<a*b;
+				break;
+				case '/':
+					if(b==0){
+						cout <<"Divided by zero!";
+						break;
+					}
+					else{
+						cout <<a/b;
+						break;
+					}
+					default:
+						cout <<"Invalid operator!";
+						break;
+						
+	}	
+	return 0;
+}
diff --git a/简单的计算器(2).cpp b/简单的计算器(2).cpp
new file mode 100644
index 0000000..e4c1c80
--- /dev/null
+++ b/简单的计算器(2).cpp
@@ -0,0 +1,25 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a,b;
+	char c;
+	cin >>a>>b>>c;
+	if(c=='+'){
+		cout <<a+b;
+	}
+	if(c=='-'){
+		cout <<a-b;
+	}
+	if(c=='*'){
+		cout <<a*b;
+	}
+	if(c=='/'){
+		if(b==0){
+			cout <<"Divided by zero!";
+		}
+		else{
+			cout <<a/b;
+	}
+	}
+	return 0;
+}
diff --git a/简单的计算器.cpp b/简单的计算器.cpp
new file mode 100644
index 0000000..0dba734
--- /dev/null
+++ b/简单的计算器.cpp
@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	char c;
+	cin >>a>>b>>c;
+	switch(c){
+		case '+':
+			cout <<a+b;
+			break;
+			case '-':
+				cout <<a-b;
+				break;
+				case '*':
+				cout <<a*b;
+				break;
+				case '/':
+					if(b==0){
+						cout <<"Divided by zero!";
+						break;
+					}
+					else{
+						cout <<a/b;
+						break;
+					}
+					default:
+						cout <<"Invalid operator!";
+						break;
+						
+	}	
+	return 0;
+}
diff --git a/素数判定.cpp b/素数判定.cpp
new file mode 100644
index 0000000..d5a9c13
--- /dev/null
+++ b/素数判定.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,b=0,c=0,e=2;
+	cin >>a;
+	for(int i=2;i<=a;i++){
+		if(a%i!=0){
+			b++;
+		}
+	}
+	if(b==a-2){
+		cout <<"yes";
+	}
+	else{
+		cout <<"no";
+	} 
+	return 0;
+}
+
diff --git a/细胞分裂(循环结构).cpp b/细胞分裂(循环结构).cpp
new file mode 100644
index 0000000..4ba5185
--- /dev/null
+++ b/细胞分裂(循环结构).cpp
@@ -0,0 +1,15 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,sum=1,b=0;
+	cin >>a;
+	while(sum<a){
+		sum*=2;
+		b++;
+	}
+	cout <<b;
+	return 0;
+}
+
+
diff --git a/统计字符信息.cpp b/统计字符信息.cpp
new file mode 100644
index 0000000..f8fe0fb
--- /dev/null
+++ b/统计字符信息.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <cstring>
+using namespace std;
+int main(){
+	char a[1000];
+	int b=0,c=0,d=0,e=0;
+	gets(a);
+	for(int i=0;i<strlen(a);i++){
+		if((a[i]<='z' && a[i]>='a') || (a[i]<='Z' && a[i]>='A')){
+			b++;
+		}
+		else if(a[i]<='9' && a[i]>='0'){
+			c++;
+		}
+		else if(a[i]==32){
+			d++;
+		}
+		else{
+			e++;
+	}
+}
+	cout <<b<<" "<<c<<" "<<d<<" "<<e; 
+	return 0;
+}
+
diff --git a/统计满足条件的4位数.cpp b/统计满足条件的4位数.cpp
new file mode 100644
index 0000000..b5c981e
--- /dev/null
+++ b/统计满足条件的4位数.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[10000],b,c,d,e,f,g=0;
+	scanf("%d",&b);
+	for(int i=0;i<b;i++){
+		cin >>a[i];
+	}
+	for(int i=0;i<b;i++){
+		c=a[i]%10;
+		a[i]/=10;
+		d=a[i]%10;
+		a[i]/=10;
+		e=a[i]%10;
+		a[i]/=10;
+		f=a[i]%10;
+		a[i]/=10;
+		if((c-d-e-f)>0){
+			g++;
+		}
+	}
+	printf("%d",g);
+	return 0;
+}
diff --git a/耶!!.cpp b/耶!!.cpp
new file mode 100644
index 0000000..d9e535b
--- /dev/null
+++ b/耶!!.cpp
@@ -0,0 +1,19 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	cout <<".\"\".   .\"\"."<<endl;
+	cout <<"|  |   /  /"<<endl;
+	cout <<"|  |  /  /"<<endl;
+	cout <<"|  | /  /"<<endl;
+	cout <<"|  |/  ;_._"<<endl;
+	cout <<"}  ` _/  / ;"<<endl;
+	cout <<"|  /` ) /  /"<<endl;
+	cout <<"| /  /_/\\_/\\"<<endl;
+	cout <<"|/  /      |"<<endl;
+	cout <<"(  ' \\ '-  |"<<endl;
+	cout <<" \\    `.  /"<<endl;
+	cout <<" |        |"<<endl;
+	cout <<" |        |"<<endl;
+	cout <<" |        |";
+    return 0;
+}
diff --git a/能被3、5、7整除的数.cpp b/能被3、5、7整除的数.cpp
new file mode 100644
index 0000000..85d72a5
--- /dev/null
+++ b/能被3、5、7整除的数.cpp
@@ -0,0 +1,31 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	if(a%3==0 && a%5==0 && a%7==0){
+		cout <<"3 5 7";
+	}
+	if(a%3==0 && a%5==0 && a%7!=0){
+		cout <<"3 5";
+	}
+	if(a%3==0 && a%5!=0 && a%7==0){
+		cout <<"3 7";
+	}
+	if(a%3!=0 && a%5==0 && a%7==0){
+		cout <<"5 7";
+	}
+	if(a%3==0 && a%5!=0 && a%7!=0){
+		cout <<"3";
+	}
+	if(a%3!=0 && a%5==0 && a%7!=0){
+		cout <<"5"; 
+	}
+	if(a%3!=0 && a%5!=0 && a%7==0){
+		cout <<"7";
+	}
+	if(a%3!=0 && a%5!=0 && a%7!=0){
+		cout <<"n";
+	}
+	return 0;
+}
diff --git a/自幂数.cpp b/自幂数.cpp
new file mode 100644
index 0000000..43c9d00
--- /dev/null
+++ b/自幂数.cpp
@@ -0,0 +1,27 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	long long a,b=0,c[10000],d,sum=0;
+	scanf("%lld",&a);
+	d=a;
+	while(d){
+		c[b]=d%10;
+		b++;
+		d/=10;
+	} 
+	for(int i=0;i<b;i++){
+		sum+=pow(c[i],b);
+	}
+	if(sum==a){
+		printf("Yes");
+	}
+	else{
+		printf("No");
+	}
+	return 0;
+}
diff --git a/自我介绍.cpp b/自我介绍.cpp
new file mode 100644
index 0000000..2f26a82
--- /dev/null
+++ b/自我介绍.cpp
@@ -0,0 +1,14 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	double a,b;
+	int c;
+	scanf("%lf%lf%d",&a,&b,&c);
+	printf("height:%.2lfm,weight:%.1lfkg,age:%dyears.",a,b,c);
+	return 0;
+}
diff --git a/花园的周长和面积.cpp b/花园的周长和面积.cpp
new file mode 100644
index 0000000..ebc665e
--- /dev/null
+++ b/花园的周长和面积.cpp
@@ -0,0 +1,9 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	cin >>a>>b;
+	cout <<(a+b)*2<<" "<<a*b;
+	return 0;
+}
diff --git a/苹果和虫子.cpp b/苹果和虫子.cpp
new file mode 100644
index 0000000..41b22c0
--- /dev/null
+++ b/苹果和虫子.cpp
@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	int b;
+	int c;
+	cin >>a>>b>>c;
+	if(c%b>0){
+		cout <<a-(c/b)-1;
+	}
+	if(c%b==0){
+		cout <<a-(c/b);
+	}
+	return 0;
+}
diff --git a/苹果和虫子2.cpp b/苹果和虫子2.cpp
new file mode 100644
index 0000000..06f1971
--- /dev/null
+++ b/苹果和虫子2.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+int main(){
+	int a,b,c,d=0;
+	cin >>a>>b>>c;
+	if(c%b==0){
+		d=a-(c/b);
+		if(d<=0){
+			cout <<"0";
+		}
+		else{
+			cout <<d;
+		}
+	}
+	if(c%b!=0){
+		d=a-(c/b)-1;
+		if(d<=0){
+			cout <<"0";
+		}
+		else{
+			cout <<d;
+		}
+	}
+	return 0;
+}
diff --git a/计算书费(普通）.cpp b/计算书费(普通）.cpp
new file mode 100644
index 0000000..a1ec281
--- /dev/null
+++ b/计算书费(普通）.cpp
@@ -0,0 +1,11 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,c,d,e,f,g,h,i,j;
+	double k;
+	cin >>a>>b>>c>>d>>e>>f>>g>>h>>i>>j;
+	k=a*28.9+b*32.7+c*45.6+d*78.0+e*35.0+f*86.2+g*27.8+h*43.0+i*56.0+j*65.0;
+	cout <<fixed<<setprecision(1)<<k;
+	return 0;
+}
diff --git a/计算分数加减表达式的值.cpp b/计算分数加减表达式的值.cpp
new file mode 100644
index 0000000..92db308
--- /dev/null
+++ b/计算分数加减表达式的值.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+using namespace std;
+int main(){
+	int a;
+	double sum1,sum2;
+	scanf("%d",&a);
+	for(int i=1;i<=a;i+=2){
+		sum1+=1*1.0/i;
+	}
+	for(int i=2;i<=a;i+=2){
+		sum2+=1*1.0/i;
+	}
+	printf("%.4lf",sum1-sum2);
+	return 0;
+}
diff --git a/计算多项式的值.cpp b/计算多项式的值.cpp
new file mode 100644
index 0000000..651412d
--- /dev/null
+++ b/计算多项式的值.cpp
@@ -0,0 +1,10 @@
+#include <iostream>
+#include <iomanip>
+#include <cmath>
+using namespace std;
+int main(){
+	double a,b,c,d,x;
+	cin >>x>>a>>b>>c>>d;
+	cout <<fixed<<setprecision(7)<<a*pow(x,3)+b*pow(x,2)+c*x+d;
+	return 0;
+}
diff --git a/计算矩阵边缘元素之和.cpp b/计算矩阵边缘元素之和.cpp
new file mode 100644
index 0000000..2aa6a19
--- /dev/null
+++ b/计算矩阵边缘元素之和.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a,b,c=0,d[100][100];
+	cin >>a>>b;
+	for(int i=0;i<a;i++){
+		for(int j=0;j<b;j++){
+			cin >>d[i][j];
+			if(i==0 || j==0 || i==(a-1) || j==(b-1)){
+				c+=d[i][j];
+			}
+		}
+	}
+	cout <<c;
+	return 0;
+}
+
+
diff --git a/计算鞍点.cpp b/计算鞍点.cpp
new file mode 100644
index 0000000..a603f22
--- /dev/null
+++ b/计算鞍点.cpp
@@ -0,0 +1,40 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[100][100],max,min,k=0,m=0;
+	for(int i=0;i<5;i++){
+		for(int j=0;j<5;j++){
+			cin >>a[i][j];
+		}
+	}
+	max=a[0][0];
+	min=a[0][0];
+	for(int i=0;i<5;i++){
+		k=0;
+		m=0;
+		max=a[i][0];
+		for(int j=0;j<5;j++){
+			if(a[i][j]>max){
+				max=a[i][j];
+				k=j;
+			}
+		}
+		min=a[0][k];
+		for(int j=0;j<5;j++){
+			if(a[j][k]<min){
+				min=a[j][k];
+				m=j;
+			}
+		}
+		if(i==m){
+			cout <<m+1<<" "<<k+1<<" "<<a[m][k];
+			return 0;
+		}
+		
+	}
+	cout <<"not found";
+	return 0;
+}
diff --git a/记忆卡牌.cpp b/记忆卡牌.cpp
new file mode 100644
index 0000000..fe92aa3
--- /dev/null
+++ b/记忆卡牌.cpp
@@ -0,0 +1,106 @@
+#include <iostream>
+#include <ctime>
+#include <windows.h>
+#include <cstdlib>
+using namespace std;
+int main(){
+	int num[10][10]={0};//��¼��������
+	int temp;//�����
+	int flag[10]={0};
+	int ix,iy,ia,ib;
+	int arr[10][10]={0};
+	int sum=0;
+	cout << "���俨����Ϸ����" << endl;
+	cout << "����16�����ֿ��ƣ�������1~8��ɣ�ÿ������ֻ����2��" << endl;
+	cout << "��Ϸ����Ҫ�����Ʒ������棬�ҳ�������ͬ������" << endl;
+	cout << "ÿһ��ֻ���������ſ���" << endl;
+	cout << "�������������ͬ���򽫿����������ֵ�һ����ʾ����" << endl;
+	cout << "���򽫿��Ʒ������棬������һ��" << endl;
+	cout << "ϵͳ������Ϸ���ҳ�������ͬ���ֵĿ��������ѵIJ����������ж����֣�" << endl;
+	system("pause");
+	srand(time(0));
+		for(int j=1;j<=4;j++){
+			for(int k=1;k<=4;k++){
+				while(true){
+				temp=rand()%8+1;
+				if(flag[temp]<2){
+					num[j][k]=temp;
+					flag[temp]++;
+					break;
+				}
+				else{
+					continue;
+				}
+				}
+			}
+		}
+		for(int i=1;i<=4;i++){
+			for(int j=1;j<=4;j++){
+				cout <<"*"<<" ";
+			}
+			cout <<endl;
+		}
+		while(true){
+			int cnt=0;
+			cout <<"�������һ�η�����Ƭ������������(ʹ�ÿո������"<<endl;
+			cin >>ix>>iy;
+			arr[ix][iy]++;
+			system("cls");
+			for(int i=1;i<=4;i++){
+				for(int j=1;j<=4;j++){
+					if(arr[i][j]!=0){
+						cout <<num[i][j]<<" ";
+					}
+					else{
+						cout <<"* ";
+					}
+				}
+				cout <<endl;
+			}
+			cout <<"������ڶ��η�����Ƭ������������(ʹ�ÿո������"<<endl;
+			cin >>ia>>ib;
+			arr[ia][ib]++;
+			system("cls");
+			for(int i=1;i<=4;i++){
+				for(int j=1;j<=4;j++){
+					if(arr[i][j]!=0){
+						cout <<num[i][j]<<" ";
+					}
+					else{
+						cout <<"* ";
+					}
+				}
+				cout <<endl;
+			}
+			if(num[ix][iy]==num[ia][ib]){
+				cout <<"��ϲ�㣬���ַ��Ƴɹ�"<<endl;
+			}
+			else{
+				cout <<"���ź������ַ���ʧ��"<<endl;
+				arr[ix][iy]--;
+				arr[ia][ib]--;
+			}
+			cout <<"2��������һ��";
+			Sleep(2000);
+			system("cls");
+			for(int i=1;i<=4;i++){
+				for(int j=1;j<=4;j++){
+					if(arr[i][j]!=0){
+						cout <<num[i][j]<<" ";
+						cnt++;
+					}
+					else{
+						cout <<"* ";
+					}
+				}
+				cout <<endl;
+			}
+			sum++;
+			if(cnt==16){
+				break;
+			}
+		}
+		cout <<"һ������"<<sum<<"��";
+	return 0;
+}
+
diff --git a/输入输出二维数组.cpp b/输入输出二维数组.cpp
new file mode 100644
index 0000000..dbe2ba4
--- /dev/null
+++ b/输入输出二维数组.cpp
@@ -0,0 +1,21 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	int a[100][100],b,c;
+	cin >>b>>c;
+	for(int i=0;i<b;i++){
+		for(int j=0;j<c;j++){
+			cin >>a[i][j];
+		}
+	}
+	for(int i=0;i<b;i++){
+		for(int j=0;j<c;j++){
+			cout <<a[i][j]<<" ";
+		}
+		cout <<endl;
+	}
+	return 0;
+}
+
+
diff --git a/输出1，2，3，…，n的值.cpp b/输出1，2，3，…，n的值.cpp
new file mode 100644
index 0000000..9af70b9
--- /dev/null
+++ b/输出1，2，3，…，n的值.cpp
@@ -0,0 +1,16 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	for(int i=1;i<=a;i++){
+		cout <<pow(i,2);
+		if(i==a){
+		}
+		else{
+			cout <<",";
+		}
+	}
+	return 0;
+}
diff --git a/输出三角形.cpp b/输出三角形.cpp
new file mode 100644
index 0000000..9e0ba69
--- /dev/null
+++ b/输出三角形.cpp
@@ -0,0 +1,10 @@
+#include <iostream>
+using namespace std;
+int main(){
+	cout <<"*    "<<endl;
+	cout <<"**   "<<endl;
+	cout <<"***  "<<endl;
+	cout <<"**** "<<endl;
+	cout <<"*****"<<endl;
+	return 0;
+}
diff --git a/输出古诗.cpp b/输出古诗.cpp
new file mode 100644
index 0000000..b648539
--- /dev/null
+++ b/输出古诗.cpp
@@ -0,0 +1,10 @@
+#include <iostream>
+using namespace std;
+int main(){
+	cout <<"��ҹ������裬"<<endl;
+	cout <<"Ũ˯�����оơ�"<<endl;
+	cout <<"���ʾ����ˣ�"<<endl;
+	cout <<"ȴ���������ɡ�"<<endl;
+	cout <<"֪��֪��Ӧ���̷ʺ��ݡ�"<<endl;
+	return 0;
+} 
diff --git a/输出字符三角形.cpp b/输出字符三角形.cpp
new file mode 100644
index 0000000..1b17d37
--- /dev/null
+++ b/输出字符三角形.cpp
@@ -0,0 +1,10 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	char a;
+	cin >>a;
+	cout <<"  "<<a<<"  "<<endl;
+	cout <<" "<<a<<" "<<a<<" "<<endl;
+	cout <<a<<" "<<a<<" "<<a;
+	return 0; 
+} 
diff --git a/输出文字.cpp b/输出文字.cpp
new file mode 100644
index 0000000..00e87fc
--- /dev/null
+++ b/输出文字.cpp
@@ -0,0 +1,6 @@
+#include <iostream>
+using namespace std;
+int main(){
+	cout <<"Let the time tell the truth.";
+	return 0;
+} 
diff --git a/输出星期几.cpp b/输出星期几.cpp
new file mode 100644
index 0000000..c85be9b
--- /dev/null
+++ b/输出星期几.cpp
@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int a;
+	cin >>a;
+	switch(a){
+		case 1:
+			cout <<"Monday";
+			break;
+			case 2:
+				cout <<"Tuesday";
+				break;
+				case 3:
+					cout <<"Wednesday";
+					break;
+					case 4:
+						cout <<"Thursday";
+						break;
+						case 5:
+							cout <<"Friday";
+							break;
+							case 6:
+								cout <<"Saturday";
+								break;
+								case 7:
+									cout <<"Sunday";
+									break;
+									default:
+										cout <<"No";
+									
+	}
+	return 0;
+} 
diff --git a/输出第二个整数.cpp b/输出第二个整数.cpp
new file mode 100644
index 0000000..2121938
--- /dev/null
+++ b/输出第二个整数.cpp
@@ -0,0 +1,12 @@
+#include <bits/stdc++.h>
+using namespace std;
+int main(){
+	int first;
+	int second;
+	int third;
+	cin >> first;
+	cin >> second;
+	cin >> third;
+	cout <<second;
+	return 0;
+}
diff --git a/输出自然数(递归).cpp b/输出自然数(递归).cpp
new file mode 100644
index 0000000..7f27142
--- /dev/null
+++ b/输出自然数(递归).cpp
@@ -0,0 +1,26 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+void wjh(int x,int n){
+	if(x>n){
+		return;
+	}
+	cout <<x<<" ";
+	wjh(x+1,n);
+}
+int main(){
+	int a;
+	cin >>a;
+	wjh(1,a);
+	return 0;
+}
diff --git a/过滤空格.cpp b/过滤空格.cpp
new file mode 100644
index 0000000..f420758
--- /dev/null
+++ b/过滤空格.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <cstring>
+using namespace std;
+int main(){
+	string a;
+	getline(cin,a);
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]==' '){
+			
+		}
+		else{
+			cout <<a[i];
+		}
+	}
+	return 0;
+}
+
+
diff --git a/过滤空格1.cpp b/过滤空格1.cpp
new file mode 100644
index 0000000..d002f45
--- /dev/null
+++ b/过滤空格1.cpp
@@ -0,0 +1,19 @@
+#include <iostream>
+#include <cstring>
+#include <cstdio> 
+using namespace std;
+int main(){
+	char a[1000];
+	gets(a);
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]==' '){
+			
+		}
+		else{
+			cout <<a[i];
+		}
+	}
+	return 0;
+}
+
+
diff --git a/过滤空格2.cpp b/过滤空格2.cpp
new file mode 100644
index 0000000..cdfae79
--- /dev/null
+++ b/过滤空格2.cpp
@@ -0,0 +1,26 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+using namespace std;
+int main(){
+	char a[1000];
+	cin.getline(a,1000);
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]==' ' && a[i+1]==' '){
+			while(a[i]==' ' && a[i+1]==' '){
+				i++;
+				continue;
+			}
+			cout <<a[i];
+		}
+		else{
+			cout <<a[i];
+		}
+	} 
+	return 0;
+}
diff --git a/递归.cpp b/递归.cpp
new file mode 100644
index 0000000..e077807
--- /dev/null
+++ b/递归.cpp
@@ -0,0 +1,21 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <stack>
+#include <ctime>
+#include <cmath>
+#include <queue>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+void wjh(int x){
+	cout <<"����~"<<x<<endl;; 
+	wjh(x+1);
+}
+int main(){
+	wjh(1); 
+	return 0;
+}
diff --git a/配对碱基链.cpp b/配对碱基链.cpp
new file mode 100644
index 0000000..f73cc86
--- /dev/null
+++ b/配对碱基链.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+int main(){
+	c a[10000];
+	cin >>a;
+	for(int i=0;i<strlen(a);i++){
+		if(a[i]=='A'){
+			a[i]='T';
+		}
+		else if(a[i]=='T'){
+			a[i]='A';
+		}
+		else if(a[i]=='G'){
+			a[i]='C';
+		}
+		else if(a[i]=='C'){
+			a[i]='G';
+		}
+	}
+	cout <<a;
+	return 0;
+}
diff --git a/长方形周长（保留小数）.cpp b/长方形周长（保留小数）.cpp
new file mode 100644
index 0000000..65d0c11
--- /dev/null
+++ b/长方形周长（保留小数）.cpp
@@ -0,0 +1,10 @@
+#include <iostream>
+#include <iomanip>
+using namespace std;
+int main(){
+	float a;
+	float b;
+	cin >>a>>b;
+	cout <<fixed<<setprecision(1)<<(a+b)*2;
+	return 0;
+}
diff --git a/长方形排序.cpp b/长方形排序.cpp
new file mode 100644
index 0000000..322e3e8
--- /dev/null
+++ b/长方形排序.cpp
@@ -0,0 +1,35 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct rect{
+	int c;
+	int k;
+	int id;
+}arr[10000];
+bool cmp(rect a,rect b){
+	if(a.c+a.k==b.c+b.k){
+		return a.c<b.c; 
+	}
+	return a.c+a.k>b.c+b.k; 
+}
+int main(){
+	int a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].c>>arr[i].k;
+		arr[i].id=i;
+	}
+	sort(arr,arr+a,cmp);
+	for(int i=0;i<a;i++){
+		cout <<arr[i].id+1<<" ";
+	}
+	return 0;
+}
diff --git a/陶陶摘苹果（升级版）.cpp b/陶陶摘苹果（升级版）.cpp
new file mode 100644
index 0000000..eba55ab
--- /dev/null
+++ b/陶陶摘苹果（升级版）.cpp
@@ -0,0 +1,42 @@
+#include <algorithm>
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	int x;
+	int y;
+}arr[10000];
+bool cmp(wjh a,wjh b){
+	return a.y<b.y;
+}
+int main(){
+	int a,b,c,d;
+	int cnt=0;
+	cin >>a>>b>>c>>d;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].x>>arr[i].y;
+	}
+	sort(arr,arr+a,cmp);
+	for(int i=0;i<a;i++){
+		if(arr[i].x<=c+d){
+			b-=arr[i].y;
+			cnt++;
+		}
+		if(b<0){
+			cnt--;
+			break;
+		}
+		if(b==0){
+			break;
+		}
+	}
+	cout <<cnt;
+	return 0;
+}
diff --git a/集训体检.cpp b/集训体检.cpp
new file mode 100644
index 0000000..9b7426f
--- /dev/null
+++ b/集训体检.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+#include <cmath>
+typedef long long l;
+typedef double d;
+typedef char c;
+using namespace std;
+struct wjh{
+	string name;
+	char pd;
+	d tw;
+}arr[10000];
+int main(){
+	l a;
+	cin >>a;
+	for(int i=0;i<a;i++){
+		cin >>arr[i].name>>arr[i].pd>>arr[i].tw;
+	}
+	for(int i=0;i<a;i++){
+		if(arr[i].pd=='Y' && arr[i].tw<37){
+			cout <<arr[i].name<<" "<<"pass"<<endl;
+		}
+		else if(arr[i].pd=='Y' || arr[i].tw<37){
+			cout <<arr[i].name<<" "<<"confirmed"<<endl;
+		}
+		else{
+			cout <<arr[i].name<<" "<<"bye"<<endl;
+		}
+	}
+	return 0;
+}
diff --git a/集邮.cpp b/集邮.cpp
new file mode 100644
index 0000000..ebf3b8b
--- /dev/null
+++ b/集邮.cpp
@@ -0,0 +1,18 @@
+#include <iostream>
+#include <iomanip>
+#include <cstring>
+#include <cstdio>
+#include <ctime>
+using namespace std;
+int main(){
+	for(int i=0;i<=40;i++){
+		for(int j=0;j<=40;j++){
+			for(int k=0;k<=40;k++){
+				if(i+j+k==40 && i*8+j*16+k*50==560){
+					cout <<i<<" "<<j<<" "<<k<<endl;
+				}
+			}
+		}
+	} 
+	return 0;
+}
diff --git a/颜文字大作战.cpp b/颜文字大作战.cpp
new file mode 100644
index 0000000..442bb63
--- /dev/null
+++ b/颜文字大作战.cpp
@@ -0,0 +1,8 @@
+#include <iostream>
+using namespace std;
+int main(){
+	cout <<"->( O_o)?"<<endl;
+	cout <<"->( \" _ \")/(T_T)"<<endl;
+	cout <<"->( ��o�� )"<<endl;
+	return 0;
+}