- 博客(55)
- 资源 (1)
- 收藏
- 关注
原创 解决Qt WebEngine的dll放到另一个电脑无法使用的情况
最近发现以前弄得关于Qt WebEngine的页面打包在另一个电脑上运行发现打不开网页并闪退,一开始是发现少了QtWebEngineProcess.exe,然后跑去qt目录下找到并且放到打包的下面,然后发现还是运行不了。就各种查找资料最后找到一篇文章附上链接:https://forum.qt.io/topic/51815/ask-deploy-qtwebengine-on-windows/4说...
2019-09-12 17:00:59 632
转载 vtk 两个窗体不同的物体联动
我有一篇是同一个窗体两个物体的相互控制联动,这次是不同的窗体的,加入了一个回调函数类来控制两个物体行动一致#include <iostream>#include <QCoreApplication>#include <qdir.h>#include <QDebug.h>#include "vtkConeSource.h"#inclu...
2019-07-26 17:43:58 759 2
原创 vtk 二维爱心的制作
本文是用vtk来实现的,首先通过公式计算出二维爱心的点,然后利用vtkParametricSpline类来将点连接起来,最后通过建立二维三角剖分然后再加了一些约束就完成啦,效果如下:实现代码如下#include <vtkPolyData.h>#include <vtkSmartPointer.h>#include <vtkPolyDataMapp...
2019-07-25 18:50:28 606
原创 vs2013+qt5.51+vtk 实现的 双view,显示并联动操作
本文参考了https://blog.csdn.net/Jecklin_online/article/details/82187558的博客,此博客是用vtk实现的,此文是在此基础上增加了qt界面是利用了qt的QVTKWidget来实现的。1.首先我们必须将QVTKWidget加入到Qt Designer,只需找到编译好的vtk的release版本下的QVTKWidgetPlugin.dll,Q...
2018-09-07 12:13:02 2297 2
原创 vs2013+vtk+qt5.51的环境配置
1.安装好vs2013和qt5.51和 qt-vs-addin-1.2.4-opensource和DXSDK_Jun10(安装Visual Studio的时候勾上Windows SDK即可!)2.配置cmake解压cmake-3.10.0-win32-x86.rar文件 进入bin目录,双击cmake-gui 设置"Where is the source code"路径为E:/src/...
2018-09-06 17:45:37 1204
转载 ubuntu16.04安装selenium的艰辛
环境:ubuntu16.04, python2.71,安装(好像是这样安装的)$ sudo pip install selenium查看版本>>> import selenium>>> print selenium.__version__3.9.02,测试[p...
2018-03-03 13:02:42 1842
原创 hihocoder #1110 : 正则表达 区间dp
1110 : 正则表达式题目链接:点击打开链接思路: dp[i][j]为i到j这段中是否符合要求,先把所有的区间标记为不符合,先扫一遍把字符串中是1和0的字符标记为符合,然后在对 *, |,(),按照要求进行检查;代码如下:#includeusing namespace std;#define INF 1000000char s[101];int main(){ in
2017-03-01 19:58:38 310
原创 #1037 : 数字三角形
#1037 : 数字三角形题目链接:点击打开链接思路:从后往前dp就好代码:#includeusing namespace std;int map[101][101];int dp[101][101];int main(){ int n; while(cin >> n) { for(int i = 1;i <= n; i ++) { for(int j
2017-02-28 15:54:59 279
原创 hihocoder #1331 : 扩展二进制数
#1331 : 扩展二进制数 题目链接:点击打开链接思路:从第一位开始推,奇数个第一位就是1,偶数个第一个就是0或2,然后往下推即可代码:#includeusing namespace std;int get(int x){ if(x==0||x==1) return 1; if(x%2) { return get(x/2); } else { return
2017-02-28 15:11:58 527
原创 hihocoder #1318 : 非法二进制数
#1318 : 非法二进制数题目链接:点击打开链接 点击打开链接 点击打开链接思路:简单的dp,算出n位的总数,根据0面可以接1或0,1后面只能接0,公式为dp[i][0] = (dp[i-1][0] + dp[i-1][1])和dp[i][1] = dp[i-1][0]算出符合的个数,ans=总数-合法代码:#includeusing namespace std;cons
2017-02-28 14:49:11 655
原创 hdu 5880 Family View
Family View题目链接:点击打开链接题意:给你n个字符,然后再给你一段文章,要求你使文章中的上面出现的字符变为“*”;例如2abccdeabcdef就会变成*****f套ac自动机模板就好代码:#include#include#include#includeusing namespace std;const int max
2016-09-20 22:17:30 273
原创 Educational Codeforces Round 2 D. Area of Two Circles' Intersection
D. Area of Two Circles' Intersection题目链接:点击打开链接题意:求两个圆的相交面积;思路: 大家都知道两圆的位置关系有五种:①两圆外离 d>R+r ②两圆外切 d=R+r ③两圆相交 R-r<d<R+r(R>r) ④两圆内切 d=R-r(R>r) ⑤两圆内含d<R-r(R>r)按着分类来做即可 我把外切和外离,内切和内含放
2016-09-09 18:04:46 260
原创 HDU 3746 Cyclic Nacklace
Cyclic Nacklac题目链接:点击打开链接题意:给你一个串,求循环节;思路:利用next数组性质来求循环节;代码:#include#includeusing namespace std;char p[100010];int nextk[100100]={0};int n; void makenext(){ int i=1,j=0; nextk[0]=-1;
2016-09-01 18:46:50 260
原创 HDU 2087 剪花布条
剪花布条题目连接:点击打开链接题意:第二个串在第一个串出现的次数(不能重叠)思路 :kmp,当匹配到的时候,往后跳第二个串的长度#include#include#includeusing namespace std;char t[2000],p[2000];int sum;void makenext(char p[],int next[]){ int m,i,k
2016-09-01 18:42:00 223
原创 HDU 1711 Number Sequence
Number Sequence题目链接:点击打开链接题意:有两个串,求第二个串是否存在第一个串中.思路:直接kmp;#include#includeusing namespace std;int nextk[1000100];int t[1000100],q[1000100];int n,m;void makenext(){ int i=0,j=
2016-09-01 18:21:31 212
原创 hdu5858 Hard problem
Hard problem题目链接:点击打开链接题意:求正方形里的一个阴影面积ps:这是一道小学竞赛题思路:我们先求出就ACE和AOE的角度出来然后根据角度求出两个扇形的面积,三角形CAO面积用海伦公式代码如下:#includeusing namespace std;const double pi=3.14159265358979323846;
2016-08-19 13:45:00 519
原创 2016 Multi-University Training Contest 4 Another Meaning
Problem DescriptionAs is known to all, in many cases, a word has two meanings. Such as “hehe”, which not only means “hehe”, but also means “excuse me”. Today, ?? is chating with MeiZi online, Me
2016-07-29 15:26:23 384
原创 2016 Multi-University Training Contest 3 Rower Bo
Rower BoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 867 Accepted Submission(s): 296Special JudgeProblem DescriptionTher
2016-07-27 14:06:24 248
原创 2016 Multi-University Training Contest 2 Eureka
Problem DescriptionProfessor Zhang draws n points on the plane, which are conveniently labeled by 1,2,...,n. The i-th point is at (xi,yi). Professor Zhang wants to know the number of best
2016-07-22 17:12:00 246
原创 2016 Multi-University Training Contest 2 Keep On Movin
Problem DescriptionProfessor Zhang has kinds of characters and the quantity of the i-th character is ai. Professor Zhang wants to use all the characters build several palindromic strings. He a
2016-07-22 11:08:02 170
原创 2016 Multi-University Training Contest 2 Acperience
Deep neural networks (DNN) have shown significant improvements in several application domains including computer vision and speech recognition. In computer vision, a particular type of DNN, known as C
2016-07-22 10:26:25 223
原创 2016 Multi-University Training Contest 2 It's All In The Mind
Problem DescriptionProfessor Zhang has a number sequence a1,a2,...,an. However, the sequence is not complete and some elements are missing. Fortunately, Professor Zhang remembers some properties
2016-07-22 09:32:20 208
原创 2016 Multi-University Training Contest 2 La Vie en rose
Problem DescriptionProfessor Zhang would like to solve the multiple pattern matching problem, but he only has only one pattern string p=p1p2...pm. So, he wants to generate as many as possible pa
2016-07-22 09:28:22 259
原创 codefores 352 C. Recycling Bottles
C. Recycling Bottlestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt was recycling day in Kekoland. To c
2016-05-13 22:03:02 387
原创 codefores 352 D. Robin Hood
D. Robin Hoodtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe all know the impressive story of Robin Hood
2016-05-13 21:57:58 338
原创 codeforcs 351 D. Bear and Two Paths
D. Bear and Two Pathstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBearland has n cities, numbered 1 thr
2016-05-08 15:33:30 367
原创 codeforcs 351 C. Bear and Color
C. Bear and Colorstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBear Limak has n colored balls, arranged
2016-05-08 15:26:08 588
原创 codeforcs 351 B. Problems for Round
B. Problems for Roundtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n problems prepared for the
2016-05-08 15:20:18 627 1
原创 codeforcs 351 A. Bear and Game
A. Bear and Gametime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBear Limak likes watching sports on TV. He
2016-05-08 15:14:48 326
原创 codeforcs 350 C. Cinema
C. Cinematime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoscow is hosting a major international conferenc
2016-05-07 20:31:54 518
原创 codeforcs 350 B. Game of Robots
B. Game of Robotstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn late autumn evening n robots gathered i
2016-05-07 20:24:41 355
原创 codeforce 350 A. Holidays
A. Holidaystime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn the planet Mars a year lasts exactly n days (
2016-05-07 20:15:09 244
原创 求关于一条直线的对称点
已知直线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垂直,及斜率的乘积为-1,可以得到计算公式a*(x+x1)/2+b*(y+y1)/2+c=0 .....公式1a*(y-y1)/(b*(x-x1))=1....公式2
2016-04-12 21:53:00 4277 2
原创 poj 1410 Intersection
You are to write a program that has to decide whether a given line segment intersects a given rectangle. An example: line: start point: (4,9) end point: (11,2) rectangle: left-top: (1,5) r
2016-04-12 21:14:32 371
原创 poj 1066 Treasure Hunt
Archeologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-Ops. Using state-of-the-art technology they are able to determine that the lower floo
2016-04-12 21:09:27 244
原创 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 throwing, Stan tries to find the top sticks, that is these sticks such that there is no
2016-04-12 21:05:04 248
原创 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 intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect
2016-04-12 21:02:33 346
原创 poj3304 Segments
Given n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at least one point
2016-04-12 20:53:04 220
原创 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 gave Reza a rectangular box to put his toys in. Unfortunately, Reza is rebellious an
2016-04-12 20:47:38 188
原创 poj2318 TOYS
Calculate the number of toys that land in each bin of a partitioned toy box.Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. They gave Jo
2016-04-12 20:41:49 247
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人