1051. Pop Sequence (25)#include <iostream> #include <stack>using namespace std;int main() {int m, n, k;scanf("%d%d%d", &m, &n, &k);int i, num[1010], j, index, flag, be…

1.mod 我们用递推式用加法避免除和mod include <bits/stdc++.h> using namespace std; long long dp[105]; long long f(int x) { if(dp[x]!=-1) return dp[x]; dp[x]=0;//归0 for(int i=0;i<x;i++) { dp[x]=…

1038. Recover the Smallest Number (30)#include <iostream> #include <string.h> #include <string> #include <algorithm> #include <vector>using namespace std;int cmp(string a,…

1037. Magic Coupon (25)#include <iostream> #include <vector> #include <algorithm>using namespace std;int main() {int nc;scanf("%d", &nc);int i;vector<long long> v[…

1040. Longest Symmetric String (25)#include <iostream> #include <string.h>using namespace std;int main() {char s[1010];gets(s);int len = strlen(s), i, count, res = 0, j, k;for(i = 0; i <…

1029. Median (25)#include <iostream> #include <vector> #include <algorithm>using namespace std;int main() {int n;scanf("%d", &n);int i;long int num;vector<long int>…

1039. Course List for Student (25)#include <iostream> #include <vector> #include <algorithm>using namespace std;vector<int> v[270000];int getbigindex(char s[]) {return (s[0] - A…

1033. To Fill or Not to Fill (25)#include <iostream> #include <algorithm>using namespace std;struct node {double dis, p; }stations[510];int cmp(node n1, node n2) {return n1.dis < n2.dis;…