网格编程答案

㈠ C语言编程问题，急求答案

使用冒泡的算法，将p后面的n-p-1个元素向前交换p+1次：

#include "stdafx.h"

#include <iostream>

using namespace std;

#define N 1000

int main()

{

int n, p;

int num[N];

cout << "请输入n值和p值：" << endl;

cin >> n >> p;

cout << "请输入" << n << "个数:" << endl;

for (int i = 0; i < n; i++)

cin >> num[i];

for (int i = 0; i <= p; i++)

{

for (int j = 0; j < n - p - 1; j++)

{

int temp = num[p+j-i];

num[p + j-i] = num[p + j + 1-i];

num[p + j + 1-i] = temp;

}

}

for (int i = 0; i < n; i++)

cout << num[i] << " ";

cout << endl;

system("pause");

return 0;

}

㈡ C语言编程，急求答案。。。。

第一个

#include<stdio.h>
#include<math.h>
doublecal(doublee)
{
	intc=1;
	doubleret=0;
	doublecur=1;
	doublet=1;
	while(cur>e)
	{
		ret+=cur;
		c++;
		t*=c;
		cur=1.0/c;
	}
	returnret;
}

intmain()
{
	intn,i;
	doublee;
	printf("inputn:");
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		e=pow(10,-i);
		printf("e=%lgresult=%lg
",e,cal(e));
	}
	return0;
}

第二个

#include<stdio.h>
intcount(char*s,charc)
{
	intret=0;
	inti;
	for(i=0;s[i];i++)
		if(s[i]==c)ret++;

	returnret;
}

voiddelete(char*s,charc)
{
	inti,j;
	for(i=j=0;s[i];i++)
		if(s[i]!=c)s[j++]=s[i];
	s[j]=0;
}

intmain()
{
	charstr[1024];
	charc;
	printf("inputstr:");
	gets(str);
	printf("inputchar:");
	c=getchar();
	printf("count=%d
",count(str,c));
	delete(str,c);
	printf("afterdelete:%s
",str);

	return0;
}

供参考 望采纳