#include <iostream> using namespace std; const int N = 1e7 + 10; int a, b, cnt; int primes[N]; bool st[N]; int get_primes(int x) ...

 把到每个坐标为止的串的位置用x，y记录下来。对于每一个位置得到的点，都能用一个对应的b以y = x + b的形式表示出来； 最长串的大小也就是对于每一个存在的b最大的x + y与最小x + y的差的最大值。 #include<bits/stdc++.h>...

#include <bits/stdc++.h> using namespace std; struct plural { int mod; string val; bool operator< (const plural &W)cons...

#include <iostream> using namespace std; const int N = 11; int m, n, res, a[N]; int main() { cin >> m >> n; for (i...

#include <iostream> #include <algorithm> using namespace std; const int N = 1010; struct node { string name; int c, m, e; ...

#include <iostream> using namespace std; int n; string s; int main() { cin >> n; while (cin >> s) { for (int ...

#include <iostream> using namespace std; const int N = 1e5 + 10; int m, n, x, a[N], map[110][N]; int c[N]; int main() { cin >...

#include <iostream> using namespace std; const int N = 110; int m; string s[N]; int main() { cin >> m; for (int i = 0; ...

#include <iostream> #include <unordered_map> using namespace std; unordered_map<int, bool> h; int main() { for (int ...

#include <iostream> using namespace std; bool check(int x) { string s; for (; x; x /= 10) s += (x % 10 + '0'); for (int i = 0, j...

#include <iostream> using namespace std; int rev(int x) { int y = 0; for (; x; x /= 10) y = y * 10 + x % 10; return y; } int...

#include <iostream> using namespace std; string id; int val[17] = {7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2}; char mp[11] ...

#include <iostream> using namespace std; void check(int a, int b, int c) { if (a * 100 + b * 110 + c * 12 == 532) printf("%d %d %d...

#include <iostream> #include <map> #include <algorithm> using namespace std; const int N = 1010; char x; string s; map...

#include <iostream> #include <cmath> using namespace std; int n, h; double s; int main() { cin >> n; while (cin >&...

#include <iostream> using namespace std; int x; int main() { cin >> x; while (cin >> x) { int res = x; while (-...

#include <iostream> using namespace std; int x, sum; int main() { cin >> x; while (cin >> x) cout << 3 * x * (...

#include <iostream> using namespace std; int n, x; double y; int main() { cin >> n; while (cin >> x) { if (x ...

#include <iostream> #include <algorithm> using namespace std; int x, cnt; vector<int> s; int main() { char a; ...

#include <iostream> using namespace std; string s; int main() { while (cin >> s) { bool f = false; for (int i = 0, ...