License Key of Advanced System Protector

You do not need to install crack file or any other software. Here is your solution.....

1-After scanning a pop-up will appear as shown in figure. Click on "click here to enter your key"

 

2-Enter the key as it is in figure. Click on "Register Now". It will take less than one minute to verify your given key, finally if it works and "Register" button in toolbar menu will disappear automatically. Enjoy.....!!!

Following serial keys also works

1. 00ZNXX-FA684X-21PQZQ-41H89P
2. 0000GJ-H294DQ-QZZWUC-28427K-6M­P9E0
3. 0000GJ-H294DP-Z9TGJM-YE4FJM-RE­7KEP
4. 0000GJ-H294DH-ED0BJB-2WBQ9D-Y3­PJ6Y
5. 0000GJ-H294DH-ED0BJ7-DVB9GY-NA­F6PP
6. 00ZNXX-FA684X-21PQZQ-41H89P

Search a value in one dimensional array in C++

#include<iostream>
using namespace std;
bool Search(int arr[],int& s,int& val)
{
     for(int i=0;i<s;i++)
     {
           if(val == a[i])
          {
               return true;
          }
     }
     return false;
}
int main(void)
{
     int size=0,value=0;
     cout<<"\n\tEnter size of array:\t";
     cin>>size;
     int *arr=new int[size];
     cout<<"\n\tEnter value to search in array:\t";
     cin>>value;
     if(Search(arr,size,value))
     {
           cout<<value<<" exist in array";
     }
     else
     {
           cout<<value<<" doesnot exist in array";
     }
     cout<<"\n\n";
     return 0;
}

Removing duplicate numbers from one dimensional array in C++

#include<iostream>
using namespace std;
void Remove_Duplicates(int arr[],int& s)
{
     for(int i=0;i<s;i++)
     {
          for(int j=i+1;j<s;j++)
          {
                if(arr[i] == arr[j])
                {
                      for(int k=j;k<s;k++)
                      {
                            arr[k]=arr[k+1];
                      }
                      j--;s--;
                }
          }
     }
}
int main(void)
{
     int size=0;
     cout<<"\n\tEnter size of array:\t";
     cin>>size;
     int *arr=new int[size];
     Remove_Duplicates(arr,size);
     return 0;
}