江船夜雨听笛的博客

#include<bits/stdc++.h>using namespace std;int main(){ long long int a,b; scanf("%lld%lld",&a,&b); long long int sum=a+b; string q=to_string(sum); reverse(q.begin(),q.end()); int cnt=0; string ans=""; for(int i=0;i<q.size();i++).

#include<bits/stdc++.h>using namespace std;string aa[]={"zero","one","two","three","four","five","six","seven","eight","nine"};//一开始那个a与后面的string a重名了 int main(){ string a; cin>>a; long long int sum=0; for(int i=0;i<a.size();i++){ .

#include<bits/stdc++.h>using namespace std;char vv[100][100];int main(){ string a; cin>>a; fill(vv[0],vv[0]+100*100,' '); int n=a.size()+2; int k=n/3; int bot=a.size()-k*2,cnt=0;//应该是a。size（）才对不是修饰过的n for(int i=0;i<k;i++){ vv[i.

#include<bits/stdc++.h>using namespace std;bool cmp1(int a,int b){ return a>b;} bool cmp2(int a,int b){ return a<b;}int main(){ int a,b,_1; scanf("%d",&a); vector<int>a1,a2,b1,b2; for(int i=0;i<a;i++){ scanf("%d",&am.

#include<bits/stdc++.h>using namespace std;bool cmp(string a,string b){ return a+b<b+a;}int main(){ string a[100000]; int n; scanf("%d",&n); for(int i=0;i<n;i++){ cin>>a[i]; } sort(a,a+n,cmp); string ans=""; for(int i=.

#include<bits/stdc++.h>using namespace std; string ad[]={"MON","TUE","WED","THU","FRI","SAT","SUN"};int main(){ string _1,_2,_3,_4; cin>>_1>>_2>>_3>>_4; map<char,int> book1,book2; for(int i=0;i<=_1.size();i+.

#include<bits/stdc++.h>using namespace std;int main(){ string a,z; string ans=""; cin>>a; int dm,epo,fh=-1,len; for(int i=0;i<a.size();i++){ if(a[i]=='.'){ dm=i; } if(a[i]=='E'){ epo=i; if(a[i+1]=='-'){ fh=0;//向左 .

#include<bits/stdc++.h>using namespace std;int main(){ int n; scanf("%d",&n); getchar();//只要scanf与后面有char别管全局还是局部都要把\n吸收掉 //vector<string>vv(n+1); string vv[n]; int min=963; for(int i=0;i<n;i++){ getline(cin,vv[i]); rev.

#include<bits/stdc++.h>using namespace std;string uijn[10]={"ling","yi","er","san","si","wu","liu","qi","ba","jiu"};string djwz[6]={"Ge","Shi","Bai","Qian","Wan","Yi"};int b[9]={1,10,100,1000,10000,100000,1000000,10000000,100000000};int main(){.

#include<bits/stdc++.h>using namespace std;int main(){ int n,cnt=0; scanf("%d",&n); char _2[50]; double _1,sum=0; char a[50]; for(int i=0;i<n;i++){ scanf("%s",&a); sscanf(a,"%lf",&_1); sprintf(_2,"%.2lf",_1); int flag=.

#include<bits/stdc++.h>using namespace std;int book[100000];int main(){ string a; cin>>a; long long int sum=0; /*for(int i=0;i<a.size();i++){ if(a[i]!='A') continue; int countp=0,countt=0; for( int j=0;j<i;j++){.

#include<bits/stdc++.h>using namespace std;int main(){ long long int n; scanf("%lld",&n); int a=sqrt(n*1.0),temp=1,first=0,len=0; for(int i=2;i<=a;i++){ int j; temp=1; for(j=i;j<=a;j++){ temp*=j; if(n%temp!=0){ break;.

#include<bits/stdc++.h>using namespace std;struct node{ char na[10]; int height;}; bool cmp(node&a,node&b){ if(a.height!=b.height) return a.height>b.height; else return strcmp(a.na,b.na)<0;}int main(){ int n,k; scanf("%d%d".

#include<bits/stdc++.h>using namespace std;bool isprime(int a){ if(a<=1) return false; for(int i=2;i<=sqrt(a*1.0);i++){ if(a%i==0){ return false; } } return true;} int book1[10000]={-1},book2[10000]={-1},exist[10000]={-1};//没.

https://www.cnblogs.com/jlyg/p/7525244.html

#include<bits/stdc++.h>using namespace std;int main(){ int n,k; set<int>num; scanf("%d",&n); for(int i=0;i<n;i++){ scanf("%d",&k); vector<int> vv(k+1); num.clear();//set忘记条件重置crt 计数变量 for(int j=1;j<=k;j++){ .

#include<bits/stdc++.h>using namespace std;bool ishvwf(string a){ //long long b =stoi(a); for(int i=0;i<a.size();i++){ if(a[i]!=a[a.size()-1-i]){ return false; } } return true;}string add(string a,string b){ int carry=0,cnt=0; ch.

本题过关率低的原因是因为题目比较晦涩，情景比较复杂，这个时候一定要结合样例看，题目能看懂多少就看懂多少，圈一些关键词就够了；#include<bits/stdc++.h>using namespace std;struct node{ int a,b;};bool cmp(node&_1,node&_2){ if(_1.a!=_2.a){ return _1.a<_2.a; } else{ return _1.b<_2.b; }}.

#include<bits/stdc++.h>using namespace std;int main(){ int n; int d; scanf("%d%d",&d,&n); vector<int> a,b; //相当于第二次的 a.push_back(d); for(int i=1;i<n;i++){ b=a; a.clear(); int pre=b[0],cnt=0; for(int i=0;i<b.size(.

#include<bits/stdc++.h>using namespace std;int main(){ int n; scanf("%d",&n); int v[n],a[n]; for(int i=0;i<n;i++){ scanf("%d",&v[i]); } for(int i=0;i<n;i++){ for(int j=i+1;j<n;j++){ vector<int> lie; fill(a.

#include<bits/stdc++.h>using namespace std;bool isprime(long long a){ if(a<=1) return false; for(int i=2;i<=sqrt(a*1.0);i++){ if(a%i==0){ return false; } } return true;}int main(){ int n,m; scanf("%d%d",&n,&m); string.