1092: 素数表(函数专题)
#include<stdio.h>
#include<math.h>
int prime(int n)
{ int flag = 0;
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
flag = 1;
return 0;
}
}
if(flag == 0){
return 1;
}
}
int main(){
int m,n;
scanf("%d %d",&m,&n);
int fr = 0;//是否是第一个输出
if(m<2){
m=2;//当m=1时 要特别考虑
}
for(int i=m;i<=n;i++){
if(prime(i)==1){
printf("%d ",i);
}
}
}
1093: 验证哥德巴赫猜想(函数专题)
#include<stdio.h>
#include<math.h>
int prime(int n)
{int flag = 0;
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
flag = 1;
return 0;
}
}
if(flag == 0){
return 1;
}
}
int main(){
int n;
scanf("%d",&n);
for(int i=2;i<=n/2;i++){
int flag = prime(i);
if(flag == 1){
int t = prime(n-i);
if(t==1){
printf("%d %d\n",i,n-i);
}
}
}
}
1094: 统计元音(函数专题)
注意大小写
int vowel(char ch)
{
if(ch == 'a' || ch =='e' || ch =='i' || ch=='o'|| ch=='u'||ch == 'A' || ch =='E' || ch =='I' || ch=='O'|| ch=='U' ){
return 1;
} else{
return 0;
}
}
1095: 时间间隔(多实例测试)
int HmsToS(int h, int m, int s) // 三个参数分别为用于表示一个时间点的时、分、秒
{
int sum = h*3600 +m*60+ s;
return sum;
}
void PrintTime(int s) //形参s表示一个时间段的长度,单位是秒//将时间段转换为对应的“小时:分钟:秒” 格式输出
{
int h = s/3600;
s = s -h*3600;
int m = s/60;
s = s- m*60;
printf("%02d:%02d:%02d\n",h,m,s);
}
1096: 水仙花数(函数专题)
#include<stdio.h>
int narcissus(int n)
{
int t = n;
int sum = 0;
while(t>0){
int a = t%10;
sum = sum +a*a*a;
t = t/10;
}
if(n == sum){
return 1;
}else{
return 0;
}
}
int main(){
int n,m;
while(scanf("%d %d",&n,&m)!=EOF){
int flag =0;
int fr=0;
for(int i=n;i<=m;i++){
if(narcissus(i) == 1){
flag = 1;
if(fr == 0){
fr=1;
printf("%d",i);
}else{
printf(" %d",i);
}
}
}
if(flag == 0){
printf("no");
}
printf("\n");
}
}
1097: 计算平均成绩(函数专题)
因为要输入字符串 用c语言没实现,用c++实现的
#include<iostream>
#include<string.h>
#include <iomanip>
using namespace std;
int getScore(char g)
{
if(g == 'A'){
return 95;
}else if(g == 'B'){
return 85;
}else if(g == 'C'){
return 75;
}else if(g == 'D'){
return 65;
}else{
return 40;
}
}
int main(){
string s;
cin>>s;
//char *c = strcpy(s)
double sum = 0;
for(int i=0;i<s.length();i++){
double n = getScore(s[i]);
sum =sum +n;
}
cout<<setiosflags(ios::fixed)<<setprecision(1)<< sum/s.length();
}
1098: 复合函数求值(函数专题)
double funF(double x)
{
double a = x-3;
double b = x+1;
if(a<0){
a = 0-a;
}
if(b<0){
b = 0-b;
}
return a+b;
}
double funG(double x)
{
return x*x-3*x;
}
1099: 角谷猜想(多实例测试)
#include<stdio.h>
static int count = 0;
int noodd(int n){
n = n / 2;
count = count + 1;
return n;
}
int odd(int n){
count = count+1;
n = 3*n +1;
return n;
}
int main(){
int n;
while(scanf("%d",&n)!=EOF){
count = 0;
while(n!=1){
if(n%2==0){
n = noodd(n);
}else{
n = odd(n);
}
}
printf("%d\n",count);
}
return 0;
}