C进阶

/*
#include<stdio.h>
#include<Windows.h>

unsigned char i = 0;
int main()
{
	for (i = 0; i <= 255; i++)
	{
		printf("hello world\n");
	}
	system("pause");
	return 0;
}死循环
*/

/*
#include<stdio.h>
#include<Windows.h>

int main()
{
	char a[1000];
	int i;
	for (i = 0; i < 1000; i++)
	{
		a[i] = -1 - i;
	}
	printf("%d\n",strlen(a));
	system("pause");
	return 0;
}255
*/

/*凶手问题:
#include<stdio.h>
#include<Windows.h>

void FindKiller()
{
	char killer = 'A';
	for (; killer <= 'D'; killer++){
		if (((killer != 'A') + (killer == 'C') + (killer == 'D') + (killer != 'D')) == 3){
			printf("found you! : %c\n", killer);
		}
	}
}
int main()
{
	FindKiller();
	system("pause");
	return 0;
}*/

/*名次问题:
#include<stdio.h>
#include<Windows.h>

void Game()
{
	int a = 1;
	for (; a <= 5; a++)
	{
		int b = 1;
		for (; b <= 5; b++)
		{
			int c = 1;
			for (; c <= 5; c++)
			{
				int d = 1;
				for (; d <= 5; d++)
				{
					int e = 1;
					for (; e <= 5; e++)
					{
						if (((b == 2) + (a == 3)) == 1 && \
							((b == 2) + (e == 4)) == 1 && \
							((c == 1) + (d == 2)) == 1 && \
							((c == 5) + (d == 3)) == 1 && \
							((e == 4) + (a == 1)) == 1)
						{
							unsigned char flag = 0; 
							flag |= (1 << (a - 1));
							flag |= (1 << (b - 1));
							flag |= (1 << (c - 1));
							flag |= (1 << (d - 1));
							flag |= (1 << (e - 1));
							if (flag == 0x1F)
							{
								printf("a: %d, b: %d, c: %d, d: %d, e: %d\n", a, b, c, d, e);
							}
						}
					}
				}
			}
		}
	}
}

int main()
{
	Game();
	system("pause");
	return 0;
}*/


/*杨辉三角
#include<stdio.h>
#include<Windows.h>

#pragma warning(disable:4996)
void ShowYang(int n)
{
	int arr[10][10];
	int i = 0;
	int j = 0;
	for (; i < n; i++)
	{
		for (j = 0; j <= i; j++)
		{
			arr[i][j] = 1;
		}
	}

	for (i = 2; i < n; i++)
	{
		for (j = 1; j < i; j++)
		{
			arr[i][j] = arr[i - 1][j] + arr[i - 1][j - 1];
		}
	}


	for (i = 0; i < n; i++)
	{
		for (j = 0; j <= i; j++)
		{
			printf("%d ", arr[i][j]);
		}
		printf("\n");
	}
}

int main()
{
	int n ;
	scanf("%d",&n);
	ShowYang(n);
	system("pause");
	return 0;
}*/

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值