@programminginc - страница 1262

MᏫᎻᎯᎷᎷᎬᎠ

so using it again is UB or does move make sure that vector gets a new buffer?

Lmao xD

olli

it always depends on the type what actually happens when moved from. for std::unique_ptr for example the standard describes the behavior.

BinaryByter

Oh

MᏫᎻᎯᎷᎷᎬᎠ

it always depends on the type what actually happens when moved from. for std::unique_ptr for example the standard describes the behavior.

Ok

MᏫᎻᎯᎷᎷᎬᎠ

Thank you again lol

olli

sure :)

A45h1

Do any one know what is carding

Liam

Do any one know what is carding

Any context?

Mat

Do any one know what is carding

A little ddg search told me what it is

A45h1

Any context?

Do you know

A45h1

Wat is it

A45h1

?

Liam

Wat is it

Faint... CARDING is a single word and has many meaning. What it is depends on the context of the word. Who, in God's name, knows what it is without any context?

A45h1

Oh

Liam

Mind OS: "I have a warn and a ban, which one do you prefer more?"

Dima

k sorry I will not do this anymore

S.

https://en.wikipedia.org/wiki/Carding_(fraud)

S.

So … that carding guy is out?

Mat

Which pleasure?

Liam

So … that carding guy is out?

That's why my inner mind OS..

Mat

It's not a pleasure

Anonymous

Hi

Hakker

plz help

Hakker

how to check frequency of a number in input number

Hakker

without arrays

Hakker

like if i enter 22313, it should tell that how many 0,1,2... are present

Anonymous

Use while with %10

Anonymous

And remember frequency

MᏫᎻᎯᎷᎷᎬᎠ

without arrays

Use std::vector then xD

爱月夜眠迟

unordered_map

Parra

like if i enter 22313, it should tell that how many 0,1,2... are present

do you know index sort?

Liam

std::cin >> s directly would be better.

Liam

/ban discrimination words.

Dima

lol lmao

klimi

@LiamHuang was it that bad?

Roxifλsz 🇱🇹

@LiamHuang was it that bad?

It was a quote of Terry Davis

Roxifλsz 🇱🇹

klimi

It was a quote of Terry Davis

So it was bad?

Dima

God save us ... https://github.com/Wittmaxi/Maxix

Dima

Liam

@LiamHuang was it that bad?

You mean the N-word?

Dima

do you have n-word pass?

klimi

You mean the N-word?

Yes

Anonymous

Indians are more powerful because they already have n word pass

Liam

Yes

Well, I'll reply this in the admin group.

Kanchan

Hi

MᏫᎻᎯᎷᎷᎬᎠ

Hi

Kanchan

I want c programming interview questions

Dima

cool

Dima

I want c programming interview questions

#googleit

Dima

Indians are more powerful because they already have n word pass

Nindian

Dima

#ot

MᏫᎻᎯᎷᎷᎬᎠ

Yeah

Dima

Indians: reach superpass for n-word by 2020

BinaryByter

xDD

Dima

stop it right here

mark

Roxifλsz 🇱🇹

So it was bad?

Kek, I'm completely indifferent to whether it's bad or not, it wasn't an ad or a homework request so I'm fine with it :D

Dima

Kek, I'm completely indifferent to whether it's bad or not, it wasn't an ad or a homework request so I'm fine with it :D

This and that

Dima

you are officially equipped with the N-word pass

Anonymous

Can we find subarray with time complexity less then O(n^3)

BinaryByter

you mean a string compare?

BinaryByter

yes

BinaryByter

you can do string comparisons in O(n * m)

Brian

Guys, I was researching with fibonacci series ... And I came up with a conclusion .... Does anyone knows any article or proof behind it...?

They say its divine... Sent from above

BinaryByter

Say I have a series ... 0+1+1+2+3+5+8 .... The answer of this would be the two more digits (21) of this series minus the second term (1) i.e., 0+1+1+2+3+5+8 = 0,1,1,2,3,5,8,13,21 = 21-1 = 20

it follows from reasoning

Anonymous

No buddy I want find sub array of e.g.[1,2,3] in time complexity of O(n3)

BinaryByter

sub array=?

Mihail

sub array=?

Find 12 in 123 I guess

BinaryByter

you mean a string compare?

strinf search*

Anonymous

sub array=?

Ya

BinaryByter

Find 12 in 123 I guess

thats a string search

BinaryByter

which you do in O n*m

Mihail

Yeah

BinaryByter

If you do your string searches in n cubed, you have brain cancer

Mihail

I don't know how to do it in n^3 tbh

BinaryByter

I don't know how to do it in n^3 tbh

Neither do I

yuuki

Totally unrelated. In c sharp, we have these jagged arrays, right? Can there be 3 dimensional ones too? Like string[] [] [] v_space