[codeforces 1269B] Modulo Equality 模拟

[codeforces 1269B] Modulo Equality 模拟

总目录详见https://blog.csdn.net/mrcrack/article/details/103564004

在线测评地址https://codeforces.com/contest/1269/problem/B

 

Problem	Lang	Verdict	Time	Memory
B - Modulo Equality	GNU C++11	Accepted	187 ms	0 KB

 

    #include <cstdio>
    #include <algorithm>
    #define maxn 2010
    using namespace std;
    int a[maxn],b[maxn],c[maxn],x[maxn];
    int main(){
    	int n,m,i,j;
    	scanf("%d%d",&n,&m);
    	for(i=1;i<=n;i++)scanf("%d",&a[i]);
    	for(i=1;i<=n;i++)scanf("%d",&b[i]);
    	for(i=1;i<=n;i++)x[i]=((b[1]-a[i])%m+m)%m;
    	sort(x+1,x+n+1);
    	sort(b+1,b+n+1);
    	for(i=1;i<=n;i++){
    		for(j=1;j<=n;j++)
    			c[j]=(a[j]+x[i])%m;
    		sort(c+1,c+1+n);
    		for(j=1;j<=n;j++)
    			if(c[j]!=b[j])break;
    		if(j==n+1){
    			printf("%d\n",x[i]);
    			break;
    		}
    	}
    	return 0;
    }