Problem A
题意:
题解:
C++版本一
Problem B
题意:
题解:
C++版本一
Problem C
题意:
题解:
C++版本一
Problem D
题意:
题解:
C++版本一
Problem E
题意:
题解:
C++版本一
Problem F Random Point in Triangle
题意:https://ac.nowcoder.com/acm/contest/881/F
题解:数学+计算几何+逻辑推理
C++版本一
题解:
特例:正三角形
取重心、中点、顶点,则期望为(S为三角形面积)
公式:
/*
*@Author: STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
ll x[3],y[3];
char str;
struct node{};
int main()
{
#ifdef DEBUG
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
//scanf("%d",&t);
while(~scanf("%lld%lld%lld%lld%lld%lld",&x[0],&y[0],&x[1],&y[1],&x[2],&y[2])){
printf("%lld\n",11*labs(x[0]*y[1]-x[1]*y[0]+x[1]*y[2]-x[2]*y[1]+x[2]*y[0]-x[0]*y[2]));
}
#ifdef DEBUG
printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
//cout << "Hello world!" << endl;
return 0;
}
Problem G
题意:
题解:
C++版本一
Problem H
题意:
题解:
C++版本一
Problem I
题意:
题解:
C++版本一
Problem J
题意:
题解:
C++版本一
Problem K
题意:
题解:
C++版本一
Problem L
题意:
题解:
C++版本一
Problem M
题意:
题解:
C++版本一
Problem N
题意:
题解:
C++版本一