Ok, so want to solve this problem - DCE05 Problem - CodeChef
Basically I want to remove the elements present in odd positions from a LIST.
So, i used erase and STL to do it.
But it’s showing me time limit exceeded. Now, I there is another method to do it, but i would really appreciate if someone could tell me how to make my STL code efficient?
#include<iostream>
#include<list>
using namespace std;
int compute(int num)
{
list<int> L;
list<int>::iterator i;
for(int k=1;k<=num;k++)
{
L.push_back(k);
}
int k=1;
while(L.size()!=2)
{
i=L.begin();
while(i!=L.end())
{
if(k%2!=0)
i=L.erase(i);
else
i++;
k++;
}
}
return L.back();
}
int main()
{
int testcases,AR[1000];
scanf("%d",&testcases);
int num;
for(int i=1 ; i<=testcases ; i++)
{
scanf("%d",&num);
AR[i]=compute(num);
}
for(int i=1;i<=testcases ; i++)
{
printf("%d\n",AR[i]);
}
return 0;
}