Muffin123

Yeah its one big partiton type system. I tried cleaning the disk, i cant, tried cleaning partition i cant. Says i cannot delete partition with boot info or something along those lines, should i leave DBAN on for full 3 overwrites? Correction: Drive 0: Partition 1 type: Primary I cannot clean drive or partition, also cannot delete partition

So ive installed a 32 bit version of win7 on my laptop by accident a week ago, when my disk died. This is a brand new 1 week old hdd. Today i had the time and i wanted to reinstall 64bit windows on it, however when i install it, at exactly 88% in i get the error 0xC0000005. I also cannot clean my disk in diskpart as it says it cannot clean a boot disk, i also ran DBAN for 1 pass for 2 hours which didnt solve the issue. Any idea on how i can format the drive? Or fix to this error? It has all the requirements for windows 7 as its ran it for a year, also ram is fine.

Hi, i have a HHD in my computer currently and im looking into buying an SSD and booting windows 7 off that, currently im booting win7 from my hhd, since my internet speed is horrible and i really would like to play gta5 im wondering if there is any way i could delete windows witout losing all my data so that would still stay on after i boot off the ssd? Or maybe if some of you know if just copying all the gta files and running some kind of install is possible to save all that time downloading 60 gigs

Im 19 currently, but i wont be on till tomorrow, ill add you if youre down for some tomorrow

Anyone down for some heists? Open lobbies are a nightmare. If youre interested message me here or add me on social club 'LukaTheLegend', id love to put a whole crew together for some heists. Or if you already have a few people that you know wont screw up and work together id love to join, let me know

Great, ill look it up once im back home, thanks

Im running an i7 3770k and a gtx660 2gb, 8gigs ram and im stuttering all over the place even on 720p lowest settings

Do we have an ltt gta5 crew? If so how do i join?

That is amazing , thank you

if (tabela[i][j]==zamenjat) return 0; if (tabela[i][j]==trenutni) { tabela[i][j]=zamenjat; if (tabela[i][j+1]==1) { return 7; } else { flood(i+1,j,trenutni,zamenjat,visina,sirina,tabela); flood(i-1,j,trenutni,zamenjat,visina,sirina,tabela); flood(i,j+1,trenutni,zamenjat,visina,sirina,tabela); flood(i,j-1,trenutni,zamenjat,visina,sirina,tabela); } } return 0; This is what it looks like, first it checks if its the same, if its not it checks if its the one im looking for and not 1, then the if statement which i use to change the area, and then color in all directions, but what happens is, it apparently never reaches a 1, and just colors everything in the same color

The problem is then that my function is faulty, it recognises some parts as a new part, but others just get painted over with another color

Im not sure we are on the same page here, this is the matrix i have: 000000000010000000000000000000000000010000000000000000000000000010000000000000000000000000010000000000000000000000000010000000000000000000001111111111100000000000000001000010000100000000000000001000010000100000000000000001000010000100000000000000001000010000100000000000111111111110000100000000000000001000000000100000000000000001000000000100000000000000001000000000100000000000000001000000000100000000000000001111111111111111100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001111111111111111111111000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 As you can see it has 4 areas, when i iterate over it, the thing doesnt care if a 0 is outside of my area, it will just replace it, what i end up with is the same matrix just replaced by 2s instead of 0s

Yeah but then it will just keep looping and finding new zones to fill, without increasing the counter

Yeah, but what i dont understand is, how do i know that that zone is filled, i tried what youre saying already and it will basically just color anything it sees without ever incrementing the counter. this is basically what you mean right? (minus the return 7 if part, apparently there is never an occurance that the next element is a 1 when there clearly is several cases???) if (tabela[i][j]==zamenjat) return 0; if (tabela[i][j]==trenutni) { tabela[i][j]=zamenjat; if (tabela[i][j+1]==1) { return 7; } else { flood(i+1,j,trenutni,zamenjat,visina,sirina,tabela); flood(i-1,j,trenutni,zamenjat,visina,sirina,tabela); flood(i,j+1,trenutni,zamenjat,visina,sirina,tabela); flood(i,j-1,trenutni,zamenjat,visina,sirina,tabela); } } return 0;

Im trying to do this on my own cuz i have no idea how to implement flood properly, so if im getting this right, youre saying i increase the first cell to say 2, then i increase every cell around it confined by 1s untill i cant anymore, then find the next 0 and put that up to say 3 then repeat?

