<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[LOUTINI的博客]]></title><description><![CDATA[okok]]></description><link>https://blog.youkuaiyun.com/LOUTINI</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LOUTINI]]></copyright><item><title><![CDATA[准确率与召回率]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/114365876</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/114365876</guid><author>LOUTINI</author><pubDate>Thu, 04 Mar 2021 13:04:06 +0800</pubDate><description><![CDATA[准确率：已预测标签的正确率
召回率·：目标标签的预测正确率

]]></description><category></category></item><item><title><![CDATA[UnrealEngine4 蓝图与C++函数相互调用]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/104230306</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/104230306</guid><author>LOUTINI</author><pubDate>Sun, 09 Feb 2020 00:13:40 +0800</pubDate><description><![CDATA[C++公开给蓝图

UFUNCTION(BlueprintCallable, Category = "MyCppFunc")
		void MyFunc();


C++调用蓝图(在头文件声明，蓝图内实现即可，无需在cpp文件实现)

UFUNCTION(BlueprintImplementableEvent, Category = "MyBPFunc")
		void BPFunc();


...]]></description><category></category></item><item><title><![CDATA[FLAGS寄存器 标志寄存器 英文全称 方便记忆]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/103744714</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/103744714</guid><author>LOUTINI</author><pubDate>Sat, 28 Dec 2019 15:11:28 +0800</pubDate><description><![CDATA[寄存器简称
全称
＝１
＝０
详解




CF
Carry Flag（进位标志）
进位
无进位
用于反映运算是否产生进位或借位。如果运算结果的最高位产生一个进位或借位，则CF置1，否则置0。运算结果的最高位包括字操作的第15位和字节操作的第7位。移位指令也会将操作数的最高位或最低位移入CF。


PF
Parity Flag（奇偶标志）
偶
奇
用于反映运算结果低8位中“1”的个数。“1...]]></description><category></category></item><item><title><![CDATA[HDU - 2021 发工资咯]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/89227007</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/89227007</guid><author>LOUTINI</author><pubDate>Fri, 12 Apr 2019 10:27:28 +0800</pubDate><description><![CDATA[#include"stdio.h"
int good(int a[],int n,int count)
{
	int i，j, k ,u;
	int b[6]={100,50,10,5,2,1,}; /*面值*/
	count=0;
	for(i=0;i&lt;n;i++){
	for(j=0;j&lt;6;j++){
		k=a[i]/b[j];
		count+=k;
		u=a[i]%b[j...]]></description><category></category></item><item><title><![CDATA[UVA - 201 Squares]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81260568</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81260568</guid><author>LOUTINI</author><pubDate>Sat, 28 Jul 2018 14:17:08 +0800</pubDate><description><![CDATA[UVA - 201 Squares

（1）把每相邻两点之间插入一个坐标表示边做一个2*n-1的map 
（2）点之间的边用‘1’表示连接



#include&quot;stdio.h&quot;
#include&quot;iostream&quot;
#include&quot;algorithm&quot;
#include&quot;string.h&quot;
using namespace std;
char map[18][18];
int n, m;
bo...]]></description><category></category></item><item><title><![CDATA[UVA - 1589 Xiangqi]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81255021</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81255021</guid><author>LOUTINI</author><pubDate>Fri, 27 Jul 2018 22:14:25 +0800</pubDate><description><![CDATA[UVA - 1589 Xiangqi



#include&quot;iostream&quot;
#include&quot;algorithm&quot;
using namespace std;
char map[10][11];
struct red {
    char name;
    int x, y;
}r[8];
int n;
int num(int a,int b,char c,int dim)//计算两个同行或...]]></description><category></category></item><item><title><![CDATA[UVA - 133 The Dole Queue]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81235933</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81235933</guid><author>LOUTINI</author><pubDate>Fri, 27 Jul 2018 13:49:50 +0800</pubDate><description><![CDATA[



UVA - 133 The Dole Queu



#include&amp;amp;amp;quot;stdio.h&amp;amp;amp;quot;
#include&amp;amp;amp;quot;iostream&amp;amp;amp;quot;
#include&amp;amp;amp;quot;algorithm&amp;amp;amp;quot;
#include&amp;amp;amp;quot;string.h&amp;amp;amp;quot;
#include&amp;]]></description><category></category></item><item><title><![CDATA[UVA - 10340 All in All]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81218479</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81218479</guid><author>LOUTINI</author><pubDate>Thu, 26 Jul 2018 13:30:05 +0800</pubDate><description><![CDATA[UVA - 10340 All in All



#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;iostream&amp;amp;quot;
#include&amp;amp;quot;string.h&amp;amp;quot;
#include&amp;amp;quot;string&amp;amp;quot;
using namespace std;
int main()
{
    string t, s;
  ]]></description><category></category></item><item><title><![CDATA[UVA - 202 Repeating Decimals]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81211659</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81211659</guid><author>LOUTINI</author><pubDate>Wed, 25 Jul 2018 22:46:43 +0800</pubDate><description><![CDATA[UVA - 202 Repeating Decimals(https://vjudge.net/problem/UVA-202)

#include&amp;amp;quot;cstdio&amp;amp;quot;
#include&amp;amp;quot;string.h&amp;amp;quot;
int th[3005];
int ans[3005];
int main()
{
    int a, b;
    while (scanf(&amp;amp;quot;%d%d&amp;amp;qu]]></description><category></category></item><item><title><![CDATA[UVA - 1368 DNA Consensus String]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81207604</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81207604</guid><author>LOUTINI</author><pubDate>Wed, 25 Jul 2018 18:04:38 +0800</pubDate><description><![CDATA[UVA - 1368 DNA Consensus String 



#include&amp;amp;quot;cstdio&amp;amp;quot;
#include&amp;amp;quot;string.h&amp;amp;quot;
int m, n;
int sum;
char map[50][1000];
int cnt[4][1000];
char alp[] = { 'A','C','G','T' };
int main()
{
    int t; scanf(&amp;amp;qu]]></description><category></category></item><item><title><![CDATA[UVA - 232 Crossword Answers]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81204813</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81204813</guid><author>LOUTINI</author><pubDate>Wed, 25 Jul 2018 16:07:37 +0800</pubDate><description><![CDATA[UVA232 Crossword Answers

#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;string.h&amp;amp;quot;
char map[10][10];
int flag[10][10];
int h, w;
int times;
void input()
{
    getchar();
    for (int i = 0; i &amp;amp;amp;lt; h; ++i)
    {
 ]]></description><category></category></item><item><title><![CDATA[UVA - 1586 Molar mass]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81187218</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81187218</guid><author>LOUTINI</author><pubDate>Tue, 24 Jul 2018 16:28:22 +0800</pubDate><description><![CDATA[UVA 1586



#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;ctype.h&amp;amp;quot;
#include&amp;amp;quot;string.h&amp;amp;quot;
double sum;
int len;
char s[85];
void su(char c,int d)
{
    if (c == 'C')sum += 12.01*d;
    if (c == 'H')sum ]]></description><category></category></item><item><title><![CDATA[POJ - 2251 Dungeon Master]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81152699</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81152699</guid><author>LOUTINI</author><pubDate>Sun, 22 Jul 2018 10:55:26 +0800</pubDate><description><![CDATA[BFS

#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;queue&amp;amp;quot;
using namespace std;
int i, j, k;
char map[31][31][31];
int dir[6][3]=
{
    {1,0,0},{0,1,0},{0,0,1},
    {-1,0,0},{0,-1,0},{0,0,-1}
};
int si, sj, sk;
int L, R,...]]></description><category></category></item><item><title><![CDATA[HDU - 3506 Monkey Party]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81072359</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81072359</guid><author>LOUTINI</author><pubDate>Mon, 16 Jul 2018 21:56:34 +0800</pubDate><description><![CDATA[HDU 3506

#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;string&amp;amp;quot;
#include&amp;amp;quot;algorithm&amp;amp;quot;
using namespace std;
#define INF 99999999
int dp[2001][2001];
int s[2001][2001];
int mk[2001];
unsigned long long]]></description><category></category></item><item><title><![CDATA[HDU - 1312 Red and Black]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81057736</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81057736</guid><author>LOUTINI</author><pubDate>Sun, 15 Jul 2018 22:08:45 +0800</pubDate><description><![CDATA[#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;queue&amp;amp;quot;
#include&amp;amp;quot;stdlib.h&amp;amp;quot;
using namespace std;
int dir[4][2] = { 0,1,0,-1,-1,0,1,0 };
char map[20][20]; 
int W, H,num;
struct node { int x, y; };
#defi]]></description><category></category></item><item><title><![CDATA[取二进制数中特定第几的位置]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/81052744</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/81052744</guid><author>LOUTINI</author><pubDate>Sun, 15 Jul 2018 14:23:18 +0800</pubDate><description><![CDATA[给定一个数a，如果想取这个数的第b位，怎么做？



假如要取第3位，一个很简单的方法。

1.首先把1往左移3位：（1的二进制是1）

int c=1&amp;amp;amp;lt;&amp;amp;amp;lt;3;//此时c的二进制为1000，是1左移三位的结果，c=8

2.然后把c和a作与运算，所得结果就能告诉你答案（假设a=10，那么a的二进制就是1010）

int d=a&amp;amp;amp;amp;c;//1010&amp;amp;amp;amp;1000=1000，那...]]></description><category></category></item><item><title><![CDATA[HDU - 1262 寻找素数对]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/80379689</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/80379689</guid><author>LOUTINI</author><pubDate>Sun, 20 May 2018 08:17:37 +0800</pubDate><description><![CDATA[把输入的数n除以2然后用i从n/2到1遍历，满足条件i和n-i是素数就好，提前打个表

#include&amp;amp;amp;quot;bits/stdc++.h&amp;amp;amp;quot;
using namespace std;
int i,j;
char isp[10005];
void prime()
{
    memset(isp,'Y',sizeof(isp));
    isp[0]=isp[1]='N';
    for(i=2;i&amp;amp;amp;amp;...]]></description><category></category></item><item><title><![CDATA[无穷大的安全初始化]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/79947350</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/79947350</guid><author>LOUTINI</author><pubDate>Sun, 15 Apr 2018 10:51:16 +0800</pubDate><description><![CDATA[如果问题中各数据的范围明确，那么无穷大的设定不是问题，在不明确的情况下，很多程序员都取0x7fffffff作为无穷大，因为这是32-bit int的最大值。如果这个无穷大只用于一般的比较（比如求最小值时min变量的初值），那么0x7fffffff确实是一个完美的选择，但是在更多的情况下，0x7fffffff并不是一个好的选择。

很多时候我们并不只是单纯拿无穷大来作比较，而是会运算后再做比较，例如...]]></description><category></category></item><item><title><![CDATA[HDU - 1004 Let the Balloon Rise]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/79622634</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/79622634</guid><author>LOUTINI</author><pubDate>Tue, 20 Mar 2018 11:04:33 +0800</pubDate><description><![CDATA[//注意，这样写出来的代码，flag数组里面的数量要比实际字符串数量少一，但对此答案无影响，需要的时候加一个一即可

#include&amp;amp;quot;iostream&amp;amp;quot;
#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;string.h&amp;amp;quot;
using namespace std;
int max(int flag[1050],int N)
{
    int i;]]></description><category></category></item><item><title><![CDATA[HDU - 1002 A + B Problem II]]></title><link>https://blog.youkuaiyun.com/LOUTINI/article/details/79614104</link><guid>https://blog.youkuaiyun.com/LOUTINI/article/details/79614104</guid><author>LOUTINI</author><pubDate>Mon, 19 Mar 2018 16:57:30 +0800</pubDate><description><![CDATA[#include&amp;amp;quot;iostream&amp;amp;quot;
#include&amp;amp;quot;stdio.h&amp;amp;quot;
#include&amp;amp;quot;string.h&amp;amp;quot;
using namespace std;
int max(int a,int b);
void result_and_print(int c[1050],int d[1050], int max_ab, int T);
void sums(ch]]></description><category></category></item></channel></rss>