filtrare numere din secventa

Edited by MarianG, 09 December 2022 - 00:12.
filtrare numere din secventa

 Hudy_17, on 08 decembrie 2022 - 20:31, said:

 Hudy_17, on 08 decembrie 2022 - 20:31, said:

Edited by MarianG, 09 December 2022 - 12:54.
paginatie

Edited by MarianG, 09 December 2022 - 12:57.

Quote

este_numar_urat(int num)
{
....cat timp numar divide 5 numar / = 5
....cat timp numar divide 3 numar / = 3
....cat timp numar divide 2 numar / = 2
....return (1 == numar);
}

este_numar_urat(int num)
{
....int lista = {5, 3, 2}
....eliminta_lista_factori(num, lista)
....return (1 == num);
}

functie eliminta_lista_factori(numar, lista)
{
....pentru fiecare factor din lista
........elimina_factor(numar, factor);
}

este_numar_urat(int num)
{
....int lista = {5, 3, 2}
....eliminta_lista_factori(num, lista)
....return (1 == num);
}

functie elimina_factor (numar, factor)
{
....cat timp numar divide factor numar / = factor
}

functie eliminta_lista_factori(numar, lista)
{
....pentru fiecare factor din lista
........elimina_factor(numar, factor);
}

este_numar_urat(int num)
{
....int lista = {5, 3, 2}
....eliminta_lista_factori(num, lista)
....return (1 == num);
}

main()
{
....limita = citeste_fisier();
....contor = 0;
....numar = 2;
....cat timp contor < limita
.......contor+= este_numar_urat( numar++ );
// to do
}

Edited by MarianG, 18 December 2022 - 13:40.

A = { 1 } => 1 = nr. urat cu nr. de ordine 0
A = { 1 } + { 1 * 2, 1 * 3, 1 * 5 } - { 1 } = { 2, 3, 5 } => 2 = nr. urat cu nr. de ordine 1
A = { 2, 3, 5 } + { 2 * 2, 2 * 3, 2 * 5 } - { 2 } = { 3, 4, 5, 6, 10 } => 3 = nr. urat cu nr. de ordine 2
A = { 3, 4, 5, 6, 10 } + { 3 * 2, 3 * 3, 3 * 5 } - { 3 } = { 4, 5, 6, 9, 10, 15 } => 4 = nr. urat cu nr. de ordine 3
A = { 4, 5, 6, 9, 10, 15 } + { 4 * 2, 4 * 3, 4 * 5 } - { 4 } = { 5, 6, 8, 9, 10, 12, 15, 20 } => 5 = nr. urat cu nr. de ordine 4
A = { 5, 6, 8, 9, 10, 12, 15, 20 } + { 5 * 2, 5 * 3, 5 * 5 } - { 5 } = { 6, 8, 9, 10, 12, 15, 20, 25 } => 6 = nr. urat cu nr. de ordine 5
A = { 6, 8, 9, 10, 12, 15, 20, 25 } + { 6 * 2, 6 * 3, 6 * 5 } - { 6 } = { 8, 9, 10, 12, 15, 18, 20, 25, 30 } => 8 = nr. urat cu nr. de ordine 6
A = { 8, 9, 10, 12, 15, 18, 20, 25, 30 } + { 8 * 2, 8 * 3, 8 * 5 } - { 8 } = { 9, 10, 12, 15, 16, 18, 20, 24, 25, 30, 40 } => 9 = nr. urat cu nr. de ordine 7

Edited by darkangel2, 18 December 2022 - 13:29.

int smart_set_init(struct smart_set_st** ss); // initializes set ss
int smart_set_destroy(struct smart_set_st** ss); // destroys set ss
int smart_set_add(struct smart_set_st* ss, int x); // adds x to set ss
int smart_set_remove(struct smart_set_st* ss, int x); // removes x from set ss (if it exists)
int smart_set_get_min(struct smart_set_st* ss, int* x); // sets x to minimum value from set ss

int transform(struct smart_set_st* ss) {
..int min_val = 0;

..smart_set_get_min(ss, &min_val);
..smart_set_remove(ss, min_val);
..smart_set_add(ss, min_val * 2);
..smart_set_add(ss, min_val * 3);
..smart_set_add(ss, min_val * 5);

..return 0;
}

int main() {
..int n = 20; // determine the 20th ugly number
..int ugly_nr = 0;
..struct smart_set_st *ss = NULL;

..smart_set_init(&ss);
..smart_set_add(ss, 1);

..for (int i = 0; i < n - 1; i++) {
....transform();
..}

..smart_set_get_min(ss, &ugly_nr);

..smart_set_destroy(&ss);

..// do something with ugly_nr e.g. print it

..return 0;
}

Edited by darkangel2, 18 December 2022 - 15:09.

darkangel2, on 09 decembrie 2022 - 12:38, said:

Edited by maccip, 15 January 2023 - 18:49.

#include <iostream>
#include <queue>

using namespace std;

int main() {
	int n;
	cin >> n;

	// initializam cozile pentru 2, 3 si 5
	priority_queue<int, vector<int>, greater<int>> q2, q3, q5;
	q2.push(2);
	q3.push(3);
	q5.push(5);

	// numarul curent
	int ugly = 1;

	for (int i = 1; i < n; i++) {
		// luam cel mai mic numar din cele 3 cozi
		int num2 = q2.top();
		int num3 = q3.top();
		int num5 = q5.top();
		ugly = min(min(num2, num3), num5);

		// eliminam numarul din coada sa
		if (ugly == num2) {
			q2.pop();
		}
		if (ugly == num3) {
			q3.pop();
		}
		if (ugly == num5) {
			q5.pop();
		}

		// adaugam numerele generate prin inmultirea cu 2, 3 si 5
		q2.push(ugly * 2);
		q3.push(ugly * 3);
		q5.push(ugly * 5);
	}

	cout << ugly << endl;
	return 0;
}

Edited by MarianG, 16 January 2023 - 12:24.
tags

maccip, on 15 ianuarie 2023 - 18:44, said:

wertyck, on 15 ianuarie 2023 - 18:56, said:

darkangel2, on 15 ianuarie 2023 - 19:31, said:

darkangel2, on 15 ianuarie 2023 - 19:31, said:

Quote

#include <stdio.h>
int is_smooth_5(int num) {
if (num <= 1) {
	 return 0; // not a smooth-5 number
}
while (num % 2 == 0) {
	 num /= 2;
}
while (num % 3 == 0) {
	 num /= 3;
}
while (num % 5 == 0) {
	 num /= 5;
}
return num == 1;
}
int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);
if (is_smooth_5(num)) {
	 printf("%d is a smooth-5 number.\n", num);
} else {
	 printf("%d is not a smooth-5 number.\n", num);
}
return 0;
}

Quote

maccip, on 15 ianuarie 2023 - 19:49, said: