Edited by author 13.05.2009 23:29

Edited by author 13.05.2009 23:29

I can't understand why the sample output on test3 is 13*12*10 i think it should be 13*13*10

Edited by author 18.02.2007 23:39

Edited by author 18.02.2007 23:39

How to construct bipartite graph there?

For test
5
2 1 3 4 5

my AC program outputs
3

but it's obvious that it's wrong.

Meanwhile my program using GCD gets WA...

Is there anything special about this test?...I don't see anything wrong with my code.

There is no race with given S and T
a) S mod 2 = 1 or T mod 2 = 1
b) T = 2
c) S = 0 and T mod 4 <>0

I got Wa#7, but I don't know why?

What is this test?
At first I had WA8. But then I change 20000->200000 and now WA 12. Who can help with this test? Thx.

I see many coders had problems with this test.
Please, give me some hint to aviod them.

TEST#4:
7
1
1
1
1
-128
1
1
1 3
2 3
6 4
7 4
4 5
3 5
0 0
TEST #7:
150
127
1
...(repeat for 149 times)
2 1
..
150 1

WHY WA#4????

#include<stdio.h>
#include<math.h>
void main(){
int v=0,m,n;
scanf("%d",&n);
int* a=new int[n];
int* b=new int[n];
int* c=new int[n];
scanf("%d",&m);

for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
}

 if(m+11<=n){
        for(int j=m+1;j<=11+v;j++){
                 b[j]=a[j];}

         for(int j=m+1;j<=11+v;j++){
                 printf("%d",b[j]);  }
         }
         else {
         v=m;
         while(v>n){
        v=abs(v-n); }
          for(int i=v+1;i<=n;i++){
                 b[i]=a[i];}
          for(int k=1;k<=10-(n-v);k++){
                 c[k]=a[k];}

          for(int i=v+1;i<=n;i++){
                 printf("%d",b[i]);  }

          for(int k=1;k<=10-(n-v);k++){
                  printf("%d",c[k]);  }
                     }
                 }

Give me some tests, please:)

Is is possible to change memory limit for this problem from 16 Mb to 32 Mb?

Problem is that 16 Mb is very uncomfortable for Java (and maybe C#) solutions. It is not enough for natural data structure (each vertex and each edge is separate object, each vertex has list of adjacent edges).

Hi,
Can you help me to find my mistake. In my opinion my solution is right but it fails on test 2.

#include<iostream>
#include<stdio.h>
using namespace std;
int n,m[21],can[100000],a,b,c=0;
int abs_(int q)
{
    if(q>=0)return q;
    if(q<0)return -q;
}
void solve()
{
     int i,j;
     unsigned long long int p;
     p=0;
     for(p=i=0;i<n;p+=m[i++]);
     for(i=1;i<=p;i++)
     can[i]=0;
     can[0]=1;
     for(i=0;i<n;i++)
     for(j=p;j+1>0;j--)
     {
                       if(can[j])
                       can[j+m[i]]=1;
     }
     for(i=p/2;i>1;i--)
     if(can[i])
     {
               a=i;
               b=p-i;
               int g=a-b;
               c=abs_(g);
               printf("%u\n",c);
               return;
     }
}
int main()
{
    int k;
    scanf("%u", &n);
    for(k=0;k<n;k++)
    scanf("%u", &m[k]);
    solve();
    return 0;
}

In statement 1 <= n.

There is no test where n = 1. And it is impossible because then according to formula in statement answer would be 0/0.

Please update statement - change limitations to 2 <= n.

Here is my code :
Const fi='input.txt';
      fo='output.txt';
Var Range,a1,b1,a2,b2,x,y,x1,y1,x2,y2:real;
    n,i,j:integer;
    f,g:text;
{------------------------------------------------------------------------}
Begin
  Assign(f,fi); Reset(f);
  Assign(g,fo); Rewrite(g);

  Readln(f,Range,x1,y1,x2,y2);
  a1:=y1; a2:=y2; b1:=x1*(-1); b2:=x2*(-1);
  Readln(f,n);
  for i:=1 to n do
    Begin
      Readln(f,x,y);
      if (sqrt(x*x + y*y)<=Range) then
      if (x1<>x2) or (y1<>y2) then
        begin
        if ((x*a1+y*b1)*(x2*a1+y2*b1)>=0) and
                 ((x*a2+y*b2)*(x1*a2+y1*b2)>=0) then
          Begin
            Writeln(g,'YES');
            Continue;
          End;
        End
      else if (x1=x2) and (y1=y2) then
        if (x*a1+y*b1)=0 then
          Begin
            Writeln(g,'YES');
            Continue;
          ENd;

      Writeln(g,'NO');
    End;

  Close(f);
  Close(g);
End.

I don't know if you should do endline after ending of ouput data.

#include <fstream>
#include <stdio.h>
using namespace std;

bool is_letter (char c)
{
    return ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'));
}

bool is_b (char c)
{
    return (c >= 'A' && c <= 'Z');
}

bool is_s (char c)
{
    return (c >= 'a' && c <= 'z');
}

int main ()
{
    //freopen ("a.in", "r", stdin);
    //freopen ("a.out", "w", stdout);
    char c;
    bool f = true;
    bool g = true;
    int ans = 0;
    char s[10010];
    int i;
    while (gets(s) != 0)
    {
        for (i = 0; i < strlen(s); ++i)
        {
            c = s[i];
            //scanf ("%c", &c);
            if (c == '.' || c == '!' || c == '?')
            {
                f = true;
                g = true;
            }
            else
            {
                if (is_letter(c))
                {
                    if (is_b(c))
                    {
                        if (!g)
                        {
                            ++ans;
                        }
                    }
                    else if (is_s(c))
                    {
                        if (f)
                        {
                            ++ans;
                        }
                    }
                    f = false;
                    g = false;
                }
                else
                {
                    g = true;
                }
            }
        }
    }
    printf ("%d\n", ans);
    return 0;
}

Edited by author 28.09.2007 19:31

///////////////////////////////////////////////////////////

#include"iostream.h"
#include"math.h"
double a,d1,b,d2,m;
int i,j;
int main()
{

    cin>>a>>d1>>b>>d2;
    if(a>=b){cout<<a<<endl;goto u;}
    if(a+d1>=b){cout<<b<<endl;goto u;}
    while(a<b)
    {
        a=a+d1;
        if(a>=b || a+d1>=b)
        {
            cout<<a<<endl; break;
        }
        b=b-d2;
        if(a>=b)
        {
            cout<<b<<endl; break;
        }
    }
u:
    return 0;
}


/////////////////////////////////////////////////////////