Twist_Nemo

problem_difficulties.cpp

Aug 6th, 2021
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.96 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. typedef long long int ll;
  4. int main() {
  5.     int t; cin >> t;
  6.     while(t--) {
  7.     // int a1, a2, a3, a4;
  8.     // cin >> a1 >> a2 >> a3 >> a4;
  9.     // // if(a1 == a2 == a3 == a4)cout << "0" << endl;
  10.  
  11.     // // if(a1!=a2 && a3!=a4)cout<< "2" << endl;
  12.     // if(a1!=a2!=a3!=a4)cout <<"2"<<endl;
  13.     // else if(a1==a2 && a3!=a4)cout<<"1"<<endl;
  14.     // else if(a1!=a2 && a3==a4)cout<<"1"<<endl;
  15.     // else if(a1!=a4 && a2!=a3)cout<< "2"<<endl;
  16.     // else if(a1!=a3 && a2!=a4)cout<<"2"<<endl;
  17.     // else cout << "0" << endl;
  18.     int arr[4]={'0'};
  19.     int n = sizeof(arr) / sizeof(arr[0]);
  20.     sort(arr, arr + n);
  21.     for (int i = 0; i < n; ++i) {
  22.         cin >> arr[i];
  23.     }
  24.    
  25.         if(arr[0]==arr[1] && arr[1]==arr[2] && arr[2]==arr[3])cout << "0" << endl;
  26.         else if(arr[0]==arr[1]&&arr[1]==arr[2] || arr[1]==arr[2]&&arr[2]==arr[3])cout<<"1"<<endl;
  27.         else cout <<"2"<<endl;
  28.     }
  29.    
  30.    
  31.  
  32. }
  33.  
Advertisement
Add Comment
Please, Sign In to add comment