bettle_king的博客

https://codeforces.com/problemset/problem/1352/D#include<bits/stdc++.h>using namespace std;const int N=1e5*2+10;int t,n,a[N],s[N];int main(void){ cin>>t; while(t--) { cin>>n; for(int i=1;i<=n;i++) cin>>a[i],s[i]=s[i.

https://leetcode-cn.com/problems/keyboard-row/class Solution {public: vector<string> findWords(vector<string>& ve) { string s[3]={"qwertyuiop","asdfghjkl","zxcvbnm"}; vector<string>ans; for(int i=0;.

https://codeforces.com/problemset/problem/1526/B#include<bits/stdc++.h>using namespace std;const int N=110;vector< pair<int,int> > ve[110]; bool cmp(pair<int,int> a,pair<int,int> b){ if(a.first==b.first) return a.sec.

https://codeforces.com/problemset/problem/1204/A数据范围很大，故需要找规律模拟。题目要求的是4进制故两个2进制即为4进制。这里要分奇偶的情况，如果是偶数的话其实直接除以字符长度直接除以2即可。如果是奇数长度看开头之后有没有多余的1，有的话，说明开头的1也是可以取的故加1。#include<bits/stdc++.h>using namespace std;int main(void){ string s; cin>&g.

https://codeforces.com/problemset/problem/139/A#include<bits/stdc++.h>using namespace std;const int N=110;int a[N],s,index;int main(void){ int sum; cin>>sum; for(int i=1;i<=7;i++) { cin>>a[i],s+=a[i]; if(a[i]) index=i;//.

https://leetcode-cn.com/problems/number-complement/class Solution {public: int findComplement(int num) { string s; while(num) s+=to_string(num%2),num/=2; long long int sum=0; for(int i=s.size()-1;i>=0;i--) .

https://codeforces.com/problemset/problem/1234/B1#include<bits/stdc++.h>using namespace std;const int N=1e5*2+10;int a[N],n,k;unordered_map<int,int>st;queue<int>q;int main(void){ cin>>n>>k; for(int i=0;i<n;i++) c.

https://codeforces.com/problemset/problem/404/A将对角线上的字符连接到一块，其它的连接到一块。排序，如果开头等于结尾说明该字符串是同一个字符的字符串。#include<bits/stdc++.h> using namespace std;const int N=310;string s[N],s1;int n;int main(void){ cin>>n; for(int i=0;i<n;i++) cin&g.

https://codeforces.com/problemset/problem/75/A#include<bits/stdc++.h>using namespace std;int solve(string s){ int sum=0; for(int i=0;i<s.size();i++) if(s[i]>'0') sum=sum*10+s[i]-'0'; return sum;}int main(void){ int a,b; cin>>a.

https://codeforces.com/problemset/problem/219/A#include<bits/stdc++.h>using namespace std;int k;string s;map<char,int>mp;int main(void){ cin>>k>>s; for(int i=0;i<s.size();i++) {mp[s[i]]++;} string temp,ans; for(auto i.

https://leetcode-cn.com/problems/count-and-say/class Solution {public: string countAndSay(int n) { string ans="1"; for(int i=2;i<=n;i++) { string s; for(int j=0;j<ans.size();j++) { .

https://leetcode-cn.com/problems/fizz-buzz/class Solution {public: vector<string> fizzBuzz(int n) { vector<string>ans; for(int i=1;i<=n;i++) { if(i%3==0&&i%5==0) ans.push_back("FizzBuzz"); .

https://leetcode-cn.com/problems/arranging-coins/class Solution {public: int arrangeCoins(int n) { int cnt=0,i=1; while(n>=i) cnt++,n-=i,i++; return cnt; }};在这里插入图片描述

https://codeforces.com/problemset/problem/450/A#include<bits/stdc++.h>using namespace std;int s[105];queue<int>q;int main(void){ int n,m,x; cin>>n>>m; for(int i=1;i<=n;i++) cin>>s[i],q.push(i); while(q.size()>1.

题目地址#include<cstdio>#include<iostream>#include<algorithm>#define pi 3.141592653589793238462643383279using namespace std;double x[10005];bool cmp(double x,double y){ return x>y;}int main(void){ int n; cin>>n; .

题目地址给定 1≤i<j≤n，且 j−aj≠i−ai，即 j−i≠aj−ai，因为 j−i>0，所以只要aj−ai≤0即可。故将数组从大到小排。#include<cstdio>#include<iostream>#include<algorithm>using namespace std;bool cmp(int a,int b){ return a>b;}int main(void){ int t; cin&gt.

题目地址就是看对称位置有不同字符的个数#include<cstdio>#include<iostream>#include<string>using namespace std;int main(void){ int t; cin>>t; for(int i=1;i<=t;i++) { int n,k; cin>>n>>k; string s; cin>.

题目地址#include<cstdio>#include<iostream>#include<algorithm>#include<string>#include<map>using namespace std;map<string,int>mp;map<int,string>d;bool judge(int year){ if(year%400==0||(year%4==0&&yea.

