6-1 输出华氏-摄氏温度转换表 (20分)
#include <stdio.h>
int main ( ) {
int l, u;
int f;
float c;
scanf ( "%d %d" , & l, & u) ;
if ( l<= u) {
printf ( "fahr celsius\n" ) ;
for ( f= l; f<= u; f+ = 2 ) {
c= 5 * ( f- 32 ) * 1.0 / 9 ;
printf ( "%d%6.1lf\n" , f, c) ;
}
}
else if ( l> u|| u> 100 || l> 100 ) {
printf ( "Invalid." ) ;
}
return 0 ;
}
6-2 求N分之一序列前N项和 (20分)
#include <stdio.h>
int main ( )
{
int i, n;
double sum;
scanf ( "%d" , & n) ;
sum= 0 ;
i= 1 ;
for ( i= 1 ; i<= n; i++ ) {
sum= sum+ 1.0 / i;
}
printf ( "sum = %.6f" , sum) ;
return 0 ;
}
6-3 生成3的乘方表 (20分)
#include <stdio.h>
#include <math.h>
int main ( )
{
int n;
int i;
int result;
scanf ( "%d" , & n) ;
i= 0 ;
for ( i; i<= n; i++ ) {
result= pow ( 3 , i) ;
printf ( "pow(3,%d) = %d\n" , i, result) ;
}
return 0 ;
}
6-4 求阶乘序列前N项和 (20分)
#include <stdio.h>
int main ( )
{
int n;
int sum = 0 ;
scanf ( "%d" , & n) ;
for ( int x = 1 ; x <= n; x++ )
{
int sum1 = 1 ;
for ( int i = 1 ; i <= x; i++ )
{
sum1 = sum1 * i;
}
sum = sum + sum1;
}
printf ( "%d\n" , sum) ;
return 0 ;
}
6-5 统计学生成绩 (20分)
#include <stdio.h>
int main ( void )
{
int N;
int i, x;
int a= 0 , b= 0 , c= 0 , d= 0 , e= 0 ;
while ( scanf ( "%d" , & N) != EOF ) {
for ( i= 0 ; i< N; i++ ) {
scanf ( "%d" , & x) ;
if ( x>= 90 ) {
a++ ;
} else if ( x>= 80 ) {
b++ ;
} else if ( x>= 70 ) {
c++ ;
} else if ( x>= 60 ) {
d++ ;
} else {
e++ ;
}
}
printf ( "%d %d %d %d %d\n" , a, b, c, d, e) ;
}
return 0 ;
}
6-6 找出最小值 (20分)
#include <stdio.h>
#include <math.h>
int main ( ) {
int n, min, num;
int i;
int cnt= 1 ;
scanf ( "%d" , & n) ;
for ( i= 1 ; i<= n; i++ , cnt++ ) {
scanf ( "%d" , & num) ;
if ( cnt== 1 ) {
min= num;
}
if ( num< min) {
min= num;
}
}
printf ( "min = %d" , min) ;
return 0 ;
}
6-7 统计素数并求和 (20分)
#include <stdio.h>
#include <math.h>
int main ( )
{
int a, b, i, m, l = 0 , sum = 0 , num = 0 ;
scanf ( "%d %d" , & a, & b) ;
for ( i= a; i<= b; i++ )
{
for ( m= 1 ; m<= i; m++ )
{
if ( i% m!= 0 ) l++ ;
}
if ( l== i- 2 )
{
sum= sum+ i; num++ ;
}
l= 0 ;
}
printf ( "%d %d" , num, sum) ;
return 0 ;
}
6-8 猴子吃桃问题 (20分)
#include <stdio.h>
int main ( )
{
int i, n, s;
s = 1 ;
scanf ( "%d" , & n) ;
for ( i = 0 ; i < n - 1 ; i++ )
{
s= ( s+ 1 ) * 2 ;
}
printf ( "%d" , s) ;
return 0 ;
}
6-9 求整数段和 (20分)
#include <stdio.h>
int main ( )
{
int a, b, i, cot= 0 , sum= 0 ;
scanf ( "%d %d" , & a, & b) ;
for ( i= a; i<= b; i++ )
{
printf ( "%5d" , i) ;
cot++ ;
if ( cot% 5 == 0 && i!= b)
printf ( "\n" ) ;
}
printf ( "\n" ) ;
for ( i= a; i<= b; i++ )
sum+ = i;
printf ( "Sum = %d" , sum) ;
return 0 ;
}
6-10 最佳情侣身高差 (20分)
#include <stdio.h>
int main ( )
{
int n, i;
char c;
double h, s;
scanf ( "%d\n" , & n) ;
for ( i= 0 ; i< n; i++ )
{
scanf ( "\n%c%lf" , & c, & h) ;
s= 0 ;
if ( c== 'M' )
{
s= h/ 1.09 ;
}
else
{
s= h* 1.09 ;
}
printf ( "%.2lf\n" , s) ;
}
return 0 ;
}
6-11 求整数的位数及各位数字之和 (20分)
#include <stdio.h>
#include <math.h>
int main ( )
{
int n;
int k = 0 ;
int sum = 0 ;
scanf ( "%d" , & n) ;
while ( n != 0 )
{
sum + = n % 10 ;
n / = 10 ;
k++ ;
}
printf ( "%d %d\n" , k, sum) ;
}
6-12 韩信点兵 (20分)
#include <stdio.h>
int main ( )
{
int count, i= 1 ;
for ( i = 1 ; ; i++ )
{
if ( i % 5 == 1 && i % 6 == 5 && i % 7 == 4 && i % 11 == 10 )
{
break ;
}
}
printf ( "%d" , i) ;
return 0 ;
}
6-13 爬动的蠕虫 (20分)
#include <stdio.h>
int main ( )
{
int N, U, D;
int time= 0 ;
scanf ( "%d %d %d" , & N, & U, & D) ;
while ( N> 0 )
{
N= N- U;
time++ ;
if ( N<= 0 )
{
continue ;
}
N + = D;
time++ ;
}
printf ( "%d" , time) ;
return 0 ;
}
6-14 人民币兑换(20分)
#include <stdio.h>
#include <math.h>
int main ( )
{
int i, j, k;
int n;
scanf ( "%d" , & n) ;
for ( i = 1 ; i< 20 ; i++ )
{
for ( j = 1 ; j < 51 ; j++ )
{
for ( k = 1 ; k < 100 ; k++ )
{
if ( i * 5 + j * 2 + k == 150 && i + j + k == 100 && n > 0 )
{
printf ( "%d %d %d\n" , i, j, k) ;
n-- ;
}
}
}
}
return 0 ;
}
6-15 小于m的最大的10个素数 (20分)
#include <stdio.h>
#include <math.h>
int isPrime ( int n)
{
if ( n== 1 )
return 1 ;
for ( int i= 2 ; i<= sqrt ( n) ; i++ )
{
if ( n% i== 0 )
return 1 ;
}
return 0 ;
}
int main ( )
{
int m, temp= 0 ;
scanf ( "%d" , & m) ;
for ( int i= m- 1 ; temp< 10 ; i-- ) {
if ( isPrime ( i) == 0 )
{
temp++ ;
printf ( "%6d" , i) ;
}
}
return 0 ;
}