Search found 6 matches
- Sun Sep 21, 2008 3:12 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10327 - Flip Sort
- Replies: 81
- Views: 35410
Re: 10327 - Flip Sort
yes, my code was AC.
- Fri Sep 05, 2008 1:01 am
- Forum: Volume 100 (10000-10099)
- Topic: 10038 - Jolly Jumpers
- Replies: 445
- Views: 152668
10038 - Jolly Jumpers -> WA
where's wrong ?
the answers of this code is correct for jasonw' inputs (try the previous post's test inputs)
[c]
#include <stdio.h>
int abs(int n);
int main(){
freopen("P10038.in", "rt", stdin);
int i, tam, bandera2, result, x, y, z, rAntX, rAntY, resto;
while(scanf("%d", &tam) != EOF ...
the answers of this code is correct for jasonw' inputs (try the previous post's test inputs)
[c]
#include <stdio.h>
int abs(int n);
int main(){
freopen("P10038.in", "rt", stdin);
int i, tam, bandera2, result, x, y, z, rAntX, rAntY, resto;
while(scanf("%d", &tam) != EOF ...
- Fri Sep 05, 2008 12:51 am
- Forum: Volume 101 (10100-10199)
- Topic: 10152 - ShellSort
- Replies: 33
- Views: 14775
10152 - ShellSort
here is my code, where's wrong ?
#include <stdio.h>
#include <string.h>
#define MAXNOM 50
#define MAXTOR 200
int getNextToMin(int tam);
void borrarValue(int val, int tam);
void generarArray(int tam);
int getIndex(char name[MAXNOM], int tam);
void procesar(int tam);
void readLine(char *cad);
char ...
#include <stdio.h>
#include <string.h>
#define MAXNOM 50
#define MAXTOR 200
int getNextToMin(int tam);
void borrarValue(int val, int tam);
void generarArray(int tam);
int getIndex(char name[MAXNOM], int tam);
void procesar(int tam);
void readLine(char *cad);
char ...
- Tue Sep 02, 2008 6:37 am
- Forum: Volume 101 (10100-10199)
- Topic: 10152 - ShellSort
- Replies: 33
- Views: 14775
10152 - ShellSort
Do you have more test inputs y its outs ?
- Thu Aug 28, 2008 6:16 pm
- Forum: Volume 103 (10300-10399)
- Topic: 10327 - Flip Sort
- Replies: 81
- Views: 35410
10327 - Flip Sort --> more inputs
Input
5
6 2 1 5 4
8
3 5 8 2 1 9 7 0
2
0 0
12
0 1 2 5 4 1 2 0 5 0 7 9
30
21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21
output
Minimum exchange operations : 6
Minimum exchange operations : 16
Minimum exchange ...
5
6 2 1 5 4
8
3 5 8 2 1 9 7 0
2
0 0
12
0 1 2 5 4 1 2 0 5 0 7 9
30
21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21 21 5 6 5 8 452 12 5 96 21
output
Minimum exchange operations : 6
Minimum exchange operations : 16
Minimum exchange ...
- Wed Aug 13, 2008 1:36 am
- Forum: Volume 102 (10200-10299)
- Topic: 10229 - Modular Fibonacci
- Replies: 53
- Views: 26160
10229 - Modular Fibonacci --> here more case testing
Input
11 7
11 6
2147483647 2
0 0
2147483647 0
2147483647 19
output
89
25
1
0
0
325917
11 7
11 6
2147483647 2
0 0
2147483647 0
2147483647 19
output
89
25
1
0
0
325917