Commit f653d59

authored

Create Make Equal With Mod.cpp

1 parent d1311c8 commit f653d59Copy full SHA for f653d59

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 56 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,56 @@`
	`1`	`+#include <iostream>`
	`2`	`+#include <vector>`
	`3`	`+#include <algorithm>`
	`4`	`+`
	`5`	`+using namespace std;`
	`6`	`+`
	`7`	`+void solve()`
	`8`	`+{`
	`9`	`+ int no_of_elements;`
	`10`	`+ cin >> no_of_elements;`
	`11`	`+`
	`12`	`+ vector <long long> A(no_of_elements + 1);`
	`13`	`+ for(int i = 1; i <= no_of_elements; i++)`
	`14`	`+ {`
	`15`	`+ cin >> A[i];`
	`16`	`+ }`
	`17`	`+`
	`18`	`+ vector <int> present(3, false);`
	`19`	`+ for(int i = 1; i <= no_of_elements; i++)`
	`20`	`+ {`
	`21`	`+ if(A[i] <= 2)`
	`22`	`+ {`
	`23`	`+ present[A[i]] = true;`
	`24`	`+ }`
	`25`	`+ }`
	`26`	`+`
	`27`	`+ int possible = true;`
	`28`	`+ if(present[1])`
	`29`	`+ {`
	`30`	`+ sort(A.begin(), A.end());`
	`31`	`+`
	`32`	`+ for(int i = 1; i + 1 <= no_of_elements; i++)`
	`33`	`+ {`
	`34`	`+ if(A[i] + 1 == A[i + 1])`
	`35`	`+ {`
	`36`	`+ possible = false;`
	`37`	`+ break;`
	`38`	`+ }`
	`39`	`+ }`
	`40`	`+ }`
	`41`	`+`
	`42`	`+ cout << (possible ? "Yes" : "No") << "\n";`
	`43`	`+}`
	`44`	`+`
	`45`	`+int main()`
	`46`	`+{`
	`47`	`+ int no_of_test_cases;`
	`48`	`+ cin >> no_of_test_cases;`
	`49`	`+`
	`50`	`+ while(no_of_test_cases--)`
	`51`	`+ solve();`
	`52`	`+`
	`53`	`+ return 0;`
	`54`	`+}`
	`55`	`+`
	`56`	`+`

Comments

(0)