CSES - Datatähti 2018 alku - Results
Submission details
Task:Fraktaali
Sender:ISIMO66
Submission time:2017-10-05 22:24:14 +0300
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED10
#3ACCEPTED10
#4ACCEPTED10
#5ACCEPTED10
#6ACCEPTED10
#7ACCEPTED10
#8ACCEPTED10
#9ACCEPTED10
#10ACCEPTED10
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.05 s2details
#3ACCEPTED0.05 s3details
#4ACCEPTED0.05 s4details
#5ACCEPTED0.04 s5details
#6ACCEPTED0.04 s6details
#7ACCEPTED0.04 s7details
#8ACCEPTED0.05 s8details
#9ACCEPTED0.05 s9details
#10ACCEPTED0.05 s10details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:25:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d\n", &n);
                   ^

Code

#include "stdio.h"
#include "stdlib.h"
struct Fractal
{
int n;
int side;
int ** cell;
};
int printfractal(Fractal);
int reverse(int);
Fractal multiply(Fractal);
int freefractal(Fractal);
int main( int argc, char ** argv) {
Fractal fractal;
fractal.n = 1;
fractal.side = 1;
fractal.cell = (int **)malloc(fractal.side * sizeof(int *));
*fractal.cell = (int *)malloc(fractal.side * sizeof(int));
**fractal.cell = 1;
int n;
scanf("%d\n", &n);
for(int i = 1; i < n; i++){
fractal = multiply(fractal);
}
printfractal(fractal);
freefractal(fractal);
return 0;
}
int printfractal(Fractal fractal){
for (int i = 0; i < fractal.side; i++){
for (int ii = 0; ii < fractal.side; ii++){
if (fractal.cell[i][ii] == 1){
putchar('#');
}
else if(fractal.cell[i][ii] == 0){
putchar('.');
}
else{
putchar('?');
}
}
putchar('\n');
}
return 1;
}
int reverse(int x){
if (x == 0) return 1;
if (x == 1) return 0;
return -1;
}
Fractal multiply(Fractal fractal){
fractal.cell = (int **)realloc(fractal.cell, 2 * fractal.side * sizeof(int *));
for(int i = 0; i < fractal.side; i++) {
fractal.cell[i] = (int *)realloc(fractal.cell[i], fractal.side * 2 * sizeof(int));
for (int ii = 0; ii < fractal.side; ii++){
fractal.cell[i][fractal.side + ii] = fractal.cell[i][ii];
}
fractal.cell[i + fractal.side] = (int *)malloc(2 * fractal.side * sizeof(int));
for (int ii = 0; ii < fractal.side; ii++){
fractal.cell[i + fractal.side][ii] = fractal.cell[i][ii];
fractal.cell[i + fractal.side][ii + fractal.side] = reverse(fractal.cell[i][ii]);
}
}
fractal.side *= 2;
fractal.n += 1;
return fractal;
}
int freefractal(Fractal fractal){
for (int i = 0; i < fractal.side; i++){
free(fractal.cell[i]);
}
free(fractal.cell);
return 1;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1

correct output
#

user output
#

Test 2

Group: 2

Verdict: ACCEPTED

input
2

correct output
##
#.

user output
##
#.

Test 3

Group: 3

Verdict: ACCEPTED

input
3

correct output
####
#.#.
##..
#..#

user output
####
#.#.
##..
#..#

Test 4

Group: 4

Verdict: ACCEPTED

input
4

correct output
########
#.#.#.#.
##..##..
#..##..#
####....
...

user output
########
#.#.#.#.
##..##..
#..##..#
####....
...

Test 5

Group: 5

Verdict: ACCEPTED

input
5

correct output
################
#.#.#.#.#.#.#.#.
##..##..##..##..
#..##..##..##..#
####....####....
...

user output
################
#.#.#.#.#.#.#.#.
##..##..##..##..
#..##..##..##..#
####....####....
...

Test 6

Group: 6

Verdict: ACCEPTED

input
6

correct output
##############################...

user output
##############################...

Test 7

Group: 7

Verdict: ACCEPTED

input
7

correct output
##############################...

user output
##############################...

Test 8

Group: 8

Verdict: ACCEPTED

input
8

correct output
##############################...

user output
##############################...

Test 9

Group: 9

Verdict: ACCEPTED

input
9

correct output
##############################...

user output
##############################...

Test 10

Group: 10

Verdict: ACCEPTED

input
10

correct output
##############################...

user output
##############################...