https://www.nowcoder.com/practice/b1f7a77416194fd3abd63737cdfcf82b?tpId=40&tqId=21554&rp=1&ru=%2Fta%2Fkaoyan&qru=%2Fta%2Fkaoyan%2Fquestion-ranking&tab=answerKey#include<cstdio>#include<iostream>#include<string>#in.

https://www.nowcoder.com/practice/d69e75bb224e4a7785a02b2acc0821c4?tpId=40&tqId=21443&rp=1&ru=%2Fta%2Fkaoyan&qru=%2Fta%2Fkaoyan%2Fquestion-ranking&tab=answerKey#include<cstdio>#include<iostream>#include<algorithm>.

https://www.nowcoder.com/practice/bcd4ec5971054997a1dc282067aa1d8b?tpId=40&tqId=30991&rp=1&ru=%2Fta%2Fkaoyan&qru=%2Fta%2Fkaoyan%2Fquestion-ranking&tab=answerKey#include<iostream>#include<cstdio>#include<algorithm>.

https://www.nowcoder.com/practice/a4b37b53a44d454ab0834e1517983215?tpId=40&tqId=21471&rp=1&ru=%2Fta%2Fkaoyan&qru=%2Fta%2Fkaoyan%2Fquestion-ranking&tab=answerKey#include<cstdio>#include<iostream>#include<algorithm>.

https://www.nowcoder.com/practice/ae7e58fe24b14d1386e13e7d70eaf04d?tpId=40&tqId=21350&rp=1&ru=%2Fta%2Fkaoyan&qru=%2Fta%2Fkaoyan%2Fquestion-ranking&tab=answerKey用1月1 累加到目标天数#include<cstdio>#include<iostream>using namesp.

http://acm.hdu.edu.cn/showproblem.php?pid=1337#include<cstdio> #include<iostream>#include<cstring>#include<string>using namespace std;int main(void){ int t; cin>>t; while(t--) { bool a[105]; memset(a,0,sizeof a).

http://acm.hdu.edu.cn/showproblem.php?pid=1216这道题比较坑你会以为这是一个简单的筛素数的问题，实际上不是的。它的题意是这样的。第一个数是2，以步长为2开始筛，此时队列里还有。第二个数是3，以步长为3开始筛，此时队列里还有。第三个数是5，以步长为5开始筛，此时5后面的第5个数是 19 故19要筛。 19是素数也被筛走了，故根本不是求素数表。#include<cstdio>#include<iostream>#i.

http://acm.hdu.edu.cn/showproblem.php?pid=1200加密过程是这样的，例要加密的信息是:There’s no place like home on a snowy night代码如下:#include<cstdio>#include<iostream>#include<algorithm>#include<string>using namespace std;int main(void) {.

https://pintia.cn/problem-sets/994805260223102976/problems/994805308755394560这道题很坑很坑坑点一 第一个值的范围是 “A" <=ans1 <= “G” 因为星期最大是 7坑点二 第二个值的范围是 “A" <=ans2 <= “N” 且 " 0" <=ans2<= " 9 " 且第二个的位置在第一个的后面坑点三 输出的时候个位数要补零，二位数不用。坑点四 最坑的就是它的位.

https://www.acwing.com/problem/content/description/449/sort()的朴素做法: 时间复杂度O(RNlongN)#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int N=1e5*2+20;struct student{ long long int id,s,p;}stu[N];bo.

https://www.luogu.com.cn/problem/P1042做模拟题就按照题目的描述来就可以了。本题的限制：两人的分数至少其中一个人的分数要大于等于11或21。俩人的分数差要大于等于2。#include<cstdio>#include<iostream>#include<vector>#include<string>#include<cmath>using namespace std;char a[103.

https://www.luogu.com.cn/problem/P1317#include<cstdio>#include<iostream>#include<algorithm>using namespace std;const int N=1e4+10;int a[N];int ans;int main(void){ int n; cin>>n; for(int i=1;i<=n;i++) cin>>a[i];.

http://oj.ecustacm.cn/problem.php?id=1093#include<cstdio>#include<algorithm>#include<string>#include<iostream>#include<vector>#include<map>using namespace std;struct monkey{ int id; int weight; int sum;}stu.

https://www.luogu.com.cn/problem/P1085找到第一个和大于8的下标#include<cstring>#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<set>#include<cmath>using namespace std;struct time{ int.

P1014 [NOIP1999 普及组] Cantor 表https://www.luogu.com.cn/problem/P1014题目大致给的意思是这样的:分析以下题目应该是找规律题 , 将上图写成这样不难找出，奇数行是一种规律，偶数行是另一种规律。且 分子+ 分母 = 层数+1例子: 1/5 1+5=5(层数)+1规律找出了那么问题的关键是找到...

https://www.luogu.com.cn/problem/P1079#include<cstdio>#include<iostream>#include<string>#include<cstring>using namespace std;int main(void){ string s,key; cin>>key>>s; int k=0; for(int i=0;i<s.size.