如何使用c语言编程输入整数n，求1+2+3+……+n和n!？ c语言编写程序求1.1+2.2+3.3+4.4+……+n.n...
c\u8bed\u8a00\u7f16\u7a0b \u8f93\u5165\u6574\u6570n\uff0c\u6c421+2+3+\u2026\u2026+n\u548cn!#include#includeint JieCheng(int n);int QiuHe(int n);int main(){ printf("\u9636\u4e58:%d\n",JieCheng(10));printf("\u6c42\u548c:%d\n",QiuHe(10));}//\u8ba1\u7b97n!int JieCheng(int n){if(n==1){return 1;}else{return n*JieCheng(n-1);}}//\u6c42\u548c,1+2+3+\u2026\u2026+nint QiuHe(int n){int i;int s=0;for(i=1;i<=n;i++){s+=i;}return s;}
\u8fd9\u6837\u884c\u4e48\u3002
#include "stdio.h"
int main()
{
int n,i=1;
printf("\u8f93\u5165n:");
scanf("%d",&n);
double z=0,x=0,t; /*z\u5b58\u6574\u6570\u90e8\u5206\u548c,x\u5b58\u5c0f\u6570\u90e8\u5206\u548c,\u6700\u540e\u8f93\u51faz+x.*/
while(i<=n)
{
z+=i;
t=i;
while(t>=1) t/=10; /* \u6b64\u5904\u521d\u59cb\u72b6\u6001t=i, \u5faa\u73af\u5b8c\u540et\u5c31\u53d8\u6210 0.t \u4e86*/
x+=t;
i++;
}
printf("\u603b\u548c\u4e3a:%f\n",z+x);
return 0;
}
\u8fd0\u884c\u4e0b\u8bd5\u8bd5\u770b\u7ed3\u679c\u5bf9\u4e0d, \u6700\u540e\u9ed8\u8ba4\u8f93\u51fa\u7684\u662f6\u4f4d\u5c0f\u6570, \u4f60\u81ea\u5df1\u53ef\u4ee5\u6309\u4f60\u7684\u9700\u8981 \u8fdb\u884c\u8c03\u6574
1. 使用c语言编程输入整数n，求1+2+3+……+n和n!
#include<stdio.h>
#include<math.h>
int main()
{
int i;
int nNumber;
int nSum = 0;
printf("Input Data:'N'");
scanf("%d", &nNumber);
for ( i = 1; i <= nNumber; i++)
{
nSum = nSum + i;
}
printf("%d
", nSum);return 0;
}
2. 使用c语言编程输入整数n，求1+2+3+……+n和n!
#include<stdio.h>
#include<math.h>
int Factorial(int n);
int Add(int n);
int main()
{
printf("阶乘:%d
",Factorial(10));printf("求和:%d
",Add(10));}
int Factorial(int n)
{
if(n==1)
{
return 1;
}
else
{
return n*JieCheng(n-1);
}
}
int Add(int n){
int i;
int s=0;
for(i=1;i<=n;i++)
{
s+=i;
}
return s;
}
12345678910111213141516171819202122232425262728293031323334#include<stdio.h>#include<math.h> int JieCheng(int n);int QiuHe(int n); int main(){ printf("<a href="http://www.baidu.com/s?wd=%E9%98%B6%E4%B9%98&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHcvrjTdrjb0T1Yvry79nAw-n1wBP16sPHcL0ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EPWcLrjDsP1RLP1n3nHDzrHcY" target="_blank" class="baidu-highlight">阶乘</a>:%d
",JieCheng(10)); printf("求和:%d
",QiuHe(10));}//计算n!int JieCheng(int n){ if(n==1) { return 1; } else { return n*JieCheng(n-1); }}//求和,1+2+3+<a href="http://www.baidu.com/s?wd=%E2%80%A6%E2%80%A6&tn=44039180_cpr&fenlei=mv6quAkxTZn0IZRqIHcvrjTdrjb0T1Yvry79nAw-n1wBP16sPHcL0ZwV5Hcvrjm3rH6sPfKWUMw85HfYnjn4nH6sgvPsT6KdThsqpZwYTjCEQLGCpyw9Uz4Bmy-bIi4WUvYETgN-TLwGUv3EPWcLrjDsP1RLP1n3nHDzrHcY" target="_blank" class="baidu-highlight">……</a>+nint QiuHe(int n){ int i; int s=0; for(i=1;i<=n;i++) { s+=i; } return s;}
这样行么。
绛旓細C璇█瀹炵幇濡備笅锛歩nclude<stdio.h>void main(){int i,j,k,n;scanf("%d",&n); //杈撳叆涓涓鏁存暟nfor(i=2;i<=n;i++){k=0;for(j=1;j<=i-1;j++)if(i%j==0) k+=j;if(k==i) printf("%d\n",i);//鍒ゆ柇i鐨勬墍鏈夌湡鍥犲瓙涔嬪拰鏄惁绛変簬i锛屾槸鍒欒緭鍑篿銆倉}娉ㄦ剰锛氬缓璁畁鐨勫彇鍊...
绛旓細include<iostream> include<cmath> using namespace std;int main(){ int a,b,i,flag=true;cin>>a;b=sqrt(a);for(i=2;i<=b;i++){ if(a%i==0){ flag=false;break;} } if(flag){ cout<<a<<"鏄礌鏁"<<endl;} else { cout<<a<<"涓嶆槸绱犳暟"<<endl;} return 0;} ...
绛旓細include <stdio.h>int Func(int n){if(n < 2)return 1;else return n*Func(n-1);} void main(){int n =0,m=0;printf("璇疯緭鍏ヤ竴涓鏁存暟锛")scanf("%d",&n);m=Func(n);printf("%d!=%d\n",n,m);} 鍦ㄤ互涓绋嬪簭浠ｇ爜涓紝Func锛堬級涓洪掑綊鍑芥暟锛屼富鍑芥暟main锛堬級涓帴鏀堕敭鐩杈撳叆鏁存暟...
绛旓細鎬濊矾锛杈撳叆瀛楃涓诧紝浠庡瓧绗︿覆鐨勭涓涓綅缃紑濮嬩緷娆℃妸姣忎釜鏁板瓧瀛楃杞垚鏁存暟锛骞惰绠楀叾绱姞鍜屻傚弬鑰冧唬鐮侊細include "stdio.h" #include "string.h" int main() {char a[100];int i,sum=0;gets(a); for(i=0;a[i]!='\0';i++)//閬嶅巻姹傜疮鍔犲拰 sum+=a[i]-'0';printf("%d\n",sum...
绛旓細include<stdio.h>#define N 20void matrx1(int a[][N],int m,int n){int d,x=0,y=0;int right,left,up,down;for(d=1;d<=m*n;d++){a[x][y]=d;right=y<n-1&&a[x][y+1]==0;left=y>0&&a[x][y-1]==0;down=x<m-1&&a[x+1][y]==0;up=x>0&&a[x-1][y...
绛旓細include <stdio.h>//鏈涢噰绾!^_^ int main(void){ int n;int sum=0,i;printf ("please input n:");if (scanf("%d",&n)!=1){ printf("杈撳叆閿欒!");} if(n<=0){ printf("杈撳叆涓嶅悎娉,n鍊煎繀椤诲ぇ浜庣瓑浜1");} for(i=1;i<=n;i++){ sum+=i;} printf("%d\n",sum);return...
绛旓細include <stdio.h>int main(int argc,char *argv[]){ int m,i,n,t,N; printf("Input N(int N>0)...\nN="); if(scanf("%d",&N)!=1 || N<1){ printf("Input error, exit...\n"); return 0; } for(m=0,i=1;i<=N;i++){ for(t=0,n=...
绛旓細a[j]<a[j+1]) { t=a[j]; a[j]=a[j+1]; a[j+1]=t; } for(i=0;i<n;i++) printf("%d\t",a[i]); printf("\n"); return 0; }宸茬粡缁欏嚭绋嬪紡鍟︼紝甯屾湜閲囩撼鐢–璇█杈撳叆3涓鏁存暟锛屾庝箞鎸変粠灏忓埌澶х殑椤哄簭杈撳嚭锛 #include <stdio.h> void f(int* x,...
绛旓細include <stdio.h>void main(){int i,a[1000],n,k=0;scanf("%d",&n);printf("鐢熸垚1000浠ュ唴鐨勯殢鏈鏁: ");for(i=0;i<n;i++){a[i]=("%d",rand()%1000);printf("%d ",a[i]);if(a[i]%2==0) k++;}printf("\n鍏朵腑鍋舵暟鐨勪釜鏁颁负%d",k);} 杩愯绀轰緥锛...
绛旓細include <stdio.h>int gcd(int a, int b);int main(){ int n, a, b, i, maxNum, count=0, flag=0; scanf("%d", &n); while(n--) { scanf("%d", &a); //鐢璇诲埌鐨勭涓涓暟鍒濆鍖杕axNum if (flag == 0) { maxNum = a; flag = 1; ...
