打卡第十一天

 1 2 3 4可以组成多少个三位数

通过If选择语句筛选出符合条件的

#include <stdio.h>
int main ()
{
	int bai = 0;
	int shi = 0;
	int ge = 0;
	int count = 0;
	for (bai = 1; bai <= 4; bai++)
	{
		for (shi = 1; shi <= 4; shi++)
		{
			for (ge = 1; ge <= 4; ge++)
			{
				if (shi != ge && shi != bai && bai != ge)
				{
					printf("%d%d%d ", bai, shi, ge);
					count++;
				}
			}
		}
	}
	printf("\n个数%d", count);
	return 0;
}

 某个数+100和+268就是某两个数的完全平方

#include <stdio.h>
#include <math.h>
int main()
{
	long long num1 = 0;
	long long num2 = 0;
	long long i = 0;
	for (i = 0; i <= 10000; i++)
	{
		num1 = (long long)sqrt(i + 100);
		num2 = (long long)sqrt(i + 268);
		if (num1 * num1 == i + 100 && num2 * num2 == i + 268)
		{
			break;
		}
	}
	printf("%lld\n", i); 
	return 0;
}