p48 奇偶分家
#include <stdio.h>
int main(void)
{
int count_odd,count_even,i,n,number;
count_odd=0;
count_even=0;
printf("Enter n:");
scanf("%d",&n);
printf("Enter %d numbers:",n);
for(i=1;i<=n;i++){
scanf("%d",&number);
if(number%2!=0){
count_odd++;
}
else{
count_even++;
}
}
printf("odd:%d,even:%d",count_odd,count_even);
return 0;
}
p49 平均分
#include <stdio.h>
int main(void)
{
int count,i,n;
double score,total;
printf("Enter n:");
scanf("%d",&n);
total=0;
count=0;
for(i=1;i<=n;i++){
printf("Enter score #%d:",i);
scanf("%lf",&score);
total=total+score;
if(score<60){
count++;
}
}
if(n!=0){
printf("Average=%.2f\n",total/n);
}else{
printf("Average=%.2f\n",0.0);
}
printf("Number of failures=%d\n",count);
return 0;
}
将所输入字母增加3位输出
#include<stdio.h>
#include<string.h>
int main()
{
char a[ 60 ] , b[ 60 ] ;
int l , i ;
gets( a ) ;
l = strlen( a ) ;
for( i = 0 ; i <= l - 1 ; i++ )
{
b[ i ] = a[ i ] ;
if( a[ i ] >= 'A' && a[ i ] < 'X' )
b[ i] >= 'a' && a[ i ] < 'x' ;
else if( a[ i ] >= 'a' && a[ i ] < 'x' )
b[ i ] >= 'A' && b[ i ] < 'X' ;
if( a[ i ] >= 'A' && a[ i ] < 'X' ) b[ i ] += 3 ;
else if( a[ i ] >= 'a' && a[ i ] < 'x' ) b[ i ] += 3 ;
else if( a[ i ] >= 'X' && a[ i ] <= 'Z' ) b[ i ] -= 23 ;
else if( a[ i ] >= 'x' && a[ i ] <= 'z' ) b[ i ] -= 23 ;
}
for( i = 0 ; i <= l - 1 ; i++ )
printf( "%c" , b[ i ] ) ;
return 0 ;
}
sy2_6给小姐姐送花
#include<stdio.h>
int main()
{
int i,n,result,a=1,b=2;
scanf("%d",&n);
if(n>=3){
for(i=3;i<=n;i++){
result=a+b;
if(i%2==0)
b=result;
else
a=result;
}
printf("result=%d\n",result);
}
else{
if(n==1)
printf("result=1\n");
else
printf("result=2\n");
}
return 0;
}
sy4_5水仙花
#include<stdio.h>
int pow(int x, int n);
int main()
{
int i, N, ge, shi, bai, qian, wan, shiwan, baiwan;
scanf( "%d", &N );
if( N == 3 )
{
for( i = 100; i <= 999; i++ )
{
ge = i % 10;
shi = i / 10 % 10;
bai = i / 100;
if( pow(ge,3)+pow(shi,3)+pow(bai,3) == i )
{
printf( "%d\n", i );
}
}
}
else if( N == 4 )
{
for( i = 1000;i <= 9999; i++ )
{
ge = i % 10;
shi = i / 10 % 10;
bai = i / 100 % 10;
qian = i / 1000;
if( pow(ge,4)+pow(shi,4)+pow(bai,4)+pow(qian,4) == i )
{
printf( "%d\n", i );
}
}
}
else if( N == 5 )
{
for( i = 10000; i <= 99999; i++ )
{
ge = i % 10;
shi = i / 10 % 10;
bai = i / 100 % 10;
qian = i / 1000 % 10;
wan = i / 10000;
if( pow(ge,5)+pow(shi,5)+pow(bai,5)+pow(qian,5)+pow(wan,5) == i )
{
printf( "%d\n", i );
}
}
}
else if( N == 6 )
{
for( i = 100000; i <= 999999; i++ )
{
ge = i % 10;
shi = i / 10 % 10;
bai = i / 100 % 10;
qian = i / 1000 % 10;
wan = i / 10000 % 10;
shiwan = i / 100000;
if( pow(ge,6)+pow(shi,6)+pow(bai,6)+pow(qian,6)+pow(wan,6)+pow(shiwan,6) == i )
{
printf( "%d\n", i );
}
}
}
else if( N == 7 )
{
for( i = 1000000;i <= 9999999; i++)
{
ge = i % 10;
shi = i / 10 % 10;
bai = i / 100 % 10;
qian = i / 1000 % 10;
wan = i / 10000 % 10;
shiwan = i / 100000 % 10;
baiwan = i / 1000000;
if( pow(ge,7)+pow(shi,7)+pow(bai,7)+pow(qian,7)+pow(wan,7)+pow(shiwan,7)+pow(baiwan,7) == i )
{
printf( "%d\n", i );
}
}
}
return 0;
}
int pow( int x, int n )
{
int result, i;
if ( n == 0 )
{
return 1;
}
else
{
result = 1;
for ( i = 1; i <= n; i++ )
{
result = result * x;
}
return result;
}
}