I have error in 11 test anybody can say what is 11 test?

Edited by author 31.01.2012 15:35

First I thought it was precision but now I don't know anymore.
I thought i would never post a thread like this one but...

INPUT:
a\b
d\a
cc\e
e\d

OTHERWISE,does it have any special situations ?

#include<stdio.h>
void A(int i)
{ int n;

   for(n=1;n<i;n++)
   printf("sin(%d+",n);
   printf("sin(%d",i);
 for(n=1;n<=i;n++)
   printf(")");
 }
void S(int i)
{ int n;
  for(n=1;n<i;n++)
   printf("(");
  for(n=1;n<i;n++)
  { A(n);
    printf("+%d)",i-n+1);
    }
  A(i);
  printf("+1");
  }
main()
 { int n;
   scanf("%d",&n);
   S(n);
   }

for  n = 1, k

 the answer is : k
 while many programs give: k-1

but there is no such test data

New tests were added. After rejudge 26 authors lost AC.

var a,b:integer;
begin

If you have some troubles with passing 16th test, try

20 3
10 5
5
1 4 8 12 16

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Collections;

namespace ConsoleApplication1
{
classProgram
    {
staticvoid Main(string[] args)
        {
string Name = "Isenbaev";
ArrayList OF = newArrayList();
ArrayList NF = newArrayList();
int n = int.Parse(Console.ReadLine());
int[,] kol = newint[n, 3];
bool f = false;
string[,] name = newstring[n, 3];
for (int i = 0; i < n; i++)
            {
string[] s = Console.ReadLine().Split(' ');
for (int j = 0; j < 3; j++)
                {
                        f = true;
                        kol[i, j] = -1;
                        name[i, j] = s[j];

                }
            }
int t=1;
            OF.Add(Name);
while (OF.Count != 0)
            {
for (int z = 0; z < OF.Count; z++)
                {
                    r = false;
for (int i = 0; i < n; i++)
                    {
                        f = false;
for (int j = 0; j < 3; j++)
                        {
if ((OF[z].ToString().CompareTo(name[i, j]) == 0) && (kol[i, j] == -1))
                            {
                                kol[i, j] = t - 1;
                                f = true;
break;
                            }
                        }
if (f)
                        {
for (int j = 0; j < 3; j++)
                            {
if (OF[0].ToString().CompareTo(name[i, j]) != 0)
                                {
int d=0;

for (int y = 0; y < OF.Count; y++)
                                    {
if (name[i, j].CompareTo(OF[y].ToString()) == 0)
                                        {
                                            d++;
                                        }
                                    }
if (d == 0)
                                    {
                                        kol[i, j] = t;
                                    }
                                        NF.Add(name[i, j]);
}
                            }
                        }
                    }
                }
                OF.Clear();
for (int i = 0; i < NF.Count; i++)
{
                    OF.Add(NF[i]);
                }
                NF.Clear();
                t++;
            }
string[] res = newstring[n*3];
int k=0;
for (int i = 0; i < n; i++)
            {
for (int j = 0; j < 3; j++)
                {
if (kol[i, j] == -1)
                    {
                        res[k] = name[i, j] + " undefined";
                    }
else
                    {
                        res[k] = name[i, j] + " " + kol[i, j];
                    }
                        k++;
                }
            }
Array.Sort(res);
for (int i = 0; i < (n*3)-1; i++)
            {
if (res[i].CompareTo(res[i + 1]) != 0)
                {
Console.WriteLine(res[i]);
                }
            }
if ((res[n * 3 - 1]).CompareTo(res[n * 3 - 2]) != 0)
            {
Console.WriteLine(res[n*3-1]);
            }
        }
    }
}

m * d1 is count of men needed to complete work in 1 day. You should divide this count into d2 days. On obvious way to do it with min men per day is to add men equally to d2 days one-by-one, while total men count is not 0.

Hi.
Can you give some samples to help fixing WA on test #3?

it has all right answer and why access violation?



#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
int a[40][50];
using namespace std;
int main(){
    int n,i,j,k;

    cin>>n;
    a[0][0]=2;
    a[1][0]=2;
    if (n>1){
        for (i=2; i<n; i++){
            for (j=0; j<39; j++){
                a[i][j]=a[i-1][j]+a[i-2][j];
            }
            for (j=0; j<19; j++){
                a[i][j+1]+=a[i][j]/10;
                a[i][j]=a[i][j]%10;
            }
        }
    }
        for (i=39; i>-1; i--){
            if (a[n-1][i]>0){
                for (j=i; j>-1; j--){
                    cout<<a[n-1][j];
                }
                break;
            }

        }

        //system("pause");
}

I think my code faster
But only 4th test
Is it?
10000
10000
10000
10000
10000
10000
10000
10000
10000
10000

And what will be correct answer this one?
Thanks

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>

using namespace std;
int main(void) {
    long double p,q;
    cin>>p>>q;
    int n=1,m;
    int k1,k2;
    int i,j;
    if (p<q) {
        for (m=1; m<100000; m++){
            for (i=0; i<=100*m/q; i++){
                k1=i;
            }
            for (j=0; j<100*m/p; j++){
                k2=j;
            }

            if (k1+1<=k2){
                n=k1+1;
                break;
            }
        }
        cout<<n;
    }
    if (p==q){

    }
    //system("pause");

}

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cmath>
long a[100000];
long b[100000];
long c[100000];
int d[100000];
using namespace std;
int main(){
    int n;
    int max;
    cin>>n;
    int i;
    for (i=0; i<n; i++){
        cin>>a[i];
        d[i]=1;
    }
    for (i=0; i<n-1; i++){
        float r=1+(a[i+1]-a[i])*(a[i+1]-a[i]);
        c[i]=sqrt(r);

    }
    for (i=0; i<n-2; i++){
       if ((a[i]-a[i+1])==(a[i+1]-a[i+2])){
            c[i+1]+=c[i];
            d[i+1]=d[i]+1;
            //cout<<d[i]<<" ";
       }
    }
    max=c[0];
    int t=0;
    for (i=0; i<n-1; i++){
        if (max<c[i]) {
            max=c[i];
            t=i;
        }
    }
//    cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<" "<<d[3]<<" ";
    cout<<t+2-d[t]<<" "<<t+2;
    system("pause");
}

thanks I've got AC!!!

Edited by author 16.08.2008 02:45

Is just one white square counted as rectangle? If no, explain me please sample #1.

Am I right that output to the sample
1 3 1
1 2

is 0?

test ID: 4088875

Edited by author 23.01.2012 20:49