<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[WAE86]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sinat_39085247</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sinat_39085247]]></copyright><item><title><![CDATA[js数组去重]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/78069600</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/78069600</guid><author>sinat_39085247</author><pubDate>Sat, 23 Sep 2017 11:11:57 +0800</pubDate><description><![CDATA[为 Array 对象添加一个去除重复项的方法

示例1


输入

[false, true, undefined, null, NaN, 0, 1, {}, {}, 'a', 'a', NaN]



输出

[false, true, undefined, null, NaN, 0, 1, {}, {}, 'a']
Array.prototype.uniq = fu]]></description><category></category></item><item><title><![CDATA[js中常用函数]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/78069208</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/78069208</guid><author>sinat_39085247</author><pubDate>Sat, 23 Sep 2017 10:30:06 +0800</pubDate><description><![CDATA[1、截取字符串函数
substring（start，end）-- 以索引start开始，end结束，若没有end参数，则从start到最后；
substr（start，length） -- 以索引start开始，往后截取长度为length的字符串，若没有length参数，截取start之后的全部。
slice（start，end）-- 当参数为正时，用法和substring一样。
当参数为]]></description><category></category></item><item><title><![CDATA[常见行内元素和块级元素]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/78068963</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/78068963</guid><author>sinat_39085247</author><pubDate>Sat, 23 Sep 2017 10:00:51 +0800</pubDate><description><![CDATA[常见行内元素和块级元素：
1，行内元素：a,span,strong,b,em,i,label,(img,textarea,button,imput,select)行块级元素，可设置宽高，不换行。
2，块级元素：div,p,pre,h1~h6,ul-li,ol-li,dl-dt-dd,form,body,table,menu.
其中strong/b:字体加粗，strong是逻辑元素，有强调意义]]></description><category></category></item><item><title><![CDATA[个位数统计]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/77316477</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/77316477</guid><author>sinat_39085247</author><pubDate>Thu, 17 Aug 2017 10:56:52 +0800</pubDate><description><![CDATA[个位数统计 (15)




时间限制 1000 ms 内存限制 32768 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)


题目描述
给定一个k位整数N = dk-1*10k-1 + ... + d1*101 + d0 (0ik-1>0)，请编写程序统计每种不同的个位数字出现的次数。例如：给定N = 100311，则有2个0，3个1，和1个3。]]></description><category></category></item><item><title><![CDATA[1.1最大子列和问题]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/77141001</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/77141001</guid><author>sinat_39085247</author><pubDate>Sun, 13 Aug 2017 11:09:18 +0800</pubDate><description><![CDATA[实例1.1 最大子列和问题   (20分)



给定KK个整数组成的序列{ N_1N​1​​, N_2N​2​​,
 ..., N_KN​K​​ }，“连续子列”被定义为{ N_iN​i​​, N_{i+1}N​i+1​​,
 ..., N_jN​j​​ }，其中 1
 \le i \le j \le K1≤i≤j≤K。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定]]></description><category></category></item><item><title><![CDATA[锤子剪刀布]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/77140705</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/77140705</guid><author>sinat_39085247</author><pubDate>Sun, 13 Aug 2017 10:35:36 +0800</pubDate><description><![CDATA[锤子剪刀布 (20)




时间限制 1000 ms 内存限制 32768 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)


题目描述
大家应该都会玩“锤子剪刀布”的游戏：

现给出两人的交锋记录，请统计双方的胜、平、负次数，并且给出双方分别出什么手势的胜算最大。

输入描述:
输入第1行给出正整数N（<=105），即双方交锋的次数。随后N]]></description><category></category></item><item><title><![CDATA[A除以B]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/77040439</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/77040439</guid><author>sinat_39085247</author><pubDate>Thu, 10 Aug 2017 10:46:09 +0800</pubDate><description><![CDATA[A除以B (20)




时间限制 1000 ms 内存限制 32768 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)


题目描述
本题要求计算A/B，其中A是不超过1000位的正整数，B是1位正整数。你需要输出商数Q和余数R，使得A = B * Q + R成立。

输入描述:
输入在1行中依次给出A和B，中间以1空格分隔。


输]]></description><category></category></item><item><title><![CDATA[部分A+B (15)]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/76895694</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/76895694</guid><author>sinat_39085247</author><pubDate>Tue, 08 Aug 2017 12:51:00 +0800</pubDate><description><![CDATA[题目描述
正整数A的“DA（为1位整数）部分”定义为由A中所有DA组成的新整数PA。例如：给定A = 3862767，DA = 6，则A的“6部分”PA是66，因为A中有2个6。



现给定A、DA、B、DB，请编写程序计算PA + PB。


输入描述:
输入在一行中依次给出A、DA、B、DB，中间以空格分隔，其中0 10。



输出描述:
在一行中输出PA + PB的值]]></description><category></category></item><item><title><![CDATA[数字分类]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/76718690</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/76718690</guid><author>sinat_39085247</author><pubDate>Sat, 05 Aug 2017 14:38:11 +0800</pubDate><description><![CDATA[题目描述
给定一系列正整数，请按要求对数字进行分类，并输出以下5个数字：

A1 = 能被5整除的数字中所有偶数的和；

A2 = 将被5除后余1的数字按给出顺序进行交错求和，即计算n1-n2+n3-n4...；

A3 = 被5除后余2的数字的个数；

A4 = 被5除后余3的数字的平均数，精确到小数点后1位；

A5 = 被5除后余4的数字中最大数字。


输入描述:
每个输入包含1]]></description><category></category></item><item><title><![CDATA[PAT+乙1008. 数组元素循环右移问题]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/74999500</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/74999500</guid><author>sinat_39085247</author><pubDate>Tue, 11 Jul 2017 21:47:19 +0800</pubDate><description><![CDATA[#include
#include
int main(void)
{
	int N,M,number;
	int i,j,temp;
	scanf("%d %d",&N,&M);
	int a[N+1];
	for(i=0;i<N;i++){
		scanf("%d",&number);
		a[i]=number;
	}
	for(i=N;i>N-M;i--)
	{			
		temp=a[N-]]></description><category></category></item><item><title><![CDATA[PAT+乙1007. 素数对猜想]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/74998618</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/74998618</guid><author>sinat_39085247</author><pubDate>Tue, 11 Jul 2017 20:33:04 +0800</pubDate><description><![CDATA[#include
#include

int isPrime(int x);
 
int main(void)
{
	int N,i,j=0,t=0;
	scanf("%d",&N);
	int a[N];
	for(i=2;i<N;i++)
	{	
		if(isPrime(i)){
			a[t++]=i;			
		}	
	}
	for(i=0;i<t;i++)
	{
		if(a[i+1]]]></description><category></category></item><item><title><![CDATA[C语言作业-advance4-1-逆序输出]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/74931479</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/74931479</guid><author>sinat_39085247</author><pubDate>Mon, 10 Jul 2017 17:19:34 +0800</pubDate><description><![CDATA[#include   
#include   
  
typedef struct _node {  
    int value;  
    struct _node *next;  
} Node;  
  
int main()  
{  
    Node * head = NULL; 
    Node *p;   
    int number;  
    do {  
     ]]></description><category></category></item><item><title><![CDATA[C语言作业-advance7-1-排序]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/74931014</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/74931014</guid><author>sinat_39085247</author><pubDate>Mon, 10 Jul 2017 16:54:14 +0800</pubDate><description><![CDATA[#include
#include
int main(void)
{
	int *a,n,number;
	int i,j,temp;
	scanf("%d",&n);
	a=(int *)malloc(sizeof(int)*n);	//动态申请存储空间 
	for(i=0;i<n;i++)
	{
		scanf("%d",&number);
		a[i]=number;
	}
	for(i=0]]></description><category></category></item><item><title><![CDATA[PAT+乙1006. 换个格式输出整数]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/74358656</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/74358656</guid><author>sinat_39085247</author><pubDate>Tue, 04 Jul 2017 22:12:22 +0800</pubDate><description><![CDATA[#include
#include 

void printfG(int n)
{
	int i;
	for(i=1;i<=n;i++)
	{
		printf("%d",i);	
	}
}
void printfS(int n)
{
	int i;
	for(i=n;i>0;i--){
		printf("S");
	}
}
void printfB(int n)
{
	int i;
	for(]]></description><category></category></item><item><title><![CDATA[c语言 什么时候需要动态分配内存？]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/74356820</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/74356820</guid><author>sinat_39085247</author><pubDate>Tue, 04 Jul 2017 20:47:44 +0800</pubDate><description><![CDATA[我讲解一下c语言中动态分配内存的函数，可能有些初学c语言的人不免要问了：我们为什么要通过函数来实现动态分配内存呢？系统难道不是会自动分配内存吗？？
既然有人会问这样的问题，那么我在这里好好的讲解一下吧！
首先让我们熟悉一下计算机的内存吧！在计算机的系统中有四个内存区域：
1）栈：在栈里面储存一些我们定义的局部变量以及形参（形式参数）；
2）字符常量区：主要是储存一些字符常量，比如：char]]></description><category></category></item><item><title><![CDATA[PAT+乙1005. 继续(3n+1)猜想]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/74356812</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/74356812</guid><author>sinat_39085247</author><pubDate>Tue, 04 Jul 2017 20:46:23 +0800</pubDate><description><![CDATA[#include
 2 #include
 3 
 4 void sort(int *,int );
 5 int main()
 6 {
 7     int *a;
 8     int n,i,t,j;
 9     scanf("%d",&n);
10     a=(int*)malloc(n*sizeof(int));  // 动态申请数组空间
11     for(i=0;i<n;i+]]></description><category></category></item><item><title><![CDATA[PAT+乙1004.成绩排名]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/73745312</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/73745312</guid><author>sinat_39085247</author><pubDate>Mon, 26 Jun 2017 22:05:25 +0800</pubDate><description><![CDATA[#include
#include
#include
//当要输入和输出三个或以上成员，且各个成员的类型不一定相同。
//如日期，时间，个人信息等应考虑使用结构体 
//结构体数组的定义和初始化
struct student{
	char name[11];
	char num[11];
	int score;
};
struct student test[100];
int main(void)]]></description><category></category></item><item><title><![CDATA[PAT+乙1003.我要通过]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/73692981</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/73692981</guid><author>sinat_39085247</author><pubDate>Sat, 24 Jun 2017 17:35:06 +0800</pubDate><description><![CDATA[#include
#include
#include
int main(void)
{
	int n,i,j;
	int na=0,nb=0,nc=0,flag=1;
	char *p1,*p2;
	scanf("%d",&n);
	char ch[n][100];
	for(i=0;i<n;i++)
	{
		scanf("%s",&ch[i]);
	}
	for(i=0;i<n;i++)
	{]]></description><category></category></item><item><title><![CDATA[strchr函数的用法小总结]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/73692453</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/73692453</guid><author>sinat_39085247</author><pubDate>Sat, 24 Jun 2017 16:14:40 +0800</pubDate><description><![CDATA[#include
#include 
#include
int main(void)
{
	char s[]={"AAPATAA"};
	char *p1,*p2;
	int na,nb,nc;
    p1=strchr(s,'P');   //strchr() 用来查找某字符在字符串中首次出现的位置，其原型为：           
    p2=strchr(s,'T');   // cha]]></description><category></category></item><item><title><![CDATA[PAT+乙1002. 写出这个数]]></title><link>https://blog.youkuaiyun.com/sinat_39085247/article/details/73556121</link><guid>https://blog.youkuaiyun.com/sinat_39085247/article/details/73556121</guid><author>sinat_39085247</author><pubDate>Wed, 21 Jun 2017 22:16:09 +0800</pubDate><description><![CDATA[#include
int main(void)
{
	int x,a;
	int sum=0;
	int cnt=1;
	int t;

	scanf("%d",&x);
	while(x>0){
		a=x%10;//得到个位数 
		x=x/10;//去除个位数 
		sum=sum+a;
	}
	t=sum;
	while(t>9){
		t=t/10;
		cnt=cnt*10;
	}]]></description><category></category></item></channel></rss>