OJ Board

After I change a bit, I get WA instead.
This is my code. Where is my bug?

#include<stdio.h>
#include<string.h>
int main(){
int C,n,i,a[10010],c[10010],x,y,s;
scanf("%d",&C);
while(C--){
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d%d",&x,&y);
a[y-1]=x-1;
}
for(i=0;i<n;i++)
c[a[i]]=i;
for ...

strange, my code get TLE..
but I think it is fast enough, which run 2000 times n=10000 test case cost about 4 sec.

Is there any critical input in judge or my code really too slow?

If I don't use epsilon, I will get WA because of precision error.

I use eps=1E-7 and pass it,
so I think eps is not main reason why you get WA.

I can't pass this problem. Can anyone check these inputs?
Thanks in advance.

Input1
25
4 1 2 3 4 4 1 2 3
6 1 2 2 1 3 4 4 5 5 6 6 3
6 1 2 2 3 3 1 4 6 6 5 5 4
6 1 1 2 2 3 4 4 5 5 3 6 6
6 1 2 2 1 3 4 4 3 5 6 6 5
10 2 2 6 5 8 7 4 9 9 4 10 10 1 1 5 3 7 6 3 8
10 4 10 2 1 9 9 3 8 6 7 10 4 5 3 1 6 8 5 7 2 ...

char* c = NULL;
*c = '\0';


No, that is not the reason.
*c is not pointer, it is a variable.

Change the code
#include "stdio.h"
int main() {
static char buffer[1000000];
int cnt = 0;
while (fgets(buffer, 1000000, stdin) != NULL)
+cnt;
if (cnt % 2 != 0) {
char* c = NULL;
*c = '\0 ...

It takes too long time for loading.

After I used Firefox, the loading time is speed up like old system.
But the inconvenience of new judge is I cannot submit code in one page.

I think the new judge is very good but something is better to improve.

The ranking has to be separated because two ...

Thank you, I found a silly mistake, and then I got AC.

And what are these outputs?
Thanks.

Input:
41
3
1 2
8 9
5 6
6
2 4
6 9
9 10
8 9
2 3
1 2
7
8 9
5 9
7 8
1 2
6 9
3 6
2 4
7
5 6
3 5
2 4
1 2
5 9
4 8
4 7
8
3 6
2 3
3 5
1 3
7 8
9 10
6 9
6 10
16
6 10
3 6
1 3
5 6
4 7
7 8
5 8
5 9
9 10
6 9
2 3
8 9
4 8
1 2
3 5
4 5
11
5 8
4 8
6 9
2 3
9 10
6 10
2 5
3 5
2 4
4 7
1 ...

thank you, I got AC
still a silly mistake.

The sequence 1,2,4,5,7,8,10,11,13,14,...
contain a lot of arithmetic sequence,
such as (1,4,7),(2,5,8 ),(1,7,13)...etc.
(1,4,7) --> 7-4=4-1=3 so it is arithmetic sequence.

Think more and you will get it

I got several WAs, anyone check these i/o?
thanks in advance.

Input:
A:FB;B:GC;D:GC;F:AGH;E:HD
A:FB;B:GC;D:GC;F:AGH;E:H
A:B;B:C;C:D;D:E;E:F;F:G;G:H
A:B;B:C;C:D;D:E;E:F;F:G;G:H;H:A
A:B;B:CE;C:D;D:E;E:F;F:G;G:H;H:A
A:B;B:CE;CG:D;D:E;E:F;F:G;G:H;H:A <--Wrong Input, sorry
A:B;B:CE;C:DG;D:E;E:F;F:G;G:H ...

What are the correct output for these inputs?
PS.although 6<=m, I want to know these outputs.

Thanks in advance.

input: my output:

even if v==m its effective income may less then m-1,
so solution v is valid as i think.
sorry, you are right.
To hi!man!

For input "100 67", your code outputs 300

But I think the answer is 299

by the way, I think
if(n*100%(100-x)==0)
n--; exist a problem

Hope it helps :)
Thanks, it really ...

even if v==m, the solution v is still valid.
I don't think so.

Given the value of m and x, you will have to find the value of the maximum income v, which is effectively (after deducting the tax) less than someone earning less than v.

According to problem statement, v must bigger than m.
If I ...