<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Mr_Sxd的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Mr_Sxd</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Mr_Sxd]]></copyright><item><title><![CDATA[LC-FDNet: Learned Lossless Image Compression with Frequency Decomposition Network 论文笔记]]></title><link>https://blog.youkuaiyun.com/Mr_Sxd/article/details/128374822</link><guid>https://blog.youkuaiyun.com/Mr_Sxd/article/details/128374822</guid><author>Mr_Sxd</author><pubDate>Mon, 19 Dec 2022 16:58:44 +0800</pubDate><description><![CDATA[学习《LC-FDNet: Learned Lossless Image Compression with Frequency Decomposition Network》这篇论文时记下的笔记，方便自己学习。]]></description><category></category></item><item><title><![CDATA[倒三角形（triangle）]]></title><link>https://blog.youkuaiyun.com/Mr_Sxd/article/details/78719351</link><guid>https://blog.youkuaiyun.com/Mr_Sxd/article/details/78719351</guid><author>Mr_Sxd</author><pubDate>Tue, 05 Dec 2017 13:28:02 +0800</pubDate><description><![CDATA[输入正整数n
#########
 #######
  #####
   ###
    #


这题较为简单，两个镶嵌的循环就可以解决。C++代码如下
#include
using namespace std;
int main()
{
    int i,j,n,t=0;
    cin>>n;
    for(i=0;i
    {
        for(]]></description><category></category></item></channel></rss>