Milestone Counter

#include <vector>
#include <valarray>
#include <deque>
#include <iostream>
#include <set>
using namespace std;
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}
struct fraction:pair<int,int>{
	fraction(int a=0,int b=1):pair<int,int>(a,b){int c=gcd(a,b);first/=c;second/=c;}
};
int main(){
	int m,n;
	cin>>m>>n;
	vector<int> M(m);
	vector<int> N(n);
	for(int i=0;i<m;i++)cin>>M[i];
	for(int i=0;i<n;i++)cin>>N[i];
	int v=M[0];
	for(auto&it:M)it-=v;
	deque<int> qq(N.begin(),N.begin()+m);
	set<fraction> a;
	set<int> b;
	for(int i=0;i<=n-m;++i){
		fraction vv(qq[1]-qq[0],M[1]);
		for(int j=2;j<m;++j){
			if(vv==fraction(qq[j]-qq[0],M[j]))continue;
			goto asd;
		}
		a.insert(vv);
		b.insert(qq[1]-qq[0]);
asd:	qq.pop_front();
		if(i+m<n)qq.push_back(N[i+m]);
	}
	cout<<a.size()<<'\n';
	int cnt=b.size();
	for(auto&it:b)cout<<it<<" \n"[--cnt==0];
	return 0;
}
 

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED