<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[kocoro的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/kocoro</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; kocoro]]></copyright><item><title><![CDATA[浙江大学计算机与软件学院2021年考研复试上机]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/129323736</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/129323736</guid><author>kocoro</author><pubDate>Fri, 03 Mar 2023 17:12:20 +0800</pubDate><description><![CDATA[优化的思想是对每次遍历之前进行循环判定，只有最长的木棍max截断后短的那根记为l1，要求max/3+1]]></description><category></category></item><item><title><![CDATA[1080 Graduate Admission 测试点1，2]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/128884783</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/128884783</guid><author>kocoro</author><pubDate>Sat, 04 Feb 2023 19:36:51 +0800</pubDate><description><![CDATA[测试点1，2]]></description><category></category></item><item><title><![CDATA[1001 A+B Format测试点3，5，6，10，11]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/128851606</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/128851606</guid><author>kocoro</author><pubDate>Thu, 02 Feb 2023 15:43:15 +0800</pubDate><description><![CDATA[测试点3，5，6，10，11]]></description><category></category></item><item><title><![CDATA[主机访问域名的过程]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/126078438</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/126078438</guid><author>kocoro</author><pubDate>Sat, 30 Jul 2022 22:34:28 +0800</pubDate><description><![CDATA[访问DNS域名服务器，已知域名服务器IP地址，需要知道域名服务器的MAC地址，主机广播ARP请求分组（目的MAC为全1），域名服务器与主机在一个局域网内，域名服务器收到ARP请求分组以后，对比目的IP是自己的IP地址，就发出一个单拨ARP响应分组，携带了自己的MAC地址。主机收到响应后，以客户机的身份向本地域名服务器发送DNS请求报文，本地域名服务器先是查询有两种方法查询域名对应的IP地址，分别是递归查询和递归与迭代查询，本地域名服务器将查询结果存储在本地缓存中，并返回给主机。查询www的MAC地址。...]]></description><category></category></item><item><title><![CDATA[1074 Reversing Linked List 测试点5、6]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/123178377</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/123178377</guid><author>kocoro</author><pubDate>Mon, 28 Feb 2022 11:24:57 +0800</pubDate><description><![CDATA[测试点5：每k个反转一次，不足k的不反转。错误原因：只有第一组k个反转了，而后的几组都没反转

测试用例：


00100 6 2
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218


输出


12309 2 00100
00100 1 00000
00000 4 33218
33218 3 68237
68237 6 99999
99999 5 -1

测试点6：错误原因：有些节点不在头节点指]]></description><category></category></item><item><title><![CDATA[关键路径、最长路径]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/123167374</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/123167374</guid><author>kocoro</author><pubDate>Sun, 27 Feb 2022 17:43:45 +0800</pubDate><description><![CDATA[测试用例：


6 8
0 1 3
0 2 2
0 3 2
2 3 5
1 4 3
3 5 2
2 5 3
4 5 1

关键路径一定是有向无环图

代码段


#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;iostream&gt;
#include &lt;math.h&gt;
#include &lt;stdio.h&gt;
#include &lt;algorithm&gt;
#include &lt;stdlib.h&gt]]></description><category></category></item><item><title><![CDATA[拓扑排序 c++]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/123165506</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/123165506</guid><author>kocoro</author><pubDate>Sun, 27 Feb 2022 15:57:23 +0800</pubDate><description><![CDATA[#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;iostream&gt;
#include &lt;math.h&gt;
#include &lt;stdio.h&gt;
#include &lt;algorithm&gt;
#include &lt;stdlib.h&gt;
#include &lt;map&gt;
#include &lt;vector&gt;
#include &lt;set&gt;
#include &lt.]]></description><category></category></item><item><title><![CDATA[最长公共子串 字符串hash法]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/123143226</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/123143226</guid><author>kocoro</author><pubDate>Fri, 25 Feb 2022 23:39:46 +0800</pubDate><description><![CDATA[算法笔记P450


#include &lt;cstdio&gt;
#include &lt;cstring&gt;
#include &lt;iostream&gt;
#include &lt;math.h&gt;
#include &lt;stdio.h&gt;
#include &lt;algorithm&gt;
#include &lt;stdlib.h&gt;
#include &lt;map&gt;
#include &lt;vector&gt;
#include &lt;set&gt;
#i]]></description><category></category></item><item><title><![CDATA[素数的判定]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122901959</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122901959</guid><author>kocoro</author><pubDate>Sat, 12 Feb 2022 20:56:32 +0800</pubDate><description><![CDATA[素数：只能被自己或者1整除的正整数，1不属于素数

方法一：


bool isPrime(int n){
	if(n&lt;=1) return false;
	int sqr = (int)sqrt(1.0*n);
	for(int i=2;i&lt;=sqr;i++){
		if(n%i==0) return false;
	}
	return true;
}

方法二：过筛法
...]]></description><category></category></item><item><title><![CDATA[进制转换c++]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122901300</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122901300</guid><author>kocoro</author><pubDate>Sat, 12 Feb 2022 20:27:27 +0800</pubDate><description><![CDATA[十进制的转换


int d[100];
void change10ToOther(int n,int radix)//radix为目标进制
{
    int len =0;
    do{
            d[len++] = n%radix;
            n/=radix;
        }while(n!=0);
}//转换后的逆序存储


转换为十进制


int otherTo10(int n[] ,int radix){ //若输入为顺序的n
    int len = ]]></description><category></category></item><item><title><![CDATA[c++中map的用法]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122802215</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122802215</guid><author>kocoro</author><pubDate>Sun, 06 Feb 2022 22:12:54 +0800</pubDate><description><![CDATA[map简单来说就是实现a到b的映射，可以自定义不同变量类型的映射

头文件:


#include&lt;map&gt;

using namespace std;

1. map的定义

map&lt;typename1,typename2&gt; mp;

注：字符串数组只能用string映射，不能用char数组

2. map访问，与访问数组类似，直接用map[键值]访问，map中所有的键值是唯一的


map&lt;char,int&gt; mp;
mp['c'] = 20;
printf("%d"]]></description><category></category></item><item><title><![CDATA[1075 PAT Judge 测试点四]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122731653</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122731653</guid><author>kocoro</author><pubDate>Fri, 28 Jan 2022 15:07:47 +0800</pubDate><description><![CDATA[测试点四试了很多次

是因为排序问题，把不能输出的和可以输出的记录一起排序，这里修改一下排序算法就ok了

参考了知乎的文章【PAT A1075】PAT Judge（详细解决测试点4！） - 知乎 (zhihu.com)


int full[10]={0};
bool cmp (Student a,Student b){
	if(a.total!=b.total) return a.total&gt;b.total;
	else if(a.fullCount!=b.fullCount) return a.]]></description><category></category></item><item><title><![CDATA[c++中sort函数]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122692328</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122692328</guid><author>kocoro</author><pubDate>Tue, 25 Jan 2022 21:29:19 +0800</pubDate><description><![CDATA[头文件：


#include &lt;algorithm&gt;
using namespace std;

函数：


//sort(数组首地址，数组尾地址+1，比较函数cmp（可省略）)
char a[10];
sort(a,a+10,cmp);

cmp比较函数伪代码


bool cmp(元素A 元素B)
{
    if(A!=B) return A&gt;B //按元素递增次序排序
}

字符串比较函数strcmp


#include &lt;cstring&gt;
strcmp(char ]]></description><category></category></item><item><title><![CDATA[一个数组复制给另一个数组 c++]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122685677</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122685677</guid><author>kocoro</author><pubDate>Tue, 25 Jan 2022 15:07:02 +0800</pubDate><description><![CDATA[#include &lt;cstring&gt;


strcpy(目的数组, 源数组);


]]></description><category></category></item><item><title><![CDATA[输入 空格的陷阱]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122685196</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122685196</guid><author>kocoro</author><pubDate>Tue, 25 Jan 2022 14:57:53 +0800</pubDate><description><![CDATA[不可读入空格


	char a[300];
	
    scanf("%s",a);// 不能输入空格，即到输入到空格即止

可以读入空格


	char a;

	scanf("%c", a)    //可以输入空格,和换行，注意不读入换行和空格时要用getchar()吸收


	char a[300];

	gets(temp);      //可以输入空格，到换行即止
                     //注意 在pat中gets不兼容，要用cin.getline(a,size);



.]]></description><category></category></item><item><title><![CDATA[int与char相互转换 c++]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122648807</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122648807</guid><author>kocoro</author><pubDate>Sun, 23 Jan 2022 13:35:50 +0800</pubDate><description><![CDATA[char -&gt; int


char a= '1';

int b= a - '0'; 

int -&gt; char itoa函数（数字，字符串地址，进制）


#include&lt;iostream&gt;
#include&lt;string&gt;
using namespace std;

int main()
{
	int a = 123;
    char str[100];
    itoa(a, str, 10);
    cout &lt;&lt; str &lt;&lt; e]]></description><category></category></item><item><title><![CDATA[1065 A+B and C (64bit) 溢出问题]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122510198</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122510198</guid><author>kocoro</author><pubDate>Sat, 15 Jan 2022 14:51:57 +0800</pubDate><description><![CDATA[Given three integersA,BandCin( -,), you are supposed to tell whetherA+B&gt;C.



Input Specification:

The first line of the input gives the positive number of test cases, T (≤10). Then T test cases follow, each consists of a single line containing ...]]></description><category></category></item><item><title><![CDATA[1046 Shortest Distance 超时问题]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122503162</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122503162</guid><author>kocoro</author><pubDate>Fri, 14 Jan 2022 22:37:33 +0800</pubDate><description><![CDATA[The task is really simple: givenNexits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.

Input Specification:

Each input file contains one test case. For each case, the first line conta...]]></description><category></category></item><item><title><![CDATA[1042 Shuffling Machine]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122498408</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122498408</guid><author>kocoro</author><pubDate>Fri, 14 Jan 2022 17:09:06 +0800</pubDate><description><![CDATA[dssds

Shuffling is a procedure used to randomize a deck of playing cards. Because standard shuffling techniques are seen as weak, and in order to avoid "inside jobs" where employees collaborate with gamblers by performing inadequate shuffles, many casinos]]></description><category></category></item><item><title><![CDATA[1018 锤子剪刀布 scanf(“%c“,&a)的陷阱]]></title><link>https://blog.youkuaiyun.com/kocoro/article/details/122495049</link><guid>https://blog.youkuaiyun.com/kocoro/article/details/122495049</guid><author>kocoro</author><pubDate>Fri, 14 Jan 2022 15:11:43 +0800</pubDate><description><![CDATA[Pat]]></description><category></category></item></channel></rss>