both of the solutions above given have complexity O(N^2),
i have tried to solve it in O(N).let me inform if there is 
any bug or better solution .

#include<iostream>
using namespace std;
int main()
{
    int a[130],a1[130];
    memset(a,0,sizeof(a));
    memset(a1,0,sizeof(a));
    char ans[1000];
    char str[]="putanystringhere";
    for(int i=0;i<sizeof(str)/sizeof(char)-1;i++)
    {
        a[(int)str[i]]+=1; 
    }
    cout<<"Enter any string of length
"<<sizeof(str)/sizeof(char)-1<<" :";
    cin>> ans;  
    for(int i=0;i<sizeof(str)/sizeof(char)-1;i++)
    {
        a1[(int)ans[i]]+=1; 
    }
    bool flag=true;
    for(int i=0;i<sizeof(str)/sizeof(char)-1;i++)
    {
           if(a[(int)str[i]]!=a1[(int)str[i]])
            {
                     flag=false;
                     break;
            }
    }
    if(flag==true)
    cout<<"No error";
    else
    cout<<"Error";
    system("pause");
    return 0;
}