сам ни до конца понял

числа из отрезка подходят под нормальный сигнал!

1) Use "double" instead of "float".
2) Don't use Pascal, 'cause C++ is really cool language.
P.S. I don't understand how can people write theese "begin ... end" so many times?

1) Look how your C++ program will work with n=10000;)
2) You've forgotten about percent sign in else printf("0.00\n");
3) Don't use % in printf, use %% (it will show as %)
4) LEARN C++ well before writing on it!

Edited by author 03.02.2006 17:57

Holywar on timus=). Lol.

Can anyone translate my solution below into C++? I want to learn programming in C/C++ too :)

type TArray=array of dword;
var arr:TArray;
m,n,c,i:dword;
begin
readln(n,m);
setlength(arr,n+1);
for i:=1 to n do arr[i]:=0;
for i:=1 to m do begin
readln(c);
arr[c]+=1;
end;
for i:=1 to n do begin
writeln((arr[i]*100/m):2:2,'%');
end;
end.

Yup, output is correct, because 3 is a friend with 1, 2, 4, 5 and 6 is a friend with 7. So each member of each team has at least one friend in the opposite team

It is not possible to achieve 0.001 sec result with the current judge.   The measurement for an empty program that only calls puts("\n"); is 0.015 at this time.   Until the measurement mechanism is changed, those who submitted results years ago will be the only ones to achieve 0.001.

My program print this result:
9
212122112

See first sample.

But if your code work 0.5 now, in 2003 he worked more than 1 sec

I can't understand you

Thanks

 My program is very short.

Each of n and m is <= 2^31-1. Yes, they are unsigned long.

But max unsigned long + 1 is? Overflow, of course !!

Your solution doesn't print n or m exactly but you have to calculate either 2*m or 2*n, aren't you?

> here is my source (C++):
---------------------------
#include <stdio.h>

int i;long sum=0;
int n;

void main()
 {
  scanf("%d",&n);
  if(n<1)
   for(i=1;i>=n;i--)
    sum+=i;
  else
   for(i=1;i<=n;i++)
    sum+=i;
  printf("%ld",sum);
 }
--------------------------

it's code

program z1821;
var n,i,j,m,x,max,ol:integer;
s,s1:string;
names:array[1..100]of string;
times:array[1..100]of integer;
reznames:array[1..100] of string;

begin
readln(n);
j:=1;
for i:=1 to n do begin
    readln (s);
    while s[j]<>' ' do  begin
    inc(j);
    end;
    names[i]:=copy(s,1,j);    //
    delete(s1,1,length(s1));  //
    s1:=copy(s,j+1,2);        //
    val(s1,times[i],ol);      //
    delete(s1,1,2);           //
    s1:=copy(s,j+4,2);        //
    times[i]:=times[i]*600;   //
    val(s1,x,ol);             //
    times[i]:=times[i]+x*10;  //
    delete(s1,1,1);           //
    s1:=copy(s,j+7,1);        //
    val(s1,x,ol);             //
    times[i]:=times[i]+x;     //
    j:=1;                     //it's input, don't look on it =)
end;
    for i:=2 to n do
    times[i]:=times[i]-300*(i-1);
    max:=times[1]+1;
    m:=0;
  j:=1;
    for i:=1 to n do begin
        if times[i]<max then begin
            max:=times[i];
            reznames[j]:=names[i];
            m:=m+1;
      j:=j+1;
        end;
    end;

        for i := 1 to m-1 do
        for j := 1 to m-i do
            if reznames[j] > reznames[j+1] then begin
                s1 := copy(reznames[j],1,length(reznames[j]));
                reznames[j] :=copy(reznames[j+1],1,length(reznames[j+1]));
                reznames[j+1] :=copy(s1,1,length(s1));
            end;
 writeln(m);
    for i := 1 to m do
        writeln(reznames[i]);
end.

Edited by author 09.10.2012 23:47

Hints:
 1) your while loop condition is not quite right.
2) you are not growing n1 properly in the while loop
3) your "if (n - n1>0)" is not necessary, if n-n1 == 0 then the division result will be zero
4) integer ceiling of x/y can be done in a single step like this: (x + y - 1)/y
5) it's generally a good idea to finish each line of output with a newline character

In general: do some examples on paper, and step through your code in the debugger, or put in a bunch of print statements to follow the progress of the solution, and you'll discover where the problems are.

Hello! The answer for this test:

2 2
1 2
2 1

is "2", but your answer is "1".
Good luck!

Btw, in test #5 N = M = 100. I made inaccurate array definition and get this information. :)