C语言学习笔记26

#define _CRT_NO_SECURE_WARNINGS
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <math.h>

int main()
{
	unsigned long pulArray[] = { 6,7,8,9,10 };
	unsigned long* pulPtr;
	pulPtr = pulArray;
	*(pulPtr + 3) += 3;
	printf("%d,%d\n", *pulPtr, *(pulPtr + 3));
	return 0;
}
//6  12

//逆序字符串
void reverse(char* str)
{
	assert(str);
	int len = strlen(str);
	char* left = str;
	char* right = str + len - 1;
	while (left<right)
	{
		char tmp = *left;
		*left = *right;
		*right = tmp;
		left++;
		right--;
	}
}
int main()
{
	char arr[256] = { 0 };
	scanf("%s", arr); //如果要读取空格可以使用gets()读取一行指令
	reverse(arr);
	printf("逆序后的字符串：%s\n", arr);
	return 0;
}


//计算由a组成每一项的前n数位的和
int main()
{
	int a = 0;
	int n = 0;
	scanf("%d%d", &a, &n);
	int sum = 0;
	int i = 0;
	int ret = 0;
	for (i = 1; i <= n; i++)
	{
		ret = ret * 10 + a;
		sum = sum + ret;
	}
	printf("%d\n", sum);
	return 0;
}

//打印水仙花数：一个n位数其各位数字的n次方之和恰好等于该数本身，如：153=1^3+5^3+3^3
int main()
{
	int i = 0;
	for (i = 0; i <= 100000; i++)
	{
		int n = 1;
		int ret = i;
		int tmp = i;
		int sum = 0;
		while (ret/=10)
		{
			n++;
		}
		while(tmp)
		{
			sum += pow(tmp % 10, n);
			tmp /= 10;
		}
		if (i == sum)
		{
			printf("%d  ", i);
		}
	}
	return 0;
}

struct stu
{
	int num;
	char name[10];
	int age;
};
void fun(struct stu* p)
{
	printf("%s\n", (*p).name);
	return 0;
}
int main()
{
	struct stu students[3] = { {9801,"zhang",20},
							   {9802,"wang",19},
							   {9803,"zhao",18}
							 };
	fun(students + 1);
	return 0;
}
//wang