![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Pat
文章平均质量分 65
寻MEa
你要的明天,定会如约而至
展开
-
pat水题
自以为对二进制有很深的理解,面对这种水题,切了好久。。。题目链接#include #include typedef long long ll;bool compare(ll a, ll b, ll c)//防止大数相加溢出{if (a > 0 && b > 0){if (a > LLONG_MAX - b)return true;}if原创 2017-06-18 12:41:50 · 274 阅读 · 0 评论 -
pat stack模拟,老超时wa......
#include #include #include #include #include using namespace std;class st{private:vector vec;public:st(){};~st(){};void pop(){if (vec.size() == 0){printf("%s\n", "Inv原创 2017-06-18 22:47:30 · 202 阅读 · 0 评论 -
pat水题
题目链接int main(){char a[100], b[100];int a1, b1, c1, a2, b2, c2,a3,b3,c3;scanf("%d.%d.%d", &a1, &b1, &c1);scanf("%d.%d.%d", &a2, &b2, &c2);int ca1, ca2;//表示进位c3 = (c1 + c2) % 29;ca1 =原创 2017-06-19 22:39:31 · 143 阅读 · 0 评论 -
pat 精度问题
点击打开链接老TLE,可以看出浮点运算的复杂程度远大于整数运算。怎么优化。。。int main(){float f1, f2;int dignum;scanf("%d", &dignum);scanf("%f %f", &f1, &f2);float t1 = f1, t2 = f2;int count1 = 0, count2 = 0;while (t原创 2017-06-20 13:06:09 · 260 阅读 · 0 评论 -
count the pat
counting the patint main(){int p=0, pa=0, pat = 0;char s[100000] = { 0 };scanf("%s", s);int i = 0;while (s[i]!=0){switch (s[i]){case 'P':p++;break;case 'A':pa += p;pa原创 2017-06-20 21:37:25 · 165 阅读 · 0 评论 -
pat 中求解最长回文串的长度
本以为暴力枚举会超时,但竟然过了。。。#include #include #include int longestPalindrome(string s) {int left = 0, right = s.length() - 1;//为奇数时int len1 = 0;int len2 = 0;int start1 = left;//标记起始点int sta原创 2017-06-20 22:26:38 · 209 阅读 · 0 评论 -
Word_ladder
题目链接参考了大神的代码#include #include class Solution {public:void gen_path(unordered_map>& father, vector& path, string start, string word,vector>& ret){path.push_back(word);if (start == w原创 2017-06-20 22:42:34 · 170 阅读 · 0 评论 -
PAT题目 有几个PAT(25)
题目链接有点动态规划的味道。#include int main(){char s[100];int p=0, pa=0, pat=0;scanf("%s", s);int len = strlen(s);for (int i = 0; i {switch (s[i]){case 'p':p += 1;break;case 'a':原创 2017-06-24 23:27:40 · 325 阅读 · 0 评论