This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| --- orig/Ardour-6.5.0/libs/ardour/wscript 2020-11-23 04:08:02.000000000 +0300 | |
| +++ Ardour-6.5.0/libs/ardour/wscript 2021-01-19 15:32:17.366195300 +0300 | |
| @@ -337,8 +337,8 @@ | |
| autowaf.check_pkg(conf, 'libcurl', uselib_store='CURL', | |
| atleast_version='7.0.0') | |
| - autowaf.check_pkg(conf, 'fftw3f', uselib_store='FFTW35F', | |
| - atleast_version='3.3.5', mandatory=False) | |
| + autowaf.check_pkg(conf, 'fftw3f', uselib_store='FFTW3F', | |
| + atleast_version='3.3.5', mandatory=True) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <cmath> | |
| using namespace std; | |
| template <typename T> | |
| struct my_vector | |
| { | |
| T* data; | |
| int capacity; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <string> | |
| #include <vector> | |
| using namespace std; | |
| vector<int> prefix(string str) { | |
| int n = str.size(); | |
| vector<int> p(n); | |
| p[0] = 0; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <cstdlib> | |
| #include <ctime> | |
| #include <conio.h> | |
| using namespace std; | |
| const int FIELD_SIZE = 4; | |
| int field[FIELD_SIZE][FIELD_SIZE]; | |
| int score; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <fstream> | |
| using namespace std; | |
| double det_rec(double** a, int n) { | |
| if (n == 1) return a[0][0]; | |
| double d = 0; | |
| for (int j = 0; j < n; j++) { | |
| double** m = new double*[n - 1]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <ctime> | |
| using namespace std; | |
| void merge(int* x, int start, int middle, int end) { | |
| int* temp = new int[end - start]; | |
| int i1 = start, i2 = middle, dest = 0; | |
| while (i1 < middle && i2 < end) { | |
| if (x[i1] < x[i2]) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <ctime> | |
| using namespace std; | |
| int main() { | |
| srand(time(0)); | |
| int m = 5; | |
| double** a = new double*[m]; | |
| for (int i = 0; i < m; i++) { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <iostream> | |
| #include <ctime> | |
| #include <string> | |
| #include <fstream> | |
| using namespace std; | |
| template <typename T> | |
| void bubble_sort(T* array, int size) | |
| { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Вариант 1 | |
| 1) Создайте перечисления "Масть" | |
| (со значениями 4-х мастей) и "Ранг" (со значениями | |
| рангов игральных карт: 1=туз,2=двойка и т.д. | |
| до 13(король)). Создайте класс "Игральная карта" | |
| с атрибутами масти и достоинства. Напишите | |
| метод для определения того,бьет ли одна карта | |
| другую (с опциональным параметром козырной | |
| масти). | |
| 2) Создайте модель данных "Трамвайное депо" |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Вариант 1 | |
| 1) Создайте перечисления "Масть" | |
| (со значениями 4-х мастей) и "Ранг" (со значениями | |
| рангов игральных карт: 1=туз,2=двойка и т.д. | |
| до 13(король)). Создайте класс "Игральная карта" | |
| с атрибутами масти и достоинства. Напишите | |
| метод для определения того,бьет ли одна карта | |
| другую (с опциональным параметром козырной | |
| масти). | |
| 2) Создайте модель данных "Трамвайное депо" |
NewerOlder