A Vagina number is a three-digit number where the last digit is a product of the first and second digit

e.g 122,100,224 are Vagina numbers, while 287,473,112 are not Vagina numbers

You're given a three digit number N, find the smallest Vagina number that is greater than or equal to N. It always exists under the constraints.

Constraints
100≤N≤919
N is positive

Sample Input 01
320
Sample Output 01
326


Sample Input 02
144
Sample Output 02
144


Sample Input 03
516
Sample Output 03
600

If you can't solve this simple problem without ChatGpt, please consider a change of career path

i can solve it , but how much ?

koladata:
i can solve it , but how much ?

Mthewww. I wonder what made you think I can't solve it myself, nonsense. How much kill you there, nonsense. Broke men everywhere, i spit on your bald head

i'm not broke, I just wanted to be sure of the need for it

turmacs:
Mthewww. I wonder what made you think I can't solve it myself, nonsense. How much kill you there, nonsense. Broke men everywhere, i spit on your bald head

koladata:
i'm not broke, I just wanted to be sure of the need for it

😒

So nobody can solve this? Wonderful

Solve it by yourself ijiot

turmacs:
A Vagina number is a three-digit number where the last digit is a product of the first and second digit

e.g 122,100,224 are Vagina numbers, while 287,473,112 are not Vagina numbers

You're given a three digit number N, find the smallest Vagina number that is greater than or equal to N. It always exists under the constraints.

Constraints
100≤N≤919
N is positive

Sample Input 01
320
Sample Output 01
326


Sample Input 02
144
Sample Output 02
144


Sample Input 03
516
Sample Output 03
600

Just come out and say it's your homework and I will give you the solution and the walk through.
This is an exercise for students taking DSA

ibo:


Just come out and say it's your homework and I will give you the solution and the walk through.
This is an exercise for students taking DSA

No be only DSA

Since nobody could solve it yet, I'll drop my own solution

C++

 #include <bits/stdc++.h>
using namespace std;
int likeNUMBER(int n ){
	vector<int> a;
	while(n>0){
		int digit = n%10;
		a.push_back(digit);
		n/=10;
	}
	reverse(a.begin(), a.end());
	int q = a.size();
	int product = 1;
	for(int i = 0; i <q-1;i++){
		product *= a[i];
	}
	if(product != a[q-1]){
		return false;
	}
	return true;
}

int main( ){
	int n; cin >>n;
	int num;
	for(int i = n;i<919; i++){
		if(likeNUMBER(i)){
			num = i;
		       break;	
		}
	}
	cout << num << endl;
	return 0;
}

turmacs:
Since nobody could solve it yet, I'll drop my own solution

C++

 #include <bits/stdc++.h>
using namespace std;
int likeNUMBER(int n ){
	vector<int> a;
	while(n>0){
		int digit = n%10;
		a.push_back(digit);
		n/=10;
	}
	reverse(a.begin(), a.end());
	int q = a.size();
	int product = 1;
	for(int i = 0; i <q-1;i++){
		product *= a[i];
	}
	if(product != a[q-1]){
		return false;
	}
	return true;
}

int main( ){
	int n; cin >>n;
	int num;
	for(int i = n;i<919; i++){
		if(likeNUMBER(i)){
			num = i;
		       break;	
		}
	}
	cout << num << endl;
	return 0;
}

Nice!

turmacs:
Since nobody could solve it yet, I'll drop my own solution

C++

 #include <bits/stdc++.h>
using namespace std;
int likeNUMBER(int n ){
	vector<int> a;
	while(n>0){
		int digit = n%10;
		a.push_back(digit);
		n/=10;
	}
	reverse(a.begin(), a.end());
	int q = a.size();
	int product = 1;
	for(int i = 0; i <q-1;i++){
		product *= a[i];
	}
	if(product != a[q-1]){
		return false;
	}
	return true;
}

int main( ){
	int n; cin >>n;
	int num;
	for(int i = n;i<919; i++){
		if(likeNUMBER(i)){
			num = i;
		       break;	
		}
	}
	cout << num << endl;
	return 0;
}

