<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[qq_62870909的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/qq_62870909</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; qq_62870909]]></copyright><item><title><![CDATA[1501养生的学长]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/122160014</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/122160014</guid><author>qq_62870909</author><pubDate>Sun, 26 Dec 2021 20:16:51 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
  int a,b,c=0,d=0,f=0,g=1,h;
 scanf("%d",&amp;a);
 for(b=1;b&lt;=a;b++)
 {
  d=c;
  scanf("%d",&amp;c);
  h=c;
  c=d+c;
  f=f+h;//f=c zong
  if(b!=a&amp;&amp;f&gt;=30||b==a...]]></description><category></category></item><item><title><![CDATA[1017第三届程序设计大赛 阶乘之和]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/122138142</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/122138142</guid><author>qq_62870909</author><pubDate>Sat, 25 Dec 2021 00:38:29 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
   int a[11],b[101]={1};
   int c,d=1,e,f,g;
   for(c=0;c&lt;11;c++)
   {
     d=d*(c+1);
     a[c]=d;
   }
   scanf("%d",&amp;e);
   for(f=0;f&lt;e;f++)
   {
     scanf("%d",&amp;...]]></description><category></category></item><item><title><![CDATA[1021第三届程序设计大赛 哥德巴赫猜想]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121943033</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121943033</guid><author>qq_62870909</author><pubDate>Wed, 15 Dec 2021 00:19:37 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
  int a[10000],b,c[10000]={0},d,e,f,j=0;
  for(b=0;b&lt;10000;b++)
  {
      scanf("%d",&amp;a[b]);
      if(a[b]==0)
      break;
  }
  for(b=2;b&lt;=10000;b++)
  {
    for(d=2;d*d&lt;...]]></description><category></category></item><item><title><![CDATA[1401幽游@之刻]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121939760</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121939760</guid><author>qq_62870909</author><pubDate>Tue, 14 Dec 2021 20:51:57 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
   int a[100],b[100],c[100],e,f,g[100]={0},h[100]={0},i=0,j=0,k,l,m[100]={0};
   char d[100];
   scanf("%d",&amp;e);
   for(f=0;f&lt;e;f++)
     scanf("%d,%d,%d,%c",&amp;a[f],&amp;b[f],&amp;c[f],&amp;d[...]]></description><category></category></item><item><title><![CDATA[1316Burj Al Arab]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121931308</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121931308</guid><author>qq_62870909</author><pubDate>Tue, 14 Dec 2021 17:00:12 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
   int a[1010],b[1010],c[1010],d,e,f,k[150]={0};
   scanf("%d",&amp;d);
   for(e=0;e&lt;d;e++)
     scanf("%d%d%d",&amp;a[e],&amp;b[e],&amp;c[e]);
  //端点值
  //试试查询每个日期有什么租客 k数组为当天最大房数
   for(e=0;e...]]></description><category></category></item><item><title><![CDATA[1363数字游戏]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121896983</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121896983</guid><author>qq_62870909</author><pubDate>Mon, 13 Dec 2021 02:45:03 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
 int a,b,c,d,e,f,g;
 scanf("%d",&amp;a);
 c=a;
 d=a+1;
 e=a+2;
 f=a+3;
   for(b=1;b&lt;=4;b++)
  {
    printf("%d%d%d ",c,d,e);
   g=e;
   e=f;
   f=g;//三号位与后台数f交换

...]]></description><category></category></item><item><title><![CDATA[1354柯南的变声蝴蝶结]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121896980</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121896980</guid><author>qq_62870909</author><pubDate>Mon, 13 Dec 2021 02:41:36 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
  int a,b,c,d=0,e,f,g;
  scanf("%d",&amp;a);//输入要求值a
 c=2*a-1;//定义初始值c，为题目要求宽度
 f=2*a-1;//定义初始值f，为题目要求长度
 for(g=1;g&lt;=(2*a-1);g++)//主循环：依次打印每一行
 {
  c=f;//f为参与计算的值，c为初始值来与之后加减的f比较
  d=d+1;/...]]></description><category></category></item><item><title><![CDATA[1306求和]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121896977</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121896977</guid><author>qq_62870909</author><pubDate>Mon, 13 Dec 2021 02:38:22 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
 char a;
  int b,c=0,d,e=0;
  for(d=1;d&lt;=25;d++)
  {
   for(b=1;b&lt;=50;b++)
  { a=getchar();
    if(a&gt;='0'&amp;&amp;a&lt;='9')
    {
      a=a-'0';
      ...]]></description><category></category></item><item><title><![CDATA[1113求正弦]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121896972</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121896972</guid><author>qq_62870909</author><pubDate>Mon, 13 Dec 2021 02:33:11 +0800</pubDate><description><![CDATA[#include&lt;stdio.h&gt;
int main()
{
  double a,b,c,d=1,e,f=1.00000000,g=0;
 scanf("%lf",&amp;a);
   e=a;
  for(1;1;1)
  {
  c=e/f;
   e=e*a*a;
  f=f*(d+1)*(d+2);
  d=d+2;
  g=g+c;
  e=-e;
  if(c*10000...]]></description><category></category></item><item><title><![CDATA[1311防护罩]]></title><link>https://blog.youkuaiyun.com/qq_62870909/article/details/121896962</link><guid>https://blog.youkuaiyun.com/qq_62870909/article/details/121896962</guid><author>qq_62870909</author><pubDate>Mon, 13 Dec 2021 02:23:25 +0800</pubDate><description><![CDATA[emmmmmm，作为一个大一的计算机学渣，刚刚学了数组就想发挥一下，结果做了一个小时，做麻了，成果给大伙们分享一下：

#include&lt;stdio.h&gt;
int main()
{
  int a[110]={1},b,c,d,e=0,f,g,h;
  scanf("%d%d",&amp;b,&amp;c);
 for(d=0;d&lt;b;d++)
 {
  scanf("%d",&amp;a[d]);
 }
 for(f=0;a[f]!=0;f++...]]></description><category></category></item></channel></rss>