Could anyone show me what the input for test #5 is? I can't figure out why my solution fails this test case. Thanks a lot.

'The archive is compiled and executed with the same parameters and restrictions that are used for compiling and executing the submitted program containing the solution of the problem.'
It means, what the maximum size of archive is 64 KB?

Edited by author 11.01.2009 16:39

I already found a way to convert the graph to a matrix, and the ans is the determinant of this matrix. But it seems so hard to get it.

I need someone to help me read the word.
If you would like to help me
please connect me at
lkmail2@gmail.com
Thank you very much

Edited by author 21.02.2009 11:56

Just use binary search.
Becase the teacher's list is in ascending order.
We can solve the problem in O(mlogn).

My solution is:



#include <iostream>
//#include <conio.h>
using namespace std;
int prepod[15000], n;
int binsearch(int num)
{
    int l = 0, r = n - 1, m;
    while (r - l > 1)
    {
        int m = (r + l) / 2;
        if (prepod[m] == num)
          return 1;
        if (prepod[m] > num)
            l = m;
        if (prepod[m] > num)
            r = m;
    }
    if ((prepod[l] != num) && (prepod[r] != num))
      return 0;
    else
      return 1;
}
int main()
{
    int m, student, s=0;
    cin>>n;
    for (int i = 0; i < n; i++)
      scanf ("%i", &prepod[i]);
    cin>>m;
    for (int i = 0; i < m; i++)
    {
        scanf ("%i", &student);
        s+=binsearch (student);
    }
    cout<<s;
    //getch();
    return  0;
}


And it has time O(mlogn) and it is about 9e+6.

WHAT TYPE CAN I GIVE fib(100) ????????
__int64 or long long?

WHY?
I passed the problem,but I didn't understand this point.
Please help!

#include<iostream>
#include<algorithm>
#include <iomanip>
using namespace std;
int cc[0x0FFFFFFF];
int main()
{
cc[0x0FFFFFF]=13;
int a,b;
cin>>a>>b;
cout<<a+b;
return 0;
}
0x0FFFFFFF -256M

After the rejudge my previously accepted solution got TL.
Today I logged in to the site, copy-pasted my old solution (from the site), submitted it and... surprisingly got AC!
Admins, don't you think it's strange?
And the time my program worked is 0.39 - far from TL...
Here are the ID's of my submits:
1526885 - TL
2460193 - AC

program verv;
var
   a : array [1 .. 20000] of Integer;
   d, d2, min, k, n, i, j : Longint;
begin
     k := 0;
     Readln (n, d);
     d2 := 0;

     for i := 1 to n do
     begin
          Read (a[i]);
          if ((d - a[i]) > 0) then
          begin
             min := d - a[i];
             for j := i + 1 to n do
                 Read (a[j]);
             Break;
          end;
     end;

     for i := 1 to n do
     begin
                if ((d + d2) - a[i]) > 0 then
                begin
                        if ((d + d2) - a[i]) < min then
                           min := (d + d2) - a[i];
                        d2 := d2 + (d - a[i]);
                        k := k + a[i];
                end
                else
                        k := k + d;
     end;
     Writeln (k, ' ', min);
end.
SHE DONT can AC !!!! Please help me

Edited by author 22.02.2009 18:27

Please, help.

var A,I,b,Top:integer;
Na,Nb:array[1..1000]of integer;
procedure OneNumber;
begin
Nb[1]:=1;
Readln(Nb[2]);
Top:=2;
end;
begin
readln(a);
if a=1 then OneNumber else begin
for i:=1 to A do
  readln(Na[i]);
B:=1;
Top:=1;
for i:=2 to A do
  if NA[i]=NA[i-1] then begin inc(b);  if i=a then begin
   Nb[Top]:=b;inc(Top);Nb[Top]:=Na[i];end;end else
   begin Nb[Top]:=b;inc(top);NB[Top]:=Na[i-1];inc(Top);B:=1;
   if i=a then begin
   Nb[Top]:=b;inc(Top);Nb[Top]:=Na[i];
   end;end;end;
for i:=1 to Top do
  write
  (Nb[i]);
end.

can more than 9 3andls be??

if matrix 2*3
 ________
|__|__|__|
|__|__|__|
 and 1 line and 1 column is zero =>
 ________
|_#|_#|_#|
|_#|__|__| => if in empty cell is 0
=> 2 column is zero => l>1 => all empty cell is 1 => 1 variant

I don't understand why I get wrong answer:
#include <stdio.h>
#include <stdlib.h>

main()
{
  float a,b;
  printf("Enter a:");
  scanf("%f",&a);
  printf("Enter b:");
  scanf("%f",&b);
  printf("a+b=%3.2f",a+b);
  system("PAUSE");
  return 0;
}

Edited by author 10.10.2008 23:04

I don't understand that my code below get wrong answer.It can show the correct answer.Anyone, please advise me.

import java.util.Scanner;


public class root {
    public static void main(String[]args){
        Scanner in = new Scanner(System.in);
        long a = in.nextLong();
        long b = in.nextLong();
        long c = in.nextLong();
        long d = in.nextLong();



        System.out.printf("%.4f \n",Math.sqrt(d));
        System.out.printf("%.4f \n",Math.sqrt(c));
        System.out.printf("%.4f \n",Math.sqrt(b));
        System.out.printf("%.4f \n",Math.sqrt(a));
    }

}

Test:
B = 3
K = 2
X = 90
Y = 100
Result:
2
Is it right?
If not what is the right result of this test and why?

Prufer code is not N-1!!! Its should be N-2, because the last number always N. For example if I will get the numbers: 1 1 1 1 1, its impossible to build this graph. About this possible to read here:
http://en.wikipedia.org/wiki/Pr%C3%BCfer_sequence