class Solution {
public:
	bool checkSubarraySum(vector<int>& nums, int k) {
		bool proceed = false;
		int count = 0;
		for(int i=0; i<nums.size(); i++)
			if(nums[i] == 0)
				count++;
		if((count == nums.size()) & nums.size() > 1)
			proceed = true;
        
		if((k != 0)&(nums.size()>1)){
			for(int i=0, gap=2; !proceed & i<nums.size(); i=i+2, gap++){
				int sum=0, sumNext=0, gapNumber=0;
				int temp = gap;
        
				while(temp){        
					sum += nums[i+temp-1];        
					temp--;        
				}        
				if(sum%k == 0)
					proceed = true;
				sumNext = sum - nums[i];
				gapNumber = sumNext;
				for(int j=i+gap; !proceed & j<nums.size(); j++){
					sum += nums[j];
					if(sum%k == 0)	proceed = true;
					sumNext += nums[j];
					if(sumNext%k == 0)	proceed = true;
					gapNumber += nums[j];
					if(gapNumber%k == 0)	proceed = true;   
					gapNumber -= nums[j-gap+1];		        
        
				}
    
			}
		}
		return proceed;
	}
};