<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wddmc的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wddmc</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wddmc]]></copyright><item><title><![CDATA[HAL库实现内部FLASh清除，存储]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/134012252</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/134012252</guid><author>wddmc</author><pubDate>Tue, 24 Oct 2023 15:12:31 +0800</pubDate><description><![CDATA[为了让数据不再掉电清零，百度一堆终于找到一个解决方案，调试一天，终于调试成功这个功能了。成功后双击上图就会弹出来，如果没有就找到编译生成的文件夹，在hex文件下面，打开map文件，滑到最下面，可以看到程序所占内存有多大，如图。18840转化为16进制为4998，所以程序所占空间加上0x08000000等于0x08004998，数一数看看在第几页。之后，在没用到的空间里进行擦除和写入操作即可。1.给flash开锁。4.给flash关锁。]]></description><category></category></item><item><title><![CDATA[L1-009 N个数求和 (20分)]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/109002624</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/109002624</guid><author>wddmc</author><pubDate>Sat, 10 Oct 2020 19:04:17 +0800</pubDate><description><![CDATA[团体程序设计天梯赛-练习集
L1-009 N个数求和 (20分)
#题目
本题的要求很简单，就是求N个数字的和。麻烦的是，这些数字是以有理数分子/分母的形式给出的，你输出的和也必须是有理数的形式。
输入格式：
输入第一行给出一个正整数N（≤100）。随后一行按格式a1/b1 a2/b2 …给出N个有理数。题目保证所有分子和分母都在长整型范围内。另外，负数的符号一定出现在分子前面。
输出格式：
输出上述数字和的最简形式 —— 即将结果写成整数部分 分数部分，其中分数部分写成分子/分母，要求分子小于分母，且它们]]></description><category></category></item><item><title><![CDATA[DijKstra算法——单源最短路]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105691987</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105691987</guid><author>wddmc</author><pubDate>Wed, 22 Apr 2020 20:37:39 +0800</pubDate><description><![CDATA[#原题：Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to g...]]></description><category></category></item><item><title><![CDATA[简单广搜（bfs）]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105568771</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105568771</guid><author>wddmc</author><pubDate>Thu, 16 Apr 2020 22:31:44 +0800</pubDate><description><![CDATA[A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the
shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboa...]]></description><category></category></item><item><title><![CDATA[Prime Time]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105303191</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105303191</guid><author>wddmc</author><pubDate>Fri, 03 Apr 2020 23:10:18 +0800</pubDate><description><![CDATA[#欧拉欧拉欧欧拉
原题：Euler is a well-known matematician, and, among many other things, he discovered that the formula
n
2 + n + 41 produces a prime for 0 ≤ n &lt; 40. For n = 40, the formula produces 1681, whi...]]></description><category></category></item><item><title><![CDATA[Harmonic Number (II)]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105281045</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105281045</guid><author>wddmc</author><pubDate>Thu, 02 Apr 2020 22:38:15 +0800</pubDate><description><![CDATA[#原题：
I was trying to solve problem ‘1234 - Harmonic Number’, I wrote the following code
long long H( int n ) {
long long res = 0;
for( int i = 1; i &lt;= n; i++ )
res = res + n / i;
return res;
}
Yes,...]]></description><category></category></item><item><title><![CDATA[确定排位]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105256400</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105256400</guid><author>wddmc</author><pubDate>Wed, 01 Apr 2020 21:45:38 +0800</pubDate><description><![CDATA[#题目：
有N个比赛队（1&lt;=N&lt;=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每场比赛的结果，即P1赢P2，用P1，P2表示，排名时P1在P2之前。现在请你编程序确定排名。
Input
输入有若干组，每组中的第一行为二个数N（1&lt;=N&lt;=500），M；其中...]]></description><category></category></item><item><title><![CDATA[拍拍牛头]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105209401</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105209401</guid><author>wddmc</author><pubDate>Mon, 30 Mar 2020 21:45:05 +0800</pubDate><description><![CDATA[#原题：今天是贝茜的生日，为了庆祝自己的生日，贝茜邀你来玩一个游戏．
贝茜让N(1≤N≤100000)头奶牛坐成一个圈．除了1号与N号奶牛外，i号奶牛与i-l号 和i+l号奶牛相邻．N号奶牛与1号奶牛相邻．农夫约翰用很多纸条装满了一个桶，每一张包含了一个独一无二的1到1,000,000的数字．
接着每一头奶牛i从柄中取出一张纸条Ai．每头奶牛轮流走上一圈，同时拍打所有编号能整除在纸条上的数字的牛的...]]></description><category></category></item><item><title><![CDATA[快速幂去越狱]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105169857</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105169857</guid><author>wddmc</author><pubDate>Sat, 28 Mar 2020 22:30:20 +0800</pubDate><description><![CDATA[#原题：
　监狱有连续编号为1…N的N个房间，每个房间关押一个犯人，有M种宗教，每个犯人可能信仰其中一种。如果相邻房间的犯人的宗教相同，就可能发生越狱，求有多少种状态可能发生越狱
输入格式
输入两个整数M，N.1&lt;=M&lt;=108,1&lt;=N&lt;=1012
输出格式
可能越狱的状态数，模100003取余
数据范围和提示
6种状态为(000)(001)(011)(100)(110)...]]></description><category></category></item><item><title><![CDATA[借锯子的农民]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105151543</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105151543</guid><author>wddmc</author><pubDate>Fri, 27 Mar 2020 22:15:57 +0800</pubDate><description><![CDATA[#原题：
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ...]]></description><category></category></item><item><title><![CDATA[#奶牛排队]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105129672</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105129672</guid><author>wddmc</author><pubDate>Thu, 26 Mar 2020 22:13:13 +0800</pubDate><description><![CDATA[#奶牛排队
##原题
FJ is about to take his N (1 ≤ N ≤ 2,000) cows to the annual"Farmer of the Year" competition. In this contest every farmer arranges his cows in a line and herds them past the judges.
The co...]]></description><category></category></item><item><title><![CDATA[#捡石子]]></title><link>https://blog.youkuaiyun.com/wddmc/article/details/105060010</link><guid>https://blog.youkuaiyun.com/wddmc/article/details/105060010</guid><author>wddmc</author><pubDate>Mon, 23 Mar 2020 22:39:58 +0800</pubDate><description><![CDATA[#捡石子
题：有一堆石子共有N个。A B两个人轮流拿，A先拿。每次最少拿1颗，最多拿K颗，拿到最后1颗石子的人获胜。假设A B都非常聪明，拿石子的过程中不会出现失误。给出N和K，问最后谁能赢得比赛。
例如N = 3，K = 2。无论A如何拿，B都可以拿到最后1颗石子。
##题意非常简单，无论如何拿，只要最后剩下的石子的数量==（最大能拿的石子+最少能拿的石子），在剩下的石子里先选者必输，结合题意可...]]></description><category></category></item></channel></rss>