宇宙-AnonyMous-

#include<iostream> using namespace std; int main() { int N; cin >> N; int sum = 5 * N; int floor[N + 1]; int f; floor[0] = 0; for (int i = 1; i < N + 1; ++...

#include<iostream> #include<string> #include<cstring> #include<map> using namespace std; int main() { map<char, int> a; string s1, s2; cin >> s1; for (int i = ...

#include<iostream> using namespace std; long int fun1(long int a, long int b){ //a和b的最大公约数 if (b == 0) return abs(a); return fun1(b, abs(a) % b); } long int fun2(long int a, long int b){ /...

#include<iostream> #include<map> #include<vector> using namespace std; struct Node{ string id, str; int flag = 0; }; int cnt = 0; map<char, int> CharToInt; map<int, char&...

#include<iostream> #include<vector> #include<algorithm> using namespace std; struct Node{ string name, id; int mark; int grade; }; bool cmp1(Node a, Node b){ return a.grade &lt...

#include<iostream> #include<vector> #include<queue> using namespace std; struct node{ int l, r; }; vector<node> tree; queue<int> q; vector<int> res; vector<int...

#include<iostream> #include<cstring> using namespace std; int main(){ int n; string s; cin >> s; n = s.length(); int a, b; int flag = 0; for (int i = 3; i <= n; i++){ fo...

差两分拿不到。。。抓狂！ #include<iostream> #include<algorithm> using namespace std; struct NODE{ double p, dis; }node[505]; bool cmp(NODE a, NODE b){ return a.dis < b.dis; } int main(){ int ...

#include<iostream> #include<map> #include<algorithm> #include<vector> using namespace std; int id = 1; map<string, int> strtoi; map<int, string> itostr; int fun(str...

#include<iostream> #include<vector> #include<algorithm> using namespace std; int main(){ int N, M, x; vector<int> value; cin >> N >> M; for (int i = 0; i < N...

#include<iostream> #include<vector> using namespace std; vector<int> res; struct Node{ int key; struct Node* l; struct Node* r; }; int mid; int isBST(vector<int> a, int ro...

#include<iostream> #include<vector> using namespace std; struct Node{ int value; int key; Node *next; }; struct Res{ int a, b; int s; }; void ins(Node *t, int value, int key){ Node *...

自己写的一个只能通过一个测试点，但是输出都没有问题。对比了满分的代码还是很疑惑，找不到问题所在。 错误代码 #include<iostream> #include<map> #include<vector> using namespace std; int main() { int k; cin >> k; string s; cin &g...

有个3分测试点过不去，还没发现问题所在。 #include<iostream> #include<map> using namespace std; int isprime(int n) { if (n <= 1) return 0; for (int i = 2; i <= n / 2; i++) { if (n % i == 0) return ...

#include<iostream> using namespace std; struct game { float odd[3]; }; int main() { float max1; game g[3]; float w, t, l; for (int i = 0; i < 3; ++i) { cin &...

有两个测试点过不去，很迷。。。 #include<iostream> #include<cstring> #include<algorithm> using namespace std; string num, temp; void add(string t) { int len = t.length(); int index = le...

#include<iostream> #include<vector> using namespace std; int main() { vector<int> result; int n, radix; scanf("%d%d", &n, &radix); if (n == 0) printf("Yes\n0"...

总感觉自己的代码全靠蛮力，思想上需要改变。 #include<iostream> #include<map> #include<string> #include<cstring> #include<vector> #include<algorithm> using namespace std; struct node ...

用map是很简单，用vector一直通不过T_T vector #include<iostream> #include<algorithm> #include<vector> using namespace std; bool cmp(int a, int b) { return a < b; } int main() { int...

这题好迷 #include<iostream> #include<algorithm> #include<vector> #include<cmath> using namespace std; int main() { int n, s; scanf("%d", &n); int m[n + 1]; ...

有个3分的测试点过不去，很烦。 #include<iostream> #include<vector> using namespace std; int main() { int n, m; int v[300][300] = {0}; int minn = 999999999; int x; scanf("%d %d&am

#include<iostream> #include<vector> using namespace std; vector<int> a, b, temp; int fun(vector<int> &temp) { int cnt = 1; for (int i = 0; i &a

#include<iostream> #include<cmath> #include<vector> using namespace std; int fun(vector<int> arr) { int len = arr.size(); for (int i = 1; i < len; i++) { for (int j = ...

#include<iostream> #include<vector> #include<cstring> #include<string> using namespace std; int main() { string name; vector<string> list; vector<string> resul...

#include<iostream> #include<vector> using namespace std; int main() { int n, sum; string s; int r[50] = {0}; cin >> n; for (int i = 0; i < n; i++) { cin >> s; sum...

#include<iostream> using namespace std; string s; int fun(int a, int b){ while(a < b){ if (s[a++] != s[b--]) return 0; } return 1; } int main(){ getline(cin, s); int step, cnt = 1; fo...