![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
2021
Linear Algebra and Geometry
这个作者很懒,什么都没留下…
展开
-
超详细,绝对能解决Cannot run program “D:\...\venv\Scripts\python.exe“ (in directory ): CreateProcess error=2
问题表现原因移动了project的位置,python解释器(即图中的Python Interpreter)的位置也跟着移动了,原本的解释器路径失效了解决方法修改python解释器的位置为移动后的位置①File->Settings->Project->Python Interpreter->Show All②Edit(点击那只笔)->将Interpreter path改为新路径(不会找的话,可以找找项目路径下venv文件夹,在里面找到Scripts\python原创 2021-11-15 16:12:39 · 25332 阅读 · 6 评论 -
1098 Insertion or Heap Sort (25 分) +测试要点
题目描述1098 Insertion or Heap Sort (25 分)According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, finds the locati原创 2021-09-08 16:01:25 · 236 阅读 · 0 评论 -
1107 Social Clusters (30 分) + 测试要点
题目描述1107 Social Clusters (30 分)When register on a social network, you are always asked to specify your hobbies in order to find some potential friends with the same hobbies. A social cluster is a set of people who have some of their hobbies in common. Yo原创 2021-09-06 17:09:04 · 160 阅读 · 0 评论 -
1066 Root of AVL Tree (25 分) + 测试要点
题目描述1066 Root of AVL Tree (25 分)An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this原创 2021-09-03 01:06:49 · 262 阅读 · 0 评论 -
1043 Is It a Binary Search Tree (25 分) + 测试注意点
题目描述:A Binary Search Tree (BST) is recursively defined as a binary tree which has the following properties:The left subtree of a node contains only nodes with keys less than the node’s key.The right subtree of a node contains only nodes with keys greate原创 2021-09-06 17:05:58 · 319 阅读 · 0 评论 -
1053 Path of Equal Weight (30 分) + 容易忽略的测试测试点
题目描述:1053 Path of Equal Weight (30 分)Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum of the weights of all the nodes along the path from R to any leaf node L原创 2021-08-31 21:29:17 · 401 阅读 · 3 评论 -
codeup - B: 数制转换 - 给出个人错误原因和测试数据
AC代码错误原因:char num[400];和char res[500];最初大小分别是40和50,不够大#include<stdio.h>#include<string.h>int main(){ int a,b; char num[400]; while(scanf("%d%s%d",&a,num,&b)!=EOF) { char res[500]; long c=0; int len=strlen(num); //print原创 2021-03-08 21:18:58 · 89 阅读 · 0 评论 -
codeup - A: 又一版 A+B - 不用数组存储而是直接输出&&给出测试数据
AC代码#include <iostream>#include<cstdio>#include<algorithm>#include<math.h>#include<stdlib.h>using namespace std;int main(){ long long int a,b; int m; while(cin>>m) { if(m==0) break;原创 2021-03-01 22:47:41 · 71 阅读 · 0 评论 -
codeup - 打印日期 - 给出测试数据
AC代码// 以及需要的头文件int main(){ int m,n; while(cin>>m>>n){ int leap=isLeap(m); int i,d=0; for(i=1;;i++) { n=n-month[i][leap]; if(n<=0) { d=n+month[i][leap];原创 2021-02-18 20:09:19 · 78 阅读 · 0 评论 -
codeup - 入门模拟->日期处理 - 人间大迷惑
ac代码#include <iostream>#include<cstdio>#include<algorithm>#include<math.h>#include<cstring>#include<time.h>using namespace std;/*2013010120130105201302052013010120000101200101052013010120140105*/int原创 2021-02-17 21:35:34 · 78 阅读 · 0 评论