<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Beyond the Sora]]></title><description><![CDATA[拖延症晚期]]></description><link>https://blog.youkuaiyun.com/blue_skyrim</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; blue_skyrim]]></copyright><item><title><![CDATA[FCN图像分割的mask标签使用transforms.ToTensor问题]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/113561701</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/113561701</guid><author>blue_skyrim</author><pubDate>Tue, 02 Feb 2021 16:13:32 +0800</pubDate><description><![CDATA[最近在用pytorch写FCN时，将损失函数换成了CrossEntropyLoss，出现的问题是在第一个反向传播后，loss一下变成了0，之后再怎么训练loss都是0不再变化。而最初的loss看起来是一个正常的浮点数，很显然网络不可能经过一个epoch就找到了最优解。
经过仔细排查后，发现经过dataloader出来的标签里面的值都为0，正常应该会包含一些[0,calss_num)的整数标签，原来是读取的mask文件经过transforms.ToTensor()方法之后都变成了0，该方法的源码中也写到
be]]></description><category></category></item><item><title><![CDATA[CCF201909-2 小明种苹果（续）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/103458186</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/103458186</guid><author>blue_skyrim</author><pubDate>Mon, 09 Dec 2019 15:05:23 +0800</pubDate><description><![CDATA[好久没做题了，这么简单的题也WA了好几次，最后还是看网上的题解才弄明白问题：注意要有连续苹果的情况，这个时候不能重复计算，而且只有苹果树个数大于2的时候才需要统计E
#include &lt;iostream&gt;
#include &lt;cstring&gt;
using namespace std;
int a[2000],flag[2000];
int main()
{
    int...]]></description><category></category></item><item><title><![CDATA[冬去春来]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/89037164</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/89037164</guid><author>blue_skyrim</author><pubDate>Thu, 04 Apr 2019 23:51:52 +0800</pubDate><description><![CDATA[  今天湖南大学的拟录取名单出来了，我成功考上了湖南大学的硕士研究生，当初选择二战也算有了个满意的回报。正好趁着这个机会总结下这四（五）年的本科生活。
  先说总结，烟台大学本科这四年可以说过的很充实，有许多欢乐的记忆，也有许多痛苦的回忆。现在回想起来，无论是人生的高潮还是低谷，都给予了我莫大的感触，让我在成功、轻松的时候冷静下来，不被喜悦冲昏了头脑，也让我顺利度过最失落的时期。
  在家准备二战...]]></description><category></category></item><item><title><![CDATA[人工智能实现简单的五子棋程序]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/73008648</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/73008648</guid><author>blue_skyrim</author><pubDate>Thu, 04 Apr 2019 22:02:41 +0800</pubDate><description><![CDATA[我这个程序在QQ五子棋上实验了一下，结果是黑棋先手全胜，白棋后手的胜率却惨不忍睹，原因有下： 
1、五子棋的先手是有优势的，所以职业比赛里都会有禁手来实现公平 
2、水平有限，对局面的评估只有一小部分

主要思路就是博弈树，程序向前看一步，对对手可能的走法进行评估，评估的策略主要有两条： 
1、扫描整个棋盘，判断出现了多少个三子成线并且两端未堵的情况，对方每出现一种该情况，评估大幅下降，因为这几乎...]]></description><category></category></item><item><title><![CDATA[OpenGL应用——实现边缘填充算法]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/72731163</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/72731163</guid><author>blue_skyrim</author><pubDate>Thu, 25 May 2017 16:56:04 +0800</pubDate><description><![CDATA[边缘填充的思想：枚举每一条边，对这条边右边的像素进行求补操作，就是有填充则去掉，无填充就进行填充#include <GL/gl.h>
#include <GL/glut.h>
#include <iostream>
#include <cmath>
#include <cstring>
#include <string>
using namespace std;
int x[]= {10,70,70]]></description><category></category></item><item><title><![CDATA[2017年山东省第八届acm省赛总结]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71438775</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71438775</guid><author>blue_skyrim</author><pubDate>Tue, 09 May 2017 10:50:34 +0800</pubDate><description><![CDATA[作为一个即将退役的大三队员，这届省赛对我来说就是最后一次比赛了，同时也是最重要的一次比赛。在去年的省赛中，我们队发挥的不理想，没拿到奖牌，因此今年就是最后的机会，我们队在这一年中也准备了很多，其中也有过放弃，失望等时期，不过好在最后都坚持下来了。其中对我来说，最大的问题就是压力了，因为我是这个小队的队长，这一年中，我总是时不时回想起去年失败的情景，队友们失望的表情我现在都记忆犹新，每次这时我都怀疑]]></description><category></category></item><item><title><![CDATA[山东省第七届ACM省赛题——Fibonacci（二分）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71171194</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71171194</guid><author>blue_skyrim</author><pubDate>Thu, 04 May 2017 15:36:38 +0800</pubDate><description><![CDATA[Problem DescriptionFibonacci numbers are well-known as follow: 
  
Now given an integer N, please find out whether N can be represented as the sum of several Fibonacci numbers in such a way that the su]]></description><category></category></item><item><title><![CDATA[hdu1711——Number Sequence（KMP求位置）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71159665</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71159665</guid><author>blue_skyrim</author><pubDate>Thu, 04 May 2017 11:35:24 +0800</pubDate><description><![CDATA[Problem Description 
Given two sequences of numbers : a[1], a[2], …… , a[N], and b[1], b[2], …… , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K]]></description><category></category></item><item><title><![CDATA[poj3321——Apple Tree（树上树状数组）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71155139</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71155139</guid><author>blue_skyrim</author><pubDate>Wed, 03 May 2017 20:53:40 +0800</pubDate><description><![CDATA[DescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.The tre]]></description><category></category></item><item><title><![CDATA[poj1658——Eva's Problem]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71123727</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71123727</guid><author>blue_skyrim</author><pubDate>Wed, 03 May 2017 15:11:06 +0800</pubDate><description><![CDATA[DescriptionEva的家庭作业里有很多数列填空练习。填空练习的要求是：已知数列的前四项，填出第五项。因为已经知道这些数列只可能是等差或等比数列，她决定写一个程序来完成这些练习。 
Input第一行是数列的数目t（0 <= t <= 20）。以下每行均包含四个整数，表示数列的前四项。约定数列的前五项均为不大于10^5的自然数，等比数列的比值也是自然数。 
Output对输入的每个数列，输出它的]]></description><category></category></item><item><title><![CDATA[poj1664——放苹果（递推）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71123615</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71123615</guid><author>blue_skyrim</author><pubDate>Wed, 03 May 2017 15:02:26 +0800</pubDate><description><![CDATA[Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。 
Input第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。 
Output对输入的每组数据M和N，用一行输出相应的K。 
Sample Input1 
7 3 
Sampl]]></description><category></category></item><item><title><![CDATA[poj1552——Doubles]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71123353</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71123353</guid><author>blue_skyrim</author><pubDate>Wed, 03 May 2017 14:42:10 +0800</pubDate><description><![CDATA[DescriptionAs part of an arithmetic competency program, your students will be given randomly generated lists of from 2 to 15 unique positive integers and asked to determine how many items in each list]]></description><category></category></item><item><title><![CDATA[poj1163——The Triangle（简单dp）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71108831</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71108831</guid><author>blue_skyrim</author><pubDate>Wed, 03 May 2017 11:39:34 +0800</pubDate><description><![CDATA[Description7 
3   8 
8   1   0 
2   7   4   4 
4   5   2   6   5(Figure 1) 
Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at]]></description><category></category></item><item><title><![CDATA[poj2528——Mayor's posters（离散化+区间覆盖）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71107080</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71107080</guid><author>blue_skyrim</author><pubDate>Wed, 03 May 2017 09:46:06 +0800</pubDate><description><![CDATA[DescriptionThe citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has]]></description><category></category></item><item><title><![CDATA[poj3308——Paratroopers（最小割）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71101749</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71101749</guid><author>blue_skyrim</author><pubDate>Tue, 02 May 2017 20:03:14 +0800</pubDate><description><![CDATA[DescriptionIt is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth are informed by their spies that the invaders of Mars wan]]></description><category></category></item><item><title><![CDATA[csu1511——残缺的棋盘（bfs）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71083137</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71083137</guid><author>blue_skyrim</author><pubDate>Tue, 02 May 2017 16:47:50 +0800</pubDate><description><![CDATA[Input 
输入包含不超过10000 组数据。每组数据包含6个整数r1, c1, r2, c2, r3, c3 (1<=r1, c1, r2, c2, r3, c3<=8). 三个格子A, B, C保证各不相同。Output 
对于每组数据，输出测试点编号和最少步数。Sample Input 
1 1 8 7 5 6 
1 1 3 3 2 2 
Sample Output 
Case 1: 7]]></description><category></category></item><item><title><![CDATA[csu1803——2016（数学）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71080821</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71080821</guid><author>blue_skyrim</author><pubDate>Tue, 02 May 2017 14:16:36 +0800</pubDate><description><![CDATA[Description给出正整数 n 和 m，统计满足以下条件的正整数对 (a,b) 的数量： 
    1. 1≤a≤n,1≤b≤m; 
    2. a×b 是 2016 的倍数。 
Input输入包含不超过 30 组数据。 
每组数据包含两个整数 n,m (1≤n,m≤109). 
Output 
对于每组数据，输出一个整数表示满足条件的数量。 
Sample Input 
32 63 
20]]></description><category></category></item><item><title><![CDATA[hdu5917——Wrestling Match（二分图染色）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/71079404</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/71079404</guid><author>blue_skyrim</author><pubDate>Tue, 02 May 2017 11:22:44 +0800</pubDate><description><![CDATA[Problem Description 
Nowadays, at least one wrestling match is held every year in our country. There are a lot of people in the game is “good player”, the rest is “bad player”. Now, Xiao Ming is refere]]></description><category></category></item><item><title><![CDATA[hdu5242——Game（dfs贪心）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/70981297</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/70981297</guid><author>blue_skyrim</author><pubDate>Sat, 29 Apr 2017 17:58:38 +0800</pubDate><description><![CDATA[Problem Description 
It is well known that Keima Katsuragi is The Capturing God because of his exceptional skills and experience in ”capturing” virtual girls in gal games. He is able to play  games sim]]></description><category></category></item><item><title><![CDATA[poj3318——Matrix Multiplication（随机化算法）]]></title><link>https://blog.youkuaiyun.com/blue_skyrim/article/details/70941151</link><guid>https://blog.youkuaiyun.com/blue_skyrim/article/details/70941151</guid><author>blue_skyrim</author><pubDate>Fri, 28 Apr 2017 21:08:41 +0800</pubDate><description><![CDATA[DescriptionYou are given three n × n matrices A, B and C. Does the equation A × B = C hold true?InputThe first line of input contains a positive integer n (n ≤ 500) followed by the the three matrices A]]></description><category></category></item></channel></rss>