Check that all of arrays in your source less that 64 KB! (MS VC compiler limitation)

help me!

#include <cstdio>
#include <map>

std :: map<int, int> a;
int ans = 0, n, c;

int main() {
        while (scanf("%d", &n) == 1)
                for (; n; n--)
                        scanf("%d", &c), ans += ++a[c] == 3;
        printf("%d", ans);
}

Edited by author 05.11.2011 20:31

my program work. but timus don't accept answer.

var n,k,m:word;
begin
read(n,k);
if 2*n mod k=0 then m:=2*n div k
else m:=(2*n div k)+1;
write(m);
end.

So i watch for cases when point a is the same with point b, when they are reversed, when b = a = kozel and when rope is longer then distance to the plant
Could you give me some tests?

var
   n,i,j,ans:Integer;
   k:integer;
   kvoskl:string;
begin
ans:=1;
j:=1;
     read(n,kvoskl);
     k:=length(kvoskl);
     i:=n;
     if n mod k = 0 then
     begin
          while i>=k do
          begin
               ans:=ans*i;
               i:=n-j*k;
               inc(j);
          end;
     end
     else
     begin
          while i>=n mod k do
          begin
               ans:=ans*i;
               i:=n-j*k;
               inc(j);
          end;
     end;
writeln(ans);
end.

what`s wrong?

what's wrong with this site??
it's about 36 hours that all problems have waiting status.

What's happened to the system?

I'm happy that i solved it! I'm think it is a basis of programming, that's why I'm happy!
There is no english.. only runglish.. I'm Sorry for this, but it is so cool!

Just use Greedy algorithm =)

uses
  SysUtils;

var
 x:array [1..150000] of real;
 size,i:integer;
 n:double;
begin
  size:=0;
  while not seekeof do
  begin
    read(n);
    inc(size);
    x[size] := sqrt(n);
  end;
  for i:=size downto 1 do
    writeln(x[i]:0:4);
  readln;
  readln;
  readln;
end.

 var N,X:integer;
 begin
 readln(N);
 if N>0 then
 X:=round((1+N)*N/2);
 if N<0 then
 X:=round((1+N)*(abs(N)+2)/2);
 writeln(X);
 end.

5
0
1
0
-1
-1
right answer:
1
1

I have correct answer on PC and wrong - here?Why?

I donno how to make it work
somebody give me hint

c++:


#include<iostream>
using namespace std;

long long sqr(int x, int y){
    long long a=1;
    for(int i=1;i<=y;i++)
            a*=x;
    return a;
}

int main(){
    int n,y,m,a=-1;
    cin>>n>>m>>y;
    if(y>=m){
           cout<<-1<<endl;
           return 0;
    }
    for(int x=0;x<m;x++)
            if((sqr(x,n))%m==y){
                                cout<<x<<" ";
                                a+=2;
            }
    cout<<endl;
    if(a==-1 && y<m)
             cout<<-1<<endl;
    return 0;
    }

please help me!

Edited by author 20.01.2011 20:31

Edited by author 20.01.2011 20:33

Reading by Console.Readline() or Console.ReadToEnd gets Memory Limit, reading by Console.Read() gets Time Limit.
Is there any other way to read without getting MLE and TLE?

Hint is wrong. I had WA#15, but after changing in Java code "int" to "long" task was accepted.

# include <stdio.h>
# include <algorithm>

using namespace std;

struct daw
{
    long long rg,lf,nd,vl,mx;
};

long long a,b;

long long w[409];
long long c[409][5];
long long v[409][409];

daw d[409];

void btr(long long x)
{
    if(d[x*2+1].vl!=0)
    btr(x*2+1);

    if(d[x*2+2].vl!=0)
    btr(x*2+2);

    if(x!=0)
    d[(x-1)/2].nd=d[(x-1)/2].nd+d[x].nd+1;
}

long long dp(long long x, long long y)
{
//    prlong longf("%d %d",x,y);getchar();

    if(y==0)
    return 0;

    if(v[x][y]>0)
    return v[x][y];

    for(long long i=0;i<=y;i++)
    if(d[x].nd-d[x*2+2].nd>=i && d[x*2+1].vl>0 && d[x*2+2].vl>0)
    {
        long long q=0;

        if(i!=0)
        q+=d[x].lf;

        if(i!=y)
        q+=d[x].rg;

        if(i==0)
        v[x][y]=max(v[x][y],dp(x*2+2,y-1)+q);

        else if(i==y)
        v[x][y]=max(v[x][y],dp(x*2+1,y-1)+q);

        else
        v[x][y]=max(v[x][y],dp(x*2+1,i-1)+dp(x*2+2,y-i-1)+q);
    }

    return v[x][y];
}

int main()
{
    scanf("%lld %lld",&a,&b);

    for(long long i=0;i<a-1;i++)
    scanf("%lld %lld %lld",&c[i][0],&c[i][1],&c[i][2]);

    d[0].vl=1;
    w[1]=1;

    for(long long i=0;i<a-1;i++)
    for(long long j=0;j<a-1;j++)
    {
        if(d[i].vl==c[j][0] && w[c[j][1]]==0)
        {
            if(d[i*2+1].vl==0)
            {d[i].lf=c[j][2];  d[i*2+1].vl=c[j][1];}

            else
            {d[i].rg=c[j][2];  d[i*2+2].vl=c[j][1];}

            w[c[j][0]]=1;
        }

        if(d[i].vl==c[j][1] && w[c[j][0]]==0)
        {
            if(d[i*2+1].vl==0)
            {d[i].lf=c[j][2];  d[i*2+1].vl=c[j][0];}

            else
            {d[i].rg=c[j][2];  d[i*2+2].vl=c[j][0];}

            w[c[j][0]]=1;
        }
    }

    btr(0);

    if(b==1)
    {printf("%lld",max(d[0].rg,d[0].lf));return 0;}

    printf("%lld",dp(0,b));

    getchar();
    getchar();
}


Thanks