fork download 
  1. # your code goes hereimport math
  2. def find(u, par):
  3.  
  4.     if par[u] != u:
  5.         par[u] = find(par[u], par)
  6.     return par[u]
  7.  
  8. def union(u, v, par, size):
  9.     u_root = find(u, par)
  10.     v_root = find(v, par)
  11.  
  12.     if u_root == v_root:
  13.         return 
  14.  
  15.  
  16.     if size[u_root] < size[v_root]:
  17.         par[u_root] = v_root
  18.         size[v_root] += size[u_root]
  19.     else:
  20.         par[v_root] = u_root
  21.         size[u_root] += size[v_root]
  22.  
  23. def ip():
  24.     return map(int,input().split())
  25.  
  26.  
  27.  
  28.  
  29. T=1
  30. T=int(input())
  31. for __ in range(T):
  32.     # n=int(input())
  33.     n,x=ip()
  34.     lst=list(ip())
  35.  
  36.     if lst.count(x)==n:
  37.         print(0)
  38.         continue
  39.  
  40.     if lst.count(x)>0:
  41.         print(1)
  42.         continue
  43.  
  44.     elif sum(lst)-n*(x)==0:
  45.         print(1)
  46.         continue
  47.  
  48.     print(2)
  49.  
Success #stdin #stdout 0.09s 14124KB
comments (?)
stdin 
3
2 69
68 70
6 4
4 4 4 4 4 4
9 38
-21 83 50 -59 -77 15 -71 -78 20
stdout 
1
0
2
https://ideone.com/xsOqhS
language:
Python 3 (python  3.12)
created:
16 days 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!