<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[decade0625的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/decade0625</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; decade0625]]></copyright><item><title><![CDATA[PTA输出全排列]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/104331023</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/104331023</guid><author>decade0625</author><pubDate>Sat, 15 Feb 2020 17:15:04 +0800</pubDate><description><![CDATA[可以用c++全排列函数next_permutation。。。简单粗暴
#include&lt;iostream&gt;
#include&lt;algorithm&gt;
using namespace std;
int main()
{
    int n;
    cin&gt;&gt;n;
    int a[100];
    for(int i = 1; i &lt;= n;i++)
 ...]]></description><category></category></item><item><title><![CDATA[PTA2.3数列求和加强版]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/104328904</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/104328904</guid><author>decade0625</author><pubDate>Sat, 15 Feb 2020 15:42:11 +0800</pubDate><description><![CDATA[大数加法，找规律
#include&lt;bits/stdc++.h&gt;
using namespace std;
//第n位数上有n个A相加
int main()
{
	char a[100010];
	int flag = 0, A, N;//flag为每次进位
	cin&gt;&gt;A&gt;&gt;N;
	if(N == 0) {cout&lt;&lt;0;return 0；}
	a...]]></description><category></category></item><item><title><![CDATA[拦截导弹（最长降序子序列）]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/104318630</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/104318630</guid><author>decade0625</author><pubDate>Fri, 14 Feb 2020 20:21:32 +0800</pubDate><description><![CDATA[最长降序，dp[i]为以m[i]为降序最后一位的长度，动规，由前面的逐步推出后面的
#include&lt;bits/stdc++.h&gt;
using namespace std;

int main()
{
    int n,i,j;
    int m[30],dp[30]={0};
    scanf("%d",&amp;n);
    for(i=1;i&lt;=n;i++)
   ...]]></description><category></category></item><item><title><![CDATA[NOI1.6-15阶乘和]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/104265927</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/104265927</guid><author>decade0625</author><pubDate>Tue, 11 Feb 2020 17:02:15 +0800</pubDate><description><![CDATA[阶乘是高精度，结果也是高精度。阶乘需要用到高精度乘小整数，结果需要用到高精度加法。
%10000表示数组每位可以存4位数
#include&lt;bits/stdc++.h&gt;
using namespace std;

int main(void)
{
    int n,i,j,x,a[99]={1,1},s[99]={1,1};
    scanf("%d",&amp;n);
    f...]]></description><category></category></item><item><title><![CDATA[NOI1.6-12计算2的N次方]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/104265880</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/104265880</guid><author>decade0625</author><pubDate>Tue, 11 Feb 2020 16:58:17 +0800</pubDate><description><![CDATA[高精度乘2，只需要高精度数每一位都乘2，边乘可以边处理进位，最后逆序输出。
#include&lt;bits/stdc++.h&gt;
using namespace std;

int main(void)
{
    int n,s[100]={1,2},x;
    scanf("%d",&amp;n);
    for(int i=2;i&lt;=n;i++)
    {
        ...]]></description><category></category></item><item><title><![CDATA[NOI1.6-11大整数加法]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/104265797</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/104265797</guid><author>decade0625</author><pubDate>Tue, 11 Feb 2020 16:55:04 +0800</pubDate><description><![CDATA[用数组将大数存入，按加法规则手动模拟加法运算（竖式运算）
#include &lt;bits/stdc++.h&gt;

using namespace std;

int main()
{
    char a[210],b[210];
    int c[210]={0},i,n;
    scanf("%s%s",a,b);
    n=strlen(a);
    n--;
    i=0...]]></description><category></category></item><item><title><![CDATA[全排列小记]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/103349175</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/103349175</guid><author>decade0625</author><pubDate>Mon, 02 Dec 2019 15:21:13 +0800</pubDate><description><![CDATA[学习笔记：
https://blog.youkuaiyun.com/a358463121/article/details/45543879
https://blog.youkuaiyun.com/MsStrbig/article/details/79823555
例题hdu1027
全排列函数用法https://blog.youkuaiyun.com/HowardEmily/article/details/68064377
#inc...]]></description><category></category></item><item><title><![CDATA[递归小集合]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/103347767</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/103347767</guid><author>decade0625</author><pubDate>Mon, 02 Dec 2019 14:23:30 +0800</pubDate><description><![CDATA[Hdu2553N皇后问题
思路：递归逐个去试
#include &lt;bits/stdc++.h&gt;
using namespace std;
int N;
int queenpos[100];
void NQueen(int k)
{
    int i;
    if(k==N){
        for(i=0;i&lt;N;i++)
            cout&lt;&lt;q...]]></description><category></category></item><item><title><![CDATA[百练练习2814拨钟问题（枚举法）]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/103241203</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/103241203</guid><author>decade0625</author><pubDate>Mon, 25 Nov 2019 17:24:25 +0800</pubDate><description><![CDATA[题目链接http://bailian.openjudge.cn/practice/2814/
思路：逐步枚举,暴力。。。
题目本来是这样：
移动    影响的时钟
1         ABDE
2         ABC
3         BCEF
4         ADG
5         BDEFH
6         CFI
7         DEGH
8         GHI
9...]]></description><category></category></item><item><title><![CDATA[NOI 1.11-05:派]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/103121128</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/103121128</guid><author>decade0625</author><pubDate>Mon, 18 Nov 2019 14:00:12 +0800</pubDate><description><![CDATA[经典二分题，适合练手。
题目链接点此
思路：先建一个数组存放各个派的体积值，用最大的派进行二分操作；再进行逐一派体积的检验，看是否符合题意。符合，右区间继续；不符合，往左区间继续。（注意精度问题和浮点数问题）。
#include &lt;bits/stdc++.h&gt;
using namespace std;
#define PI 3.141592653589//圆周率精度需注意。
doubl...]]></description><category></category></item><item><title><![CDATA[HDU2053 switch game]]></title><link>https://blog.youkuaiyun.com/decade0625/article/details/103085433</link><guid>https://blog.youkuaiyun.com/decade0625/article/details/103085433</guid><author>decade0625</author><pubDate>Fri, 15 Nov 2019 15:00:22 +0800</pubDate><description><![CDATA[HDU2053 switch game
题目链接http://acm.hdu.edu.cn/showproblem.php?pid=2053
题意：有n盏灯，在第i次操作中，其数字为i的倍数的灯改变了条件(开到关，关到开)。n次操作完，问第n盏灯的状态。
思路一（会超时）
首先我想到的是逐步操作，第1，2，3…直到n次，但是会超时。。。
#include&lt;bits/stdc++.h&gt;
...]]></description><category></category></item></channel></rss>