hi guys
how i must read string, using c#
i mean read the WHOLE string, not just trim before '\n'
sry for my language

that's simply funny - I got result in 1.046sec, but need 1sec... That's unfair..

#include<conio.h>
#include<math.h>
#include<stdio.h>
int k,t[10];
double fonction (int n, int i)
{
       int h;
    if(n==1)
    {
            if(t[n]>=i)
            {
                       return 1;
            }
            else
            {
                return 0;
            }
    }
    else
    {
        if(t[n]>i)
            {
                       return ((pow(10,n-1))+(t[n]*pow(10,n-2))+(fonction(n-1,i)));
            }
        if(t[n]==i)
            {
                       h=int(k/pow(10,n-1));
                       return (((k-(h*pow(10,n-1)))+1)+(t[n]*pow(10,n-2))+(fonction(n-1,i)));
            }
        if(t[n]<i)
            {
                       return ((t[n]*pow(10,n-2))+(fonction(n-1,i)));
            }
    }
}

int main()
{
    int n=0,i=1,j,m,r=1,w=0;
    scanf("%d",&k);
    m=k;
   // double q=1.56;
    while(m!=0)
    {
               n++;
               t[n]=m%10;
               m=m/10;
               //printf("%d",t[n]);


    }
    for(i=0;i<n;i++)
    {
                    w+=pow(10,i);
    }
    r=int(fonction(n,0));
    printf("%d\n",r-w);
    for(i=1;i<10;i++)
    {
    r=int(fonction(n,i));
    printf("%d\n",r);
}
    getch();

return 0;
}

why WA2??
program ural;
var n,a,b,y:byte;
    m,i,z,r:integer;
    h,g:array[1..200]of integer;
    t:array[1..32767]of byte;
    l:array[1..32767]of integer;
    p,q:array[1..32767]of boolean;
    s:array[1..200]of byte;
    k:array[1..400]of integer;
    o:array[1..400]of byte;
    u:array[1..200]of boolean;
    x:boolean;
procedure search(d:byte);
var r:integer;
  begin
    u[d]:=true;
    r:=h[d];
    while r<>0 do
      begin
        if u[t[r]]=false then
          begin
            inc(y);
            k[y]:=g[d];
            g[d]:=y;
            o[y]:=t[r];
            inc(y);
            k[y]:=g[t[r]];
            g[t[r]]:=y;
            o[y]:=d;
            p[r]:=true;
            if q[r] then
              p[r+1]:=true
            else
              p[r-1]:=true;
            search(t[r]);
          end;
        r:=l[r];
      end;
  end;
procedure track(v,d:byte);
var r:byte;
  begin
    if d=i then
      begin
        write(v,' ');
        for r:=1 to v-1 do
          write(s[r],' ');
        writeln(d);
        x:=true;
        exit;
      end;
    u[d]:=true;
    s[v]:=d;
    r:=g[d];
    while r<>0 do
      begin
        if u[o[r]]=false then
          track(v+1,o[r]);
        if x then
          exit;
        r:=k[r];
      end;
  end;
begin
  assign(input,'travel.in');
  assign(output,'travel.out');
  reset(input);
  rewrite(output);
  readln(n,m);
  for i:=1 to m do
    begin
      readln(a,b);
      inc(r);
      l[r]:=h[a];
      h[a]:=r;
      t[r]:=b;
      q[r]:=true;
      inc(r);
      l[r]:=h[b];
      h[b]:=r;
      t[r]:=a;
    end;
  z:=m-n;
  for i:=1 to n do
    if u[i]=false then
      begin
        inc(z);
        search(i);
      end;
  if z<=0 then
    begin
      writeln(0);
      exit;
    end
  else
    writeln(z);
  for i:=1 to n do
    begin
      r:=h[i];
      while r<>0 do
        begin
          if(q[r])and(p[r]=false)then
            begin
              x:=false;
              fillchar(u,sizeof(u),false);
              track(1,t[r]);
            end;
          r:=l[r];
        end;
    end;
end.

Edited by author 29.07.2010 21:50

is there something tricky in it?

If we return 0 things
must we write return 0 or return ?
Also is not clear must we count returnings with 0 things?
Not clear 3: Can we take bottle with each returning?

Edited by author 11.11.2009 10:56

what is wrong with this code.
#include<stdio.h>
#include<stdlib.h>
int main()
{
    int n,i;long long int sum=0;
    scanf("%d",&n);
    if(n>=1)
    {
        for(i=1;i<=n;i++)
            sum=sum+i;
    }
    if(n<0)
    {
         for(;n<=1;n++)
              sum=sum+n;
    }
    printf("%ld \n",sum);
    system("pause");

}
why i got wa?

Hey,

I wonder what did people do in order to get less than 0.3s using Java?

The minimum I got is only 0.343s 5590KB

I use StreamTokeziner(BufferedReader) for input; PrintWriter for output; int[] ID, byte[] M, and O(n*m) outputing.

I also tried to make it O(n) with LinkedList, but it didn't decrease time too much...


Any suggestions to speed it up are welcome! =)

First you should use BufferedReader for input and PrintWriter for output.
Then you should create a big char[] buffer, read() whole input (3000000 chars is enough), manually parse it for data and put it into an array of some kind of Collections.
While parsing you should calculate the length of output.
Then you should create a char buffer of calculated size, manually fill it and print() whole buffer at once.

If you still can't get the idea, write to Abrackadabraa@gmail.com.

Java isn't slow, you just can't cook it. =)

Edited by author 28.07.2010 05:20

This is my code.
#include<stdio.h>
#include<math.h>
double min(int t,int s)
{
    switch (t)
    {
        case 1:
            return 2*s;
        case 2:
            return (double)s;
        default:
            return ((s/2)*sqrt(3.0));
    }
}
double max(int t,int s)
{
    switch (t)
    {
        case 1:
            return 2*s;
        case 2:
            return (s*sqrt(2.0));
        default:
            return (double)s;
    }
}
void main()
{
    int htype,hsize;
    int type,size;
    double max_len,min_len;
    int n,c=0;
    int i;
    scanf("%d %d",&htype,&hsize);
    max_len=max(htype,hsize);
    scanf("%d",&n);
    for (i=0;i<n;i++)
    {
        scanf("%d %d",&type,&size);
        min_len=min(type,size);
        if (min_len<=max_len)
            c++;
    }
    printf("%d",c);
}

Please tell me whats wrong..

why......

Edited by author 18.04.2008 21:42

Edited by author 18.04.2008 21:47

Dose anyone know a better solution?I used big Ints for this task.Do anyone has a mathematic solution?

Please,take me a test#1.My program's output on example test are "000",but  got WA#1 many times....(((



Edited by author 28.09.2008 19:09

  Any hint on how to count all relations?

    Thanks!

Question in topic.

I am wondering because my soution was testing for like 60 seconds, there were no other solutions in queue, and "execution time" was 0.031 seconds...

thnks ^_^