HackerRank Contest https://www.hackerrank.com/contests/snapdeal-codesprint/challenges/cycling

cycling.cpp

#include <iostream>
#include <vector>

using namespace std;

int main(int argc, char const *argv[])
{
	int n, m;
	int **nm;
	int *s, *q;
	int min=0, max=0;
	string tmp;
	cin>>n>>m;

	s = new int[n];
	q = new int[m];

	cin>>s;
	cin>>q;

	nm = new int[n][m];

	for (int i = 0; i < n; ++i)
	{
		cin >> tmp;
		for (int j = 0; j < tmp.length() ; ++j)
		{
			nm[i][j]= tmp[j]=='Y' ? 1 : 0;
			min 
		}


	}

	return 0;
}