同学应聘程序员,接到这样的一道笔试题目,要我帮忙。我二话不说,赶快拿来看。可是没想到,这题目看起来似乎简单,但是算法却着实要动一番脑筋。我不是计算机专业出身,所以这道题还是花了我不少时间,而且也没来得及算复杂度。先看题目吧:
下载:
draw.c
/*-----------------------------
这个程序画出下面这样一副图
N = ? 8
1 2 3 4 5 6 7 8
28 29 30 31 32 33 34 9
27 48 49 50 51 52 35 10
26 47 60 61 62 53 36 11
25 46 59 64 63 54 37 12
24 45 58 57 56 55 38 13
23 44 43 42 41 40 39 14
22 21 20 19 18 17 16 15
welcome to http://isdox.com
-----------------------------*/
main ()
{
int i , j ;
int n ;
printf ( " N = ? " ) ;
scanf ( " %d " , & n ) ;
for ( i = 0 ; i < n ; i ++ )
{
for ( j = 0 ; j < n ; j ++ )
{
if ( i < n - j - 1 && i <= j )
printf ( " %2d " , 4 * i * ( n - i ) + j - i + 1 ) ; /*画上半部*/
if ( i >= n - j - 1 && i <= j )
printf ( " %2d " , ( 4 * j + 5 ) * ( n - j ) - 3 * n + i - 1 ) ; /*画右半部*/
if ( i < n - j - 1 && i > j )
printf ( " %2d " , 4 * ( j + 1 ) * ( n - j - 1 ) + j - i + 1 ) ; /*画左半部*/
if ( i >= n - j - 1 && i > j )
printf ( " %2d " , 4 * i * ( n - i ) + 2 * n - 3 * i - j - 1 ) ; /*画右半部*/
}
printf ( " \ n " ) ;
}
printf ( " welcome to http://isdox.com \ n " ) ;
}
这个程序画出下面这样一副图
N = ? 8
1 2 3 4 5 6 7 8
28 29 30 31 32 33 34 9
27 48 49 50 51 52 35 10
26 47 60 61 62 53 36 11
25 46 59 64 63 54 37 12
24 45 58 57 56 55 38 13
23 44 43 42 41 40 39 14
22 21 20 19 18 17 16 15
welcome to http://isdox.com
-----------------------------*/
main ()
{
int i , j ;
int n ;
printf ( " N = ? " ) ;
scanf ( " %d " , & n ) ;
for ( i = 0 ; i < n ; i ++ )
{
for ( j = 0 ; j < n ; j ++ )
{
if ( i < n - j - 1 && i <= j )
printf ( " %2d " , 4 * i * ( n - i ) + j - i + 1 ) ; /*画上半部*/
if ( i >= n - j - 1 && i <= j )
printf ( " %2d " , ( 4 * j + 5 ) * ( n - j ) - 3 * n + i - 1 ) ; /*画右半部*/
if ( i < n - j - 1 && i > j )
printf ( " %2d " , 4 * ( j + 1 ) * ( n - j - 1 ) + j - i + 1 ) ; /*画左半部*/
if ( i >= n - j - 1 && i > j )
printf ( " %2d " , 4 * i * ( n - i ) + 2 * n - 3 * i - j - 1 ) ; /*画右半部*/
}
printf ( " \ n " ) ;
}
printf ( " welcome to http://isdox.com \ n " ) ;
}
我的算法似乎过于复杂了,感觉还应该有更简单的算法,不知道计算机专业的同学做这样的题目会用什么方法?
code, 应聘

