competitive-coding-questions/51.cpp at master · adityamangal1998/competitive-coding-questions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include<bits/stdc++.h>
using namespace std;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin.tie(NULL);
	int q;
	cin>>q;
	while(q--)
		{
			int n;
			cin>>n;
			int max = 0,temp,temp1;
			int a[n+1];
			a[0]=0;
			for (int i=1;i<=n;i++)
				{
					cin>>a[i];
				}
			int swap = 0,flag=0;
			for (int i=1;i<=n;i++)
				{
					if((a[i]-(i))>2)
						{
							flag=1;
							break;
						}
				}
			if(flag!=1)
				{
					while(1)
						{
							flag = 0;
							for (int i = 1;i<n;i++)
								{
									if(a[i]>a[i+1])
										{
											temp = a[i];
											a[i]= a[i+1];
											a[i+1] = temp;
											swap++;
											flag=1;
										}
								}
							if(flag==0)
								{
									break;
								}
						}
				}
			if(flag==1)
				{
					cout<<"Too chaotic\n";
				}
			else
				{
					cout<<swap<<"\n";
				}

		}
	}