I am getting TLE but another solution with 0(n^2) got accepted
#include <stdio.h>
#include <stdlib.h>
int main()
{
int t,l,c;
scanf("%d",&t);
for(int i=0;i<t<100;i++){
scanf("%d %d",&l,&c);
if(c<100){
while(l!=0){
process(c,l);
l–;
}
}else{
return 0;
}
}
}
void process(int c,int l){
int count=0,count1=0;
count++;
if(l%2==0){
printf("\n*");
while(c!=1){
count1++;
if(count1%2!=0){
printf(".");
}else{
printf("");
}
c–;
}
}
else{
printf("\n.");
while(c!=1){
count1++;
if(count1%2!=0){
printf("");
}else{
printf(".");
}
c–;
}
}
}