<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Guang_Novak的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Guang_Novak</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Guang_Novak]]></copyright><item><title><![CDATA[VTK环境配置中的一些问题]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/77936278</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/77936278</guid><author>Guang_Novak</author><pubDate>Mon, 11 Sep 2017 18:25:04 +0800</pubDate><description><![CDATA[vtk环境配置中遇到的缺少.lib文件的解决方案]]></description><category></category></item><item><title><![CDATA[2017暑期工程训练day1_leetcode2_Add Two Numbers]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/74279185</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/74279185</guid><author>Guang_Novak</author><pubDate>Tue, 04 Jul 2017 00:52:18 +0800</pubDate><description><![CDATA[LeetCode 2.Add Two Numbers
You are given two non-empty linked
 lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Ad]]></description><category></category></item><item><title><![CDATA[2017暑期工程训练day1_leetcode206_Reverse Linked List]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/74279167</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/74279167</guid><author>Guang_Novak</author><pubDate>Tue, 04 Jul 2017 00:50:17 +0800</pubDate><description><![CDATA[LeetCode206.Reverse Linked List
Reverse a singly linked list.
Hint:
A linked list can be reversed either iteratively or recursively. Could you implement both?
题目描述
给出一个链表，输出反转链表。代码中给出了链表节点的构造函数
]]></description><category></category></item><item><title><![CDATA[2017年暑期工程训练day1_leetcode_Two Sum]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/74216999</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/74216999</guid><author>Guang_Novak</author><pubDate>Mon, 03 Jul 2017 17:11:27 +0800</pubDate><description><![CDATA[leetCode编程题目Two sum的javascript实现]]></description><category></category></item><item><title><![CDATA[磁盘调度算法模拟]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/61960427</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/61960427</guid><author>Guang_Novak</author><pubDate>Tue, 14 Mar 2017 00:40:32 +0800</pubDate><description><![CDATA[2017年3月 操作系统课程设计作品：磁盘调度算法模拟

目的：了解磁盘管理的原理，掌握磁盘调度种算法。
设计要求：编程序实现下述磁盘调度算法，并求出每种算法的平均寻道长度：要求设计主界面可以灵活选择算法，且以下算法都要实现。
（1）     先来先服务算法（FCFS）
（2）     最短寻道时间优先算法（SSTF）
（3）     扫描算法（SCAN）
（4）     循环扫描算]]></description><category></category></item><item><title><![CDATA[POJ1061青蛙的约会]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52529304</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52529304</guid><author>Guang_Novak</author><pubDate>Tue, 13 Sep 2016 20:41:43 +0800</pubDate><description><![CDATA[青蛙的约会




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 107883
 
Accepted: 21571




Description

两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰]]></description><category></category></item><item><title><![CDATA[POJ1061青蛙的约会（扩展欧几里得）]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52529059</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52529059</guid><author>Guang_Novak</author><pubDate>Tue, 13 Sep 2016 20:14:15 +0800</pubDate><description><![CDATA[青蛙的约会




Time Limit: 1000MS
 
Memory Limit: 10000K


Total Submissions: 107883
 
Accepted: 21571




Description

两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰]]></description><category></category></item><item><title><![CDATA[POJ2478 Farey Sequence]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52507045</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52507045</guid><author>Guang_Novak</author><pubDate>Sun, 11 Sep 2016 22:32:00 +0800</pubDate><description><![CDATA[Farey Sequence




Time Limit: 1000MS
 
Memory Limit: 65536K


Total Submissions: 15250
 
Accepted: 6058




Description

The Farey Sequence Fn for any integer n with n >= 2 is the ]]></description><category></category></item><item><title><![CDATA[湖南省第十二届大学生程序设计竞赛A题 2016 （csuoj1803）]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52433004</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52433004</guid><author>Guang_Novak</author><pubDate>Sun, 04 Sep 2016 16:20:39 +0800</pubDate><description><![CDATA[这道题应该是省赛中最简单的题了，但是对弱新来说感觉其实还是很难找到正确的思路。

主要就是把n,m取余，然后做2016X2016的枚举。
AC代码如下：


#include 

using namespace std;
typedef long long LL;
const int mod=2016;
int c[mod+5],d[mod+5];
int main()
{]]></description><category></category></item><item><title><![CDATA[2016暑期训练4C-PrimePath（POJ3126）]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52082566</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52082566</guid><author>Guang_Novak</author><pubDate>Mon, 01 Aug 2016 08:15:52 +0800</pubDate><description><![CDATA[C - Prime Path
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%lld
 & %llu
Submit Status Practice POJ
 3126





Description

The ministers of the cabinet were quite upset ]]></description><category></category></item><item><title><![CDATA[暑期训练赛3F题（HDU4355）]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52076880</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52076880</guid><author>Guang_Novak</author><pubDate>Sun, 31 Jul 2016 08:50:24 +0800</pubDate><description><![CDATA[Party All the Time
Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5260    Accepted Submission(s): 1624



Problem Description

In the ]]></description><category></category></item><item><title><![CDATA[暑期集训训练3练习题B - Toxophily（HDU2298）]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52076845</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52076845</guid><author>Guang_Novak</author><pubDate>Sun, 31 Jul 2016 08:46:37 +0800</pubDate><description><![CDATA[这道题主要是需要推两个公式：
水平方向上：v*cos(a)*t=x;
竖直方向上：v*sin(a)*t-g*t*t/2.0=y;
得到：y=x*tan(a)-g*x*x/(v*v*cos(a)cos(a)*2.0);
可以证明这个y是随着角度a呈凹曲线变化的，虽然我也不知道怎么证明。
所以我的代码如下：]]></description><category></category></item><item><title><![CDATA[暑期集训训练赛2（uva11210） 你会打麻将吗？]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/52076831</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/52076831</guid><author>Guang_Novak</author><pubDate>Sun, 31 Jul 2016 08:35:29 +0800</pubDate><description><![CDATA[麻将的公式是：mABC+nDDD+EE,所以要胡牌的话就把”听张“加到牌里去，然后dfs这三种情况看是否能成立
#include 
#include 
#include 
#include 
#include 


const char *MJ[]={"0","1T", "2T", "3T", "4T", "5T", "6T", "7T", "8T", "9T",
    "1S]]></description><category></category></item><item><title><![CDATA[暑期集训Day2训练赛D题Spreadsheets（codeforces 1B）]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/51982039</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/51982039</guid><author>Guang_Novak</author><pubDate>Thu, 21 Jul 2016 13:43:31 +0800</pubDate><description><![CDATA[应该是一道比较简单的模拟题，然而弱菜如我纠结于1WA好久。最终找到的错误竟是不久前犯过的错误，所以，数字转字符时模26是一定考虑”Z“这个特殊情况的。
#include 
#include 
#include 
using namespace std;


int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		string str;]]></description><category></category></item><item><title><![CDATA[zoj1242——Carbon Dating]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/50791355</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/50791355</guid><author>Guang_Novak</author><pubDate>Thu, 03 Mar 2016 20:21:21 +0800</pubDate><description><![CDATA[很简单的模拟题，纯数学运算
题目大意就是考古学上根据C12这种同位素的衰减速率来推断一些化石的年代。需要我们通过编程根据carbon的数量w和检测到的衰减速率d来估算产生的年代]]></description><category></category></item><item><title><![CDATA[从今天开始]]></title><link>https://blog.youkuaiyun.com/Guang_Novak/article/details/50761987</link><guid>https://blog.youkuaiyun.com/Guang_Novak/article/details/50761987</guid><author>Guang_Novak</author><pubDate>Sun, 28 Feb 2016 21:49:43 +0800</pubDate><description><![CDATA[寒假小结
       2016年2月28日，早上5点半火车到达长沙站。不知不觉中就在这个城市生活了一年多的时间，和以前孑然一身来到这里升起的无名落寞不同，可能是多了一些认同感和归属感的缘故，渐渐失去了那种背井离乡的感觉。
       假期里给自己下达了很多任务，回头来看当初真的是太贪心了，一方面想要和久未谋面的小伙伴团聚，一方面又想要在学习方面做很多事情，最终却是“欲速不达”。最终的结果并]]></description><category></category></item></channel></rss>