遍历一遍,遇到边界为奇数次时,格子在多边形内

偶数次时,在多边形外

#include<cstdio>
#define REP(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;

int main()
{
	char s[105];
	int n, m;
	while(~scanf("%d%d", &n, &m))
	{
		int ans = 0, c = 0;
		REP(i, 0, n)
		{
			int in = 0;
			scanf("%s", s);
			REP(j, 0, m)
			{
				if(s[j] == '/' || s[j] == '\\') c++, in = !in;
				else if(in) ans++;
			}
		}
		printf("%d\n", ans + c / 2);
	}
	return 0;
}

 

相关文章:

  • 2021-07-01
  • 2022-03-06
  • 2021-11-04
  • 2021-08-27
  • 2021-07-31
  • 2021-05-28
  • 2021-05-28
  • 2022-01-04
猜你喜欢
  • 2021-12-26
  • 2021-09-04
  • 2021-11-26
  • 2021-10-29
  • 2021-11-21
  • 2021-10-05
  • 2021-08-07
相关资源
相似解决方案