#include <bits/stdc++.h> using namespace std; int main() {     int n, maximun = INT_MIN, a[505], dp[505];     cin >> n;     fo...

#include <iostream> using namespace std; int main() { int M, K, value[1005], dp[1005] = {0}; while(cin >> M) { if(M == 0) ...

#include <iostream> using namespace std; void shellSort(int arr[], int n) { int gap = n / 2; while(gap >= 1) { for(int i = g...

#include <iostream> using namespace std; bool isLeap(int x) { if(x % 4 == 0 && x % 100 != 0 || x % 400 == 0) return true;...

#include <iostream> #include <string.h> using namespace std; int main() { int n, m, maxlen = 1; int a[105], b[105], dp[105];...

#include <iostream> #include <string.h> using namespace std; int height[1005]; int dp[1005][1005]; int main() { int n, max...

#include <iostream> using namespace std; int dp[11][11] = {0}; //dp[i][k]表示前i位数中插入k个乘号的最大值 int a[11][11] = {0}; //a[i][j]表示从第i个数字到第j个数...

#include <iostream> using namespace std; const int MAXN = 1005; int fa[MAXN]; //存储每个元素的父节点 int rk[MAXN]; //记录每个根节点对应的树的深度 void in...

#include <iostream> #include <vector> using namespace std; const int MAXN = 1e7+5; vector<long long> prime; bool isPrime...

import java.math.BigInteger; import java.util.Scanner; public class Main { static BigInteger fibo[] = new BigInteger[1000005]; publi...

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

import java.math.BigInteger; import java.util.Scanner; public class Main { public static BigInteger Factorial(int n) { BigInteger b = ...

#include <iostream> #include <map> #include <string> using namespace std; int main() {     int m, n, id;     string inf...

#include <iostream> #include <algorithm> using namespace std; int main() {     string s, rs;     int index = 1;     while(cin...

#include <iostream> #include <string.h> #include <map> using namespace std; int main() {     string s;     map<int, ...

#include <iostream> #include <vector> #include <string.h> #include <algorithm> using namespace std; struct Complex...

#include <bits/stdc++.h> using namespace std; struct Record {     char s[10];     int score1, score2, score3; }r[105]; bool cmp(R...

#include <bits/stdc++.h> using namespace std; int main() {     int n;     cin >> n;     while(n--) {         string s;      ...

#include <bits/stdc++.h> using namespace std; int Priority(char c) {     if(c == '#') return 0;     else if(c == '$') return 1;     ...