shenqimaomaoxia

摘要： 题目链接：https://codeforces.com/contest/1700/problem/B #include<iostream> #include <string.h> #include<string> #include <cmath> #include <algorithm> using 阅读全文

摘要： 题目链接：https://codeforces.com/contest/1999/problem/D #include<iostream> #include<string> #include <vector> using namespace std; int main(){ int n; cin>> 阅读全文

摘要： 题目链接：https://www.luogu.com.cn/problem/P5019 #include<iostream> #include<string> using namespace std; int main(){ int n; cin>>n; int arr[n+1]; int sum= 阅读全文

摘要： 题目链接：https://www.luogu.com.cn/problem/P1106 #include<iostream> #include<string> using namespace std; int main(){ int n,k,mu; string num; int t=1,wei,t 阅读全文

摘要： 题目链接：https://www.luogu.com.cn/problem/P1803 #include <iostream> #include <algorithm> #include <vector> using namespace std; int main(){ int ui; cin>>u 阅读全文

摘要： 题目链接：https://www.luogu.com.cn/problem/P1223 ＃include < iostream> ＃include < algorithm> using namespace std; int main(){ int num; cin>>num; long long a 阅读全文

摘要： 题目链接：https://codeforces.com/contest/2005/problem/B1 （开局看掉m=2和q=1） include include using namespace std; int main(){ long u; cin>>u; for(;u>0;u--){ long 阅读全文

摘要： 题目链接：https://leetcode.cn/problems/corporate-flight-bookings/ int* corpFlightBookings(int** bookings, int bookingsSize, int* bookingsColSize, int n, in 阅读全文

摘要： 题目链接：https://leetcode.cn/problems/car-pooling/ bool carPooling(int** trips, int tripsSize, int* tripsColSize, int capacity) { int arr[1100]; int max=0 阅读全文

摘要： 题目链接：https://leetcode.cn/problems/check-if-all-the-integers-in-a-range-are-covered/description/ bool isCovered(int** ranges, int rangesSize, int* rang 阅读全文