I have managed to code something which then produced this 222222222012222222222222222 222222222012222222222222222 222222222212222222222222222 222222222212222222222222222 222222222212222222222222222 222221111111111122222222222 222221333314444122222222222 222221333314444122222222222 222221333314444122222222222 222221333314444122222222222 111111111114444122222222222 222251444444444122222222222 222251444444444122222222222 222251444444444122222222222 222251444444444122222222222 222221111111111111111122222 222222222222222222222222222 222222222222222222222222222 222222222222222222222222222 222222222222222222222222222 222221111111111111111111111 222222222222222222222222222 222222222222222222222222222 222222222222222222222222222 222222222222222222222222222 222222222222222222222222222 222222222222222222222222222 So when it returns 7 it should increment the 'color' by 1, but i have a problem that i cant seem to get around, when am i supposed to change the 'color', what are the standards that tell me i have to move to a new cell int flood(int i, int j, int trenutna, int zamenjat,int visina,int sirina, int tabela[visina][sirina]) { if ((tabela[i][j]==1) || (tabela[i][j]==0)) { if (tabela[i][j]==1) { return 0; } tabela[i][j]=zamenjat; if (tabela[i][j+1]==1) { flood(i+1,j,trenutna,zamenjat,visina,sirina,tabela); return 7; } if (tabela[i][j]==zamenjat) { if (tabela[i][j+1]==0) { //flood(i,j+1,trenutna,zamenjat,visina,sirina,tabela); } if (tabela[i][j-1]==0) { flood(i,j-1,trenutna,zamenjat,visina,sirina,tabela); } if (tabela[i+1][j]==0) { flood(i+1,j,trenutna,zamenjat,visina,sirina,tabela); } if (tabela[i-1][j]==0) { flood(i-1,j,trenutna,zamenjat,visina,sirina,tabela); } } return 0; } return 0;}

Implementing flood fill should be straightforward, think recursively and you should be able to come up with a workable method on your own. Of course you can get plenty of implementations online if you want. Yeah i was thinking about that, however i still dont understand this, say i 'colored' a segment by increasing every number to 2, how would i then go to the next segment and increase that to 3, so i can then find the maximum of the whole array. I was thinking this way, if i add an if in the recursive function, where if everything is colored it should return an integer, and i would then increase the number by 1?

I was thinking about that yes, but i have problems with walking trough the one section, i cant seem to write that properly, could you elaborate on how to do that?

If you can do it in java or something similiar it would be of great help, i am quite new to coding myself, i understand what you mean here, but i have no idea how i would go about writing it

This is the really hard one, most of them incorporate only squares and and rectangles, so if you have any ideas for that shoot

I have to write this in c, but any thoughts on this would help My problem is i have to read a matrix (which i have coded sucessfully) and then i have to search how many confined areas there are, by that i mean how many areas of 0 are confined by either the boarders of the matrix or the groups of 1s, so in this case the answer would be 4 Here is my matrix: 000000000010000000000000000 000000000010000000000000000 000000000010000000000000000 000000000010000000000000000 000000000010000000000000000 000001111111111100000000000 000001000010000100000000000 000001000010000100000000000 000001000010000100000000000 000001000010000100000000000 111111111110000100000000000 000001000000000100000000000 000001000000000100000000000 000001000000000100000000000 000001000000000100000000000 000001111111111111111100000 000000000000000000000000000 000000000000000000000000000 000000000000000000000000000 000000000000000000000000000 000001111111111111111111111 000000000000000000000000000 000000000000000000000000000 000000000000000000000000000 000000000000000000000000000 000000000000000000000000000 000000000000000000000000000 Any ideas on how to solve this? ive tried with different kinds of conditions within if statements with no sucess so far (i think this might be similar to the flood fill algorithm but i have no idea how to implement that to fill more than 1 area, if anybody knows how to do that, what i mean by that is to just fill each area with numbers from 1 to n instead of colors, so each confined area has its own number, and i can find the maximum of the table)

Thank you

It looked super complitcated put like that in the link, the problem still is my input is 22, so do i just put input.split('' '') ?

There should be an easier solution to this (its a low level java class they wouldnt bother us with this much effort just reading the data), the problem i have is ill need a switch statement for the first digit and then ill need a switch for the second digit, i have no idea how to get that out of this