fork download
copy 
  1. import java.util.Scanner;
  2. class LCOLLIS
  3. {
  4.     final static long[] factorial = {1,1,2,6,24,120,720,5040,40320,362880,3628800};
  5.     public static void main(String[] args) 
  6.     {
  7.         Scanner scan = new Scanner(System.in);
  8.         long n = scan.nextLong();
  9.         for(long i=0;i<n;i++)
  10.         {
  11.             long coll=0;
  12.             long N = scan.nextLong();
  13.             scan.nextLong();
  14.             for(long j=0;j<N;j++)
  15.             {
  16.                 coll+=combinations(count1(scan.next()));
  17.             }
  18.             System.out.println(coll);
  19.         }
  20.         scan.close();
  21.     }
  22.     static long count1(String input)
  23.     {
  24.         return input.length()-(input.replaceAll("1", "").length());
  25.     }
  26.     static long combinations(long N)
  27.     {
  28.         if(N==1||N==0)
  29.             return 0;
  30.         return factorial[(int) N]/((2)*factorial[(int) (N-2)]);
  31.     }
  32. }
Success #stdin #stdout 0.06s 4386816KB
comments (?)
stdin
copy 
2
4 3
101
100
101
000
2 2
10
01
stdout
copy 
2
0
https://ideone.com/18f12Q
language:
Java (HotSpot 12)
created:
6 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!