Solving code chef problem
Question:- Chef has recently been playing a lot of chess in preparation for the ICCT (International Chef Chess Tournament). Since putting in long hours is not an easy task, Chef's mind wanders elsewhere. He starts counting the number of squares with odd side length on his chessboard.. However, Chef is not satisfied. He wants to know the number of squares of odd side length on a generic N ∗ N N ∗ N chessboard. Solution:- /* package codechef; // don't place package name! */ import java.util.*; import java.lang.*; import java.io.*; /* Name of the class has to be "Main" only if the class is public. */ class Codechef { public static void main (String[] args) throws java.lang.Exception { // your code goes here int t; Scanner sc=new Scanner(System.in); t=sc.nextInt(); int sum=0; for(int j=t;j>0;j=j-1) { int l; l=sc.nextInt(); for(int i=l;i>0;i=i-2) ...