输入一个正整数n，1＜n≤10,再输入n个整数，将数组的数逆序存放，并输出这组数。样例如下。 输入 输入一个正整数n (1<n≤10),再输入n个整数,将它们存...
\u7f16\u7a0b\u8f93\u5165\u4e00\u4e2a\u6b63\u6574\u6570n\uff0c\u5bfb\u627e\u5c0f\u4e8e\u7b49\u4e8en\u7684\u6570\u4e2d\u56e0\u5b50\u4e2a\u6570\u6700\u5927\u7684\u6570\u3002 \u8f93\u5165\uff1a20 \u8f93\u51fa\uff1a 12\u7684\u56e0\u5b50\u65706\u6700#include
void main()
{
int t,i;
printf("please input the number:");
scanf("%d",&t);
for(i=1;i<t;i++)
{
if((t%i)==0)
printf("%d\n",i);
}
}
#include
#include
int main(void)
{
int n = 0, i;
int min = 0,minpos = 0;
int* a = NULL;
printf("\u8bf7\u8f93\u5165\u4f60\u8981\u8f93\u5165\u591a\u5c11\u6574\u6570\n");
scanf("%d",&n);
a = (int*)malloc(n*sizeof(int));
if(a == NULL) return -1;
printf("\u8bf7\u8f93\u5165\u8fd9%d\u4e2a\u6574\u6570\n",n);
for(i=0; i<n;)
{
scanf("%d",a+i);
if(*(a+i)10)
{
printf("\u91cd\u65b0\u8f93\u5165\n");
}else{
i++;
}
}
min = *a;
for(i=0; i<n; i++)
{
if(*(a+i) < min)
{
min = *(a+i);
minpos = i;
}
}
printf("\u6700\u5c0f\u6570%d,\u4f4d\u7f6e%d\n",min, minpos+1);
*(a+minpos) = *a;
*a = min;
for(i=0; i<n; i++)
{
printf("%d\t",*(a+i));
}
return 0;
}
//\u5f53\u8f93\u5165\u7684\u6570\u53ef\u4ee5\u91cd\u590d\u7684\u65f6\u5019\uff0c\u6682\u65f6\u6ca1\u8003\u8651\u8fd9\u4e2a\uff0c\u9700\u8981\u7684\u8bdd\uff0c\u76f4\u63a5\u4fee\u6539\u5b58\u50a8\u53d8\u91cf\u7684\u4ee3\u7801\u5373\u53ef
int main()
{int n,i,j,t,a[10];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0,j=n-1;i<j;i++,j--)
{t=a[i];a[i]=a[j];a[j]=t;}
for(i=0;i<n;i++)
printf("%d ",a[i]);
printf("\n");
return 0;
}
#include <stdio.h>
void main(){
int i,n,t,a[100];
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n/2;i++)
{t=a[i];a[i]=a[n-i-1];a[n-i-1]=t;}
for(i=0;i<n;i++)
printf("%d ",a[i]);
}
#include<stdio.h>
#define N 256
void main()
{ int i,a[N],n;
scanf("%d",&n); if ( n>N ) n=N;
for ( i=0;i<n;i++ ) scanf("%d",&a[i]);
for ( i=0;i<n;i++ ) printf("%d ",a[n-i-1]);
printf("\n");
}
代码呈上：
void main() {
int n;
int a[n] = {};
scanf("%d
",n);
for (int i = 0; i < n; i++) {
scanf("%d ",&z);
a[i] = z;
}
for (int i = n; i > 0; i--) {
printf("%d ", a[i]);
}
}
答案与问题不符，这里面的n不在二到十之间
绛旓細int main(){int n,i,j,t,a[10];scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",&a[i]);for(i=0,j=n-1;i<j;i++,j--){t=a[i];a[i]=a[j];a[j]=t;} for(i=0;i<n;i++)printf("%d ",a[i]);printf("\n");return 0;} ...
绛旓細printf("璇杈撳叆浣犺杈撳叆澶氬皯鏁存暟\n"); scanf("%d",&n); a = (int*)malloc(n*sizeof(int)); if(a == NULL) return -1; printf("璇疯緭鍏ヨ繖%d涓暣鏁\n",n); for(i=0; i<n;) { scanf("%d",a+i); if(*(a+i)<2 || *(a+i)>10) { printf("閲嶆柊杈撳叆\n"); }else{ i++; } ...
绛旓細include<stdio.h>int main(){int i,n,a[100],max; scanf("%d",&n); for(i=0;i<n;i++) {scanf("%d",&a[i]); if(i==0)max=a[i]; if(max<a[i])max=a[i]; } printf("鏈澶у=%d\n",max); return 0; } ...
绛旓細int main(void){ int a[10];int n,i,min,max,t;printf("Input n: ");scanf("%d",&n);printf("Input %d integers: ",n);for(i=0;i<n;i++)scanf("%d",&a[i]);min=max=0;printf("After swapped: ");for(i=1;i<n;i++){if(a[i]>a[max])max=i;if(a[i]<a[min...
绛旓細1銆杈撳叆涓涓鏁存暟 n (1<n<=10)锛屽啀杈撳叆n 涓暣鏁帮紝杈撳嚭骞冲潎鍊硷紙淇濈暀2 浣嶅皬鏁帮級銆俿um = 0;for(i = 0;i < n;i++){ sum += a[i];} aver=sum*1.0/n;2銆乮ndex = 0;for(i = 1;i < n;i++){ if(a[i] > a[index]){ index = i;} } 鍛介 1 瀵逛簬B=36N+1 褰㈡暟...
绛旓細杈撳叆涓涓鏁存暟n(1<n鈮10),鍐杈撳叆n涓鏁存暟,鎵惧嚭鍏朵腑鐨勭礌鏁,骞跺皢瀹冧滑浠庡ぇ鍒板皬鎺掑簭鍚庤緭鍑 杈撳叆涓涓鏁存暟n(1<n鈮10),鍐嶈緭鍏涓鏁存暟銆傛壘鍑哄叾涓殑绱犳暟,骞朵粠澶у埌灏忔帓搴忋... 杈撳叆涓涓鏁存暟n(1<n鈮10),鍐嶈緭鍏涓鏁存暟銆傛壘鍑哄叾涓殑绱犳暟,骞朵粠澶у埌灏忔帓搴忋 灞曞紑 鎴戞潵绛 ...
绛旓細n; scanf("%d",&n); if ( n>N ) n=N; srand((unsigned int)time(NULL)); for ( i=0;i<n;i++ ) a[i]=rand()%100; for ( i=1;i<n;i++ ) b[i-1]=a[i]-a[i-1]; for ( i=0;i<n-1;i++ ) { printf("%d ",b[i]); if ( i%3==2 )...
绛旓細int main(){int n,i,j,t,a[10];scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",&a[i]);for(i=0;i<n-1;i++)for(j=0;j<n-1-i;j++)if(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 ",a[i]);printf("\n");r...
绛旓細void main(){ int i,j=0,k=0,t,n,min,max,a[10];printf("杈撳叆鏁寸櫨鏁板害鐨勪釜鏁: ");scanf("%d",&n);printf("杈撳叆%d涓暣鏁: ",n);scanf("%d",&a[0]);max=a[0];min=a[0];for(i=1;i<n;i++){ scanf("%d",&a[i]);if(max<a[i]) {max=a[i];j=i;} if(min...
绛旓細include <stdio.h>void main (){ int a[10]; int i,k=0,n,min,temp; printf ("杈撳叆n:"); scanf ("%d",&n); printf ("杈撳叆%d涓暟:\n",n); for (i=0; i<n; i++) scanf ("%d",&a[i]); min = a[0]; for (i=0; i<n; i++) if (min > a[i]) { ...
