上机编程Day01

 1、设N是一个四位数，它的9倍恰好是其反序数，求N的值。

本题考查枚举、反序数问题。

//经典反序数代码：

int remain;

int reverse = 0;

while(n>0){

        remain = n%10;

        n = n/10;

        reverse = reverse*10 + remain;

}

#include<cstdio>
#include<iostream>
using namespace std;
int main(){
	for (int i = 1000; i < 1111; i++)
	{
		int x = i * 9;
		int y = 0;
		while (x>0){
			y = y * 10 + (x% 10);
			x = x / 10;
		}
		if (y == i){
			cout << i<<endl;
		}

	}
	return 0;
}

2、对称平方数（打印所有不超过256，其平方具有对称性质的数，如2和11就是这样的数，因为2*2=4，11*11=121）

本题仍考察的逆序数问题。

#include<cstdio>
#include<iostream>
using namespace std;
int Reverse(int n){
	int reverse=0;
	while (n>0)
	{
		reverse = reverse * 10 + (n % 10);
		n = n / 10;
	}
	return reverse;
}
int main(){
	for (int i = 0; i < 256; i++)
	{
		int j = i*i;
		if (j == Reverse(j)){
			cout << i << endl;
		}
	}

	return 0;
}

3、输入一个高度h，输出一个高度为h、上底边长度为h的梯形。

方法一：

#include<cstdio>
int main(){
	int h;
	scanf("%d", &h);
	for (int i = 0; i < h; i++)
	{
		for (int j = 0; j < 2*h-2-2*i; j++)
		{
			printf(" ");
		}
		for (int z = 0; z < h+2*i; z++)
		{
			printf("*");
		}
		printf("\n");
	}

	return 0;
}

方法二：使用二维数组。

#include<cstdio>
char Array[500][500];
int main(){
	int h;
	scanf("%d", &h);
	for (int i = 0; i < h; i++)
	{
		for (int j = 0; j < 3*h-2; j++)
		{
			Array[i][j] =' ';
		}
		
	}
	int beg = 0;
	for (int i = h-1; i >=0 ; i--)
	{
		for (int j = beg; j < 3 * h - 2; j++)
		{
			Array[i][j] = '*';
		}
		beg = beg + 2;
	}
	for (int i = 0; i < h; i++)
	{
		for (int j = 0; j < 3 * h - 2; j++)
		{
			printf("%c", Array[i][j]);
		}
		printf("\n");
	}

}

4、今天是一年中的第几天。

#include<cstdio>
#include<iostream>
using namespace std;
int main(){
	int year, month, day;	
	int daymon[13] = { -1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
	while(scanf("%d %d %d", &year, &month, &day) != EOF){
		int sumday = 0;
		if (year%400==0 || year%4==0 && year%100!=0)
		{
			daymon[2] = 29;
		}
		else
		{
			daymon[2] = 28;
		}
		for (int i = 1; i < month; i++)
		{
			if (month>1)
			{
				sumday = daymon[i] + sumday;
			}
		}
		sumday = sumday + day;
		cout << sumday << endl;
	}
	return 0;
}

5、知道年份，第几天是几月几号

#include<cstdio>
#include<iostream>
using namespace std;
int main(){
	int day,year;
	int daymon[13] = { -1, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
	while (scanf("%d %d",&year,&day)!=EOF)
	{
		int mon = 1, n = 0;
		if (year % 400 == 0 || year % 4 == 0 && year % 100 != 0)
		{
			daymon[2] = 29;
		}
		else
		{
			daymon[2] = 28;
		}
		for (int i = 0; i < day; i++)
		{
			n++;
			if (n>daymon[mon])
			{		
				mon++;
				n = 1;
				if (mon > 12){
					year++;
					mon = 1;
				}
			}
		}
		printf("%4d-%02d-%02d\n", year, mon, n);
	}

}

6、c++使用库函数中的sort排序。

#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
	int A[101];
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &A[i]);
	}
	sort(A, A + n);
	for (int i = 0; i < n; i++)
	{
		cout << A[i] << " ";
	}
	cout << endl;
	return 0;
}

