原创 codeforcs 351 D. Bear and Two Paths

D. Bear and Two Paths time limit per test 2 seconds memory limit per test 256 megabytes input standard input o

原创 codeforcs 351 A. Bear and Game

A. Bear and Game time limit per test 2 seconds memory limit per test 256 megabytes input standard input o

原创 codeforcs 351 C. Bear and Color

C. Bear and Colors time limit per test 2 seconds memory limit per test 256 megabytes input standard input outp

原创 poj 1269 Intersecting Lines

We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will inters

原创 codeforce 350 A. Holidays

A. Holidays time limit per test 1 second memory limit per test 256 megabytes input standard input output

原创 poj 1066 Treasure Hunt

Archeologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-O

原创 poj 2398 Toy Storage

Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They

原创 poj 2653 Pick-up sticks

Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing thro

原创 求關於一條直線的對稱點

已知直線l:a*x+b*y+c=0(a!=0,b!=0)點A(x1,y1),求點關於直線l的對稱點A'. 可以設A'爲(x,y),那麼可知點((x1+x)/2, (y1+y)/2) )在直線l上,且過點A與點A'的直線與l垂直,及斜率的乘

原创 codeforcs 351 B. Problems for Round

B. Problems for Round time limit per test 2 seconds memory limit per test 256 megabytes input standard input o

原创 codeforcs 350 B. Game of Robots

B. Game of Robots time limit per test 1 second memory limit per test 256 megabytes input standard input output

原创 codeforcs 350 C. Cinema

C. Cinema time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standa

原创 poj3304 Segments

Given n segments in the two dimensional space, write a program, which determines if there exists a line such that af

原创 解決Qt WebEngine的dll放到另一個電腦無法使用的情況

最近發現以前弄得關於Qt WebEngine的頁面打包在另一個電腦上運行發現打不開網頁並閃退,一開始是發現少了QtWebEngineProcess.exe,然後跑去qt目錄下找到並且放到打包的下面,然後發現還是運行不了。就各種查找資料最後

原创 vtk 二維愛心的製作

 本文是用vtk來實現的,首先通過公式計算出二維愛心的點,然後利用vtkParametricSpline類來將點連接起來,最後通過建立二維三角剖分然後再加了一些約束就完成啦,效果如下: 實現代碼如下  #include <vtkPol