- 博客(17)
- 资源 (13)
- 收藏
- 关注
原创 【笨方法学PAT】对字符串的reverse
一、reversestring s;reverse(s.begin(),s.end());头文件:#include<algorithm>二、代码#include<iostream>#include<string>#include<algorithm>using namespace std;int main() { st...
2018-09-23 23:01:33 144
原创 【笨方法学PAT】1013 Battle Over Cities(25 分)
一、题目It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if ...
2018-09-11 12:31:06 158
原创 【笨方法学PAT】1012 The Best Rank(25 分)
一、题目To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E...
2018-09-11 11:14:57 784 1
原创 【笨方法学PAT】1011 World Cup Betting(20 分)
一、题目With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Afri...
2018-09-11 10:14:41 96
原创 【笨方法学PAT】1010 Radix(25 分)
一、题目Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a binary number.Now for any pair of positiv...
2018-09-11 09:51:17 1699 1
原创 【笨方法学PAT】1009 Product of Polynomials(25 分)
一、题目This time, you are supposed to find A×B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each line contains the i...
2018-09-11 09:43:03 120
原创 【笨方法学PAT】1008 Elevator(20 分)
一、题目The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs...
2018-09-11 09:42:58 176 1
原创 【笨方法学PAT】1007 Maximum Subsequence Sum(25 分)
一、题目Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Subsequence is the continuous sub...
2018-09-11 09:42:52 1193
原创 【笨方法学PAT】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'...
2018-09-10 20:16:39 99
原创 【笨方法学PAT】C++中string scanf读取和printf输出
一、scanfa.resize(100); //需要预先分配空间scanf("%s", &a[0]);头文件:#include<string>二、printfprintf(a.c_str());头文件:#include<string>三、代码#include <iostream>#include <string>...
2018-09-10 20:14:19 691
原创 【笨方法学PAT】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 cas...
2018-09-10 17:39:21 96
原创 【笨方法学PAT】1004 Counting Leaves(30 分)
一、题目1004 Counting Leaves(30 分)A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contai...
2018-09-10 17:04:26 850
原创 【笨方法学PAT】DFS核心思想与模板
一、DFS算法核心思想与难点【核心思想】不撞南墙不回头,参考:解救小哈——DFS算法举例【做题难点】维护变量的个数、什么时候标记、什么时候退出、是否需要保存路径、什么时候回溯,可以看下面的几道典型例题,好好揣摩。二、DFS算法模板void dfs(int step){ 剪枝{ 相应操作 return; } 到达目的地{ 更新数据 } 尝试每一种可能{ 满...
2018-09-10 15:20:00 851
原创 【笨方法学PAT】1003 Emergency(25 分)
一、题目As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and...
2018-09-10 15:12:37 307
原创 【笨方法学PAT】1002 A+B for Polynomials(25 分)
一、题目This time, you are supposed to find A+B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines, and each line contains the i...
2018-09-10 13:55:35 181
原创 【笨方法学PAT】string 与 int 的互相转换
一、string 转 intstoi()函数头文件:#include<string>二、int 转stringto_string()函数头文件:#include<string>三、代码#include<iostream>#include<string>using namespace std;int main() {...
2018-09-10 13:35:03 244
原创 【笨方法学PAT】1001 A+B Format(20 分)
一、题目1001 A+B Format(20 分) Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).Input...
2018-09-10 13:08:31 139
【Java】学生管理系统——Servlet实现,代码和数据库(源代码下载)
2019-10-29
android在线图片浏览器
2018-01-07
chromedriver
2018-01-03
数据挖掘常用数据集 GroupLens_MovieLens 3套数据集
2017-12-30
TensorFlow实战_黄文坚+Tensorflow 实战Google深度学习框架
2017-12-24
【软著查询代码行数Windows】SourceCounter
2017-12-18
msvcp120d .dll、msvcr120d.dll包括32位和64位
2017-12-08
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人