Take a look at https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes.

> const n=500;
> var a:array[1..n]of string;
>     i,j,k,l,m,rk,v,t,z,pus:longint;
>     sum,ss,zz:string;
> function mmm(p:longint):longint;
>   begin
>   v:=1;
>     while ((v+1)*(v+2)) div 2<=p do v:=v+1;
>   mmm:=v;
>   end;
> function plus(pluss1,pluss2:string):string; {only pozitive!!!}
>   var plusi,pluscode,plusi1,plusi2,plusna,plusba:integer;
>       pluss,plusss:string;
>   begin
>     if pluss1='' then pluss1:='0';
>     if pluss2='' then pluss2:='0';
>   pluss:='';
>     while length(pluss1)<length(pluss2) do pluss1:='0'+pluss1;
>     while length(pluss2)<length(pluss1) do pluss2:='0'+pluss2;
>   plusna:=0; plusba:=0;
>     for plusi:=length(pluss1) downto 1 do begin
>     val(pluss1[plusi],plusi1,pluscode);
>     val(pluss2[plusi],plusi2,pluscode);
>     plusba:=(plusi1+plusi2+plusna) mod 10;
>     plusna:=(plusi1+plusi2+plusna) div 10;
>     str(plusba,plusss);
>     pluss:=plusss+pluss;
>     end;
>     if plusna<>0 then begin
>     str(plusna,plusss);
>     pluss:=plusss+pluss;
>     end;
>   plus:=pluss;
>   end;
> begin
>   readln(m);
>     for i:=1 to m do a[i]:='1';
>   sum:='0';
>   rk:=mmm(m);
>     for i:=2 to rk do begin {&#1031;&#1168;&#1072;&#1168;&#1038;&#174;&#1072; &#1031;&#174; k}
>       for j:=1 to i do begin
>       t:=i+j;
>         while (t<(i+1)*i div 2)and(t<=m) do t:=t+i;
>       ss:='0';
>         while t<=m do begin
>         zz:=a[t];
>         a[t]:=plus(a[t-i],ss);
>         t:=t+i;
>         ss:=zz;
>         end;
>       end;
>       if m<((i+1)*i div 2)-1 then pus:=m else pus:=((i+1)*i div 2)-
1;
>       for z:=1 to pus do a[z]:='0';
>     sum:=plus(sum,a[m]);
>     end;
>   writeln(sum);
> end.

your solution is verry stupid. I think only one lamer could solve
the problem like this. I wrote only 22 lines. Of course, Pascal suks.

what does your program mean?

program ural1017;
var
  q:array[0..500]of int64;
  n,i,j:integer;
begin
  fillchar(q,sizeof(q),0);
  readln(n);
  q[0]:=1;
  for i:=1 to n do
    for j:=n downto i do
      inc(q[j],q[j-i]);
  writeln(q[n]-1);
end.

haha, why anyone use array with length 500?
just try to think a little, program need array with length no more 32!

LOL! the only lamer here is  "Yuriy Frolov (ufrolov@ukr.net)"-:D :D :D Your program is worst i've ever seen :D :D :D You chose stupidest way to solve and  you think that others are lamers??? :D it would be better to hide this solution except to submit it :D

Didn't you see constraint bro -_- Length is 50 and suffix array :V

Now TL on test#1, what's wrong, I don't understand everything

I also got AC out there. 250 ms. 1300 kb.
Here I got TLE. 102 kb.

using long long rather than int

Found it. Misunderstood the problem.

If 64631000033 is a prime, it's also good. You should output any, not necessarily minimal.

got AC +17...

it SHOULD have leading zeros.
L CAN be 0
digits CAN be separated by blanks.
ALL IS MY IMHO

i have the same question as you，why is 64631000033 not the right answer，can you tell me，please？

I spotted a bug. Will fix it first and try again.

TRY :
7 2
u should get:
4

TRY :
7 2
u should get:
4

My code is here:
http://www.vitoshacademy.com/python-algorithm-challenge-first-day-at-school/

may be it is test

1
vasya like computers
Thursday 1

You have to change Output in case of empty solution from "0" to Empty string. It will solve your problem

It's hard to dispute with you! :))))

其实我也这样觉得！

Don't know what kind of test it is, but precision troubles are quite likely in this problem. So, solve problem in integers to avoid them.

I had WA on test 9 with a wrong formula for the movement equations, that worked on the samples, but was too weak to solve these tests (it would say "yes" to both):

14
0 20
0 10
0 0
Yes

14
0 20
0 9
0 0
No