<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ilovebinary的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ilovebinary</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ilovebinary]]></copyright><item><title><![CDATA[1005]]></title><link>https://blog.youkuaiyun.com/ilovebinary/article/details/109688468</link><guid>https://blog.youkuaiyun.com/ilovebinary/article/details/109688468</guid><author>ilovebinary</author><pubDate>Sat, 14 Nov 2020 11:30:56 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;stdlib.h&gt;
int pre[10010];
int t[10010];

int find(int x)
{//找队长
    int r=x;
    while(r!=pre[r])
        r=pre[r];
    int i=x,j;
    while (pre[i]!=r)
    {//让所有人直属队长
        j=pre[i];
        pre[i]=r;
        i=]]></description><category></category></item><item><title><![CDATA[1004]]></title><link>https://blog.youkuaiyun.com/ilovebinary/article/details/109595212</link><guid>https://blog.youkuaiyun.com/ilovebinary/article/details/109595212</guid><author>ilovebinary</author><pubDate>Tue, 10 Nov 2020 11:16:20 +0800</pubDate><description><![CDATA[#include &lt;stdio.h&gt;
#include &lt;stdlib.h&gt;

int main()
{
    int t,s1,s2,s,n,ai,x,y;
    scanf("%d",&amp;t);
    for(int i=0;i&lt;t;i++)
    {
        scanf("%d",&amp;n);
        int a[n];
        for(int j=0;j&lt;n;j++)
        {
            scanf]]></description><category></category></item><item><title><![CDATA[PAT乙级1003（c语言）]]></title><link>https://blog.youkuaiyun.com/ilovebinary/article/details/109432716</link><guid>https://blog.youkuaiyun.com/ilovebinary/article/details/109432716</guid><author>ilovebinary</author><pubDate>Sun, 01 Nov 2020 18:23:11 +0800</pubDate><description><![CDATA[PAT乙级1003（c语言）
因为这个代码很多思路来自另一个大佬，故不再过多注释，仅作为做题记录。
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
int main()
{
    int n,c1,c2,c3,t,p,np,nt;
    scanf("%d",&amp;n);
    getchar();
    if(n&gt;10 &amp;&amp; n&lt;0)
    {
        printf("数据不合法");
    }
  ]]></description><category></category></item><item><title><![CDATA[PAT乙级1001（c语言）]]></title><link>https://blog.youkuaiyun.com/ilovebinary/article/details/109412827</link><guid>https://blog.youkuaiyun.com/ilovebinary/article/details/109412827</guid><author>ilovebinary</author><pubDate>Sun, 01 Nov 2020 11:26:08 +0800</pubDate><description><![CDATA[PAT乙级1001（c语言）
#include &lt;stdio.h&gt;
int main()
{
    int a,c;
    //c用来存到达1用的步数
    c=0;
    scanf("%d",&amp;a);
    int i=a;
    //判定奇偶并进行运算，让计算机在数值等于一之前不要停
    while(i!=1){
        if(i%2==0)
        {
            i=i/2;
            c=c+1;
        }
]]></description><category></category></item><item><title><![CDATA[PAT乙级1002（c语言）]]></title><link>https://blog.youkuaiyun.com/ilovebinary/article/details/109412751</link><guid>https://blog.youkuaiyun.com/ilovebinary/article/details/109412751</guid><author>ilovebinary</author><pubDate>Sun, 01 Nov 2020 11:14:30 +0800</pubDate><description><![CDATA[PAT乙级1002（c语言）
#include &lt;stdio.h&gt;
#include &lt;string.h&gt;
int main()
{
    //建立10个最多包含5个字符的空间，存放中文拼音
    const char a[10][5]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};
    //初始化s后续用其存和
    int s=0;
    //建一个可以放101位的字符数组，存放不超过10^100的数]]></description><category></category></item></channel></rss>