Dance_Devil的博客

#include<bits/stdc++.h>using namespace std;char a[110][110];bool f[110][110];int c=0,n,m;int fx[5]= {0,0,1,0,-1};int fy[5]= {0,1,0,-1,0};void dfs(int x,int y) { c++; f[x][y]=true; int p1,p2; for(int i=1; i<=4; i++) { p1=x+fx[i]; p2=

#include <bits/stdc++.h>using namespace std;int a[20][8];int r[8];int k;int b;int d;void jinzhi(int n){ int i; for(i=0;i<b;i++){ r[i] = 0; } i = 0; while(n!=0){ r[i] = n % 2; n = n / 2; i+

#include<bits/stdc++.h>using namespace std;int main(){int ax,ay,bx,by;cin>>ax>>ay>>bx>>by;int h,w;h = abs(ax - bx);w = abs(ay - by);cout<<max(h,w);}

#include <bits/stdc++.h>using namespace std;int main(){int a,b;cin>>a>>b;cout<<(a+b-1)-(abs(a-b)+1)+1<<endl;return 0;}

#include <bits/stdc++.h>using namespace std;bool huiwen(string s){string c;char x;for(int i=0;i<=s.size()-1;i++){x=s[i];c=x+c;}if(c==s){return true;}else{return false;}}int main() {int n,m,c=0,k;char x;string s;cin>>n>&

#include<bits/stdc++.h>using namespace std;int n,m,an,ha[100001],a[100000],c[100001];int main(){scanf("%d%d",&m,&n);for (int i=1;i<=n;i++){scanf("%d",&c[i]);}for (int i=n;i>=1;i–){if (ha[c[i]]==0){an++;a[an]=c[i];ha[

#include <bits/stdc++.h>using namespace std;int a[1000010],b[1000010];string s,w;int c,n,m,len;bool f;int main() {cin>>n>>m;cin>>s>>w;int i,j;for(i=0; i<n; i++) {if(s.substr(i,m)!=w) {continue;}f=false;for(j=