Is it guaranteed, Captain Jack Sparrow, Pintel and Ragetti are located at the same point?

If the towns ought to be all connected with each other, then why there's just N/2 roads? I think there should at least be N-1 roads.

Guys what does '?' mean?

Who know test#8?

The the example, is (23+7 == 3) taken into account?

Thanks

//

Oh. I saw the "Hint" ...

Edited by author 10.11.2012 16:29

Edited by author 10.11.2012 16:29

WA#7,could anybody help me?

Just need you AC code,thank you!

I solved 1012 using BigInteger. Same solution got AC for this problem too. I know there is a difference in the limit of input but where is the difference between 1012 and 1013 in solving strategies?

I've got WA on test 4. People who had WA on this test too, what did you fix? I use 2 ternary searchs.

Edited by author 29.10.2011 10:37

Edited by author 29.10.2011 10:37

import java.util.*;
public class taksi
{
 public static void main(String args[])
 { Scanner in = new Scanner(System.in);
  int a = in.nextInt();
int a1 = in.nextInt();
int b = in.nextInt();
int b1 = in.nextInt();
int g = 0;
      for(int i = b;i>a;i=i-b1)
      {
          a=a+a1;
          if(i>a)
         g = a;
          }
          System.out.println(" kelisken bagasy :"+g);
 }
}

somebody know what is the test 3, I don't know what problem I have in my code; here is it

#include <stdlib.h>
#include <stdio.h>

int main(){

    int desicion[10];
    int exponentes[1000]={0};
    int i,j,valor=1;
    int numeroDivisores=1;
    int valorIteracion;
    int impresion;

    for(i=0;i<10;i++){
        scanf("%i",&desicion[i]);
        valor*=desicion[i];
    }

    i=2;
    j=0;
    while(valor!=1){
        if(valor%i==0){
            exponentes[j]++;
            valor=valor/i;
        }else{
            i++;
            numeroDivisores=numeroDivisores*(exponentes[j]+1);
            j++;
        }
    }

    numeroDivisores=numeroDivisores*(exponentes[j]+1);

    numeroDivisores%=10;

    printf("%i\n",numeroDivisores);
}

There is my code on C. All test I found are passed. For example:
hot (3,2) == 3);
hot (3,10) == 2);
hot (1,5) == 2);
hot (5,3) == 4);
hot (10,3) == 7);
hot (7,3) == 5);
hot (9,5) == 4);
But server says that anyway test 1 - wrong. What is wrong?
Please give me any test, which my program can't decide corectly.

int hot (int n1, int k) {
   int n2, minutes = 0;

   //Жарим первую сторону по максимальному числу бифштексов
    minutes += n1/k;
    //Пожаренные первые стороны становятся недожаренными вторыми
    n2 = minutes * k;
    //Ищем недожаренные первые стороны
    n1 -= minutes*k;
    //Докладываем на сковороду n2, если есть
    if (n2 > 0) {
        n2 -= (k-n1);
        if (n2<0) n2=0;
    }
    //Жарим остатки n1 и то, что доложили
    minutes++;
    //Пожаренное n1 переходит в n2
    n2 += n1; n1 = 0;
    //Жарим вторую сторону
    minutes += (int) ceil((float)n2/k);

    return minutes;
}

int main() {
    int n,k;

    scanf("%d %d",&n, &k);

    printf("%d", hot(n,k));

    return (EXIT_SUCCESS);
}

Edited by author 01.10.2012 09:26

my solution get wrong answer ?
can anyone give me  sample test cases ?  or detect my error in my algorithm ?
 // my code

//Bismillahir Rahmanir Rahim Thanks Allah 4 everything

#include <stdio.h>
#include <stdlib.h>
#include <memory.h>
#include <map>
#include <queue>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;


int dp(int a ,int opt,int k) ;
int max(int m1,int m2) ;


using namespace std;

 int save[10002][102] ;
 int call[10002][102] ;

   int k1;
   int max_b=0;
   int n,m,k2;
int main()
{


    while((scanf("%d%d%d",&n,&m,&k2))==3)
    {
        memset(save,0,sizeof(save));
        memset(call,0,sizeof(call));
        k1=0;
        k1=m;
        max_b=0;
        int max_a=dp(n,0,k2);
        cout  << max_a << " " << max_b << endl ;
    }
    return 0;
}

int dp(int a,int opt,int k)
{


    //cout << a << " " << opt << " " << k  << endl  ;
    //getchar() ;

    int r1,r2;
    r1=opt;
    if(r1==0)
    r2=1;
    else r2=0;
  if(a<=0) return 0;
  if(a<k && a<k1 ) return k1;
  if(a<k && a>k1) return a ;
  if(a==k) return a;
  if(k==0) return 0;
  if(call[a][k]==1)
  return save[a][k];

  call[a][k]=1;
  save[a][k]=max(dp(a,r1,k-1) , k+ dp(a-k - dp(a-k,r2,k2),r1,k2) ) ;
  if(opt==1)
  max_b=save[a][k];


  return save[a][k];
}

int max(int m1,int m2)
{
    if(m1>=m2) return m1;
    return m2;
}

This problem is not difficult. A lot of people got long sequences of WA#22 (as well as I did) because of one very stupid mistake. I hope this test will help to understand this mistake:

10 10 20 10 100 1 2012 10000
1
30 60
Answer: 15000.0000000

Abidna zhe

sort and DP is ok

just use <map>

Edited by author 07.11.2012 15:05

Input:
7
2 3 0
3 1 0
1 2 4 5 0
3 0
3 0
7 0
6 0

Output:
4
1 4 5 6
Is it true?
Please Give me some tests.

Edited by author 03.11.2009 15:17

Edited by author 03.11.2009 15:18