C语言编程1、1、1、3、5、9、17. 除去前三项其他项均为该数前三项之和 要求输入第几项然后输出该项的数字 C语言编程“一个数列的前三项为1,2,3,以后各项是其前三项...
\u8bbe\u8ba1c\u8bed\u8a00\u7a0b\u5e8f:1,1,1,3,5,9,17.....\u524d20\u9879\u7684\u548c#include
int main()
{
int a1=1,a2=1,a3=1;
int i,sum=a1+a2+a3;
for( i=4;i<=20;i++ )
{
int a4=a1+a2+a3;
sum+= a4 ;
a1=a2;
a2=a3;
a3=a4;
}
printf("sum=%d\n",sum );
return 0;
}
#includeint main(){int arr[21], i;arr[0] = 1;arr[1] = 2;arr[2] = 3;for(i = 3; i < 20; ++i)arr[i] = arr[i - 1] + arr[i - 2] + arr[i - 3];for(i = 0; i < 20; ++i)printf("%d ", arr[i]);printf("\n");return 0;}
#include <stdio.h>
int main()
{
int p1,p2,p3,p,n,i;
p=p1=p2=p3=1;
scanf("%d",&n);
for(i=4;i<=n;++i){
p=p1+p2+p3;
p1=p2;p2=p3;
p3=p;
}
printf("%d
",p);
getchar();
return 0;
}
#include<stdio.h>
void main() {
int n,t,a0,a1,a2,i;
a0=a1=a2=t=1; scanf("%d",&n);
for ( i=0;i<n-3;i++ ) { t=a0+a1+a2; a0=a1; a1=a2; a2=t; }
printf("%d\n",t);
}
绛旓細include <stdio.h>int main(){int p1,p2,p3,p,n,i;p=p1=p2=p3=1;scanf("%d",&n);for(i=4;i<=n;++i){p=p1+p2+p3;p1=p2;p2=p3;p3=p;}printf("%d\n",p);getchar();return 0;}
绛旓細int main(){int a[30],i;a[0]=a[1]=a[2]=1;for(i=0;i<30;i++){if(i>2)a[i]=a[i-1]+a[i-2]+a[i-3];printf("%9d",a[i]);if(i%6==5)printf("\n");} getch();return 0;}
绛旓細int main(){ int a1=1,a2=1,a3=1;int i,sum=a1+a2+a3;for( i=4;i<=20;i++ ){ int a4=a1+a2+a3;sum+= a4 ;a1=a2;a2=a3;a3=a4;} printf("sum=%d\n",sum );return 0;}
绛旓細鎬濊矾锛氳瀵熸暟鎹寰嬪彲鐭ワ紝鍏堣緭鍑轰竴涓暟1锛鎺ョ潃杈撳嚭2涓暟鏈澶ф暟2閫掑噺鍒1锛屾帴鐫杈撳嚭3涓暟浠3閫掑噺鍒1鈥︹︼紝鎵鏈夊彲浠ラ氳繃涓や釜for寰幆锛屽涓帶鍒舵鏁锛屼竴鍏辫緭鍑5缁勶紝绗簩涓猣or鎺у埗杈撳嚭涓暟銆傚弬鑰冧唬鐮侊細include <stdio.h>int main(){ int i,j; for(i=1;i<=5;++i) { for(j=i;j>=1...
绛旓細绗涓娆2x0+1=1涓暟锛屾渶鍚庝竴涓暟鏄0+1 绗簩娆2x1+1=3涓暟锛屾渶鍚庝竴涓暟鏄1+2 绗笁娆2x2+1=5涓暟锛屾渶鍚庝竴涓暟鏄2+3 澶栧眰寰幆i浠1锛3锛5锛7...涓鐩村鍔狅紝鍐呭眰寰幆浠1鍒癷鎵撳嵃鍑烘潵
绛旓細C璇█婧愮▼搴忓涓嬶細include<stdio.h> int main(){ int array[100]={1,1};//鏂愭尝閭ｅ鏁板垪鍓嶄袱涓厓绱犲潎涓0 int i=0;//寰幆鍙橀噺 int n=20;//鏁板垪闇瑕佹眰鐨勪釜鏁 int sum = 0;//鍜屽彉閲 for(i=2;i<n+1;i++)//鎸夐掓帹鍘熺悊渚濇姹傚嚭鍚庣画鍏冪礌 { array[i]=array[i-1]+array[i-2];/...
绛旓細{ return 1;} else { return fibonacci(n-1) + fibonacci(n-2);} } int main(){ int cond;int i = 1;int max;int val;printf("璇疯緭鍏涓涓暟:");scanf("%d",&cond);max = cond+3;for(i=1; i<max; i++){ val = fibonacci(i);printf("%d ",val);if(val >= cond){ ...
绛旓細鎴戠敤鏈绗ㄧ殑鏂规硶鍐欑殑 缂栬瘧閫氳繃锛堜笉閫氳繃灏辨病澶╃悊浜嗭紒锛侊級浣嗗緢鏈夋晥 浠ｇ爜濡備笅锛歩nclude <stdio.h> include <stdlib.h> main(){ printf(" 1\n");printf(" 123\n");printf(" 12345\n");printf(" 1234567\n");printf("123456789\n");printf(" 4444444\n");printf(" 33333\n");p...
绛旓細if(n<3) return 1; /*鍓嶄袱椤逛负1*/ else return func(n-1)+func(n-2); /*鍚庨潰涓轰箣鍓嶇殑涓ら」涔嬪拰锛岄掑綊鐢ㄦ硶*/}int main(void){ int n=10,i; for(i=1;i<=n:i++){ printf("绗%d椤癸細%d\n",i,func(i)); } return 0;} ...
绛旓細include <STDIO.H> define N 7 main(){ int num[N] = {1, 1}, i;printf ("%d %d ", num[0], num[1]);for (i = 2; i < N; i++){ num[i] = num[i - 1] + num[i - 2];printf ("%d ", num[i]);} } ...