FriedPussy 😁

turmacs:
A Vagina number is a three-digit number where the last digit is a product of the first and second digit

e.g 122,100,224 are Vagina numbers, while 287,473,112 are not Vagina numbers

You're given a three digit number N, find the smallest Vagina number that is greater than or equal to N. It always exists under the constraints.

Constraints
100≤N≤919
N is positive

Sample Input 01
320
Sample Output 01
326


Sample Input 02
144
Sample Output 02
144


Sample Input 03
516
Sample Output 03
600

From your definition of vagina number is this not wrong?

5*1 is = 5

Output should be 605

BlackhatMentor:
[/i]


From your definition of vagina number is this not wrong?

5*1 is = 5

Output should be 605

6 X 0 is not 5

turmacs:
6 X 0 is not 5

That's the output.

Check the input

BlackhatMentor:


That's the output.

Check the input

Reread the problem

Are you telling me this romanceland troll has brain?

Javascript

1 function smallestPussyNumber(pussyNumber, to = 919) {
2 let smallestPNumber = pussyNumber;
3 for (let i = pussyNumber; i <= to; i++) {
4 if (isPussyNumber(i) === i && isPussyNumber(i) >= smallestPNumber) {
5 smallestPNumber = i;
6 break;
7 }
8 }
9
10 return smallestPNumber;
11 }

🤣 The problem is really tricky. the tricky part for me is that line 6. If you like no put that break statement e go dey return the maximum constraint i.e 919, you have to loop it once!(speaking for my logic only).

Here is the function I used, him work na to return back the number if it's pussy/vaginaNumber.

1 function isPussyNumber(numberValue) {
2 let isPussyNumber = numberValue;
3 if (typeof numberValue !== 'number') {
4 return 'Go And Sit Down!';
5 }
6
7 // Handle The Constraint Gently 🥰
8 const isThreeDigit = `${numberValue}`.length == 3;
9
10 if (!isThreeDigit) {
11 return 'Pussy Number is Three Digit Number Only!';
12 }
13
14 // we need some methods from string or array. Let me use string.
15 const stringifiedDigit = `${numberValue}`;
16
17 const lastDigit = +(stringifiedDigit.slice(stringifiedDigit.length - 1, stringifiedDigit.length));
18
19 const firstTwoDigit = +(stringifiedDigit.slice(0, 2));
20
21 const productOfFirstTwo = (+stringifiedDigit.slice(0, 1)) * (+stringifiedDigit.slice(1, 2));
22
23 if (productOfFirstTwo !== lastDigit) {
24 isPussyNumber = false;
25 }
26
27 return isPussyNumber;
28 }

29 console.log(smallestPussyNumber(516));



The whole code without number lines.
function smallestPussyNumber(pussyNumber, to = 919) {
let smallestPNumber = pussyNumber
for (let i = pussyNumber; i <= to; i++) {
if (isPussyNumber(i) === i && isPussyNumber(i) >= smallestPNumber) {
smallestPNumber = i
break
}
}

return smallestPNumber
}

function isPussyNumber(numberValue) {
let isPussyNumber = numberValue
if (typeof numberValue !== 'number') {
return 'Go And Sit Down!'
}

// Handle The Constraint Gently 🥰
const isThreeDigit = `${numberValue}`.length == 3

if (!isThreeDigit) {
return 'Pussy Number is Three Digit Number Only!'
}

// we need some methods from string or array. Let me use string.
const stringifiedDigit = `${numberValue}`

const lastDigit = +(stringifiedDigit.slice(stringifiedDigit.length - 1, stringifiedDigit.length))

const firstTwoDigit = +(stringifiedDigit.slice(0, 2))

const productOfFirstTwo = (+stringifiedDigit.slice(0, 1)) * (+stringifiedDigit.slice(1, 2))

if (productOfFirstTwo !== lastDigit) {
isPussyNumber = false
}

return isPussyNumber
}
console.log(smallestPussyNumber(516))

termacs2:
Javascript

