For this Question: For two strings A and B, let A + B denote the concatenation of A and B in this order.
You are given N strings Si,. , SN​. Modify and print them as follows, in the order i = 1,. , N:
 
Let X be the number of strings S1​,. , Si-1​ are equal to Si​.
if X = 0 print Si.
if X (X > 0) print Si​+(+X+), treating X as a string.The first line of the input contains a single integer N.
The next N lines contains N strings S1, S2,. SN.

Constraints:
1 <= N <= 2 x 10^5
Si is a string of length between 1 and 10 (inclusive) consisting of lowercase English letters.Print N lines as specified in the Problem Statement.Sample Input 1:
5
newfile
newfile
newfolder
newfile
newfolder
 
Sample Output 1:
newfile
newfile(1)
newfolder
newfile(2)
newfolder(1)
 
 
Sample Input 2:
11
a
a
a
a
a
a
a
a
a
a
a
 
Sample Output 2:
a
a(1)
a(2)
a(3)
a(4)
a(5)
a(6)
a(7)
a(8)
a(9)
a(10), I have written this Solution Code: #include<iostream>
#include<cstring>
#include<map>
using namespace std;
const int N=1e3+10;

int main(){
	int n;
	scanf("%d",&n);
	map<string,int>ans;
	for(int i=1;i<=n;i++){
		string res;
		cin>>res;
		if(ans[res]){
			cout<<res<<"("<<ans[res]<<")"<<endl;
		}
		else{
			cout<<res<<endl;
		}
		ans[res]++;
	}
	
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?