<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[DNMTOOBA的博客]]></title><description><![CDATA[端着村西头的碗，操着国际化的心]]></description><link>https://blog.youkuaiyun.com/DNMTOOBA</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; DNMTOOBA]]></copyright><item><title><![CDATA[优快云写博客时，你可能会用到的一些Markdown小技巧]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/112828327</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/112828327</guid><author>DNMTOOBA</author><pubDate>Tue, 19 Jan 2021 19:33:46 +0800</pubDate><description><![CDATA[目录字体图片
字体
图片
添加图片的方法，上方的编辑栏有显示，添加的时候还可以选择“对齐方式”。这里说一下如何居中添加图片标题，最简单的方式，就是，加一个center标签： &lt;center&gt;图片标题&lt;/center&gt;
样例如下：

...]]></description><category></category></item><item><title><![CDATA[PAT (Advanced Level) Practice---甲级刷题---题解（1001~1115）]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/107398173</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/107398173</guid><author>DNMTOOBA</author><pubDate>Fri, 17 Jul 2020 00:06:35 +0800</pubDate><description><![CDATA[目录



1001A+B Format(20分)

Sample Output:

1001A+B Format(20分)

Calculatea+band output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four digits).

Input Specification:...]]></description><category></category></item><item><title><![CDATA[PAT (Basic Level) Practice （中文）---题解（1001~1095）]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/107051561</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/107051561</guid><author>DNMTOOBA</author><pubDate>Tue, 30 Jun 2020 21:59:25 +0800</pubDate><description><![CDATA[题目目录1001 害死人不偿命的(3n+1)猜想 (15分)
1001 害死人不偿命的(3n+1)猜想 (15分)
卡拉兹(Callatz)猜想：
对任何一个正整数 n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把 (3n+1) 砍掉一半。这样一直反复砍下去，最后一定在某一步得到 n=1。卡拉兹在 1950 年的世界数学家大会上公布了这个猜想，传说当时耶鲁大学师生齐动员，拼命想证明这个貌似很傻很天真的命题，结果闹得学生们无心学业，一心只证 (3n+1)，以至于有人说这是一个阴谋，卡拉兹是在蓄意延缓美]]></description><category></category></item><item><title><![CDATA[LeetCode刷题--中等篇]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/106799290</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/106799290</guid><author>DNMTOOBA</author><pubDate>Wed, 17 Jun 2020 01:29:02 +0800</pubDate><description><![CDATA[目录2. 两数相加
2. 两数相加
题目链接：  https://leetcode-cn.com/problems/add-two-numbers/
给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。
如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外，这两个数都不会以 0 开头。
示例：

输入：(2 -&gt; 4 -&gt; 3) + (5 -&gt; 6 -&gt; 4)]]></description><category></category></item><item><title><![CDATA[LeetCode刷题--简单篇]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/106798232</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/106798232</guid><author>DNMTOOBA</author><pubDate>Wed, 17 Jun 2020 01:22:52 +0800</pubDate><description><![CDATA[目录1.两数之和
1.两数之和
题目链接： https://leetcode-cn.com/problems/two-sum/
给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是，数组中同一个元素不能使用两遍。
示例:

给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]


...]]></description><category></category></item><item><title><![CDATA[【牛客网】剑指Offer题解]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104714450</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104714450</guid><author>DNMTOOBA</author><pubDate>Sat, 07 Mar 2020 16:26:17 +0800</pubDate><description><![CDATA[目录1.二维数组中的查找【数组】
1.二维数组中的查找【数组】
题目描述
在一个二维数组中（每个一维数组的长度相同），每一行都按照从左到右递增的顺序排序，每一列都按照从上到下递增的顺序排序。请完成一个函数，输入这样的一个二维数组和一个整数，判断数组中是否含有该整数。
题解：从左到右逐渐增大，从上到下逐渐增大。右边的一定比左边的大，下边的一定比上面大。所以我们选择第一行最后一个元素与目标值targe...]]></description><category></category></item><item><title><![CDATA[【Java入门（二）】eclipse的安装以及利用eclipse编写Java程序]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104481846</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104481846</guid><author>DNMTOOBA</author><pubDate>Mon, 24 Feb 2020 19:25:51 +0800</pubDate><description><![CDATA[使用IDE(集成开发环境)可以更好地编写代码、调试代码等，从而提高效率。
这里我们只了解其中一种IDE，即：Eclipse。
一.下载安装Eclipse
1.点此进入官网下载
2.然后选择”Download Packages“，点击进入。

3.选择自己需要的文件，比如”Windows 64-bit“.

4.点击下载即可，如下图所示：

5.下载好之后，解压，进入即可使用。
二.使用eclips...]]></description><category></category></item><item><title><![CDATA[【Java入门（一）】Java简介及Java环境搭建]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104465439</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104465439</guid><author>DNMTOOBA</author><pubDate>Mon, 24 Feb 2020 14:23:52 +0800</pubDate><description><![CDATA[在进行环境搭建之前，我们先简单地了解一下Java
Java是一门面向对象编程语言，不仅吸收了C++语言的各种优点，还摒弃了C++里难以理解的多继承、指针等概念，因此Java语言具有功能强大和简单易用两个特征。
同时Java具有简单性、面向对象、分布式、健壮性、安全性、平台独立与可移植性、多线程、动态性等特点。
Java分为三个体系：
Java SE：Standard Edition
Java EE...]]></description><category></category></item><item><title><![CDATA[安装Python运行环境]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104397805</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/104397805</guid><author>DNMTOOBA</author><pubDate>Thu, 20 Feb 2020 01:20:27 +0800</pubDate><description><![CDATA[学习Python第一步，当然是安装运行环境
这里只提供windows版的
[点击进入下载](https://www.python.org/)


选择Windows

选择对应的选项

注意勾上Add Python 3.8 to PATH，然后点“Install Now”即可完成安装



打开命令提示符窗口，敲入python

此时说明已安装成功

...]]></description><category></category></item><item><title><![CDATA[石子合并（一）【区间DP】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82952970</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82952970</guid><author>DNMTOOBA</author><pubDate>Sat, 06 Oct 2018 18:45:51 +0800</pubDate><description><![CDATA[石子合并（一）
时间限制：1000 ms  |  内存限制：65535 KB
难度：3
描述
有N堆石子排成一排，每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆，每次合并花费的代价为这两堆石子的和，经过N-1次合并后成为一堆。求出总的代价最小值。
输入
有多组测试数据，输入到文件结束。
每组测试数据第一行有一个整数n，表示有n堆石子。
接下来的一行有n（...]]></description><category></category></item><item><title><![CDATA[Codeforces Round #508 (Div. 2)  D. Slime【思维】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82503332</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82503332</guid><author>DNMTOOBA</author><pubDate>Tue, 11 Sep 2018 16:30:23 +0800</pubDate><description><![CDATA[D. Slime

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are nn slimes in a row. Each slime has an integer value (possibly ...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2018 南京赛区网络预赛 A. An Olympian Math Problem]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82383496</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82383496</guid><author>DNMTOOBA</author><pubDate>Tue, 04 Sep 2018 21:01:58 +0800</pubDate><description><![CDATA[Alice, a student of grade 66, is thinking about an Olympian Math problem, but she feels so despair that she cries. And her classmate, Bob, has no idea about the problem. Thus he wants you to help him....]]></description><category></category></item><item><title><![CDATA[Codeforces Round #478 (Div. 2)-C. Valhalla Siege【二分】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82351598</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/82351598</guid><author>DNMTOOBA</author><pubDate>Mon, 03 Sep 2018 20:00:51 +0800</pubDate><description><![CDATA[C. Valhalla Siege

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Ivar the Boneless is a great leader. He is trying to capture Ka...]]></description><category></category></item><item><title><![CDATA[Find a multiple 【poj-2356】【抽屉原理】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79582920</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79582920</guid><author>DNMTOOBA</author><pubDate>Fri, 16 Mar 2018 17:21:48 +0800</pubDate><description><![CDATA[Find a multipleTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8657 Accepted: 3745 Special JudgeDescriptionThe input contains N natural (i.e. positive integer) numbers ( N &amp;lt;= 10000 ). Eac...]]></description><category></category></item><item><title><![CDATA[Pie 【hdu-1969】【二分】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79572022</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79572022</guid><author>DNMTOOBA</author><pubDate>Thu, 15 Mar 2018 22:27:14 +0800</pubDate><description><![CDATA[PieTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14949    Accepted Submission(s): 5290Problem DescriptionMy birthday is coming up and traditio...]]></description><category></category></item><item><title><![CDATA[Subsequence 【poj-3061】【二分搜索】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79546977</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79546977</guid><author>DNMTOOBA</author><pubDate>Tue, 13 Mar 2018 22:01:27 +0800</pubDate><description><![CDATA[SubsequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 18363 Accepted: 7852DescriptionA sequence of N positive integers (10 &amp;lt; N &amp;lt; 100 000), each of them less than or equal 10000, a...]]></description><category></category></item><item><title><![CDATA[Rightmost Digit 【hdu-1061】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79534034</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79534034</guid><author>DNMTOOBA</author><pubDate>Mon, 12 Mar 2018 22:23:12 +0800</pubDate><description><![CDATA[Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62844    Accepted Submission(s): 23625Problem DescriptionGiven a positive integer...]]></description><category></category></item><item><title><![CDATA[美素数 【hdu-4548】【素数】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79532646</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79532646</guid><author>DNMTOOBA</author><pubDate>Mon, 12 Mar 2018 21:00:36 +0800</pubDate><description><![CDATA[美素数Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 8606    Accepted Submission(s): 2945Problem Description　　小明对数的研究比较热爱，一谈到数，脑子里就涌现出好多数的问题，今天，小明...]]></description><category></category></item><item><title><![CDATA[分拆素数和 【hdu-2098】【素数】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79528329</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79528329</guid><author>DNMTOOBA</author><pubDate>Mon, 12 Mar 2018 16:02:10 +0800</pubDate><description><![CDATA[分拆素数和Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44817    Accepted Submission(s): 19483Problem Description把一个偶数拆成两个不同素数的和，有几种拆法呢？ Input输入包含一...]]></description><category></category></item><item><title><![CDATA[Train Problem I 【hdu-1022】【栈】]]></title><link>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79459879</link><guid>https://blog.youkuaiyun.com/DNMTOOBA/article/details/79459879</guid><author>DNMTOOBA</author><pubDate>Tue, 06 Mar 2018 16:17:16 +0800</pubDate><description><![CDATA[Train Problem ITime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42802    Accepted Submission(s): 16042Problem DescriptionAs the new term comes, t...]]></description><category></category></item></channel></rss>