<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[QXK_Jack的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/QXK_Jack</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; QXK_Jack]]></copyright><item><title><![CDATA[cuda11.0+pytorch（gpu）版本安装]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/125857104</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/125857104</guid><author>QXK_Jack</author><pubDate>Mon, 18 Jul 2022 18:07:46 +0800</pubDate><description><![CDATA[cuda11.0+pytorch（gpu）版本安装]]></description><category></category></item><item><title><![CDATA[PAT甲级 1014 Waiting in Line]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/125417357</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/125417357</guid><author>QXK_Jack</author><pubDate>Wed, 22 Jun 2022 21:49:35 +0800</pubDate><description><![CDATA[注意：1、审题2、17：00前，即【8：00，17：00）之间到达窗口可以处理，处理完可以超过17：00]]></description><category></category></item><item><title><![CDATA[PHP接收http的post请求]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/122381474</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/122381474</guid><author>QXK_Jack</author><pubDate>Sat, 08 Jan 2022 15:47:20 +0800</pubDate><description><![CDATA[&lt;?php
    $json_params = file_get_contents("php://input");
    $data = json_decode($json_params);
    echo "hello";
    if (strlen($json_params) &gt; 0 )
    {
        echo "yes";  	
        // $myfile = fopen("newfile.txt", "a+") or die("Unable to ope.]]></description><category></category></item><item><title><![CDATA[ajax学习笔记]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/122318155</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/122318155</guid><author>QXK_Jack</author><pubDate>Wed, 05 Jan 2022 10:36:54 +0800</pubDate><description><![CDATA[1、get


&lt;!DOCTYPE html&gt;
&lt;html lang="en"&gt;
    &lt;head&gt;
        &lt;meta charset = "utf-8"&gt;
        &lt;meta name="viewpoint" content="width=device-width,initial-scale=1.0"&gt; 
        &lt;title&gt;Document&lt;/title&gt;    
    &lt;/head]]></description><category></category></item><item><title><![CDATA[问题 H: 包含]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119959405</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119959405</guid><author>QXK_Jack</author><pubDate>Fri, 27 Aug 2021 19:26:47 +0800</pubDate><description><![CDATA[时间限制:1Sec内存限制:128 MB提交状态

题目描述

我们定义A“包含”B的概念是A&amp;B=B，其中&amp;是位运算中的“按位与”。
现在给出一个集合Q，这个集合n个正整数，m次询问。每次询问给出一个数字x，请回答集合Q中是否有一个数字包含x。

输入

第一行输入两个正整数n,m，意义如题面所示。
接下来一行输入n个正整数，描述集合Q中的数字，其中第i个数字为ai。
然后有m行，每行给出一个正整数x，代表询问。

输出

对于每一个询问，输出yes或no表示答案。

样例输入...]]></description><category></category></item><item><title><![CDATA[问题 M: Shorten Diameter]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119776086</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119776086</guid><author>QXK_Jack</author><pubDate>Wed, 18 Aug 2021 11:13:11 +0800</pubDate><description><![CDATA[http://icpc.upc.edu.cn/problem.php?cid=2919&amp;pid=12


#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
vector&lt;int&gt;g[2003];
int cnt;
in]]></description><category></category></item><item><title><![CDATA[【图论】问题 G: 旅行2018]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119775369</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119775369</guid><author>QXK_Jack</author><pubDate>Wed, 18 Aug 2021 10:52:08 +0800</pubDate><description><![CDATA[http://icpc.upc.edu.cn/problem.php?cid=2919&amp;pid=6


#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
int vis[5005];
int n,m;
vector&lt;int.]]></description><category></category></item><item><title><![CDATA[问题 D: Mountain Climbing]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119596521</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119596521</guid><author>QXK_Jack</author><pubDate>Wed, 11 Aug 2021 10:13:18 +0800</pubDate><description><![CDATA[时间限制:1Sec内存限制:64 MB提交状态

题目描述

Farmer John has discovered that his cows produce higher quality milk when they are subject to strenuous exercise. He therefore decides to send his N cows (1 &lt;= N &lt;= 25,000) to climb up and then back down a nearby...]]></description><category></category></item><item><title><![CDATA[【并查集】问题 A: Bovine Alliance]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119578024</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119578024</guid><author>QXK_Jack</author><pubDate>Tue, 10 Aug 2021 20:03:32 +0800</pubDate><description><![CDATA[题目描述

Bessie and her bovine pals from nearby farms have finally decided that they are going to start connecting their farms together by trails in an effort to form an alliance against the farmers. The cows in each of the N (1 &lt;= N
&lt;= 100,000) farms .]]></description><category></category></item><item><title><![CDATA[【线段树+扫描线】]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119378991</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119378991</guid><author>QXK_Jack</author><pubDate>Wed, 04 Aug 2021 10:47:14 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/11257/H
来源：牛客网


#include &lt;stdio.h&gt;
#include &lt;bits/stdc++.h&gt;
#define inf 0x3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
ll n, d;
ll lazy[800500] = {0};
ll min1[800500] = {0};

void push_up(ll.]]></description><category></category></item><item><title><![CDATA[【21牛客多校6：F】思维+构造]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119332097</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119332097</guid><author>QXK_Jack</author><pubDate>Mon, 02 Aug 2021 19:29:41 +0800</pubDate><description><![CDATA[链接：https://ac.nowcoder.com/acm/contest/11257/F
来源：牛客网


【分析】

有n个锅，m个饼

记煎饼的平均时间：ave=SUM(ti)/n

理解k=2的意义，怎么让时间减少。

①考虑极端情况：最充分利用n个锅，所以每个锅要煎ave那么多时间，因为一个饼可以换一次锅，可以考虑样例【40、50、80，最优解是85，不是90】

②但是特殊样例：【40、50、100，最优解就是100，而不是95】为什么呢？因为平均值小于最大的时间t，此时注意，k=2的意思，.]]></description><category></category></item><item><title><![CDATA[【数论】密码——扩展欧几里得]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119320296</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119320296</guid><author>QXK_Jack</author><pubDate>Mon, 02 Aug 2021 10:42:50 +0800</pubDate><description><![CDATA[题目描述

有一个密码箱，0到n-1中的某些整数是它的密码。且满足：如果a和b都是它的密码，那么(a+b)%n也是它的密码(a,b可以相等，%表示整除取余数)，某人试了k次密码，前k-1次都失败了，最后一次成功了。
问：该密码箱最多有多少不同的密码。

输入

第一行两个整数分别表示n，k（1≤k≤250000，k≤n≤1014）。第二行为k个用空格隔开的非负整数，表示每次试的密码。数据保证存在合法解。

输出

输出一行一个数，表示结果。

样例输入Copy


42 5
28 31 10 38 24
.]]></description><category></category></item><item><title><![CDATA[单调栈求 区间长度和区间最大值]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119296197</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119296197</guid><author>QXK_Jack</author><pubDate>Mon, 02 Aug 2021 09:18:30 +0800</pubDate><description><![CDATA[00111000  
    00111010
    00010010
    00000000
    
    00111000
    00222010
    00030020
    00000000


]]></description><category></category></item><item><title><![CDATA[ST表——求区间[l,r]之间的最大值]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119294420</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119294420</guid><author>QXK_Jack</author><pubDate>Sun, 01 Aug 2021 10:56:39 +0800</pubDate><description><![CDATA[讲解
	
	
	板子题

	
#include &lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
int n,m,l,r;
int a[180010];
int maxn[180010][50];
int minn[180010][50];
///  f(i,j)=从ai开始的2^j个数里面
///  maxn[i][j]=[i,i+2^j-1]里面的最大值
int main()
{
    scanf("%d%d",&am..]]></description><category></category></item><item><title><![CDATA[问题 B: Reversible Cards]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119250766</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119250766</guid><author>QXK_Jack</author><pubDate>Fri, 30 Jul 2021 16:28:19 +0800</pubDate><description><![CDATA[时间限制:1Sec内存限制:128 MB

题目描述

We have N cards numbered 1 to N. Each side of each card has a color represented by a positive integer.
One side of Card i has a color ai, and the other side has a color bi.
For each card, you can choose which side shows up....]]></description><category></category></item><item><title><![CDATA[问题 K: 运动会＜__int128＞]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119105590</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119105590</guid><author>QXK_Jack</author><pubDate>Mon, 26 Jul 2021 11:25:33 +0800</pubDate><description><![CDATA[时间限制: 1 Sec 内存限制: 128 MB

题目描述

在一次运会上，有一个比赛项目，共有N个人参加比赛，要将这N个人分组，每组人数不少于K个，问有多少种分组方式？
比如有16个运动员，每组人数不少于5个，共有6种分组方式：
(1) 分一组，为16人；
(2) 分二组，分别为11人、5人；
(3) 分二组，分别为10人、6人；
(4) 分二组，分别为9人、7人；
(5) 分二组，分别为8人、8人；
(6) 分三组，分别为6人、5人、5人。
注意：6+5+5，5+6+5，5+5+6为同一种，只算一种.]]></description><category></category></item><item><title><![CDATA[问题 E: Xor Sum 2]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/119083980</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/119083980</guid><author>QXK_Jack</author><pubDate>Sun, 25 Jul 2021 16:47:43 +0800</pubDate><description><![CDATA[时间限制:1Sec内存限制:128 MB

题目描述

There is an integer sequence A of length N.
Find the number of the pairs of integers l and r (1≤l≤r≤N) that satisfy the following condition:
Alxor Al+1xor … xor Ar=Al+ Al+1+ … + Ar
Here, xor denotes the bitwise exclusiv...]]></description><category></category></item><item><title><![CDATA[问题 A: 联通数]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/118965537</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/118965537</guid><author>QXK_Jack</author><pubDate>Wed, 21 Jul 2021 14:25:10 +0800</pubDate><description><![CDATA[问题 A: 联通数

时间限制:1Sec内存限制:128 MB提交状态

题目描述

数学高手小G最近发现了一种新型的数！
他首先在草稿纸写下任意长度的数字串kkkkkkkkkkk...(1≤k≤9)并在其中间添加加号，且相邻两个加号之间至少含有两个数字k (默认数字串第一个数字前与最后一个数字后也有两个加号)，然后对其进行求和得出一个新的数。像这样得出的数他将其定义为 “k联通数 ” 。
小G对于他的发现感到非常的自豪， 像数字854就能表示为77+777，因此854是7联通数。
小G现在非常...]]></description><category></category></item><item><title><![CDATA[单片机并行口I/O接口扩展]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/118254600</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/118254600</guid><author>QXK_Jack</author><pubDate>Sat, 26 Jun 2021 21:29:19 +0800</pubDate><description><![CDATA[对I/O端口的操作采用外部RAM操作相同的指令：

输出指令

MOVX @DPTR,A
	MOVX @Ri,A
输入指令

MOVX A,@DPTR
	MOVX A,@Ri


1. 8255各个端口的操作




端口地址：  P2.7 ~ P2.0 P0.7 ~ P0.0

PA口地址： 0111 1111 1111 1100B = 7FFCH

PB口地址： 0111 1111 1111 1101B = 7FFDH

PC口地址： 0111 1111 1111 1110...]]></description><category></category></item><item><title><![CDATA[单片机串行接口]]></title><link>https://blog.youkuaiyun.com/QXK_Jack/article/details/118243690</link><guid>https://blog.youkuaiyun.com/QXK_Jack/article/details/118243690</guid><author>QXK_Jack</author><pubDate>Sat, 26 Jun 2021 11:24:16 +0800</pubDate><description><![CDATA[串行口控制寄存器SCON 
 

 



电源控制寄存器PCON 
 

工作方式
         



1. 工作方式0

波特率=fosc/12
	SCON中SM2=0（非多机通讯）
	8位串行数据从RXD输入...]]></description><category></category></item></channel></rss>