#include <bits/stdc++.h> #include "insects.h" using namespace std; deque <int> PrevIndex; int InMachine[2003]; int n; int PossibleMincount(int cnt){ PrevIndex.clear(); for(int i=0;i<n;i++){ if(!InMachine[i]){ InMachine[i]=1; move_inside(i); if(press_button()>cnt){ move_outside(i); InMachine[i]=0;\ } } } } int min_cardinality(int N){ int l,r,mid; n=N; l=1; //Phase 1: Determining the amount of different types of insects int TypeCount; for(int i=0;i<n;i++){ move_inside(i); InMachine[i]=1; PrevIndex.push_back(i); if(press_button()>1){ move_outside(i); InMachine[i]=0; PrevIndex.pop_back(); } } TypeCount=PrevIndex.size(); r=N/TypeCount; while(r-l>=1){ mid=(l+r)/2; if(PossibleMincount(mid)){ l=mid; }else{ r=mid-1; } } if(PossibleMincount(l)){ return l; }else{ return r; } }

insects.cpp: In function 'int PossibleMincount(int)':
insects.cpp:20:1: warning: no return statement in function returning non-void [-Wreturn-type]
   20 | }
      | ^