1 function smallestPussyNumber(pussyNumber, to = 919) {
2 let smallestPNumber = pussyNumber;
3 for (let i = pussyNumber; i <= to; i++) {
4 if (isPussyNumber(i) === i && isPussyNumber(i) >= smallestPNumber) {
5 smallestPNumber = i;
6 break;
7 }
8 }
9
10 return smallestPNumber;
11 }

🤣 The problem is really tricky. the tricky part for me is that line 6. If you like no put that break statement e go dey return the maximum constraint i.e 919, you have to loop it once!(speaking for my logic only).

Here is the function I used, him work na to return back the number if it's pussy/vaginaNumber.

1 function isPussyNumber(numberValue) {
2 let isPussyNumber = numberValue;
3 if (typeof numberValue !== 'number') {
4 return 'Go And Sit Down!';
5 }
6
7 // Handle The Constraint Gently 🥰
8 const isThreeDigit = `${numberValue}`.length == 3;
9
10 if (!isThreeDigit) {
11 return 'Pussy Number is Three Digit Number Only!';
12 }
13
14 // we need some methods from string or array. Let me use string.
15 const stringifiedDigit = `${numberValue}`;
16
17 const lastDigit = +(stringifiedDigit.slice(stringifiedDigit.length - 1, stringifiedDigit.length));
18
19 const firstTwoDigit = +(stringifiedDigit.slice(0, 2));
20
21 const productOfFirstTwo = (+stringifiedDigit.slice(0, 1)) * (+stringifiedDigit.slice(1, 2));
22
23 if (productOfFirstTwo !== lastDigit) {
24 isPussyNumber = false;
25 }
26
27 return isPussyNumber;
28 }

29 console.log(smallestPussyNumber(516));



The whole code without number lines.
function smallestPussyNumber(pussyNumber, to = 919) {
let smallestPNumber = pussyNumber
for (let i = pussyNumber; i <= to; i++) {
if (isPussyNumber(i) === i && isPussyNumber(i) >= smallestPNumber) {
smallestPNumber = i
break
}
}

return smallestPNumber
}

function isPussyNumber(numberValue) {
let isPussyNumber = numberValue
if (typeof numberValue !== 'number') {
return 'Go And Sit Down!'
}

// Handle The Constraint Gently 🥰
const isThreeDigit = `${numberValue}`.length == 3

if (!isThreeDigit) {
return 'Pussy Number is Three Digit Number Only!'
}

// we need some methods from string or array. Let me use string.
const stringifiedDigit = `${numberValue}`

const lastDigit = +(stringifiedDigit.slice(stringifiedDigit.length - 1, stringifiedDigit.length))

const firstTwoDigit = +(stringifiedDigit.slice(0, 2))

const productOfFirstTwo = (+stringifiedDigit.slice(0, 1)) * (+stringifiedDigit.slice(1, 2))

if (productOfFirstTwo !== lastDigit) {
isPussyNumber = false
}

return isPussyNumber
}
console.log(smallestPussyNumber(516))

turmacs:

Wetin 😂😂

termacs2:

Wetin 😂😂

Na u go dey reply person wey get empty brain.

A word of advice. Start building out projects, stop sexualizing programming challenges.

The real challenge is in system design. Make your product no work first. You go know what's up.

Pussy this, dick that, toto this, breast that. Come on!

// Vag Number Checker fuction
function isVagNo(x) {
return (
Number(x.toString()[0]) * Number(x.toString()[1]) ===
Number(x.toString()[2])
);
}

// Implementation
function vagNo(num) {
// Return nothing if Constraints are not met
if (num.toString().length < 3 || num < 100 || num > 919) return;

// Return num if num passes as a Vag Number
if (isVagNo(num)) {
console.log(num);
return num;
} else {
// Else loop through with num as the lower range and 919 as the Upper range till the nearest Vag no is found.
for (let i = num; i <= 919; i++) {
if (isVagNo(i)) {
console.log(i);
return i;
}
}
}
}
// Test cases

vagNo(320);
vagNo(144);
vagNo(516);