#include "stdio.h"
int main()
{
    int n,i;
    scanf("%d %d",&n,&i);
    if(n==2)
        {printf("0");
    return 0;
    }
    if(i<=n/2)
    printf("%d",n-i-2);
    else
        printf("%d",i-1-2);

}

#include "stdio.h"
#include "stdlib.h"
#include<string.h>
int main()
{
    long int m,n,sum=0,a[3001];
    scanf("%ld %ld",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d",&a[i]);
    }
n=n*3;
    for(int i=1;i<=m;i++)
    {
        sum+=a[i];
        if(sum>=n)
        {
            printf("Free after %d times.",i);
            return 0;
        }
    }
    printf("Team.GOV!");

}

#include<iostream>
using namespace std;
int main()
{
    double a,b,c,d,e,f=0;
    cin>>a>>b>>c;
    d=a*c*0.01;
    e=a-d;
    a=e;
    if(a<=b)
    {
        cout<<f;
        return 0;
    }
    f++;
    while(a>b)
    {
        d=a*c*0.01;
    e=a-d;
    a=e;
    f++;
    }
    cout<<f;
return 0;}

import java.util.*;
public class BallonNumber {
public static void main(String args[])
{
    Scanner sc=new Scanner(System.in);
    int a[]=new int[10];
    int count=0;
    int prod=1,i;
    for(i=0;i<10;i++)
    {
        a[i]=sc.nextInt();
    }
    for(i=0;i<10;i++)
    {
        prod=prod*a[i];
    }
    //System.out.println(prod);
    for(i=1;i<=prod;i++)
    {
        if (prod%i==0)
        {
            count+=1;

        }
    }
    System.out.println(count);
}
}
So this is my code but it says wrong answer but I get the same answer in ide.What is wrong with this code

#include<iostream>
#include<stdlib.h>
#include<math.h>
using namespace std;
int main()
{long double n;
    long long int m,i;
    cin>>m;

    for(i=1;i<10000000000000000000;i++)
    {
        n=sqrt(i*i*i*m);
        if(n==floor(n+0.5))
        {    cout<<n<<endl<<i;break;}
    }
    fflush(stdin);
    getchar();
return 0;}

#include<iostream>
using namespace std;
int main()
{       double n;
    long long int m,i;
    cin>>m;

    for(i=1;i<10000000000000000000;i++)
    {
        n=sqrt(i*i*i*m);
        if(n==floor(n+0.5))
        {    cout<<n<<endl<<i;
                        break;
                 }
    }
    fflush(stdin);
    getchar();
        return 0;
}

...for test
40 40 40?

My is

32460430015431999968619493682032835511850959272235390105491169601

I got WA#6, what is wrong?

I am getting a WA at test #5

Here's my code :
#include <iostream>

using namespace std;

int main(){
  int n,i=1,count=0;
  cin>>n;
  while(n>0){
    if(i*i<=n)
      i++;
    else{
      n-=(i-1)*(i-1);
      i=1;
      count++;
    }
  }
  cout<<count<<endl;
  return 0
}

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

int main(int argc, char *argv[])
{
    int n, tmp;
    long sum;
    scanf("%d", &n);
    if (n > 10000 || n < -10000) {
        printf("%d\n", 0);
        return 0;
    }

    if (n == 0) {
        printf("%d\n", 1);
        return 0;
    }
    if (n > 0) { /* positive */
        if (n % 2 == 0) { /* even */
            sum = n * (n / 2 - 1) + n + (n / 2);
        } else { /* not even */
            sum = n * (n / 2) + n;
        }
    } else { /* negative */
        if (n % 2 == 0) { /* even */
            sum = n * (n / 2 + 1) - n - (n / 2) - 1;
            tmp = ~sum + 1;
            sum = tmp;
        } else { /* not even */
            sum = n * (n / 2) - n - 1;
            tmp = ~sum + 1;
            sum = tmp;
        }
    }

    printf("%ld\n", sum);
    return 0;
}

/* n * (n / 2) + n not even */
/* n * ((n / 2) - 1) + n + (n / 2) even */
/* n * (n / 2) - n - 1 negative not even */
/* n * ((n / 2) + 1) - n - (n / 2) - 1 negative even */

using System;
namespace gholamali
{
    class Program
    {
        static void Main(string[] args)
        {
            try
            {
                int N = Convert.ToInt32(Console.ReadLine());
                if (Math.Abs(N) <= 10000)
                {
                    if (N > 1)
                        Console.Write(((N + 1) / 2) * N);
                    else
                        Console.Write(((N + 1) / 2) * (2 - N));
                }

                Console.ReadKey();
            }
            catch { }
         }
    }
}

My old C++ solution got AC with optimized Dijkstra, O(v*log(v)), where v = m*n.
The timing was 0,406 sec.

Evidently, with Python (2.7, 3.4) I got TLE with the same solution. On my machine 500*500 case runs for 4.5 seconds.

Then I realized O(m*n) solution and optimized input as much as possible (Python). It still gives TLE16, on my machine - runs for 2.3 seconds.

Then I run code under PyPy (5.4.1, Python2.7 compatible) and on my machine it runs for 0.383 seconds only. I hope it would AC if PyPy is able to be selected as a programming language.

Please add PyPy!
Thanks

I have also got WA in the test 7.
Is it necessary to sort the teams names before output?

Edited by author 22.05.2015 03:17

Edited by author 22.05.2015 03:43

Hey,
do the guys that submit on Java use BigInteger and array of (2 x BigInteger)[2000][1000]?
If yes, then how do they manage to pass the TL? Is it just a matter of Java optimization, or the solution is much harder than a simple DP?

Thanks !

Edited by author 07.04.2012 06:11

New tests have been added. All solutions have been rejudged: 288 authors have lost AC.

Who can give me some tricky tests for this problem, please!

Please, give me some hint!

Python: 7028591
The same C++: 7028621

Please increase memory limit or disable python.
Thanks

What is wrong in my code? Thanks

[code deleted]

Edited by moderator 19.11.2019 23:57