刷牛客的高级磨洋工很愉快

分类

/ 注册

全部文章（共20篇）

题解 | 【模板】序列操作

#include <iostream> #include<algorithm> #include<vector> using namespace std; int main() { int q; cin>>q; vector&...

2025-08-24

0 10

题解 | 两直线交点

point findMeetingPoint(line line_A,line line_B){ point re(-1,-1); double a1,a2,b1,b2,c1,c2; a1=line_A.point_A.y-line_A.point_B.y; a2=l...

2025-08-24

0 13

题解 | 三角形面积

double getArea(triangle T) { double a = sqrt((T.a.x - T.b.x) * (T.a.x - T.b.x) + (T.a.y - T.b.y) * (T.a.y - T.b.y)); doubl...

2025-08-24

0 12

题解 | 点到直线距离

double getDistance(point P, line L){ int a=L.point_A.y-L.point_B.y; int b=L.point_B.x-L.point_A.x; int c=L.point_A.x*L.point_B.y-L.point_A...

2025-08-24

0 12

题解 | 凯撒解密

class Solution { public: string decodeWangzai(string password, int n) { for(char& ch:password) ch=(ch-'a'+26-n%26)%26+'a';...

2025-08-24

0 9

题解 | 牛牛的考试

#include <iostream> #include<vector> #include<string> using namespace std; int main() { int t; cin >> t; while (t...

2025-08-24

1 14

题解 | 无限长正整数排列字符串

#include <iostream> #include<string> using namespace std; int main() { int n,k=1; cin>>n; string s=""; wh...

2025-08-23

0 11

题解 | 添加逗号

#include <iostream> #include<string> using namespace std; int main() { string s; cin>>s; int n=s.size()-1; for(int i...

2025-08-23

0 10

题解 | 扫雷

#include <iostream> #include<vector> using namespace std; int main() { int n, m; cin >> n >> m; vector<vector&...

2025-08-23

0 9

题解 | 校门外的树

#include <iostream> #include<vector> #include<utility> #include<algorithm> using namespace std; int main() { int l,m; ...

2025-08-22

0 14