7、降序使用sort。

#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
//降序
bool comp(int l, int r){
    //第一种：直接return l>r;
    //第二种:
	if (l > r){
		return true;
	}
	else
	{
		return false;
	}
}
int main(){
	int A[101];
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &A[i]);
	}
	sort(A, A + n,comp);
	for (int i = 0; i < n; i++)
	{
		cout << A[i] << " ";
	}
	cout << endl;
	return 0;
}

8、整数奇偶排序，输入10个整数，重新排序，先输出奇数再输出偶数，奇数从大到小排序，偶数从小到大排序。

#include<algorithm>
#include<cstdio>
#include<iostream>
using namespace std;
bool comp(int l, int r){
	if (l % 2 != 0 && r % 2 == 0 ){
		return true;
	}
	else if (l%2!=0&&r%2!=0&&l>r)
	{
		return true;
	}
	else if (r%2==0&& l%2==0&&l<r)
	{
		return true;
	}
	return false;
}
int main(){
	int A[10];
	for (int i = 0; i < 10; i++)
	{
		scanf("%d", &A[i]);
	}
	sort(A, A + 10, comp);
	for (int i = 0; i < 10; i++)
	{
		cout << A[i] << " ";
	}
	cout << endl;
	return 0;
}

9、输入任意（用户名、成绩）序列，可以获得成绩从高到低或从低到高的排列，相同成绩都按先录入者排列在前。输入排序方法，0降序，1升序。

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<string>
using namespace std;
struct Student
{
	char name[20] ;
	int grade;
	int flag;
};
bool comp1(Student l, Student r){
	if (l.grade < r.grade){
		return true;
	}
	else if(l.grade == r.grade && l.flag<r.flag)
	{
		return true;
	}
	return false;
}
bool comp2(Student l, Student r){
	if (l.grade > r.grade){
		return true;
	}
	else if (l.grade == r.grade && l.flag<r.flag)
	{
		return true;
	}
	
	return false;
}
int main(){
	Student Stu[100];
	int n,p;
	while (scanf("%d", &n) != EOF){
		Stu[0].flag = 0;
		cout << "请输入学生姓名和成绩";
		for (int i = 0; i < n; i++)
		{
			scanf("%s %d", Stu[i].name, &Stu[i].grade);
			Stu[i].flag++;
		}
		cout << "输入0降序，1升序";
		scanf("%d", &p);

		if (p == 0)
		{
			sort(Stu, Stu + n, comp2);
			for (int i = 0; i < n; i++)
			{
				printf("%s %d\n", Stu[i].name, Stu[i].grade);
			}
		}
		else
		{
			sort(Stu, Stu + n, comp1);
			for (int i = 0; i < n; i++)
			{
				printf("%s %d\n", Stu[i].name, Stu[i].grade);
			}
		}

	}
	
	
	return 0;
}

10、利用map，查找某个数，查到了返回yes，否则返回no。

#include<cstdio>
#include<map>
#include<iostream>
using namespace std;
int main(){
	map<int, int> mymap;
	int arr[100];
	int n,m;
	cout << "请输入个数:";
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);
		mymap[arr[i]] = i;
	}
	cout << "查找个数：";
	scanf("%d", &m);
	for (int i = 0; i < m; i++){
		int findNum;
		cout << "要查找的元素是：";
		scanf("%d", &findNum);
		if (mymap.find(findNum) == mymap.end())
		{
			cout << "NO" << endl;
		}
		else
		{
			cout << "YES" << endl;
		}
		
	}
	return 0;
}

11、 求单链表结点的阶乘和。

typedef struct Node *PtrToNode;
struct Node {
    int Data; /* 存储结点数据 */
    PtrToNode Next; /* 指向下一个结点的指针 */
};
typedef PtrToNode List; /* 定义单链表类型 */

int FactorialSum( List L ){
    int sum=0;
    int temp=1;
    while(L !=NULL){
        for(int i=1;i<=L->Data;i++){
            temp=temp*i;
        }        
        sum=sum+temp;
        L=L->Next;
        temp=1;
    }
    return sum;
}