摘要： num1:C++ code:#include include include include include using namespace std; struct Edge { int to, time; }; int findBestStarter(int n, vector<vector>& 阅读全文

摘要： num1:C++ code:#include<bits/stdc++.h> using namespace std; int n,a,b,i,ans=-2147483647; int main(){ cin>>n; for(i=1;i<=n;i++){ cin>>a; if(i==1) b=a; e 阅读全文

摘要： num1:C++ code:#include using namespace std; int n,a[10]; void dfs(int he,int c,int qs){ if(he==n){ for(int i=1;i<=c-2;i++){ cout<<a[i]<<'+'; } cout<<a 阅读全文

摘要： num1:C++ code:#include include include include using namespace std; const int p=19260817; int a[10100]; int b[10100]; char a1[10100]; char b1[10100]; 阅读全文

摘要： code1:C++ include include include int main() { std::priority_queue pq; std::string command; int value; while (std::cin >> command) { if (command == "e 阅读全文

摘要： num1: code:C++ include using namespace std; void halfSearch(int* arr, int b, int n) { int left = 0; int right = n - 1; while (left <= right) { int mid 阅读全文

摘要： num1: code:该题使用C语言 include<stdio.h> int main(void) { int n; scanf("%d",&n); printf("L"); for(int i=0;i<n;i++) { printf("o"); } printf("ng"); } 解题思路：直接 阅读全文