OJ Board

plz help me.. why wa..

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;

unsigned long long a[50000];

int main()
{
unsigned long long i,j;
int coin[]={5,10,20,50,100,200,500,1000,2000,5000,10000};
a[0]=1;
for(i=0;i<11;i++)
{
for(j=0;j<=30000;j ...

thx via. i cant understand why im getting wa. I should get re or ce.. bt making the the arry mark[101][25001] and mark[101][25001] get accepted its too weird to me.

why wa i have cant understand

//C++
#include<iostream>
#include<algorithm>
using namespace std;
#define max_(a,b)(a>b?a:b)

int a[110];
int mark[10000][10000];
int store[10000][10000];
int n,t;

int dp(int i, int w)
{
if(i==0 || w==0)
return 0;
else if(mark[i][w]==t)
return store[i][w];
int ...

thax for ur help. At first i misunderstand the problem..
then i solve using marge sort..
bt i cant think any better way...
how they solve it under one second runtime...
can anyone help me ?

hi im getting wrong answer.... i cant understand where is the problem...plz check my code

C++

#define max 10000001

long int a[max];
int main ()
{
long int i,n,cnt,t;
// freopen("in.txt","r",stdin);
while(scanf("%ld",&n)==1)
{
cnt=0;
for(i=1;i<=n;i++)
cin>>a ;
for(i=1;i<=n;i++)
{
if(a <i ...

I think my algo is wrong ....
nobody help me

i have not find any simple equation for this problem im getting tle. plz give me a hints. here is my code....


#include<iostream>
using namespace std;
int main()
{
long int n,flag,i,x,j,l,w;
scanf("%ld",&n);
for(i=1;i<=n;i++)
{
flag=0;
scanf("%ld",&x);
for(j=2;j*j<=x;j++)
{
if((x%j)==0 ...

hey u should remind this line......
If more than one order of brown, green, and clear bins yields the minimum number of movements then the alphabetically first string representing a minimal configuration should be printed.
may be your program does not solve this for same minimum moves ......

im gatting WA im sick of this problem...... here is my code.... i thought i was a easy probem.... plz help me
#include<iostream>
using namespace std;
double make2(double d)
{
long int a,e;
double b,c,f,g;
a=d;
b=d-a;
c=b*100;
e=c;
g=double(e*.01);
c=b*1000;
e=c;
if((e%1000)>4)
f=a+g+.01 ...