Edited by author 01.02.2017 17:12

program arrays;
var
 k:array[1..20]of longint;
 d:array[0..20]of longint;
 n:integer;
 s:longint;
procedure init;
var
 i:integer;
begin
 readln(n,s);
 for i:=1 to n do
  readln(d[i]);
 d[0]:=s;
end;
procedure solve;
var
 i:integer;
begin
 k[n]:=d[n-1]-1;
 for i:=n-1 downto 1 do
  k[i]:=(d[i-1] div d[i])-1;
 for i:=1 to n-1 do
  write(k[i],' ');
 writeln(k[n]);
end;
begin
 init;
 solve;
end.

Thanks to author!

Edited by author 19.11.2014 21:49

I have WA 1 but on my computer all ok. Is first test not like in statement?

import java.util.Scanner;
public class T1228 {

        public static void main(String[] args)
        {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            int k = in.nextInt();
            int[] a = new int[n+1];
            for (int i = 1; i <=n; i++)
            {
                a[i] = in.nextInt();
            }
            k -=1;
            int t=1;
            while (k!=0)
            {
                System.out.print((k/a[t])+" ");
                k = k%a[t];
                t++;
            }
        }
}

Edited by author 12.01.2008 04:09

var
n, s, p, i: longint;
d, k: array[1..21]of longint;
begin
readln(n, s);
for i:=1 to n do
readln(d[i]);
k[n]:=d[n-1];
p:=k[n];
for i:=n-1 downto 2 do
begin
  k[i]:=d[i-1] div p;
  p:=p*k[i];
end;
k[1]:=s div p;
for i:=1 to n-1 do
write(k[i]-1, ' ');
writeln(k[n]-1);
end.

find all K such that
1+ sumof (Di*Ki) i=1->N = S ?