OJ Board

Sumon wrote: Sample Input:

5
5 5
5 5 5 5 5
4 4
2 2 4 0
3 4
2 2 4
5 4
2 2 4 0 4
5 4
-1 3 -3 1 1

Sample Output

Case 1: 1
Case 2: 2
Case 3: 1
Case 4: 3
Case 5: 4

Thanks, but my program outputs the same output.

I don't need initialize it with 0's, because I use different flags for each
test case, i. e. I use flags 1 and 2 for test case 1, 3 and 4 for test case 2
and so... I changed char[20000005] to unsigned char[20000005] but
got WA again :(

In my implementation, at the end of each test case i have ...

Please i got wrong answer
I just need sample inputs and sample outputs for
3 4 5 6 7 8 9 100 200 1000 and more if any one can
This is my program, and it gets RTE on online judge, but it works
on my computer normally.

#include <iostream.h>
int m[1005][500]={0};
int main()
{
int i,n,j,t; m[0][499 ...

make the flag array ready for the next input. re - initialize it with 0's
I don't need initialize it with 0's, because I use different flags for each
test case, i. e. I use flags 1 and 2 for test case 1, 3 and 4 for test case 2
and so... I changed char[20000005] to unsigned char[20000005] but
got ...

No sorting & no hashing.

I used a flag array to identify duplicates..
char flag[20000002]

It runs within 0:07.125

I used that method and got WA :cry:


#include <iostream.h>
#include <string.h>
char flag[20000005]={0};
const int dif=10000005;
int main()
{
long long s,temp,k,t,n,ii,i,zz ...

[quote="minskcity] number of permutations which will take at least K swaps should be number of permutations for which minimum number of swaps to sort is K "at least" implies nothing about minimum.
Are you claiming that "1 3 2" does not require "at least 0 swaps" to sort it? Let me know how to sort ...

From problem statement, output section: For each of the input, print in a line the number of permutations which will take at least K swaps. Now, look at the test case#2... The way I see it, any of 3! = 6 permutations of 3 elements require at least 0 swaps to sort.

You should output the number of ...

Thanks a lot, Zaspire, but I am getting WA :cry:
This is my code:

#include <iostream.h>
#include <stdio.h>
int main()
{
char c;
int crc,m=34943;
for(;;)
{
c=getchar();
if(c=='#') break;
crc=0;
while(c!='\n')
{
crc<<=8;
crc+=c;
crc%=34943;
c=getchar();
}
crc=(crc<<16)%34943 ...

What's the formula for this problem?

Thanks to Adrian Kuegel !!! At last I got Accepted!

At least I got Accepted! :wink: Here is my code:

#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
char c[1000005];
int m[1000005];
int main()
{
int n,a,b,i,ii=0,k;
while(scanf("%s",c)!=EOF)
{
ii++;
cout<<"Case "<<ii<<':'<<endl;
m[0]=0;
k=strlen(c);
for(i=1;i<k;i ...

Why I got TLE?? :cry:


#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
char c[1000005];
int m[1000005];
int main()
{
int n,a,b,i,ii=0;
while(scanf("%s",c)!=EOF)
{
ii++;
cout<<"Case "<<ii<<':'<<endl;
m[0]=0;
for(i=1;i<strlen(c);i++)
{
if(c !=c[i-1]) m =m[i-1]+1 ...