UVA 12405 - Scarecrow
Problem PDF
Solution:
#include
int main()
{
int t,n,j,c,i;
char a[110];
while(scanf("%d",&t)==1)
{
for(j=1;j<=t;j++)
{
scanf("%d %s",&n,a);
c = 0;
for(i=0;ihttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/12405/12405.cpp
