Codeforces 1106A Lunar New Year and Cross Counting

math Zinnatul Islam Morol Thursday, January 31, 2019

Problem link

The solution is simple: Just check if crosses can appear in every positions. Two nesting for-loops will be enough to solve this problem.
Time complexity: 

A solution in c++






Tags
Zinnatul Islam Morol

Posted by Zinnatul Islam Morol

I love to introduce myself as a competitive programmer. I have a strong motivation for writing server-side code. I take a special interest in Designing REST and GraphQL APIs, Open source contribution, Querying databases. I love to learn new things. I'm highly motivated and ready for newer challenges and want to learn new technologies.

Post a Comment

0 Comments

If you have any doubts, Please let me know