Could anybody tell my what the test data#8 is,
or tell me where my program wrong:
var
  a,b,c:array [1..20000] of 0..9;
  n,k:longint;
  i,j:int64;

procedure mul;
  var i,j,r,c:byte;
  begin
    c:=0;
    inc(j);
    while a[j]=0 do dec(j);
    i:=0;
    repeat
      inc(i);
      r:=a[i]*(k-1)+c;
      a[i]:=r mod 10;
      c:=r div 10;
    until i=(j+1);
  end;

procedure add;
  var i,j,r,c:byte;
  begin
    c:=0;
    inc(j);
    while a[j]=0 do dec(j);
    i:=0;
    repeat
      inc(i);
      r:=a[i]+b[i]+c;
      a[i]:=r mod 10;
      c:=r div 10;
    until i=(j+1);
  end;

begin
  read(n,k);
  fillchar(a,sizeof(a),0);
  fillchar(b,sizeof(b),0);
  fillchar(c,sizeof(c),0);
  a[1]:=k-1;
  j:=1793;
  i:=1;
  repeat
    inc(i);
    c:=a;
    add;
    mul;
    b:=c;
  until i=n;
  add;
  inc(j);
  while a[j]=0 do dec(j);
  inc(j);
  repeat
    dec(j);
    write(a[j]);
  until j=1;
  writeln;
end.
(like this one:
var
  a,b,c:extended;
  n,k,i:integer;
begin
  readln(n,k);
  a:=k-1;
  for i:=2 to n do begin
  c:=a;
  a:=(a+b)*(k-1);
  b:=c;
  end;
  a:=a+b;
  writeln(a);
end.)

This is my solution:
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n1 = in.nextInt();
int[] a = new int[n1];
for (int i = 0; i < n1; i++) a[i] = in.nextInt();
// Arrays.sort(a);
int n2 = in.nextInt();
int[] b = new int[n2];
for (int i = 0; i < n2; i++) b[i] = in.nextInt();
// Arrays.sort(b);
boolean res = false;
for (int i = 0; i < n1; i++)
if (Arrays.binarySearch(b, 10000 - a[i]) >= 0) res = true;
if (res) out.println("YES");
else out.println("NO");
out.flush();
It have got WA on test#3
After uncommenting sorting I have got AC.
But by the data I must not sort arrays, because its sorted.
Am I wrong?

Edited by author 11.09.2007 20:08

I've spent so much time solving this problem and tried many different approaches. Finally, I've go Accepted. It's a very good problem, it develops your imagination.

For those who doesn't no how to solve it there is a hint. Assume that N <= 4 / 3 * M and solve it. After that generalize your approach

