vatayush's blog

By vatayush, history, 10 years ago, In English

hey! i was trying to solve this problem but i am continuously getting WA on sample test cases itself.here's my submission...can someone please point a bug in my code..

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By vatayush, 10 years ago, In English

hi!! i am trying to solve this problem on uva o9 judge,but i am getting WA on test cases.here's my code...can someone please explain why??

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By vatayush, 10 years ago, In English

hi!i was solving this problem.it's strange that this submission1 got TLE while when i used set instead of visited array to keep track of colors the same code got AC.My AC code.Can someone please explain me why??

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it

By vatayush, 10 years ago, In English

hi! i am trying to solve this question.here's my code.it is getting stuck somewhere.i can't find the error.please help!!

Full text and comments »

  • Vote: I like it
  • -3
  • Vote: I do not like it

By vatayush, 10 years ago, In English

Hey i am tying to solve the problem from yesterday's contest.i am getting WA in 2nd test case.can someone please point a bug.i am unable to find one.here is my code

Full text and comments »

  • Vote: I like it
  • +2
  • Vote: I do not like it

By vatayush, 10 years ago, In English

How can i solve this question? i wrote the following code but it fails for larger test cases:

#include<bits/stdc++.h>
using namespace std;
int main()
{
  while(1)
  {
    long long sum;
    cin>>sum;
    long long int n=sqrt(sum);
    int h=0,len=999999999;
    for(int i=n;i<=2*n;i++)
    {
      //printf("%d\n",i);
      int fh=(i*(i+1))/2;
      if(fh>sum)
	break;
      if(fh==sum)
      {
	if(len>n)
	{
	  cout<<len<<endl;
	  h=i;
	  len=i;
	}
      }
      long long int rem=sum-fh;
      long long int a=2*(i-1)+1;
      if(a*a-8*rem>=0)
      {
	long long int r=(a+sqrt((a*a)-(8*rem)))/2;
	if(2*rem==r*(2*(i-1)+(r-1)*-1))
	{
	  if(len>i+r)
	  {
	    len=i+r;
	    cout<<len<<' '<<i<<endl;
	  }
	}
	if(a>sqrt(a*a-8*rem))
	{
	  long long int r=(a-sqrt((a*a)-(8*rem)))/2;
	  if(2*rem==r*(2*(i-1)+(r-1)*-1))
	  {
	    if(len>i+r)
	    {
	    len=i+r;
	    cout<<len<<' '<<i<<endl;
	    }
	  }
	}
      }
    }
    printf("%d\n",len);
  }
  return 0;
}

	

please help? Edit: sorry, the question was not visible earlier.Now it's visible.

Full text and comments »

  • Vote: I like it
  • 0
  • Vote: I do not like it