这个程序主要考虑优化的问题,这里给出4种解法,其中除第一种没有通过(Time Limit Exceeded ),其他的都通过了,可以看出对于同一个题目,思路不一样,程序结构不一样,运行时间也会不一样,代码长度也不一样.第一种就是传统的用递归的算法来求解,程序很简单,但是没有通过,这里就不给出代码了.
连接是:ACM 2060
第二种:
#include
<
stdio.h
>
int main()
{
int n;
while (scanf( " %d " , & n) != EOF)
if (n % 8 == 2 || n % 8 == 6 )
printf( " yes " );
else
printf( " no " );
return 0 ;
}
int main()
{
int n;
while (scanf( " %d " , & n) != EOF)
if (n % 8 == 2 || n % 8 == 6 )
printf( " yes " );
else
printf( " no " );
return 0 ;
}
第三种:
#include
<
stdio.h
>
int get ( int n)
{
int number = 0 ;
if (n == 0 ) number = 1 ;
else if (n == 1 ) number = 2 ;
else
{
number = get (n - 1 ) + get (n - 2 );
if (number >= 3 )
number -= 3 ;
}
return number;
}
int main()
{
int n;
while (scanf( " %d " , & n) != EOF)
{
if (n == 0 || n == 1 )
printf( " no " );
else
{
n = n % 8 ;
if ( get (n) == 0 )
printf( " yes " );
else printf( " no " );
}
}
return 0 ;
}
int get ( int n)
{
int number = 0 ;
if (n == 0 ) number = 1 ;
else if (n == 1 ) number = 2 ;
else
{
number = get (n - 1 ) + get (n - 2 );
if (number >= 3 )
number -= 3 ;
}
return number;
}
int main()
{
int n;
while (scanf( " %d " , & n) != EOF)
{
if (n == 0 || n == 1 )
printf( " no " );
else
{
n = n % 8 ;
if ( get (n) == 0 )
printf( " yes " );
else printf( " no " );
}
}
return 0 ;
}
第四种:
#include
<
stdio.h
>
int main()
{
int array[] = { 1 , 2 , 0 , 2 , 2 , 1 , 0 , 1 };
int n;
while (scanf( " %d " , & n) != EOF)
{
if (array[n % 8 ] == 0 )
printf( " yes " );
else printf( " no " );
}
return 0 ;
}
int main()
{
int array[] = { 1 , 2 , 0 , 2 , 2 , 1 , 0 , 1 };
int n;
while (scanf( " %d " , & n) != EOF)
{
if (array[n % 8 ] == 0 )
printf( " yes " );
else printf( " no " );
}
return 0 ;
}