用C语言编程求1、2、3到n的全排列 C语言。。。把一个数组里的数字（均为一位）全排列，（例如1，...
\u7528C\u8bed\u8a00\u5199\u4e00\u4e2a\u7a0b\u5e8f\uff0c\u8f93\u5165\u4e00\u4e2a\u6574\u6570n\uff0c\u8f93\u51fa1,2,3,4.\u2026\u2026n\u7684\u5168\u6392\u5217#include
#include
char string[9]="12345678";
int used[9]={0};
char output[9];
int length;
void F(int d)
{
int i;
for(i=0;i<=length;i++)
{
if(!used[i])
{
used[i]=1;
output[d]=string[i];
if(d==length)
{
for(d=0;d<length;d++)
printf("%c ",output[d]);
printf("%c\n",output[length]);
}
else
F(d+1);
used[i]=0;
}
}
}
int main(void)
{
int n;
scanf("%d",&n);
string[n]=0;
length=strlen(string)-1;
F(0);
return 0;
}
\u001a
\u8003\u8651\u8f93\u51fa\u901f\u5ea6\u95ee\u9898,\u6700\u591a\u652f\u63018\u4e2a\u6570\u5b57,\u9700\u8981\u66f4\u591a\u81ea\u5df1\u6539\u76f8\u5e94\u7684\u6570\u636e
#include int data[] = {1,2,3,4};int n = sizeof(data)/sizeof(data[0]);int used[20];int print(){ int i,j; for(i=1;in) { print(); return 0; } int i = 0; for(i=0;i<n;i++) { if(!used[i]) { used[i]=p; dfs(p+1); used[i]=0; } }}int main(){ dfs(1); }
#include <stdio.h>int main()
{
int n, nn;
printf("input a number: ");
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
{
nn = 1;
for (int j = 1; j <= i; ++j)
{
nn = nn * j;
}
printf("%d! = %d\n", --j, nn);
}
return 0;
}
#include
int
main()
{
int
n,
nn;
printf("input
a
number:
");
scanf("%d",
&n);
for
(int
i
=
1;
i
<=
n;
++i)
{
nn
=
1;
for
(int
j
=
1;
j
<=
i;
++j)
{
nn
=
nn
*
j;
}
printf("%d!
=
%d\n",
--j,
nn);
}
return
0;
}
这个只支持数字,字母的不支持
#include
#define
maxn
100
int
a[maxn]
=
{0};
int
flag[maxn]
=
{0};
void
comb(int
m,int
s)
{
int
i;
if
(s>=m)
{
for
(i=0;i
评论
0
0
加载更多
什么叫全排列？
全排列不就是阶乘吗?
绛旓細printf("%d\n"锛宻um)锛況eturn 0锛泒 渚嬪锛歩nclude <stdio.h> /* 閫氳繃閫掑綊璁＄畻涓涓暟鐨勫洖闃朵箻 */ int factorial(int num){ if (num==1)return 1锛沞lse return (num * factorial(num - 1))锛泒 int main(){ int i锛宯锛沴ong sum = 1锛泂canf("%d"锛&n)锛沠or (i = 2锛沬 <= n...
绛旓細int[n]; a[0] = a[1] = 1; for (int i = 2; i < n; i++) a[i] = a[i - 1] + a[i - 2]; return new FibonacciNumberResult() { a = a[n - 1], S = a.Sum() }; }
绛旓細include <stdio.h>int main(void){ int i,n,sum=0; printf("璇疯緭鍏涓涓ぇ浜3鐨勬鏁存暟锛"); scanf("%d",&n); for(i=1;i<=n;i++) sum=sum+i; printf("1+2+3+...+%d=%d\n",n,sum); return 0;} ...
绛旓細1 杈撳叆n銆2 瀵1~n杩涜閬嶅巻锛屽鏋滆兘琚3鎴5鏁撮櫎锛屽垯绱姞鍒扮粨鏋滀笂銆3 杈撳嚭缁撴灉銆備唬鐮 int main(){ int n,s = 0; int i; scanf("%d",&n); for(i = 1; i <= n; i ++) if(i%3==0 || i % 5 == 0) s+=i; printf("%d\n",s);} ...
绛旓細int bEven(int num){return num%2?0:num;} int main(){ int i = 0, sum = 0;for (i=0; i<=100; i++){ sum += bEven(i);} printf("100浠ュ唴(鍚100)鍋舵暟鍜屼负%d\n", sum);return 0;} 涓銆C璇█姹1鍒100鍋舵暟鍜锛岀紪绋杈撳嚭姹傚拰缁撴灉(鐢╠o鈥hile)main(){ int i=1,sum=0;...
绛旓細nums[i]=nums[i-1]+nums[i-2];result+=nums[i];} return result;} main()//姹傚墠n椤圭殑鍜锛宯浠庨敭鐩樿緭鍏 { int n,n_time;cout<<"please input the num"<<endl;cin>>n;n_time=GetTickCount();nums[0]=1;nums[1]=1;f1(n);cout<<result<<endl;cout<<"鑰楁椂"<<GetTickCount()-n...
绛旓細scanf("%d",&n);}while(n<1);for(i=1;i<=n;i++){ m=1;for(j=1;j
绛旓細/*鐢╟璇█缂栧啓绋嬪簭 杈撳叆涓涓鏁存暟n锛屾眰1鍒皀鐨鏁颁腑1鍑虹幇鐨勪釜鏁*/ include"stdio.h"int count(int n){ int i,j,c=0;for(i=1;i<=n;i++){ j=i;while(j!=0){ if(i%10==1) /*鍒ゆ柇浣嶆暟涓槸鍚︽湁1*/ { c++;} j=j/10; /*璁╂暟闄や互鍗佽浠栧師鏉ョ殑楂樹綅鍙樹负浣庝綅锛屽嵆鍘熸潵鐨勫崄浣...
绛旓細i;// 澹版槑鏁村瀷鏁扮粍鎸囬拡鍙橀噺int *array;printf("input n: ");scanf("%d", &n);// 鍒涘缓闀垮害涓n鐨鏁扮粍array = (int *)malloc(n * sizeof(int));// 璧嬪煎苟杈撳嚭for(i = 0; i < n; i++){array[i] = i + 1;printf("%d ", array[i]);}printf("\n");return 0;} ...
绛旓細绗竴浜琛屼唬鐮侊細int i,j,n;long int t=1,sum=0;//瀹氫箟浜嗕笁涓暣鏁板瀷锛堢煭鏁村瀷锛夌殑鍙橀噺锛屽畾涔変袱涓暱鏁存暣鍨嬪彉閲忓苟鍒濆鍖栥傜涓夎浠ｇ爜锛歱rintf("input n:",&n);//鎻愮ず杈撳叆銆傜鍥涜浠ｇ爜锛歴canf("%d",&n);鍒╃敤scanf锛堬級鍑芥暟杈撳叆n銆傜浜旇浠ｇ爜锛歠or (i=1;i<=n;i++)//杩涘叆for寰幆锛屽閮...
