Search found 8 matches

by tridorje
Wed Jul 27, 2016 2:54 pm
Forum: Volume 2 (200-299)
Topic: 290 - Palindroms <---> smordnilaP
Replies: 31
Views: 6562

Re: 290 - Palindroms <---> smordnilaP My code get Runtime error after accepted all test Case :(, can anyone help me?

My code get Runtime error after accepted all test Case :(, can anyone help me? #include <math.h> #include <string.h> #include <iostream> #include <fstream> #include <map> #include <algorithm> #include <stdlib.h> #include <stdio.h> #include <vector> #define fi "290.inp" #define fo "290.out" using nam...
by tridorje
Wed Nov 13, 2013 5:36 am
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 30237

Re: 10930 why RE??

brianfry713 wrote:
brianfry713 wrote:Input: 2 2 1
is not an A-sequence.
Thank Brianfry :)
by tridorje
Sun Nov 10, 2013 11:29 am
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 30237

10930 Wa :(

remove
by tridorje
Fri Nov 01, 2013 5:20 am
Forum: Volume 2 (200-299)
Topic: 271 - Simply Syntax
Replies: 46
Views: 11734

Re: 271 - WA

brianfry713 wrote:Input zN output should be NO
Thank you very much :)
by tridorje
Tue Oct 29, 2013 12:48 am
Forum: Volume 2 (200-299)
Topic: 271 - Simply Syntax
Replies: 46
Views: 11734

Re: 271 - WA, i get WA, somebody help me

brianfry713 wrote:For the input posted by algoJo in this thread, your code doesn't match the output posted by Jan.

Code: Select all

remove
by tridorje
Tue Oct 08, 2013 3:21 am
Forum: Volume 100 (10000-10099)
Topic: 10020 - Minimal coverage
Replies: 57
Views: 20016

Re: 10020 - Minimal Coverage

brianfry713 wrote:
brianfry713 wrote:Greedily choose the next segment that covers the most additional points to the right of those already covered.
Thank !
by tridorje
Mon Oct 07, 2013 8:19 pm
Forum: Volume 100 (10000-10099)
Topic: 10020 - Minimal coverage
Replies: 57
Views: 20016

Re: 10020 - Minimal Coverage

Can some body help my. I don't know about Greedy :-? . In 10020 problem, in the maximum test case - (Each test case in the input should contains an integer M(1<=M<=5000), followed by pairs "Li Ri"(|Li|, |Ri|<=50000, i<=100000), ) i = 100000, may I use Depth first search with Dynamic programing. :oops:
by tridorje
Mon Oct 07, 2013 8:11 pm
Forum: Volume 100 (10000-10099)
Topic: 10020 - Minimal coverage
Replies: 57
Views: 20016

Re: 10020 - Minimal Coverage.I got TLe with DP Dynamic progr

#include <stdio.h> #include <math.h> #include <stdlib.h> #include <iostream> #include <fstream> #include <string.h> using namespace std; long itest, ntest; long m, pt; long r, l; bool thoat, brk; long len[120000]; long a[120000]; struct data { long l; long r; }; data luu[200000]; void out(long tt) {...

Go to advanced search