疯狂的指针

未归档

C/C++(10) c语言(1) git(1) Git教程(2) IO模型(1) leetcode(18) LeetCode题解(3) Linux(7) PLC(3) Python(7) socket(1) 中国(2) 其他(1) 冒泡排序(1) 动态规划(6) 回溯法(1) 回溯法基础(3) 快速排序(1) 接口(2) 数据结构(5) 树状数组(1) 浙大PAT-A题目集(30) 浙大PAT-B题目集(23) 深入学习C++(14) 生物(1) 程序员升职记(10) 笔试(2) 经济学人(6) 英语学习(1) 读书笔记(3) 谷歌(1)

/ 注册

全部文章 / 未归档（共187篇）

PAT-A 1085. Perfect Sequence

1085. Perfect Sequence Given a sequence of positive integers and another positive integer p. The sequence is said to be a “perfect sequence” if M <...

2016-08-03

0 478

PAT-B 1034. 有理数四则运算

本题要求编写程序，计算2个有理数的和、差、积、商。输入格式：输入在一行中按照“a1/b1 a2/b2”的格式给出两个分数形式的有理数，其中分子和分母全是整型范围内的整数，负号只可能出现在分子前，分母不为0。输出格式：分别在4行中按照“有理数1 运算符有理数2 = 结果”的格式顺序输...

2016-08-03

0 483

PAT-B 1050.螺旋矩阵

1.题目描述本题要求将给定的N个正整数按非递增的顺序，填入“螺旋矩阵”。所谓“螺旋矩阵”，是指从左上角第1个格子开始，按顺时针螺旋方向填充。要求矩阵的规模为m行n列，满足条件：m*n等于N；m>=n；且m-n取所有可能值中的最小值。输入格式：输入在第1行中给出一个正整数N，第2行给...

2016-08-02

0 400

PAt-A 1065. A+B and C(64bit)

Given three integers A, B and C in [-263, 263], you are supposed to tell whether A+B > C. Input Specification: The first line of the input gives ...

2016-08-01

0 404

PAT-A 1049. Counting Ones

The task is simple: given any positive integer N, you are supposed to count the total number of 1’s in the decimal form of the integers from 1 to N. F...

2016-08-01

0 502

PAT-A 1058. A+B in Hogwarts

If you are a fan of Harry Potter, you would know the world of magic has its own currency system – as Hagrid explained it to Harry, “Seventeen silver S...

2016-07-31

0 421

PAT-A 1036. Boys vs Girls

This time you are asked to tell the difference between the lowest grade of all the male students and the highest grade of all the female students. In...

2016-07-31

0 369

PAT-A 1029. Median

Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, a...

2016-07-31

0 351

PAT-B 1044. 火星数字

火星人是以13进制计数的：地球人的0被火星人称为tret。地球人数字1到12的火星文分别为：jan, feb, mar, apr, may, jun, jly, aug, sep, oct, nov, dec。火星人将进位以后的12个高位数字分别称为：tam, hel, maa...

2016-07-30

0 416

【动态规划】钢条切割问题

问题描述参见《算法导论》第十五章动态规划，下面给出程序代码： #include<stdio.h> int max(int a,int b); int calc(int p[],int n); int p[11]={0,1,5,8,9,10,17,17,20,24,30};//p[i]...

2016-07-29

0 514