发函数答案了
肖静 • 2年前
发函数类编程题答案了
评论:
///May.26
//向上取整
/*#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
double i;
cin>>i;
int xxqz(double x);
printf("%d",xxqz(i));
}
double xxqz(double x)
{
int n;
n=(int)x+1;
return(n);
}*/
//向下取整
/*#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
double i;
cin>>i;
int xxqz(double x);
printf("%d",xxqz(i));
}
double xxqz(double x)
{
int n;
n=(int)x;
return(n);
}*/
//n的几次方
/*#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int x,n;
cin>>x>>n;
int mi(int i,int j);
printf("%d",mi(x,n));
return 0;
}
int mi(int i,int j)
{
int answer=i;
for(int x=0;x<j-1;x++)
answer=answer*i;
return (answer);
}*/
//绝对值I与绝对值II
/*#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
double n=0;
cin>>n;
double bigger_than_zero(double number);
double smaller_than_zero(double number);
if(n>0)
cout<<bigger_than_zero(n);
if(n<0)
cout<<smaller_than_zero(n);
return 0;
}
double bigger_than_zero(double number)
{
return (number);
}
double smaller_than_zero(double number)
{
number=0-number;
return (number);
}*/
//求两个数较大的数
/*#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n1,n2;
cin>>n1>>n2;
int than(int j1,int j2);
cout<<than(n1,n2);
return 0;
}
int than(int j1,int j2)
{
return (j1>j2? j1:j2);
}*/
//求两个数较小的数
/*#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int n1,n2;
cin>>n1>>n2;
int than(int j1,int j2);
cout<<than(n1,n2);
return 0;
}
int than(int j1,int j2)
{
return (j1>j2? j2:j1);
}*/
///May.26
//判断素数I
/*#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
int main()
{
int n,i,j=0;
cin>>n;
if(n==1)
{
cout<<"No";
return 0;
}
for(i=3;i<=sqrt(n);i++)
if(n%i==0) j+=1;
if(j>0)
cout<<"No";
else
cout<<"Yes";
return 0;
}*/
//求平方根
/*#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
int main()
{
double n;
cin>>n;
double sqrts(double number);
cout<<sqrts(n);
return 0;
}
double sqrts(double number)
{
return sqrt(number);
}*/
///May.27
//最大公约数
/*#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
int main()
{
int n1,n2;
cin>>n1>>n2;
int bigger(int number1,int number2);
cout<<bigger(n1,n2);
return 0;
}
int bigger(int number1,int number2)
{
int i=0,j=0,z=0;
z=number1<number2? number1:number2;
for(i=1;i<=z;i++)
{
if((number1%i==0) && (number2%i==0))
j=i;
}
return (j);
}*/
//字符串的长度
/*#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
int main()
{
char n[100];
int strlens(char n1[100]);
cout<<strlens(n);
return 0;
}
int strlens(char n1[100])
{
gets(n1);
int STRLEN=strlen(n1);
return (STRLEN);
}*/
///May.28
//十六进制转十进制
/*#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
int main()
{
int n;
scanf("%x",&n);
printf("%d\n",n);
return 0;
}*/
//-//寻找绝对素数--------------------------------------------------------------wait some time
/*#include <iostream>
#include <cstdio>
#include <math.h>
using namespace std;
int main()
{
int n1,n2,i,j,min,max,sushu[100000]={0},sushu_max=0,m1,m2,m3,m4,m5,m6;
cin>>n1>>n2;
if(n1==n2)
{
cout<<"No";
return 0;
}
min=n1>n2?n2:n1;
max=n1>n2?n1:n2;
for(int n=min;n<=max-1;n++)
{
j=0;
for(i=2;i<=sqrt(n);i++)
if(n%i==0) j+=1;
if(j==0)
{
sushu[sushu_max]=n;
sushu_max+=1;
}
}
if(sushu[0]==0)
cout<<"No";
else
{
for(int n=0;n<sushu_max-1;n++)
cout<<sushu[n]<<",";
cout<<sushu[sushu_max-1];
}
return 0;
}*/
///May.31
//输出元音字母
/*#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char a[100];
char b[100];
char k;
int m=0,i,j;
gets(a);
j=strlen(a);
for(i=0;i<j;i++)
{
k=a[i];
if(k=='a') {b[m]='a';m+=1;}
if(k=='A') {b[m]='A';m+=1;}
if(k=='e') {b[m]='e';m+=1;}
if(k=='E') {b[m]='E';m+=1;}
if(k=='i') {b[m]='i';m+=1;}
if(k=='I') {b[m]='I';m+=1;}
if(k=='o') {b[m]='o';m+=1;}
if(k=='O') {b[m]='O';m+=1;}
if(k=='u') {b[m]='u';m+=1;}
if(k=='U') {b[m]='U';m+=1;}
}
puts(b);
return 0;
}*/
//字符倒序（1）
/*#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char a[100];
char b[100];
char k;
int i,j;
gets(a);
j=strlen(a);
for(i=0;i<j;i++)
{
k=a[i];
b[j-i-1]=k;
}
b[i]='\0';
puts(b);
return 0;
}
//字符倒序（2）
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char a[100];
char b[100]={NULL};
char k;
int i,j;
gets(a);
j=strlen(a);
for(i=0;i<j;i++)
{
k=a[i];
b[j-i-1]=k;
}
puts(b);
return 0;
}*/
//阶乘的和
/*#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int n,i,j,answer[12],ends=0;
cin>>n;
for(i=0;i<n;i++)
answer[i]=1;
for(i=0;i<n;i++)
{
for(j=n-i;j>0;j--)
answer[i]=answer[i]*j;
}
for(i=0;i<n;i++)
ends=ends+answer[i];
cout<<ends;
return 0;
}*/
//阶乘的和
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int n,i,j,answer[12];
cin>>n;
for(i=0;i<n;i++)
answer[i]=1;
for(i=0;i<n;i++)
{
for(j=n-i;j>0;j--)
answer[i]=answer[i]*j;
}
for(i=n-1;i>=0;i--)
cout<<answer[i]<<" ";
return 0;
}
肖静 • 2年前