bettle_king的博客

https://leetcode-cn.com/problems/reordered-power-of-2/ class Solution { public: vector<int> check(int x) { vector<int>ve; while(x) ve.push_back(x%10),x/=10; sort(ve.begin(),ve.end()); return ve; } .

https://codeforces.com/problemset/problem/489/B #include<bits/stdc++.h> using namespace std; int n,m,a[105],b[105]; map<int,int>mp; int main(void) { cin>>n; for(int i=0;i<n;i++) cin>>a[i]; cin>>m; int cnt=0; for(int i.

https://codeforces.com/problemset/problem/466/A #include<bits/stdc++.h> using namespace std; typedef long long int LL; int main(void) { LL n,m,a,b; cin>>n>>m>>a>>b; LL ans=1e9; for(int i=0;i<=n;i++) { for(int j=0;j&.

https://codeforces.com/problemset/problem/25/A #include<bits/stdc++.h> using namespace std; int a[105],n; int main(void) { int cnt1=0,cnt2=0; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; if(a[i]&1) cnt1++; else cnt2++; }.

https://codeforces.com/problemset/problem/165/A 存一下同x的所有y 存一下同y的所有x 对于每一个点暴力查找即可。 #include<bits/stdc++.h> using namespace std; int n; vector<pair<int,int>>ve; map<int,vector<int> >a,b; int main(void) { cin>>n; for(i.

https://codeforces.com/contest/1598/problem/B 暴力枚举所有的俩组的情况，对于每种情况判断可不可以达到要求。 #include<bits/stdc++.h> using namespace std; const int N=1e5+10; int a[N][6]; int main(void) { int t; cin>>t; while(t--) { int n; cin>>n; for(int i=1;i&l.

http://oj.ecustacm.cn/problem.php?id=1084 超时了，刚开始没看清题目，以为分为三个数字。后来才看到分成三个三位数字 #include<cstdio> #include<iostream> #include<algorithm> #include<string> using namespace std; string a="123456789"; int main(void) { int i,j; int ans=0.