diff --git a/quito/7.1 b/quito/7.1 new file mode 100755 index 0000000..c2fb079 Binary files /dev/null and b/quito/7.1 differ diff --git a/quito/7.1.cpp b/quito/7.1.cpp new file mode 100644 index 0000000..8a057f5 --- /dev/null +++ b/quito/7.1.cpp @@ -0,0 +1,56 @@ +#include +#include +using namespace std; + +// 7.1, 7.2, 7.3 feladatok megoldasai + +bool prim(int n) { + if (n == 1) return false; + if (n == 2) return false; + for (int i = 2; i < n; i++) { + if (n%i==0){ + return false; + } + } + return true; +} + +int convert(string a) { + int out = 0; + int counter = 1; + for (int i = a.size() - 1; i >= 0; i--) { + if (a[i] == '1') { + out += counter; + } + counter = counter *2; + } + return out; + +} + +int lnko(int n, int k) { + vectorosztok1; + vectorosztok2; + for (int i = 1; i <= n; i++) { + if (n%i==0) osztok1.push_back(i); + } + for (int i = 1; i <= k; i++) { + if (k%i==0) osztok2.push_back(i); + } + int out=1; + for (int i = 0; i < osztok1.size(); i++) { + for (int j = 0; j < osztok2.size(); j++) { + if ((osztok1[i] == osztok2[j]) && (osztok1[i] > out)) { + out = osztok1[i]; + } + } + } + return out; +} + +int main() { + cout< +#include +using namespace std; + +// 7.5, 7.6 feladatok megoldasai + +long long factorial (long long n) { + if (n==0) return 1; + return n * factorial(n-1); +} + +int stringToInt (string n) { + if (n == "") return 0; + return (stringToInt(n.substr(0, n.size() -1)) * 10) + n.back() - '0' ; +} + +int maximum(vector v) { + +} + +int main () { + cout< +#include +using namespace std; + + + +int hatvany (int n, int k) { + if (k == 0) return 1; + return n * hatvany(n, k-1); +} + + + +int main () { + cout<