
Search found 11 matches
- Thu Apr 02, 2015 1:33 am
- Forum: Volume 7 (700-799)
- Topic: 773 - The JustaPox Language
- Replies: 1
- Views: 2045
Re: 773 - The JustaPox Language

- Thu Mar 26, 2015 5:13 pm
- Forum: Volume 7 (700-799)
- Topic: 773 - The JustaPox Language
- Replies: 1
- Views: 2045
Re: 773 - The JustaPox Language
I'm getting TLE with this code, not sure why :<
#include <iostream>
#include <fstream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#define PF printf
#define SF scanf
using namespace std;
typedef long long ll;
int itest = 1, ntest = 1 ...
#include <iostream>
#include <fstream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#define PF printf
#define SF scanf
using namespace std;
typedef long long ll;
int itest = 1, ntest = 1 ...
- Sat Jan 10, 2015 3:57 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10994 - Simple Addition
- Replies: 41
- Views: 21912
Re: 10994 - Simple Addition
Thanks for your suggestionbrianfry713 wrote:print F(q) - F(p - 1)


- Thu Jan 08, 2015 9:44 pm
- Forum: Volume 109 (10900-10999)
- Topic: 10994 - Simple Addition
- Replies: 41
- Views: 21912
Re: 10994 - Simple Addition - TLE
Hello,
I got some TLE with my code which I think It's quite fast and can handle over 100 maximum test cases like 0 2147483647...but still TLE!
// Author: Hoang Duc Viet (ducviet321)
#include <fstream>
#include <iostream>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h ...
I got some TLE with my code which I think It's quite fast and can handle over 100 maximum test cases like 0 2147483647...but still TLE!
// Author: Hoang Duc Viet (ducviet321)
#include <fstream>
#include <iostream>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h ...
- Sun Oct 12, 2014 5:24 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22056
Re: 122 - Trees on the level
Thanks! Finally AC after bunch of WAslighted wrote:I deleted my post with big input data. Here i post some small I/O.
Input

- Sat Oct 11, 2014 7:19 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22056
Re: 122 - Trees on the level
Hi, thanks for the tests but I think you might post half or just a last part of those inputlighted wrote:Your code fails last case from input below.
Input

- Fri Oct 10, 2014 3:22 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22056
Re: 122 - Trees on the level
Here is it, I've WA so many times for this problem...
Code: Select all
#include <iostream>
#include <fstream>
#include <math.h>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
int main()
{
int itest, ntest;
return AC ;D
}
- Sat Oct 04, 2014 3:39 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22056
Re: 122 - Trees on the level
@brianfry713
I've fixed it but didn't get AC
By the way, is there test likes (,) and why is your ouput 0?
I've fixed it but didn't get AC

By the way, is there test likes (,) and why is your ouput 0?
- Sat Sep 27, 2014 1:39 pm
- Forum: Volume 1 (100-199)
- Topic: 122 - Trees on the level
- Replies: 103
- Views: 22056
Re: 122 - Trees on the level
Hello, I've tried all tests on this thread and wrote myself, but still WA.
<removed>
<removed>
- Fri Aug 08, 2014 12:35 pm
- Forum: Volume 6 (600-699)
- Topic: 671 - Spell checker
- Replies: 27
- Views: 15305
Re: 671 - Spell checker
I forgot, I always delete "read and write" file before submission.by brianfry713 »
Don't read and write to files
- Tue Aug 05, 2014 9:24 am
- Forum: Volume 6 (600-699)
- Topic: 671 - Spell checker
- Replies: 27
- Views: 15305
Re: 671 - Spell checker
I wrote a lot of tests for this problem but it keeps WA :-? Can anyone help?
Gotcha AC :) Tks for those tests
Inputs
37
oi
#
io
ii
oo
#
llaapp
#
llaapp
llaap
laapp
llapp
llaaapp
lllaapp
llaappp
lap
lapp
llap
laap
lllaappp
llaaappp
lllaaapp
lllaaappp
aappll
ppaall
llppaa
ppllaa
#
more
#
ore
mor ...
Gotcha AC :) Tks for those tests
Inputs
37
oi
#
io
ii
oo
#
llaapp
#
llaapp
llaap
laapp
llapp
llaaapp
lllaapp
llaappp
lap
lapp
llap
laap
lllaappp
llaaappp
lllaaapp
lllaaappp
aappll
ppaall
llppaa
ppllaa
#
more
#
ore
mor ...