C++
ZhangVeni
好好学习。
展开
-
1110. Complete Binary Tree (25)
题目地址 题目大意:给一棵二叉树,判断是否为完全二叉树,如果是完全二叉树,输出YES和最后一个节点编号,如果不是,输出NO和根节点编号。原创 2016-04-03 17:01:31 · 521 阅读 · 0 评论 -
1097. Deduplication on a Linked List (25)(段错误)
// main.cpp // Dedeplication_on_a_Linked_List // // Created by ZDQ on 16/6/25. // Copyright © 2016年 ZDQ. All rights reserved. //#include <iostream> #include<cstdio> #include<cstdlib> #include <map>原创 2016-07-08 20:37:08 · 636 阅读 · 0 评论 -
1098. Insertion or Heap Sort (25)
#include <iostream> #include<vector> #include<algorithm> using namespace std;void HeapAdjust(vector<int>& numbers, int idx, int length) { // 根结点的序号为0而不是1,所以i结点左孩子和右孩子分别为2i+1和2i+2 for(int i=2*id原创 2016-07-10 16:45:20 · 494 阅读 · 0 评论 -
dll初探
介绍dll原创 2016-03-31 15:32:37 · 362 阅读 · 0 评论 -
1094. The Largest Generation (25)
PAT题目链接 牛客网题目链接 题目大意: 找到节点最多的一层,记录其层数和节点数。原创 2016-04-11 16:05:24 · 644 阅读 · 0 评论 -
1091. Acute Stroke (30)
题目大意:计算连通域的大小,给出一个三维矩阵,先给出一个平面的矩阵依次向上叠加。计算其连通点大于阈值的个数。原创 2016-04-10 18:36:19 · 607 阅读 · 0 评论 -
1090. Highest Price in Supply Chain (25)
Highest Price in Supply Chain原创 2016-04-08 13:44:46 · 325 阅读 · 0 评论 -
1087. All Roads Lead to Rome (30)
All Roads Lead to Rome原创 2016-04-02 16:14:37 · 667 阅读 · 0 评论 -
1111. Online Map (30)
1111原创 2016-04-07 20:51:52 · 775 阅读 · 0 评论 -
1108. Finding Average (20)段错误
The basic task is simple: given N real numbers, you are supposed to calculate their average. But what makes it complicated is that some of the input numbers might not be legal. A “legal” input is a rea原创 2016-03-25 15:54:52 · 562 阅读 · 0 评论 -
1006. Sign In and Sign Out (25)
At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you原创 2016-03-13 16:47:58 · 632 阅读 · 0 评论 -
1005. Spell It Right (20)
Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each input file contains one test case. Each cas原创 2016-03-13 15:57:28 · 675 阅读 · 0 评论 -
1009. Product of Polynomials (25)
#include<cstdio> #include<cstring> #define MAX 2001 int main() { int n1, n2,n3=0;// <10 double p1[MAX]; double p2[MAX]; double p3[MAX]; memset(p1, 0, sizeof(p1)); memset(p2, 0,原创 2017-02-18 11:02:32 · 264 阅读 · 0 评论