无为的博客

思路在代码里~~#include <iostream>#include <math.h>#include <string.h>#include <algorithm>#include <queue>#define ll long longusing namespace std;const int N=1e7+10;bool vis[N];int prime[1000000],tot;void init(){ tot=0;

#include <iostream>#include <cstring>#define ll long longusing namespace std;//const int maxn=struct point{ int x,y;};struct node{ point a,b;} pp[5100];int pos[5100];int judge(int x,int y,int mid){ int k=(pp[mid].a.x-x)*(pp[mid]