Can anybody explain me DP algo what is it?

#include <stdio.h>
#include <math.h>
int N, kol, Optkol;
void kvad(int n)
{
 for (int i=sqrt(double(n)); i>=1; i--)
    {
     if (n-i*i>=0 && kol+1 < Optkol)
       {
        kol++;
        mas[kol] = i*i;
        n -= i*i;
        if (n>0) kvad(n);
        else if (n == 0)
          Optkol = kol;

        l--;
        n=n+i*i;
       }
     }
}

int main()
{ scanf("%d", &N);
  Optkol = N;
  kvad(N);
  printf("%d\n", Optkol);


        return 0;
}

var a:real;
    b:real;
    c:longint;
begin
    readln(a);
    if a=181 then writeln(2) else begin
    while a>0 do begin
    b:=trunc(sqrt(a));
    c:=c+1;
    a:=a-(b*b);
    end;
    writeln(c);
    end;
end.

Edited by author 25.01.2008 17:35

Edited by author 30.01.2008 19:26

Help me please. I don't understand what DP is. Any hints?

Firstly it's comfortable to use recursive scheme of DP.
Secondly : I've STAK_OVERFLOW when tried to take DP form 1 to sqrt(n), but AC when sqrt(n) downto 1. I don't know what's the differnce but result depend of it

//1073
#include<iostream>
#include<cmath>
using namespace std;
unsigned long mn;
bool fine;
unsigned long sch(unsigned long n,unsigned long stpos,unsigned long time)
{
    if ((fine==true)&&(time==mn-1)){
        return(1);
    }else{
        n=n-stpos*stpos;
        if (n==0) {
            fine=true;
            return(1);
        }else{
            if (n<(stpos*stpos)) {
                stpos=int(floor(sqrt((long double)n)));
            }
            unsigned long submn,i,tmp;
            submn=sch(n,stpos,time+1);
            for (i=stpos-1;i>0;i--) {
                tmp=sch(n,i,time+1);
                if (tmp<submn) {
                    submn=tmp;
                }
            }
            return(submn+1);
        }
    }
}
int main (void)
{
    unsigned long n,rtfn;
    cin>>n;
    if (n==0) {
        cout<<0;
        return 0;
    }else{
    fine=0;
    rtfn=int(floor(sqrt((long double)n)));
    cout<<sch(n,rtfn,0);
    }
}

who can explain it for me???

the only part that I can think of getting compile error is this:

  int num;
  int tmp;

 tmp = (int) sqrt(num);

But why??

#include <iostream>
#include <math.h>
using namespace std;

long int c,i,a,s;

int main ()
{
    cin>>a;
    s=0;
    for(;;)
    {
        s++;
        a-=pow(int (sqrt(a)),2);
        if(a==0) break;
    }
    cout<<s<<endl;

    return 0;
}

No problem, I solved it in 0.001s
Edited by author 27.11.2006 04:11

Edited by author 27.11.2006 05:02

Edited by author 27.11.2006 05:02

Author: Test 5 -- Wrong answer
Correct -- 2: 2^2+1^2
Why Error

Edited by author 23.09.2006 02:26

Help Please !!