fork download
copy 
  1. program bouquet;
  2. var N,J,i : Longint;
  3.     F : array [0..100000] of Longint;
  4.  
  5.  
  6. function componi (N:Longint; J:Longint; F: array of Longint) : longint; 
  7. var minimo, massimo : Longint;
  8.     uguali : boolean;
  9. begin
  10.    massimo:=F[0]; minimo:=F[0]; uguali:=true;
  11.    for i:=1 to N-1 do
  12. 	                 begin
  13. 	                    if F[i]< minimo then minimo:=F[i];
  14. 	                    if F[i]> massimo then massimo:=F[i];
  15. 	                    if F[i]<>F[0] then uguali:=false;
  16. 	                 end; 
  17.   if J=0 then componi:=minimo
  18.          else
  19.            begin
  20.               if uguali=true then componi:=minimo+ J div N
  21.                              else
  22.                                begin
  23.                                   writeln('cia');
  24.                                end;
  25.            end;
  26.  end;          
  27.  
  28.  
  29. begin
  30. 	readln(N,J);
  31. 	for i:=0 to N-1 do read(F[i]);  readln;
  32. 	writeln(componi(N,J,F));
  33. end.
Success #stdin #stdout 0s 5292KB
comments (?)
stdin
copy 
4 7
2 6 4 3
stdout
copy 
cia
400004
https://ideone.com/Z8Cp7l
language:
Pascal (fpc 3.0.4)
created:
1 hour 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!