CCF CSP202006-1线性分类器#include<iostream>#include<vector>using namespace std;const int maxn = 1010;struct Point{ int x,y;}point;vector<Point>A,B;int main(){ int n,m; cin>>n>>m; for(int i = 0; i < n; i++){ char c;
摘要由CSDN通过智能技术生成
CCF CSP202006-1线性分类器
#include<iostream>#include<vector>usingnamespace std;constint maxn =1010;struct Point{
int x,y;}point;
vector<Point>A,B;intmain(){
int n,m;
cin>>n>>m;for(int i =0; i < n; i++){
char c;
cin>>point.x>>point.y>>c;if(c
CCF CSP202006-1线性分类器#include<iostream>#include<vector>using namespace std;const int maxn = 1010;struct Point{ int x,y;}point;vector<Point>A,B;int main(){ int n,m; cin>>n>>m; for(int i = 0; i < n; i++){ char c;