OJ Board

we have n numbers in a set A
A = {a1, a2, a3 ... an}

and a number s.

I want to pick up some numbers from A, and sum of these numbers will equals to s or closest to s(but smaller than s).

input:
3
1 2 7
9

output:
2 7


input:
3
1 2 7
5

output
1 2

Can I solve this problem using dynamic ...

CDiMa,thank u indeed,u helped me a lot.
I've correct my code,but it still get WA.but i hope i can find the mistakes myself.
Anyway,thanks again :)

I've understand what's wrong with my code
Thank u,MDima

but here's another problem,my code always get TLE now
i even change my graph data structure from adj matrix to adj list,but still got TLE,can u tell me why?

is there any wired input data in test case?like a node presented by a string ...

yeah,it's dfs,actually.
but it isnt why i got WA,is it?

CDiMa,i'm afraid ur code is wrong

just look at this group of input and output u apply to us

5
1 2 2 3 3 1 4 5 6 2147483647
1 1

ur program's output is 5
which should be 4

isn't it?

and i also got WA,hope someone can help me out

i used a function

int lookup(int n)
{
int i;
for(i = 0;i ...

I've read all topics concerning 10013,but still don't know why i got WA.
can anyone help me?

#include <cstdio>
#include <cmath>
using namespace std;
#define MAXDIGITS 1000101 /* maximum length bignum */

typedef struct {
char digits[MAXDIGITS]; /* represent the number */
long lastdigit ...

i know why i keep getting WA

the input must be weird

i deleted my while(cin >> N) loop and got AC

but i still don't know why

if there's something following the input case ,i should get TLE but not WA
:-?

i don't think so.

i've changed my code to if(u == 0 || u <= v) printf("Case %d: can't determine\n",i);

but still got WA

#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main()
{
int N;
double d,v,u;
while(cin >> N)
{
for(int i = 1;i <= N;i++)
{
cin >> d >> v >> u;
if(v == 0 || u == 0 || u <= v) ... else
{
... }
}
}
return 0;
}

a quite simple problem,huh?why do i keep ...

yeah,that's why i got WA.
thank u so much!

i used the DP(LIS) which is O(n^2),that algorithm may cause TLE,but why i got WA?

is my algorithm okay?

#include <iostream>
using namespace std;

int height[10000];
int len[10000];
int pre[10000];
int limit;
int i,j;
int maxlen;
int tail;

void output(int i)
{
if(pre[i] == -1)
{
cout ...

[cpp]
#include <iostream>
using namespace std;
int arr[10001];//used to flag whether a number has been visited
int get(int z,int i,int m,int l)
{
//before the while() loop is initial
int count = 0;
for(int t = 0;t < 10001;t++)
{
arr[t] = 0;
}
arr[l] = 1;
while(1)
{
count++;
l = (z * l % m ...

I've gotten AC,thanks

[cpp]
#include <iostream.h>
int main()
{
double d = 0.987654321;
cout << (long long)(1000000000 * d) << endl;
return 0;
}
[/cpp]

the output would be:

98654320

that's why i always get wrong answer.
but how can i control it?
is there any type that be preciser than double?

yeah,i got what u mean,they are not in order,now i got AC.Thanks