Algorithms

1. Read the question carefully
   
2. Understand that English isn't everyone's first language so be lenient of bad spelling and grammar
   
3. If a question is poorly phrased then either ask for clarification, ignore it, or mark it down. Insults are not welcome
   
4. If the question is inappropriate then click the 'vote to remove message' button
   

1. Choose the correct forum for your message. Posting a VB.NET question in the C++ forum will end in tears.
   
   
2. Be specific! Don't ask "can someone send me the code to create an application that does 'X'. Pinpoint exactly what it is you need help with.
   
   
3. Keep the subject line brief, but descriptive. eg "File Serialization problem"
   
   
4. Keep the question as brief as possible. If you have to include code, include the smallest snippet of code you can.
   
   
5. Be careful when including code that you haven't made a typo. Typing mistakes can become the focal point instead of the actual question you asked.
   
   
6. Do not remove or empty a message if others have replied. Keep the thread intact and available for others to search and read. If your problem was answered then edit your message and add "[Solved]" to the subject line of the original post, and cast an approval vote to the one or several answers that really helped you.
   
   
7. If you are posting source code with your question, place it inside <pre></pre> tags. We advise you also check the "Encode "<" (and other HTML) characters when pasting" checkbox before pasting anything inside the PRE block, and make sure "Use HTML in this post" check box is checked.
   
   
8. Be courteous and DON'T SHOUT. Everyone here helps because they enjoy helping others, not because it's their job.
   
   
9. Please do not post links to your question into an unrelated forum such as the lounge. It will be deleted. Likewise, do not post the same question in more than one forum.
   
   
10. Do not be abusive, offensive, inappropriate or harass anyone on the boards. Doing so will get you kicked off and banned. Play nice.
    
    
11. If you have a school or university assignment, assume that your teacher or lecturer is also reading these forums.
    
    
12. No advertising or soliciting.
    
    
13. We reserve the right to move your posts to a more appropriate forum or to delete anything deemed inappropriate or illegal.

Fonction f(a: entier, b: entier): integer
var r, z: integer
Begin
r <-- 0
z <-- 1

while(a != 0)
  r <-- r + (a mod 10) * z
  z <-- z * b
  a <-- a div 10
endWhile

return r
End

I want to ask one general question here, We have seen 32 bit and 64 bit Operating System.
Is there any other larger size bit Operating System exist? If yes can you please share the link to download it.?   i  want the best speed operating system.

Below is the link to the problem and my code. I could only pass case 1 with my code. And other cases are showing wrong answers. It would be of great help if anyone could identify the errors in my code.

#include<bits/stdc++.h>

using namespace std;

vector<long long int>freq(1000000,0);

void merge(vector<long long int>&v,long long int low,long long int mid,long long int high)
{
    long long int count=0;
    long long int i = low,j = mid+1,k=0;
    vector<long long int>temp(high-low+1);
    for(long long int p=low;p<=high;p++)
    {
        if(i>mid)
        {
            temp[k++] = v[j++];
        }
        else if(j>high)
        {
            temp[k++] = v[i];
            freq[v[i]]+=count;
            i++;
        }
        else if(v[i]<=v[j])
        {
            temp[k++] = v[i];
            freq[v[i]]+=count;
            i++;
        }
        else
        {
            temp[k++] = v[j++];
            count++;
        }
    }
    
    
    for(long long int p = 0;p<k;p++)
    {
        v[low+p] = temp[p];
    }
}

void merge_sort(vector<long long int>&v,long long int low,long long int high)
{
    if(low>=high)
    {
        return;
    }
    long long int mid = (low+high)/2;
    merge_sort(v,low,mid);
    merge_sort(v,mid+1,high);
    merge(v,low,mid,high);
}

int main()
{
    long long int t;
    cin>>t;
    while(t--)
    {
        long long int n,x;
        cin>>n;
        vector<long long int> v;
        for(long long int i=0;i<n;i++)
        {
            cin>>x;
            v.push_back(x);
        }
        vector<long long int>w = v;
        merge_sort(v,0,n-1);
        for(long long int i=0;i<n;i++)
        {
            cout<<freq[w[i]]<<" ";
        }
        cout<<endl;
    }
}