UVA 11044 寻找尼斯湖水怪

求需要放置的最少声纳探测器

#include <iostream>#include <sstream>#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <vector>#include <set>#include <cctype>#include <algorithm>#include <cmath>#include <deque>#include <map>using namespace std;///#define INF 0xffffff7#define MAXN 200 ///int n, m;int main(){///int testCases;int nums;cin >> testCases;while(testCases--){nums = 0;cin >> n >> m;int startrow, startcol;startrow = startcol = 3;int initRow(startrow), initCol(startcol);while (1){nums++;while (1){if (startcol + 3 < m){startcol += 3;nums++;}else if (startcol + 3 == m){startcol += 2;nums++;}else{startcol = initCol;break;}}if (startrow + 3 < n){startrow += 3;}else if (startrow + 3 == n){startrow += 2;}elsebreak;}cout << nums << endl;}    ///    return 0;}