PAT 1152 Google Recruitment （20 分）- 甲级

柳婼

已于 2023-11-09 14:58:04 修改

阅读量5.6k

点赞数 11

文章标签： c++ 算法图论

于 2018-12-12 14:58:34 首次发布

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接：https://blog.csdn.net/liuchuo/article/details/84973085

版权

In July 2004, Google posted on a giant billboard along Highway 101 in Silicon Valley (shown in the picture below) for recruitment. The content is super-simple, a URL consisting of the first 10-digit prime found in consecutive digits of the natural constant e. The person who could find this prime number could go to the next step in Google’s hiring process by visiting this website.

The natural constant e is a well known transcendental number（超越数）. The first several digits are: e = 2.718281828459045235360287471352662497757247093699959574966967627724076630353547594571382178525166427427466391932003059921… where the 10 digits in bold are the answer to Google’s question.

最低0.47元/天解锁文章

博客等级

码龄9年

1632
原创

8624
点赞

9990
收藏

1万+
粉丝

关注

私信

热门文章

最新评论

1076. Wifi密码 (15)-PAT乙级真题
柠石榴: 没有柳神这么强的思路，还是用的n [code=cpp] #include<bits/stdc++.h> using namespace std; int main(){ int n; cin >> n; cin.ignore(); while (n --){ string s; getline(cin, s); for (int i = 0; i < s.size(); i ++) if (s[i] == 'T') cout << s[i - 2] - 'A' + 1; } return 0; } [/code]
PAT 1067. 试密码(20)-乙级
柠石榴: [code=cpp] #include<bits/stdc++.h> using namespace std; int main(){ string s,t; int n; cin >> s >> n; cin.ignore(); for (int i = 1; ; i ++) { getline(cin, t); if (t == "#") break; else if (t == s){ cout << "Welcome in" << endl; break; } else{ cout << "Wrong password: " << t << endl; if (i == n){ cout << "Account locked" << endl; break; } } } return 0; } [/code]
1115 裁判机 – PAT乙级真题
夜一森: difficult
1039. 到底买不买（20）-PAT乙级真题
柠石榴: 用的哈希表，不过思路跟柳神一样 [code=cpp] #include<bits/stdc++.h> using namespace std; int main() { string s1, s2; cin >> s1 >> s2; map<char,int> mp; for (int i = 0; i < s1.size(); i ++) mp[s1[i]] ++; int sum = 0; for (int i = 0; i < s2.size(); i ++) if (mp[s2[i]] != 0) mp[s2[i]] --; else sum ++; if (sum == 0) cout << "Yes" << " " << s1.size() - s2.size() << endl; else cout << "No" << " " << sum << endl; return 0; } [/code]
浮点错误的意思-PAT 、OJ
金秋飞雪: 阿里嘎多！！！

大家在看

最新文章

目录

评论 3

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。