Fruit Ninja（随机数rand()）

链接：https://www.nowcoder.com/acm/contest/163/A
来源：牛客网

题目描述

Fruit Ninja is a juicy action game enjoyed by millions of players around the world, with squishy,
splat and satisfying fruit carnage! Become the ultimate bringer of sweet, tasty destruction with every slash.
Fruit Ninja is a very popular game on cell phones where people can enjoy cutting the fruit by touching the screen.
In this problem, the screen is rectangular, and all the fruits can be considered as a point. A touch is a straight line cutting
thought the whole screen, all the fruits in the line will be cut.
A touch is EXCELLENT if $\frac{M}{N}$ ≥ x, (N is total number of fruits in the screen, M is the number of fruits that cut by the touch, x is a real number.)
Now you are given N fruits position in the screen, you want to know if exist a EXCELLENT touch.

输入描述:

The first line of the input is T(1≤ T ≤ 100), which stands for the number of test cases you need to solve.
The first line of each case contains an integer N (1 ≤ N ≤ 1e4) and a real number x (0 < x < 1), as mentioned above.

The real number will have only 1 digit after the decimal point.
The next N lines, each lines contains two integers xi and yi(-1e9≤ xi,yi≤ 1e9),denotes the coordinates of a fruit.

输出描述:

For each test case, output "Yes" if there are at least one EXCELLENT touch. Otherwise, output "No".

输入例子:

输出例子:

Yes

No

-->

示例1

输入

复制

输出

复制

Yes

No

第一次做题用到随机数，蒟蒻
用不用srand应该都差不多
题意是给你n个点 是否满足一条线上有m个点 m/n>=x,随机数枚举

 #include<bits/stdc++.h>

 using namespace std;

 const int maxn = 1e4+;

 struct Node

 {

     int x,y;

 } node[maxn];

 int main()

 {

     int t;

     scanf("%d",&t);

     while(t--)

     {

         int n;

         double x;

         int cnt = ;

         int flag = ;

         scanf("%d%lf",&n,&x);

         for(int i=; i<n; i++)

         {

             scanf("%d%d",&node[i].x,&node[i].y);

         }

         srand(time());

         for(int i=; i<; i++)

         {

             int a = rand()%n;

             int b = rand()%n;

             if(a == b)continue;

             cnt = ;

             for(int j=; j<n; j++)

             {

                 if((node[a].x-node[j].x)*(node[b].y-node[j].y) == (node[b].x-node[j].x)*(node[a].y-node[j].y))

                     cnt++;

             }

             if(cnt >= x * n)

             {

                 flag = ;

                 break;

             }

         }

         if(flag)printf("Yes\n");

         else printf("No\n");

     }

 }

巴特西