OJ Board

it should be 2185. am i right?

594 - One Little#@#Two Little#@#Three Little Endians
it should be
One Little, Two Little, Three Little Endians

Have a look in the problem 10493, the title is "Cats, with or without Hats", but in the new system, it become "Cats" only....

BTW: I think the problem ID should be keep in the submissions list, it will be much more convenience.

I got TL for thousand times. Is there any one give me some help on it. Thank you very much!!

My computer is P-M 1.6G with 512MB. it is about 2sec to finished
but my code got WA or TL on the judge......
my output

7
8
15
12
9
143
629
314
1600
1597
224296
26399
123446
254370
194220
94220
2250226
225093
5766432
63293
78171
70777
325148
3606692
325149
325146

real 0m1.819s
user 0m1.650s
sys ...

eyhk wrote:For sedafcho's input, I got a different output, the last two.
I'm not able to find 2^31 though.

Code: Select all

7
8
15
12
20
31
28748
24559
4813
325147
325148
11036
37937
6432163
146964308
146964307

I had calculated the 2^146964308 with big number.
the first 20 digits is 99999999281501361389...

i am use the DP but not as fast as the search.......

[cpp]
#include<iostream.h>

#define MAX 3655

void sim(int day)
{
int a[MAX*2]={0};
register int i,j;
unsigned long long h;
cin >> i;
for(;i>0;i--)
{
cin >> h;
for(j=1;(j*h) <= day ;j++)
a[j*h]=1;
}

for(i=7;(i-1)<=day;i+=7)//i fixed this line,see?
a =a[i-1]=0;

j=0 ...