Cod sursă (job #543073)

#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;

ifstream fi("patru.in");
ofstream fo("patru.out");

int N,i,K,C[20010],A[20010],q,a,b,s,p;
int P[]={1,16,81,256,625,1296,2401,4096,6561,10000,14641};

int main()
{
	fi >> N >> K;
	for(i=1; i<=N; i++)
	{
		
		fi >> C[i];//
		for(a=0; a<=10 && C[i]>P[a]; a++)
		for(b=0; b<=10 && C[i]>=P[b]+P[a]; b++)
		if(P[b]+P[a]==C[i])q++,a=10,b=10/*,fo << 1 <<'\n'*/;
		
		C[i]=pow(C[i]%10,4);C[i]%=10;
		s+=C[i];
		//fo << " C[i]=" << C[i] << '\n';
		if(i-K>=0)
		{
		if(i-K>0)s-=C[i-K]; 
			//fo << s << " ";
			if(s%10==4) p++;
			b=1;
		}
		
	}
	 
	
	
	
	
	fo << q<< '\n' << p;
}