fork download
copy 
  1. program airport;
  2. var
  3. n,m,i,j : longint;
  4. t : array[1..1000] of longint;
  5. max,min : longint;
  6. begin
  7. 	readln(n,m);
  8. 	for i:= 1 to m do
  9. 	begin
  10. 		read(t[i]);
  11. 	end;
  12. 	for i := 1 to (n div m) do
  13. 	begin
  14. 		for j := 1 to m do
  15. 		begin
  16. 		max := max + (t[j]-i+1);
  17. 		end;
  18. 	end;
  19. 	for i := 1 to (n mod m) do
  20. 	begin
  21. 		max := max + (t[i]-(n div m)+1);
  22. 	end;
  23. 	for i := 1 to m do
  24. 	begin
  25. 		if n<t[i] then min := min + (t[i]*(t[i]+1) div 2) - (n*(n+1) div 2)
  26. 		else
  27. 		min := min + (t[i]*(t[i]+1) div 2);
  28. 		n := n-t[i];
  29. 	end;
  30. 	writeln(max,' ',min);
  31. end.
Success #stdin #stdout 0.02s 216KB
comments (?)
stdin
copy 
4 3
2 2 2
stdout
copy 
8 9
https://ideone.com/bfXXx
language:
Pascal (fpc 3.0.4)
created:
13 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!