<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[gonghangyu的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/gonghangyu</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; gonghangyu]]></copyright><item><title><![CDATA[P1514 [NOIP2010 提高组] 引水入城]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/141720505</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/141720505</guid><author>gonghangyu</author><pubDate>Fri, 30 Aug 2024 16:02:08 +0800</pubDate><description><![CDATA[【代码】P1514 [NOIP2010 提高组] 引水入城。]]></description><category></category></item><item><title><![CDATA[洛谷最水题目 P10290 [CCC 2024 J1] Conveyor Belt Sushi]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/141335970</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/141335970</guid><author>gonghangyu</author><pubDate>Mon, 19 Aug 2024 22:02:45 +0800</pubDate><description><![CDATA[【代码】洛谷最水题目 P10290 [CCC 2024 J1] Conveyor Belt Sushi。]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通题库 第一章 C++语言入门（关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/141335529</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/141335529</guid><author>gonghangyu</author><pubDate>Mon, 19 Aug 2024 21:57:33 +0800</pubDate><description><![CDATA[信息学奥赛一本通第一章题解]]></description><category></category></item><item><title><![CDATA[东方博弈OJ 1002 - 编程求解1+2+3+...+n（求关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140938135</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140938135</guid><author>gonghangyu</author><pubDate>Mon, 05 Aug 2024 22:07:29 +0800</pubDate><description><![CDATA[方法二：首先定义两个整数变量a和s，其中a用于存储从输入读取的整数，s用于存储累加和的结果，初始为0，读取一个整数，并将其赋值给变量a，for循环从1开始，每次迭代增加i的值，直到i等于a为止，每次迭代，将当前的i的值加到s上，实现累加求和，输出，就好了！方法一：首先我们可以根据等差数列的（首项+末项）*项数/2（只针对偶数），所以我们可以用if先来判断n的奇偶性，那么奇数就可以将末项设为n-1，末项就变成了偶数，再在最后加上n，输出，就好了。写作不易，求赞求关！]]></description><category></category></item><item><title><![CDATA[自创c++题目（求关注、点赞、收藏）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140152271</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140152271</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 14:54:59 +0800</pubDate><description><![CDATA[你的朋友提议玩一个游戏：将写有数字的n个纸片放入口袋中，你可以从口袋里抽取4次纸片，每次记下纸片上的数字后都将其放回口袋中。如果这4个数字的和是m，就是你赢，否则就是你的朋友赢。你挑战了好几回，结果一次也没有赢，于是怒而撕破口袋，取出所有纸片，检查自己是否真的有赢的可能性。请你编写一个程序，判断当纸片上所写的数字是k1，k2，…，kn时，是否存在抽取4次和为m的方案。如果存在，输出Yes；Yes（例如4次抽取的结果是1、1、3、5，和就是10）No（不存在和为9的抽取方案）]]></description><category></category></item><item><title><![CDATA[东方博宜OJ 3140 - 避开湖泊（求关注、点赞）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140149863</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140149863</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 13:41:14 +0800</pubDate><description><![CDATA[这样，通过DFS方法能够高效地找出并计算最大的湖泊大小，满足题目要求。]]></description><category></category></item><item><title><![CDATA[洛谷题单 CCF GESP C++ 一级上机题（一）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140149292</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140149292</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 13:16:02 +0800</pubDate><description><![CDATA[1.B3846 [GESP样题 一级] 闰年求和。]]></description><category></category></item><item><title><![CDATA[洛谷 P1816 忠诚 （求关注、点赞）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140147908</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140147908</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 11:37:58 +0800</pubDate><description><![CDATA[这种方法确保每个查询都能在对数时间内完成，即使对于大量的输入数据也能高效处理。]]></description><category></category></item><item><title><![CDATA[洛谷 P3774 [CTSC2017] 最长上升子序列]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140147679</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140147679</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 11:31:12 +0800</pubDate><description><![CDATA[【代码】洛谷 P3774 [CTSC2017] 最长上升子序列。]]></description><category></category></item><item><title><![CDATA[洛谷 P10356 [PA2024] Splatanie ciągów]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140146394</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140146394</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 10:53:48 +0800</pubDate><description><![CDATA[int i,j;for(i=1;i<=len;i++)for(j=2;j*i+1<=len;j++)if(lim>=m)elseswap(l,r);return;for(i=l+1;i<=r;i++)if(mn>=mx)return;for(i=l+1;i<r;i++)int cur=0;for(i=1;i++)]]></description><category></category></item><item><title><![CDATA[东方博宜OJ 1031 - 温度转换 （求点赞、关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140145967</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140145967</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 10:43:16 +0800</pubDate><description><![CDATA[解法一：int c;double f;return 0;解法二：int c;cin>>c;return 0;]]></description><category></category></item><item><title><![CDATA[东方博宜OJ 1030 - 心系南方灾区 （求点赞、关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140145273</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140145273</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 10:31:37 +0800</pubDate><description><![CDATA[计算需要的卡车数量，向上取整。]]></description><category></category></item><item><title><![CDATA[洛谷 P1002 [NOIP2002 普及组] 过河卒 （求点赞、关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140145073</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140145073</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 10:17:37 +0800</pubDate><description><![CDATA[tt int ii;ll f[g][g];ii main(){for(ii i=1;i<=8;i++){for(ii i=2;i<=bx;i++){for(ii j=2;j<=by;j++){continue;return 0;]]></description><category></category></item><item><title><![CDATA[洛谷 P1316 Mivik 写书（求关注、点赞）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140144714</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140144714</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 10:08:23 +0800</pubDate><description><![CDATA[代码int n;ll m;ll ans;y = y >> 1;i < a;++i) {int fa[25];j < x;j < n;++j) {c &= b;if (!c) {++tot;} else {j < x;} else {i <= n;return 0;]]></description><category></category></item><item><title><![CDATA[洛谷 P1315 [NOIP2011 提高组] 观光公交c++（求点赞、关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140144192</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140144192</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 09:56:42 +0800</pubDate><description><![CDATA[/ 更新当前时间为当前时间和站点i的最晚到达时间的最大值。]]></description><category></category></item><item><title><![CDATA[洛谷P1314 [NOIP2011 提高组] 聪明的质监员（求点赞、关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140143708</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140143708</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 09:45:59 +0800</pubDate><description><![CDATA[代码ff c;c = 1;i <= n;i ++) {elseLL res = 0;i <= m;i ++)ff d;d=1;i <= n;i ++)i <= m;i ++)rr = mid;elsereturn 0;]]></description><category></category></item><item><title><![CDATA[洛谷 P8218 【深进1.例1】求区间和（求关注）]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140143236</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140143236</guid><author>gonghangyu</author><pubDate>Wed, 03 Jul 2024 09:33:56 +0800</pubDate><description><![CDATA[代码int n;cin >> n;i <= n;++i) {int m;cin >> m;i <= n;++i) {i < m;++i) {int l, r;return 0;]]></description><category></category></item><item><title><![CDATA[P4202 [NOI2008] 奥运物流（无代码，纯思路）求点赞、关注]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/140129058</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/140129058</guid><author>gonghangyu</author><pubDate>Tue, 02 Jul 2024 15:59:50 +0800</pubDate><description><![CDATA[基站 i 中需要继续运输的物资都 将被运往后继基站 Si，显然一个物流基站的后继基站不能是其本身。整个系统的可靠性与控制基站的可靠性正相关，我们的目标是通过修改物流 系统，即更改某些基站的后继基站，使得控制基站的可靠性 R(1)尽量大。但由于 经费限制，最多只能修改 m 个基站的后继基站，并且，控制基站的后继基站不 可被修改。对于所有的数据，满足 m ≤ N ≤ 60，Ci ≤ 106，0.3 ≤ k < 1，请使用双精度实 数，无需考虑由此带来的误差。SN，即每一个基站的后继基站编号。]]></description><category></category></item><item><title><![CDATA[2060：【例1.1】计算机输出]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/132997507</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/132997507</guid><author>gonghangyu</author><pubDate>Mon, 18 Sep 2023 21:21:19 +0800</pubDate><description><![CDATA[2060：【例1.1】计算机输出。]]></description><category></category></item><item><title><![CDATA[一本通题库 1000：入门测试题目]]></title><link>https://blog.youkuaiyun.com/gonghangyu/article/details/132997428</link><guid>https://blog.youkuaiyun.com/gonghangyu/article/details/132997428</guid><author>gonghangyu</author><pubDate>Mon, 18 Sep 2023 21:20:19 +0800</pubDate><description><![CDATA[时间限制: 1000 ms         内存限制: 32768 KB。提交数: 305743     通过数: 183857。一行，两个用空格隔开的整数。1000：入门测试题目。]]></description><category></category></item></channel></rss>