<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Svring的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Svring</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Svring]]></copyright><item><title><![CDATA[Windows10无法找到wifi解决方法]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/123544093</link><guid>https://blog.youkuaiyun.com/Svring/article/details/123544093</guid><author>Svring</author><pubDate>Thu, 17 Mar 2022 10:35:41 +0800</pubDate><description><![CDATA[这两天windows提示我要自动更新系统了，本来以为不会出问题所以设定电脑关机后自动更新，没想到第二天就就连不上网了，诊断结果显示无线适配器有问题。

解决方法：按下win+R，搜索services.msc，找到windows.updata,右键进属性后把启动类型设为“禁用”，然后重启电脑。

不愧是微软，windows自动更新系统的强大令我大开眼界。
...]]></description><category></category></item><item><title><![CDATA[第五部分（二）：杨辉三角]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121937681</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121937681</guid><author>Svring</author><pubDate>Tue, 14 Dec 2021 19:00:43 +0800</pubDate><description><![CDATA[运行环境：VS2022

实现形式：


#include&lt;stdio.h&gt;
main()
{
	int triangle[31][31];
	int line;
	puts("please input the number of lines you'd like to see:");
	scanf_s("%d", &amp;line);
	//begin initialize
	for (int i = 0; i &lt; 31; i++)
		for (int j = 0; j &lt; 3]]></description><category></category></item><item><title><![CDATA[第五部分（一）：偶数求和]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121884217</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121884217</guid><author>Svring</author><pubDate>Sun, 12 Dec 2021 10:47:58 +0800</pubDate><description><![CDATA[运行环境：VS2022

实现形式：


#include&lt;stdio.h&gt;
#include&lt;stdlib.h&gt;
main()
{
	int n, m, sum = 0;
	float aver;
	int reminder;
	puts("please input the length you'd like to set:");
	scanf_s("%d", &amp;n);
	int* a = (int*)malloc(n * sizeof(int));
	if (a == N]]></description><category></category></item><item><title><![CDATA[算法（六）：快速排序]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121637168</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121637168</guid><author>Svring</author><pubDate>Tue, 30 Nov 2021 16:54:42 +0800</pubDate><description><![CDATA[运行环境：VS2022


void QuickSort(int arr[],int l,int h)
{
	if (l &lt; h)
	{
		int i = l, j = h, x = arr[l];
		while (i &lt; j)
		{
			while (i &lt; j &amp;&amp; arr[j] &gt;= x)
				j--;
			if (i &lt; j)
				arr[i++] = arr[j];

			while (i &lt; j &amp;&amp; arr]]></description><category></category></item><item><title><![CDATA[算法（五）：插入排序]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121607325</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121607325</guid><author>Svring</author><pubDate>Mon, 29 Nov 2021 13:01:53 +0800</pubDate><description><![CDATA[运行环境：VS2022

实现形式：


void InsertSort(int* arr, int len)
{
	int tmp;
	int i;
	int j;
	for (i = 1; i &lt; len; i++)
	{
		tmp = arr[i];
		for (j = i - 1; j &gt;= 0 &amp;&amp; arr[j] &gt; tmp; j--)
		{
			arr[j + 1] = arr[j];
		}
		arr[ j + 1 ] = tmp;
	}
}


.]]></description><category></category></item><item><title><![CDATA[第三部分（五）：分数加减法]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121584936</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121584936</guid><author>Svring</author><pubDate>Sat, 27 Nov 2021 22:31:43 +0800</pubDate><description><![CDATA[2021/11/27


#include&lt;stdio.h&gt;
main()
{
	int a, b, c, d;
	int fm, fz;
	char sign, temp;
	printf("please input a decimal expression,system will return its result:\n");
	scanf_s("%d/%d%c%d/%d", &amp;a, &amp;b, &amp;sign, 2, &amp;c, &amp;d);
	if (sign =]]></description><category></category></item><item><title><![CDATA[第三部分（四）：素数筛子算法]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121575530</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121575530</guid><author>Svring</author><pubDate>Sat, 27 Nov 2021 12:45:02 +0800</pubDate><description><![CDATA[2021/11/27


int is_prime(int a)
{
	for (int i = 2; i * i &lt; a; i++)
	{
		if (a % i == 0)
			return 0;
	}
	return 1;
}

#include&lt;stdio.h&gt;
main()
{
	int n;
	printf("please input a number,system will return the number of primes between 2 and it:\n");]]></description><category></category></item><item><title><![CDATA[c语言编程练习]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121575435</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121575435</guid><author>Svring</author><pubDate>Sat, 27 Nov 2021 12:36:39 +0800</pubDate><description><![CDATA[来自知乎用户的分享，ic翼的博客。

C语言编程超全练习题（一） - ic翼
]]></description><category></category></item><item><title><![CDATA[第三部分（三）：5个数求最值]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121575409</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121575409</guid><author>Svring</author><pubDate>Sat, 27 Nov 2021 12:33:28 +0800</pubDate><description><![CDATA[2021/11/27


#include&lt;stdio.h&gt;
main()
{
	int n; int max = 0, min = 0;
	printf("please input five numbers,system will return the maximum value and the minimum value among them:\n");
	for (int i = 0; i &lt; 5; i++)
	{
		scanf_s("%d", &amp;n);
		if (i =]]></description><category></category></item><item><title><![CDATA[第三部分（二）：公约数和公倍数]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121575285</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121575285</guid><author>Svring</author><pubDate>Sat, 27 Nov 2021 12:21:17 +0800</pubDate><description><![CDATA[2021/11/27


#include &lt;stdio.h&gt;

int main(){
    int a;
    int b;
    int temp;
    int T;
    int a_save;
    int b_save;
    
    scanf("%d",&amp;T);
    
    while(T--){
        scanf("%d%d",&amp;a,&amp;b);
        
        if(a&lt;b){
          ]]></description><category></category></item><item><title><![CDATA[第三部分（一）：最小公倍数]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121575270</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121575270</guid><author>Svring</author><pubDate>Sat, 27 Nov 2021 12:17:45 +0800</pubDate><description><![CDATA[2021/11/27


#include&lt;stdio.h&gt;
main()
{
	int a, b;
	printf("please input two numbers,system will return their greatest common divisor and largest common multiple:\n");
	scanf_s("%d%d", &amp;a, &amp;b);
	printf("greatest common divisor is:%d\n", getGc]]></description><category></category></item><item><title><![CDATA[第二部分（五）：数值统计]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121570442</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121570442</guid><author>Svring</author><pubDate>Fri, 26 Nov 2021 23:11:12 +0800</pubDate><description><![CDATA[2021/11/26


#include&lt;stdio.h&gt;
main()
{
	int n, number; int a = 0, b = 0, c = 0;
	printf("how many numbers you'd like to input:\n");
	scanf_s("%d", &amp;n);
	printf("please input several numbers,system will ruturn the numbers of negative numbers,zero]]></description><category></category></item><item><title><![CDATA[第二部分（四）：ASC排序]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121567188</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121567188</guid><author>Svring</author><pubDate>Fri, 26 Nov 2021 19:38:33 +0800</pubDate><description><![CDATA[2021/11/26


void swap(int* a, int* b)
{
	int temp = *a;
	*a = *b;
	*b = temp;
}

#include&lt;stdio.h&gt;
main()
{
	char a, b, c;
	printf("please input three characters,system will sort them by ASC code size:\n");
	scanf_s("%c %c %c", &amp;a, 2, &amp;b, 2,]]></description><category></category></item><item><title><![CDATA[第二部分（三）：两点距离]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121566937</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121566937</guid><author>Svring</author><pubDate>Fri, 26 Nov 2021 19:20:11 +0800</pubDate><description><![CDATA[2021/11/26


#include&lt;stdio.h&gt;
#include&lt;math.h&gt;
main()
{
	float x1, y1, x2, y2;
	double distance;
	printf("please input the horizontal and vertical coordinates of the first point:\n");
	scanf_s("%f%f", &amp;x1, &amp;y1);
	printf("please input t]]></description><category></category></item><item><title><![CDATA[第二部分（二）：计算球体积]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121566815</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121566815</guid><author>Svring</author><pubDate>Fri, 26 Nov 2021 19:11:28 +0800</pubDate><description><![CDATA[2021/11/26


#include&lt;stdio.h&gt;
#include&lt;math.h&gt;
#define pi 3.14
main()
{
	float r, v;
	printf("please input the radius of the sphere,system will return its volume:\n");
	scanf_s("%f", &amp;r);
	v = 4.0 / 3 * pi * pow(r, 3);
	printf("%.3f\n", v)]]></description><category></category></item><item><title><![CDATA[第二部分（一）：求实数的绝对值]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121566712</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121566712</guid><author>Svring</author><pubDate>Fri, 26 Nov 2021 19:05:03 +0800</pubDate><description><![CDATA[2021/11/26


#include&lt;stdio.h&gt;
main()
{
	float a, b;
	printf("input a real number,system will return its absolute value:\n");
	while (scanf_s("%f", &amp;b) != EOF)
	{
		if (b &lt; 0)
			b = -b;
		printf("%f\n", b);
	}
}


]]></description><category></category></item><item><title><![CDATA[第一部分（五）：成绩转换]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121546778</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121546778</guid><author>Svring</author><pubDate>Thu, 25 Nov 2021 20:29:33 +0800</pubDate><description><![CDATA[2021/11/25

#include &lt;stdio.h&gt;
main()
{
 int grade; char c;
 printf("input your grades:\n");
 scanf_s("%d", &amp;grade);
 if (grade &gt;= 90)
  c = 'A';
 else if (grade &gt;= 80 &amp;&amp; grade &lt; 90)
  c = 'B';
 else...]]></description><category></category></item><item><title><![CDATA[第一部分（二）：兰州烧饼]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121546547</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121546547</guid><author>Svring</author><pubDate>Thu, 25 Nov 2021 20:20:00 +0800</pubDate><description><![CDATA[2021/11/25

#include &lt;stdio.h&gt;
main()
{
 int n, k;
 printf("请输入能同时放入的煎饼数量：\n");
 scanf_s("%d", &amp;k);
 printf("请输入煎饼总数：\n");
 scanf_s("%d", &amp;n);
 int time;
 time = 2 * n / k;
 if (2 * n % k != 0)
  time++;
 prin...]]></description><category></category></item><item><title><![CDATA[第一部分（一）：韩信点兵]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121546454</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121546454</guid><author>Svring</author><pubDate>Thu, 25 Nov 2021 20:15:57 +0800</pubDate><description><![CDATA[2021/11/25

#include &lt;stdio.h&gt;
main()
{
 int a, b, c;
 printf("分别输入三人一排，五人一排，七人一排时，最后一排的人数：\n");
 scanf_s("%d%d%d", &amp;a, &amp;b, &amp;c);
 for (int i = 10; i &lt;= 100; i++)
  if (i % 3 == a &amp;&amp; i % 5 == b &amp;&amp; i % 7...]]></description><category></category></item><item><title><![CDATA[第一部分（四）：第几天？]]></title><link>https://blog.youkuaiyun.com/Svring/article/details/121546235</link><guid>https://blog.youkuaiyun.com/Svring/article/details/121546235</guid><author>Svring</author><pubDate>Thu, 25 Nov 2021 20:08:08 +0800</pubDate><description><![CDATA[2021/11/25

#include&lt;stdio.h&gt;
main()
{
 int month[13];
 month[1] = 31; month[2] = 28; month[3] = 31;
 month[4] = 30; month[5] = 31; month[6] = 30;
 month[7] = 31; month[8] = 31; month[9] = 30;
 month[10] = 31; month[11] = 30; month[12]...]]></description><category></category></item></channel></rss>