My Ac code,but I don't know why?

#include<stdio.h>
#include <iostream>

using namespace std;

int main()
{
    unsigned long long int c[25][20],sum;
    int a,b,n,i,j;
    for(i=1;i<=20;i++)
           c[i][1]=i+1;
    for(i=1;i<=15;i++)
       c[1][i]=i+1;
    for(i=2;i<=20;i++)
      for(j=2;j<=15;j++)
        c[i][j]=c[i][j-1]+c[i-1][j];
    for(i=1;i<=20;i++)c[i][0]=1;
    scanf("%d%d%d",&n,&a,&b);
    sum=c[n][a]*c[n][b];
    cout<<sum;
    printf("\n");
    return 0;
}

please tell me:admins,What is WA7?

#include <stdlib.h>
#include <iostream>
using namespace std;

int main()
{
    int n, cnt = 0;
    register int j;
    char shop[1001][31];
    char used[5] = "stop";

    cin >> n;
    for(register int i = 0; i < n; i++)
        cin >> shop[i];

    for(register int i = 0; i < n; i++)
    {
        if(shop[i] == "stop")
            break;
        for(j = i + 1; j <= n; j++)
        {
            if(strcmp(shop[j], "stop") != 0)
                if(strcmp(shop[i], shop[j]) == 0)
                {
                    cnt++;
                    strcpy(shop[j], "stop");
                }
        }
    }

    cout << cnt;
}

a[n+1]-a[n]=a[1]-a[0]+2*(c[1]+c[2]+...+c[n]);

code:

#include<stdio.h>

#define N 3000
float c[N+5];

int main()
{
    int i,k,m;
    float sum,a0,an,t;
    scanf("%d",&m);
    scanf("%f%f",&a0,&an);
    for(i=1;i<=m;i++)
      scanf("%f",&c[i]);
    sum=0;
    k=m;
    for(i=1;i<=m;i++)
    {
        sum=sum+k*c[i];
        k--;
    }
    sum=sum*2;
    t=(an+m*a0-sum)/(m+1);
    printf("%.2f",t);
    return 0;
}


Edited by author 14.05.2010 19:53

Hi!

I solved the problem with binary search and got TL. After the search for some test I have found that the actual solution includes use of binary tree. So, what the difference? I actually thought that search is better because it doesn't use any memory, isn't it?

example: input
int A: 12345678910111212
int B: 12345678910111212

output:
Add is: 24691357820222424
Minus is: 0
Multi: 1.5241578775156476338589020810894.....
div is: 1

You have full code (write by C) share with my
Thanks a lots

Example:
text: abc abc accabcb acc
pattenr: acc
Position: 8
Position: 16

code full used Boyer-More Algorithms and Knuth-moris-part Algorithms ( written by C )

Thanks

You are not allowed to swap digits in the last number (the sum of N numbers)

Example
-------
Input:
2
11
20
13
Output:
Unrecoverable error.

Where is Greenpeace? Oh,rebits,rebits...

Test:
2
1 2
3 4
My Ac program gives
YES
1 0
2 0
I dont know if other solutions will fail on this test, but.. =)

Crash (access violation)

In 24 test precision greater than 18? why?

Always format input is
dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy
dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy
or may be (for example)
2
dd.mm.yyyy
dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy dd.mm.yyyy
?


Edited by author 09.05.2010 02:02

,.'A'..'Z'a'..'z

in this test my program gave "2" and got WA4,
but now I got AC, because the correct answer is "1".

Why does System.exit(1) get WA instead of Crash?

Hello, I tried many times, but do not know where is the problem, I wrote java and run on IDE it seems OK, but every time when I submitted it can not be accepted. Would you please give me some help. Thank you so much!

import java.util.*;
public class SumAllInt1068 {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int d = sc.nextInt();
        int f = sc.nextInt();
        int e = a+b+c+d+f;
        System.out.println(e);

    }

}

Tell please something helpful to pass fourth test. Maybe it is  a misunderstanding of statement.

#include <iostream>
long int fibonacci(const int );
int main()
    {
    int N;
    std:: cin>>N;
    const int M=N;
    std::cout << fibonacci(M)*2;;
    return 0;
    }
long int fibonacci(const int n)
     {   const int m = n;
         long int t[m],i;
         int first = 0, second = 1;
         t[first]=0; t[second]=1;
         for (i=second+1; i<m-1; ++i)
         {
             t[i] = t[first] + t[second];
             first = second;
             second = i;
         }

        return t[i];
     }

Edited by author 10.05.2010 18:58

why I get wa on test 39?

Edited by author 30.04.2010 17:12

does anybody knows what is this fucking test 5?
if you know write the answer please:)