蒟蒻求助,倒数第二个例子过不去呀,大佬救救我
查看原帖
蒟蒻求助,倒数第二个例子过不去呀,大佬救救我
335860
化身灵蝶子楼主2020/6/6 17:37
#include<stdio.h>
int main()
{
	double a;
	int t, n, of[200000] = { 0 }, i;
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		scanf("%lf%d", &a, &t);
		void flight(double a, int t,int of[]);
		flight(a, t,of);
	}
	void one(int of[]);
	one(of);
	return 0;
}
void flight(double a, int t,int of[])
{
	int i, j,x,y;
	for (i =1; i <= t; i++)
	{
		x = (double)i;
		y = int(a * x);
		if (of[y] == 0)
			of[y] = 1;
		else of[y] = 0;
	}
}
void one(int of[])
{
	int i;
	for (i =0; i < 200000; i++)
	{
		
		if (of[i] == 1)
		{
			printf("%d", i);
			break;
		}	
	}
}
2020/6/6 17:37
加载中...