杨哥，能不能有时间讲讲第9题。
不知道如何来减少时间

大神

关于第9题的算法我在9楼已经阐述过了，不知道哪里没说明白？或者是代码实现上有困难？

代码的实现。- -  

结合我9楼的分析看代码吧。这段代码比题目要求输出的多，同时输出了所有带分数的表达式。如果只想得到题目要求的结果请删去search中的printf。

#include<stdio.h>

int s[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};

int n, count;

void search(int deep)
{
    int i, j, t, a, b, c, d, k;
    if(deep >= sizeof(s) / sizeof(int))
    {
        for(t = i = 0; i < sizeof(s) / sizeof(int); t = t * 10 + s[i++]);
        for(i = 100; i <= t; i *= 10)
        {
            if((a = t / i) >= n) continue;
            for(k = t % i, j = 10; (b = k / j) >= (c = k % j); j *= 10)
            {
                if((d = a + b / c) < n) break;
                if(b % c) continue;
                if(d == n) printf("%d + %d / %d\n", a, b, c), count++;
            }
        }
        return;
    }
    for(i = deep; i < sizeof(s) / sizeof(int); i++)
    {
        t = s[deep]; s[deep] = s[i]; s[i] = t;
        search(deep + 1);
        t = s[deep]; s[deep] = s[i]; s[i] = t;
    }
}

int main()
{
    scanf("%d", &n);
    search(0);
    printf("%d", count);
    return 0;
}

谢谢谢谢，

蓝桥杯的题为何我一道都不会？？？

请哥哥将第一题的代码贴出，感激不尽！

#include "stdio.h"
#define N 8113
main()
{  int  y=0,x=1;
int year,mon,day;
   
    for(year=1777;year<1778;year++)
    for(mon=5;mon<=12;mon++)
        {if(mon==5||mon==7||mon==8||mon==10||mon==12)
            {for(day=1;day<=31;day++)
            x++;}
            
            
            else if(mon==6||mon==9||mon==11)
            {for(day=1;day<=30;day++)
            x++;}
        }
        
   
   
   
   
   
   
    for(year=1778;year<2012;year++)
    {for(mon=1;mon<=12;mon++)
    {if(year%4==0&&year%100!=0||year%400==0)
        {if(mon==1||mon==3||mon==5||mon==7||mon==8||mon==10||mon==12)
            for(day=1;day<=31;day++)
            {x++;
                if(x==N)
                {
   if(mon<10&&day<10)
   printf("%d-0%d-0%d",year,mon,day);
   else if(mon<10&&day>=10)
    printf("%d-0%d-%d",year,mon,day);
    else if(mon>=10&&day<10)
     printf("%d-%d-0%d",year,mon,day);
     else
     printf("%d-%d-%d",year,mon,day);
}}
                    
        
            else if(mon==4||mon==6||mon==9||mon==11)
            for(day=1;day<=30;day++)
            {x++;
                if(x==N)
                {
   if(mon<10&&day<10)
   printf("%d-0%d-0%d",year,mon,day);
   else if(mon<10&&day>=10)
    printf("%d-0%d-%d",year,mon,day);
    else if(mon>=10&&day<10)
     printf("%d-%d-0%d",year,mon,day);
     else
     printf("%d-%d-%d",year,mon,day);
}}
            else
            for(day=1;day<=29;day++)
            {x++;
                if(x==N)
                {
   if(mon<10&&day<10)
   printf("%d-0%d-0%d",year,mon,day);
   else if(mon<10&&day>=10)
    printf("%d-0%d-%d",year,mon,day);
    else if(mon>=10&&day<10)
     printf("%d-%d-0%d",year,mon,day);
     else
     printf("%d-%d-%d",year,mon,day);
}}
        }
            
    else
    {if(mon==1||mon==3||mon==5||mon==7||mon==8||mon==10||mon==12)
            for(day=1;day<=31;day++)
            {x++;
                if(x==N)
                {
   if(mon<10&&day<10)
   printf("%d-0%d-0%d",year,mon,day);
   else if(mon<10&&day>=10)
    printf("%d-0%d-%d",year,mon,day);
    else if(mon>=10&&day<10)
     printf("%d-%d-0%d",year,mon,day);
     else
     printf("%d-%d-%d",year,mon,day);
}}
            else if(mon==4||mon==6||mon==9||mon==11)
            for(day=1;day<=30;day++)
            {x++;
                if(x==N)
                {
   if(mon<10&&day<10)
   printf("%d-0%d-0%d",year,mon,day);
   else if(mon<10&&day>=10)
    printf("%d-0%d-%d",year,mon,day);
    else if(mon>=10&&day<10)
     printf("%d-%d-0%d",year,mon,day);
     else
     printf("%d-%d-%d",year,mon,day);
}}
            else
            for(day=1;day<=28;day++)
            {x++;
                if(x==N)
                {
   if(mon<10&&day<10)
   printf("%d-0%d-0%d",year,mon,day);
   else if(mon<10&&day>=10)
    printf("%d-0%d-%d",year,mon,day);
    else if(mon>=10&&day<10)
     printf("%d-%d-0%d",year,mon,day);
     else
     printf("%d-%d-%d",year,mon,day);
}}
    }
    }   }
   
}

其实这道题可以化简，不用那么多输出，可以把输出放在最后面，