/* we need to find max count possible from available ingredients. First line of input says N which is total ingredients. Second line of input says N long long which is each ingredient's amount required for a reciepe. Third line of input says N long long which is total availability of each ingredient. input : 4 2 5 6 3 20 40 90 50 output : 8 EXPLANATION: First ingredient can be used for 20/2 = 10 Recipe Second ingredient can be used for 40/5 = 8 Recipe Third ingredient can be used for 90/6 = 15 Recipe Fourth ingredient can be used for 50/3 = 16 Recipe As all ingredients are required to have proper recipe , we can create only 8 reciepe (min of all four) Query: I am getting time out error and feels that code is not optimized...Could you please share view on this? */ #include #include #include #include using namespace std; int main(int argc, char *a[]) { //Write code here int N;//ingredients cin >> N; vector vecCnt; vector vecReq; vecCnt.reserve(N); vecReq.reserve(N); int i=0; long long input; while(i> input; vecReq.push_back(input); ++i; } i=0; while(i> input; vecCnt.emplace_back (input / vecReq[i]); ++i; } sort(vecCnt.begin(),vecCnt.end()); cout << vecCnt[0] << endl; return 0; } int main_NeverUseRegex(int argc, char *a[]) { //Write code here int N;//ingredients cin >> N; string strDummy; string strReq; getline(cin,strDummy); getline(cin,strReq); string strAvail; getline(cin,strAvail); vector vecCnt(N); vector vecReq; vector vecAvail; regex reg("\\s+"); sregex_token_iterator startReq(strReq.begin(), strReq.end(), reg, -1); sregex_token_iterator endReq; sregex_token_iterator startAvail(strAvail.begin(), strAvail.end(), reg, -1); sregex_token_iterator endAvail; //cout << N << strAvail << strReq << endl; //return 0; int i = 0; while(startReq!=endReq) { //string str1 = *startReq; //string str2 = *startAvail; //cout << stoll (str1,nullptr,10) / stoll (str2,nullptr,10); //cout << *startReq << " " << *startAvail << stoll (*startReq,nullptr,10) << endl; //cout << str << endl; vecCnt[i] = stoll (*startAvail,nullptr,10) / stoll (*startReq,nullptr,10); ++startReq; ++startAvail; ++i; //cout << vecCnt[i] << endl; } sort(vecCnt.begin(),vecCnt.end()); cout << vecCnt[0] << endl; return 0; }

Reciepe_Cnt