<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wyj_2016的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wyj_2016</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wyj_2016]]></copyright><item><title><![CDATA[异步FIFO设计(非常详细，图文并茂，值得一看！）]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78469272</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78469272</guid><author>wyj_2016</author><pubDate>Tue, 07 Nov 2017 16:27:00 +0800</pubDate><description><![CDATA[原文地址：https://www.toutiao.com/a6329245604338450690/


本文由EETOP论坛帖子编辑修改而来
作者：ThinkSpark
原文：//bbs.eetop.cn/thread-308169-1-1.html
一、概述
在大规模ASIC或FPGA设计中，多时钟系统往往是不可避免的，这样就产生了不同时钟域数据传输的问题，其中一个比较好的解决方]]></description><category></category></item><item><title><![CDATA[HDU1205]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059692</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059692</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:53:05 +0800</pubDate><description><![CDATA[吃糖果



Problem Description
HOHO，终于从Speakless手上赢走了所有的糖果，是Gardon吃糖果时有个特殊的癖好，就是不喜欢将一样的糖果放在一起吃，喜欢先吃一种，下一次吃另一种，这样；可是Gardon不知道是否存在一种吃糖果的顺序使得他能把所有糖果都吃完？请你写个程序帮忙计算一下。

 

Input
第一行有一个整数T，接下来T组数据，每组数]]></description><category></category></item><item><title><![CDATA[HDU1202]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059682</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059682</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:52:12 +0800</pubDate><description><![CDATA[The calculation of GPA



Problem Description
每学期的期末，大家都会忙于计算自己的平均成绩，这个成绩对于评奖学金是直接有关的。国外大学都是计算GPA(grade point average) 又称GPR(grade point ratio)，即成绩点数与学分的加权平均值来代表一个学生的成绩的。那么如何来计算GPA呢？


一般大学采用之]]></description><category></category></item><item><title><![CDATA[HDU1201]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059659</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059659</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:50:26 +0800</pubDate><description><![CDATA[18岁生日



Problem Description
Gardon的18岁生日就要到了，他当然很开心，可是他突然想到一个问题，是不是每个人从出生开始，到达18岁生日时所经过的天数都是一样的呢？似乎并不全都是这样，所以他想请你帮忙计算一下他和他的几个朋友从出生到达18岁生日所经过的总天数，让他好来比较一下。

 

Input
一个数T，后面T行每行有一个日期，格式是YYYY]]></description><category></category></item><item><title><![CDATA[HDU1197]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059653</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059653</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:49:51 +0800</pubDate><description><![CDATA[Specialized Four-Digit Numbers



Problem Description
Find and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits ]]></description><category></category></item><item><title><![CDATA[HDU1196]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059625</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059625</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:47:53 +0800</pubDate><description><![CDATA[Lowest Bit
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12623    Accepted Submission(s): 9203


Problem Description
Given an positive ]]></description><category></category></item><item><title><![CDATA[HDU1194]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059609</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059609</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:47:03 +0800</pubDate><description><![CDATA[Beat the Spread!



Problem Description
Superbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions, the local hackers have organize]]></description><category></category></item><item><title><![CDATA[HDU1170]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059594</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059594</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:46:03 +0800</pubDate><description><![CDATA[Balloon Comes!



Problem Description
The contest starts now! How excited it is to see balloons floating around. You, one of the best programmers in HDU, can get a very beautiful balloon if only ]]></description><category></category></item><item><title><![CDATA[HDU1164]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059575</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059575</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:44:43 +0800</pubDate><description><![CDATA[Eddy's research I



Problem Description
Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime]]></description><category></category></item><item><title><![CDATA[HDU1163]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059550</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059550</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:43:17 +0800</pubDate><description><![CDATA[Eddy's digital Roots



Problem Description
The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the d]]></description><category></category></item><item><title><![CDATA[HDU1157]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059530</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059530</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:42:03 +0800</pubDate><description><![CDATA[Who's in the Middle



Problem Description
FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more tha]]></description><category></category></item><item><title><![CDATA[HDU1108]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78059508</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78059508</guid><author>wyj_2016</author><pubDate>Fri, 22 Sep 2017 09:40:28 +0800</pubDate><description><![CDATA[最小公倍数



Problem Description
给定两个正整数，计算这两个数的最小公倍数。
 

Input
输入包含多组测试数据，每组只有一行，包括两个不大于1000的正整数.
 

Output
对于每个测试用例，给出这两个数的最小公倍数，每个实例输出一行。

 

Sample Input

10 14

 

Sample Outpu]]></description><category></category></item><item><title><![CDATA[HDU1106]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048496</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048496</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 10:01:16 +0800</pubDate><description><![CDATA[排序



Problem Description
输入一行数字，如果我们把这行数字中的‘5’都看成空格，那么就得到一行用空格分割的若干非负整数（可能有些整数以‘0’开头，这些头部的‘0’应该被忽略掉，除非这个整数就是由若干个‘0’组成的，这时这个整数就是0）。

你的任务是：对这些分割得到的整数，依从小到大的顺序排序输出。


 

Input
输入包含多组测试用例，每]]></description><category></category></item><item><title><![CDATA[HDU1098]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048460</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048460</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 09:59:25 +0800</pubDate><description><![CDATA[Ignatius's puzzle


Problem Description
Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5*x^13+13*x^5+k*a*x,in]]></description><category></category></item><item><title><![CDATA[HDU1097]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048422</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048422</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 09:57:44 +0800</pubDate><description><![CDATA[A hard puzzle



Problem Description
lcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem]]></description><category></category></item><item><title><![CDATA[HDU1096]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048403</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048403</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 09:56:46 +0800</pubDate><description><![CDATA[A+B for Input-Output Practice (VIII)



Problem Description
Your task is to calculate the sum of some integers.

 

Input
Input contains an integer N in the first line, and then N lines foll]]></description><category></category></item><item><title><![CDATA[HDU1095]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048380</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048380</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 09:55:32 +0800</pubDate><description><![CDATA[A+B for Input-Output Practice (VII)



Problem Description
Your task is to Calculate a + b.

 

Input
The input will consist of a series of pairs of integers a and b, separated by a space, o]]></description><category></category></item><item><title><![CDATA[HDU1094]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048354</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048354</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 09:54:21 +0800</pubDate><description><![CDATA[A+B for Input-Output Practice (VI)



Problem Description
Your task is to calculate the sum of some integers.

 

Input
Input contains multiple test cases, and one case one line. Each case s]]></description><category></category></item><item><title><![CDATA[HDU1093]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048332</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048332</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 09:52:59 +0800</pubDate><description><![CDATA[A+B for Input-Output Practice (V)



Problem Description
Your task is to calculate the sum of some integers.

 

Input
Input contains an integer N in the first line, and then N lines follow.]]></description><category></category></item><item><title><![CDATA[HDU1092]]></title><link>https://blog.youkuaiyun.com/wyj_2016/article/details/78048316</link><guid>https://blog.youkuaiyun.com/wyj_2016/article/details/78048316</guid><author>wyj_2016</author><pubDate>Thu, 21 Sep 2017 09:51:28 +0800</pubDate><description><![CDATA[A+B for Input-Output Practice (IV)


Problem Description
Your task is to Calculate the sum of some integers.

 

Input
Input contains multiple test cases. Each test case contains a integer N,]]></description><category></category></item></channel></rss>