内蒙古大学2016年考研题

#include<bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include<cmath>


using namespace std;
//1.求m到n中所有偶数的和
int  MySum(int m,int n)
{
	int res = 0;
	for(int i = m ; i<=n;i++)
	{
		if(i % 2 == 0)
			res+=i;
	}	
	return res;
} 

int main1()
{	
	cout<<MySum(3,10);
	return 0;
}


//2.编写程序求e的值
int main2()
{
	double e = 1,b;
	long long  a = 1;
	int i = 1;
	while(1)
	{
		a  =  a * i;
		b = 1.0/a;
		e = e+b;
		i++;
		if(b < pow(0.1,6))
			break;
	}
	cout<<"e约等于"<<e<<endl;
	cout<<"第"<<i<<"项小于10^-6"<<endl;
	return  0;
}

//3.杨辉三角
int main3()
{
	int a[100][100];
	int n,i,j;
	cin>>n;
	for(i = 0 ; i < n;i++)
	{
		int l = n - 1 - i;
		while(l)
		{
			printf(" ");
			l--;	
		}
		for(j = 0 ;j <=i;j++)
		{
			if(i ==j || j ==0)
			{
				a[i][j] = 1;
				cout<<a[i][j]<<" ";
			}
			else
			{
				a[i][j] = a[i-1][j] + a[i-1][j-1];
				cout<<a[i][j]<<" ";
			}
		}
		cout<<endl;
	}
	return 0;
} 

//4.对一个m*n矩阵，执行函数后对每行的元素按照升序排列
void pailie(int **a,int m,int n)
{
	for(int i = 0;i<m;i++)
	{
		for(int j = 0;j<n;j++)
		{
			cin>>a[i][j];
		}
	}
	int k = 0;
	while(k < m)
	{
		for(int i = 0 ;i<n;i++)
		{
			for(int j = 0;j<n-1-i;j++)
			{
				if(a[k][j] > a[k][j+1])
				{
					int tmp = a[k][j];
					a[k][j] = a[k][j+1];
					a[k][j+1] = tmp;
				}
			}
		}
		k++;
	}
}

int main4()
{
	
	int m;
	int n;
	int **b;
	cin>>m>>n;
	b = new int*[m];
	for(int i = 0;i<m;i++)
	{
		b[i] = new int[n];
	}
	pailie(b,m,n);
   	for(int i = 0;i<m;i++)
   	{
   		for(int j = 0;j<n;j++)
   		{
   			cout<<b[i][j]<<" ";
		}
		cout<<endl;
	}
	return 0;
}


//5.设计函数  正整数由高位到低位倒序输出
void reverse(int num)
{
	int tmp;
	tmp = num%10;
	cout<<tmp<<" ";
	num = num/10;
	if(num!=0)
		reverse(num);
} 


int main5()
{
	reverse(4892);
	return 0;
}


//6.字符串中含有数字和非数字字符 输入的字符串有多少个整数 
void tongji(string s)
{
	int num = s.length();
	int res = 0;
	int flag  = 0;
	int a[101];
	int j = 0;
	int i = 0;
	for(i = 0;i<num;)
	{
		while(s[i] >='0' && s[i] <='9')
		{
			res = res*10 + s[i] - '0';
			i++;
			flag = 1;
		}
		if(flag ==1)
		{
			a[j++] = res;
			res = 0;
			flag = 0;
		}
		i++;
	}
	i = 0;
	while(i < j)
	{
		cout<<a[i]<<endl;
		i++; 
	}
} 


int main6()
{
	string s = "xy12abdasd46812yiaddh37da12fa9f8f3";
	tongji(s);
}