I have WA (test #5). Who can give me tests? I want to find and correct my mistake. Please, answer.

hi , here is my code . why my program crashed.

/// code

 import java.io.* ;
 import java.util.* ;

  public class stonepile {

  public static void main(String args[]) throwsIOException {

BufferedReader br = new BufferedReader(new  InputStreamReader(System.in));

    String str =null ;

   while((str=br.readLine())!=null) {
    //str=br.readLine() ;
   StringTokenizer st = new StringTokenizer(str," ") ;
   String s = st.nextToken() ;

      int []a = new int [50] ;
      int []dp =  new int [2000100] ;
      int  sum= 0 ;

       int n = Integer.parseInt(s) ;
         for ( int i = 0 ; i < n; i ++) {
           str = br.readLine() ;
             st = new StringTokenizer(str," ");
              s=st.nextToken() ;
              int m = Integer.parseInt(s) ;
               a[i] = m ;
                //sum +=m ;
          }

         dp[0] = 1 ;
          for ( int i = 0 ; i < n ; i++ ) {
              int c = a[i] ; sum+=c ;
            for ( int j = sum;  j -c >= 0 ; j--)
                 if ( dp[j-c]>0)
                      dp[ j ] = 1 ;

             }

          int y = -1 ,x = -1, j= -1 , r = 20000000 ;

            for ( int i = 1; i <sum+1 ; i++)
                 if ( dp[i]>0 && dp[sum-i]>0) {
                       x = Math.abs(i-(sum-i));
                       if ( r >x)
                           r=x  ;
             }

                    System.out.println(r) ;
           }
         }

      }

i have write my own Z function algorithm and need to test it
please tell me some problems, where i need to use this function to solve it

Зачем столько неясностей в условии оставлять, да ещё и, не скрывая этого, говорить "try both variants".

I use hungary algo, but OLE.
It is right to use this algo? Or what should I improve in my prog? Any hint? Plz

It's easy to understand
if (n mod 3=0) or (m mod 3=0) then answer=2
But why are the answers to the rest of datas are all 1????
Can someone tell me???

I need help.

I have WA6

Edited by author 18.09.2006 22:29

Edited by author 18.09.2006 22:29

Can anybody give me good tests...

~.~
There is a trick in finding divsors.
For example,the number of k divisor from 1~N is
F(N)=N div k+N div (k*k)+N div (k*k*k)......

So we can just calc F(N)-F(M)-F(N-M) for every divisor that is between 1 and N.

Hi,Gues!

Please Help me! I have WA#54 and I don't understand what's wrong.

This is my code

#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>

using namespace std;

struct sphere
{
    int x;
    int y;
    int z;
    int r;
    int num;
    bool met;
    sphere(){}
    sphere(int X,int Y,int Z,int R,int Num)
    {
        x = X;
        y = Y;
        z = Z;
        r = R;
        num = Num;
        met = false;

    }
} mas[1005];
int x,y,z,r;
int n;
string STR[1005];
int countSTR;
void input()
{
    cin>>n;
    for (int i=0;i<n;i++)
    {
        cin>>x>>y>>z>>r;
        mas[i] = sphere(x,y,z,r,i);
    }
}
int posR;
int posW;
sphere Q[1005];
void Add(sphere sp)
{
    Q[posW++] = sp;
}
void zero()
{
    posR = 0;
    posW = 0;
    memset(Q,0,sizeof(Q));
}

bool isInter(sphere &a,sphere &b)
{
    int len = (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y) + (a.z-b.z)*(a.z-b.z);
    int R = (a.r + b.r)*(a.r + b.r);
    if (len>=R)
        return false;
    return true;
}
void search(sphere sp)
{
    zero();
    sp.met = true;
    Add(sp);



    while(posR<posW)
    {
        sphere cur = Q[posR++];
        for (int i=0;i<n;i++)
        {
            if (mas[i].met == false)
                if (isInter(cur,mas[i]))
                {
                    mas[i].met = true;
                    Add(mas[i]);
                }
        }

    }
    int INT[1005];
    int countINT = 0;
    memset(INT,0,sizeof(INT));
    for (int i=0;i<posW;i++)
    {
        INT[countINT++] = Q[i].num;
    }
    sort(INT,INT+countINT);
    string str = "";
    char tmp[10];
    sprintf(tmp,"%i",INT[0]);
    str += tmp;
    for (int i=1;i<countINT;i++)
    {
        sprintf(tmp,"%i",INT[i]);
        str += ", ";
        str += tmp;
    }
    STR[countSTR++] = str;



}
void solve()
{
    for (int i=0;i<n;i++)
    {
        if (mas[i].met==false)
        {
            mas[i].met = true;
            search(mas[i]);
        }
    }
    sort(STR,STR + countSTR);
    for (int i=0;i<countSTR;i++)
    {
        cout<<STR[i]<<endl;
    }
}
int main()
{
    input();
    solve();
    return 0;
}

In DevC++ program compile perfect; And it works; but why isn't working in here :[ Please help me...

#include<iostream>
using namespace std;
int main(){
    int k,grup[101];
        cin >> k;
        int majority = k/2+1, min[majority],sum=0;
            for(int i=0;i<k;i++)
            cin >> grup[i];
              int localMin=grup[0], indx=0,H=0;

              while(H<majority){
              for(int i=1;i<k;i++){
                      if((grup[i]<localMin)&&(grup[i]>0)){
                      localMin=grup[i];
                      indx=i;
                      }
              }
              min[H]=localMin/2+1;
              grup[indx]=-2;
              H++;
              }

for(int i=0;i<majority;i++)
        sum += min[i];

        cout << sum << endl;
}

Here is my solution! I can't find my mistake!


Edited by author 03.09.2007 22:01

Can anybody help me with test 2? What is it?
I use merge sort.

[code deleted]

Edited by author 07.02.2008 01:45

can somebody tell what is the 5th test?