what answare on input = 6

This is very foolish task. I think, it hasn't right answer.
It is not really to describe all sides of this program!!!

subj

Qalaysan

What is 9th test???

Is there any way to submit my code to some problems with email?

WA :(
Can anyone give me some sly tests?

Tried to use STL (map, vector), but get TL11. Please, give me idea, how to use in this problem triple tree? Can't find any algorithms. Thank you!

Edited by author 27.10.2007 23:49

does it mean: -3, -2, -1.. etc?

or say:

-1 (1 1 2 -2 -1)

i am choosing the last 5?

Edited by author 27.10.2007 17:16

I don't understand why my program is wrong.
Please help me. Give me some hints or tests.

Thanks

.....who knows why??????

.....who knows why??????

It's nearly O(n) and it only uses 0.001 second.
As follows:


#include<stdio.h>
#include<string.h>
#include<math.h>
int n,s;
int f[100001];

int gcd(int a,int b)
{
       if(b==0)  return a;
       return gcd(b,a%b);
}

void work()
{
      int i,j,k,max=0;
      memset(f,0,sizeof(f));
      f[s]=1;
      for(i=s;i<=n;i++){
            if(f[i]){
                 if(i>100) k=gcd(i,100);
                 else k=gcd(100,i);
                 k=i/k;
                 for(j=k;j<=i&&i+j<=n;j+=k){//据说只要加到100%就可以了
                       if(f[i]+1>f[i+j])
                         f[i+j]=f[i]+1;
                 }
                if(f[i]>max)
                  max=f[i];
            }
      }
      printf("%d\n",max);
}
int main()
{
     int i;
     scanf("%d%d",&n,&s);
     work();
     return 0;

}

It's nearly O(n) and it only uses 0.001 second.
I'm sorry I didn't saw the rule...
"Messages should NOT contain source code (especially correct solutions). "

Fogive me //
A small hint : use the GCD..

Edited by author 26.10.2007 08:58

n=111 s=110
There is no sequence that that leads form 110 to 111. Is it possible such test? I got WA on test 2 and really don't know why. Are this correct?:
input
400 100
output
7
------
123 14
9
------
333 2
20
------
1000 67
11
------
5678 567
8
------
9800 100
22
------

   Thanks

I dont know/My programm out 3 in the 1 test/And it is wrong.But if wright
cout << "3";
it is right/
???????

:

this is my algorithm

printf(minfactor(k)-1) where minfactor(k) - min x, such k % x == 0, x>2

i have proof for my algorithm...
where my mistake?

Edited by author 28.09.2007 11:00

Are there tests like this?
3 4
2 2 1
3 1 7 2
2 1 4