PAT-A
ZhangVeni
好好学习。
展开
-
1110. Complete Binary Tree (25)
题目地址 题目大意:给一棵二叉树,判断是否为完全二叉树,如果是完全二叉树,输出YES和最后一个节点编号,如果不是,输出NO和根节点编号。原创 2016-04-03 17:01:31 · 526 阅读 · 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 · 642 阅读 · 0 评论 -
1009. Product of Polynomials (25)
#include<cstdio>#include<cstring>#define MAX 2001int 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 · 268 阅读 · 0 评论 -
1011. World Cup Betting (20)
#include<cstdio>#include<algorithm>using namespace std;int main(){ char c3[4] ="WTL"; double w, t, l; double sum = 1; for (int i = 0; i < 3; i++) { scanf("%lf%lf%lf", &w原创 2017-02-18 12:28:06 · 263 阅读 · 0 评论 -
1036. Boys vs Girls (25)
#include<cstdio>#include<algorithm>using namespace std;struct person { char name[11]; char id[11]; char gender; int grade;}M,F,temp;int main(){ M.grade = 101; F.grade = -1原创 2017-02-18 20:12:41 · 323 阅读 · 0 评论 -
1031. Hello World for U (20)
#include<cstdio>#include<cstring>int main(){ char str[100]; scanf("%s", str); int len = strlen(str); int n1 = (len + 2) / 3, n2 = n1, n3 = len - n1 - n2; for (int i = 0; i < n1-1原创 2017-02-19 10:57:22 · 324 阅读 · 0 评论 -
1019. General Palindromic Number (20)
#include<cstdio>int main(){ int deci, base, s[64] = { 0 }, i = 0, flag = 1; scanf("%d%d", &deci, &base); while (deci != 0) { s[i++] = deci%base; deci /=base; }原创 2017-02-19 11:41:56 · 449 阅读 · 0 评论 -
1027. Colors in Mars (20)
#include<cstdio>int main(){ int r, g, b; char s[14] = "0123456789ABC"; scanf("%d%d%d", &r, &g, &b); printf("#"); printf("%c%c", s[r/13], s[r%13]); printf("%c%c", s[g/13], s[g%原创 2017-02-19 12:19:29 · 288 阅读 · 0 评论 -
1058. A+B in Hogwarts (20)
#include<cstdio>int main(){ long long int s1, k1, g1, s2, k2, g2; scanf("%lld.%lld.%lld", &g1, &s1, &k1); scanf("%lld.%lld.%lld", &g2,&s2, &k2); long long int s = s1 + s2, k = k1 + k原创 2017-02-19 15:24:06 · 340 阅读 · 0 评论 -
1035. Password (20)
#include<cstdio>#include<cstring>struct Info{ char name[11]; char psw[11]; bool isChanged;}node[1001];int main(){ int n,m=0,tem; scanf("%d",&n); tem = n; while (n--)原创 2017-02-21 11:55:15 · 452 阅读 · 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 · 498 阅读 · 0 评论 -
1096. Consecutive Factors (20)
求最大连续因子数和其中的最小因子序列。原创 2016-04-22 13:49:36 · 514 阅读 · 0 评论 -
1094. The Largest Generation (25)
PAT题目链接 牛客网题目链接 题目大意: 找到节点最多的一层,记录其层数和节点数。原创 2016-04-11 16:05:24 · 649 阅读 · 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 · 680 阅读 · 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 · 636 阅读 · 0 评论 -
1002. A+B for Polynomials (25)
1002. A+B for Polynomials (25)原创 2016-02-29 18:19:52 · 530 阅读 · 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 · 566 阅读 · 0 评论 -
1111. Online Map (30)
1111原创 2016-04-07 20:51:52 · 778 阅读 · 0 评论 -
1087. All Roads Lead to Rome (30)
All Roads Lead to Rome原创 2016-04-02 16:14:37 · 672 阅读 · 0 评论 -
求助:1109. Group Photo (25)(两个案例未通过)
两个案例未通过原创 2016-03-26 19:30:57 · 528 阅读 · 0 评论 -
1090. Highest Price in Supply Chain (25)
Highest Price in Supply Chain原创 2016-04-08 13:44:46 · 332 阅读 · 0 评论 -
1091. Acute Stroke (30)
题目大意:计算连通域的大小,给出一个三维矩阵,先给出一个平面的矩阵依次向上叠加。计算其连通点大于阈值的个数。原创 2016-04-10 18:36:19 · 611 阅读 · 0 评论 -
1077. Kuchiguse (20)
#include<cstdio>#include<cstring>char s[100][257];int main(){ int n, max = -1; scanf("%d", &n); getchar(); int nn = n; while (n--) { gets(s[n]); } int len =原创 2017-02-21 13:40:05 · 381 阅读 · 0 评论