[CSP-J 2023] 小苹果【民间数据】C语言50分,求指点
  • 板块学术版
  • 楼主0x18B
  • 当前回复7
  • 已保存回复7
  • 发布时间2023/10/23 20:58
  • 上次更新2023/11/2 11:40:02
查看原帖
[CSP-J 2023] 小苹果【民间数据】C语言50分,求指点
398783
0x18B楼主2023/10/23 20:58
#include<stdio.h>
#define max 10000
int main()
{
	void mas(int apple[], int n);
	int n = 0, apple[max] = { 0 }, sum = 0, m = 0;
	scanf_s("%d", &n);
	for (int i = 0; i < n; i++)
	{
		apple[i] = i + 1;
	}
	while (apple[0] != 0)
	{
		for (int i = 0; i < n; i+=3)
		{
			if (apple[i] == n)m=sum+1;
			apple[i] = 0;

		}
		mas(apple, n);
		sum++;
	}
	printf("%d %d", sum, m);
	return 0;
}
void mas(int apple[], int n)
{
	for (int i = 0; i < n; i++)
	{
		for (int j = i; j < n; j++)
		{
			if (apple[i] == 0 && apple[j] != 0)
			{
				apple[i] = apple[j];
				apple[j] = 0;
			}
		}
	}
}
2023/10/23 20:58
加载中...