Solution Of Light Online Judge 1166

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
    int temp,count=0,i,n,j,k,test,array[101];
    cin>>test;

     for(i=1;i<=test;i++)
     {
         cin>>n;
         for(j=1;j<=n;j++)
             cin>>array[j];

         for(k=1;k<=n;k++)
         {
             if( array[k]!=k )
                 for(j=k+1;j<=n;j++)
                 {
                     if( array[j] == k )
                     {
                         temp=array[j];
                         array[j]=array[k];
                         array[k]=temp;

                         ++count;
                         break;
                     }
                 }
         }

         printf("Case %d: %d\n",i,count);
         count=0;
     }

    return 0;
}