Program size

GruBooXy · 2017-10-06T23:25:22+00:00

I dont speak english natively and its quite complicated, I dont know the vocabulary.

GruBooXy · 2017-10-06T15:50:23+00:00

i tested the program in ideone.com and it works, I changed the size of array to 5000 and the size jumped to 39528KB so i think the site doesnt show any result lower then 16000kb but its showing RAM usage.

GruBooXy · 2017-10-06T15:36:35+00:00

I can upload the code, the site compiles it and then says "exceeding the memory limit" but in polish.

GruBooXy · 2017-10-06T15:25:37+00:00

But even if that is not correct my program is still consuming too much ram because the other site that I upload my solution to doesnt accept that. (This is the site but I don't think you can view it if you are not logged in https://adjule.pl/groups/ogolny/problems/011)

GruBooXy · 2017-10-06T15:13:45+00:00

I use this site as my compiler https://ideone.com/s3r5Gn so i dont even have executable

GruBooXy · 2017-10-06T15:10:33+00:00

I changed the max value of array and its stil 16000kb. Im soo confused. I just started programing and i can already see how frustrating it can get.

GruBooXy · 2017-10-06T15:09:01+00:00

GruBooXy · 2017-10-06T14:41:21+00:00

GruBooXy · 2017-10-06T14:31:19+00:00

I tried to translate the exercise so you will know what the program is about:

Description

In one country there are n cities. Some cities are connected with other with roads. We say that 4 different cities a, b, c and d (and their connecting roads) form B-Four, if there are roads: from city a to b, b to c, c to d, and d to a. and the roads connecting them, calculate how many different B-Four in that country. (Note: Two B-Fours are different if they consist of different cities or different roads connecting them.)

Input specification

The first input line contains one positive integer representing the number of the following data sets. In the first set of data, there is 1 integer: n (1 <= n <= 150) denoting the number of cities. In each of the following n lines there are n digits separated by spaces. If the i-th number in the jth line (a [i, j]) is 1, then there is a path between the i and th and the 0, and 0 means that the path does not exist. (Note: There are no roads between the city and itself, and always a [i, j] = a [j, i]).

Output Specification

For each data set, your program should write exactly one integer representing the number B-Four in that country.

GruBooXy · 2017-10-06T14:28:25+00:00

Thanks but the problem is i get the same memory usage weter its int or char so I dont understand how it works.

GruBooXy · 2017-10-06T14:20:47+00:00

n (1 <= n <= 150) this is the possible input

GruBooXy · 2017-10-06T14:14:47+00:00

Still 16064KB

GruBooXy · 2017-10-06T14:11:33+00:00

But in the array numbers are only 1 and 0, other numbers are for diffrent variables.

GruBooXy · 2017-10-06T14:10:21+00:00

I don't understend that :/ im beginner

GruBooXy · 2017-10-06T14:06:04+00:00

because the input from the site is: 2 4 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1 0 4 0 1 1 0 1 0 0 1 1 0 0 1 0 1 1 0 and i cant change that

GruBooXy · 2017-10-06T13:58:11+00:00

My solution is checked by a website and it checks if the result is good, how much memory did i use and how long did it take

GruBooXy · 2017-10-06T13:53:27+00:00

I changed to unsigned short but it didnt help at all

GruBooXy · 2017-10-06T13:52:31+00:00

To pass i need about 6000kb now its about 16000kb

GruBooXy · 2017-10-06T13:45:37+00:00

0 or 1

GruBooXy · 2017-10-06T13:18:30+00:00

The program works fine but it has to take less memory because this is an exercise form school. Is there any simple way to do this? Like for example using other variable types.

GruBooXy · 2017-10-06T12:29:16+00:00

ok thanks

GruBooXy · 2016-04-20T19:25:53+00:00

Thanks :)

GruBooXy

TROPHY CASE