Competitions » Main CodeFu Competitons » CodeFu 2010 » Results

CodeFu 2010 Results

Final Round Results

vasja's solution for 300: NumberSequence, written in C++, submitted on 09.05.2010 11:59:33

#include <string>
#include <vector>
using namespace std;

class NumberSequence
{
  public:
         
  string lepi(string prev,int br)
  {
    return prev+to_string(br);       
  }
   string to_string(int br)
{
  string res="";
   while(br>0){res+=(br%10)+'0'; br/=10;}
   reverse(res.begin(),res.end());
return res;
   
}
    int findDigit(int N)
    {
      string broj="1";
  string s;
int Ndigs=1;
int next=2;
int cnt;
string nxtS="12";

if(N==1) return 1;

while(1)
{
 
 // cout<<broj.size()<<endl;
 // system("pause");


  
  Ndigs+=nxtS.size();

  if(Ndigs>=N)
{
  cnt=nxtS.size()-1;
  while(Ndigs>N) {Ndigs--; cnt--;}
return int(nxtS[cnt]-'0');
}

  next++;
  nxtS+=to_string(next);
}

      return -1;
  }
}