<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[mmjcj的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/mmjcj</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; mmjcj]]></copyright><item><title><![CDATA[zzulioj ：2020新生赛：花海]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/121653105</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/121653105</guid><author>mmjcj</author><pubDate>Wed, 01 Dec 2021 13:09:01 +0800</pubDate><description><![CDATA[没什么好说的，就是简单的判断素数加嵌套循环






]]></description><category></category></item><item><title><![CDATA[补发刚才天梯赛中相同的数那个]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/121608280</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/121608280</guid><author>mmjcj</author><pubDate>Mon, 29 Nov 2021 13:57:59 +0800</pubDate><description><![CDATA[c++不会的同学可以看这个c






]]></description><category></category></item><item><title><![CDATA[弥补第一次天梯赛遗憾]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/121607915</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/121607915</guid><author>mmjcj</author><pubDate>Mon, 29 Nov 2021 13:42:35 +0800</pubDate><description><![CDATA[目录


	单词长度
		输出闰年
		找出两个集合中相同的数
		输入一个字符串转换成十进制整数
		一维数组的褶子
		不一样的人生密码
		找鞍点
		删除字符串中的子串
		通讯录排序
		加密数
		找出两个集合中相同的数
		7-23 找出两个集合中相同的数 (25分)
		给定两个正整数的集合，分别含有m个和n个元素，找出在两个集合中都出现过的数并输出。
		输入格式:
		第一行输入两个整数m和n，分别表示两个集合中的整数的个数。 第二行输入m个用空格隔开的整数，表示第一个集合中的元素。 第]]></description><category></category></item><item><title><![CDATA[算法直线与圆]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/121573080</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/121573080</guid><author>mmjcj</author><pubDate>Sat, 27 Nov 2021 10:05:45 +0800</pubDate><description><![CDATA[Description

﻿给出一个圆的圆心坐标与圆的半径，和一条直线上的两点坐标，求这条直线与圆有多少个交点。

Input
输入3个实数x，y，r值分别表示圆心坐标与圆的半径，输入4个实数x1，y1，x2，y2表示直线上的两点。多实例，输入到文件尾结束。

Output
输出直线与圆的交点个数。

Sample Input
1 1 1 0 0 1 1
Sample Output
2

现根据叉积求三角形面积，然后根据面积和底算出高





#include&lt;stdio.h&gt;
#inclu.]]></description><category></category></item><item><title><![CDATA[不如试试c语言来解决矩阵？]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120787566</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120787566</guid><author>mmjcj</author><pubDate>Fri, 15 Oct 2021 17:26:27 +0800</pubDate><description><![CDATA[布尔矩阵：

#include&lt;stdio.h&gt;
int main(){
 int num, x=0, y=0, flag=1, flag1=1,ret,count=0,count1=0;
 int a[100][100];
 scanf("%d",&amp;num);

 for (int i = 0; i &lt; num; i++)
 {
  for (int j = 0; j &lt; num; j++)
   scanf("...]]></description><category></category></item><item><title><![CDATA[小游戏:汉诺塔]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120707963</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120707963</guid><author>mmjcj</author><pubDate>Mon, 11 Oct 2021 17:35:33 +0800</pubDate><description><![CDATA[汉诺塔（Tower of Hanoi），又称河内塔，是一个源于印度古老传说的益智玩具。大梵天创造世界的时候做了三根金刚石柱子，在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘。大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放大圆盘，在三根柱子之间一次只能移动一个圆盘。














...]]></description><category></category></item><item><title><![CDATA[函数：三组组合函数：阶乘，斐波那契，平面直线]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120686548</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120686548</guid><author>mmjcj</author><pubDate>Sun, 10 Oct 2021 15:01:37 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int f1(int n)
{
 if(n==1)
 return 1;
 else
 return f1(n-1)*n;
}

int f2(int n)
{
 if(n==1||n==2)return 1;
 else return f2(n-1)+f2(n-2);
}
int f3(int n)
{
 if(n==1)return 2;
 else return f3(n-1)+n;
}
int mai...]]></description><category></category></item><item><title><![CDATA[函数：再遇哥德巴赫猜想]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120676367</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120676367</guid><author>mmjcj</author><pubDate>Sat, 09 Oct 2021 17:54:41 +0800</pubDate><description><![CDATA[哥德巴赫1742年给欧拉的信中哥德巴赫提出了以下猜想：任一大于2的整数都可写成三个质数之和[1] 。. 但是哥德巴赫自己无法证明它，于是就写信请教赫赫有名的大数学家欧拉帮忙证明，但是一直到死，欧拉也无法证明。. [2] 因现今数学界已经不使用"1也是素数"这个约定，原初猜想的现代陈述为：任一大于5的整数都可写成三个质数之和。. (n&gt;5：当n为偶数，n=2+(n-2)，n-2也是偶数，可以分解为两个质数的和；当n为奇数，n=3+(n-3)，n-3也是偶数，可以分解为两个质数的和)欧拉在回信中也提出另一]]></description><category></category></item><item><title><![CDATA[zzulioj：1073再谈鸡兔同笼问题]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120668915</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120668915</guid><author>mmjcj</author><pubDate>Sat, 09 Oct 2021 13:02:33 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[函数：素数判定]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120659430</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120659430</guid><author>mmjcj</author><pubDate>Fri, 08 Oct 2021 20:36:43 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[函数：幂的两种方法]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120656042</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120656042</guid><author>mmjcj</author><pubDate>Fri, 08 Oct 2021 17:19:39 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[数组加分支循环问题之问卷（制作不易支持一下）]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120626181</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120626181</guid><author>mmjcj</author><pubDate>Wed, 06 Oct 2021 16:30:02 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[再谈新郎新娘问题：continue]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120616691</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120616691</guid><author>mmjcj</author><pubDate>Tue, 05 Oct 2021 18:33:08 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[分支循环之新郎新娘问题]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120616512</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120616512</guid><author>mmjcj</author><pubDate>Tue, 05 Oct 2021 18:06:25 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[数组之最大值问题]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120607451</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120607451</guid><author>mmjcj</author><pubDate>Mon, 04 Oct 2021 20:07:57 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[数组解决斐波那契数列问题：1]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120607159</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120607159</guid><author>mmjcj</author><pubDate>Mon, 04 Oct 2021 19:39:54 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[郑式密码！！！！（2.0）]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120569828</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120569828</guid><author>mmjcj</author><pubDate>Thu, 30 Sep 2021 17:11:45 +0800</pubDate><description><![CDATA[转载需要作者同意哦
]]></description><category></category></item><item><title><![CDATA[图形专题：菱形！！]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120553591</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120553591</guid><author>mmjcj</author><pubDate>Wed, 29 Sep 2021 18:00:48 +0800</pubDate><description><![CDATA[有什么问题私信本博主！！！！！！！
]]></description><category></category></item><item><title><![CDATA[ZZULIOJ 1118: 数列有序]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120452424</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120452424</guid><author>mmjcj</author><pubDate>Fri, 24 Sep 2021 11:57:26 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[ZZULIOJ 1113: 递归调用的次数统计（函数专题）]]></title><link>https://blog.youkuaiyun.com/mmjcj/article/details/120449917</link><guid>https://blog.youkuaiyun.com/mmjcj/article/details/120449917</guid><author>mmjcj</author><pubDate>Fri, 24 Sep 2021 10:23:58 +0800</pubDate><description><![CDATA[]]></description><category></category></item></channel></rss>