P3123 Penevskaya Alexandra task-3

src/main/cpp/t01_quad.cpp

@@ -19,5 +19,12 @@
 using namespace std;
 
 int t01_quad() {
+    int N, i;
+    cin >> N;
+    i=1;
+    while (i*i <= N) {
+        cout << i*i << " ";
+        i++;
+    }
 
 };

src/main/cpp/t02_divisor.cpp

@@ -19,5 +19,12 @@
 using namespace std;
 
 int t02_divisor() {
+    int a;
+    cin >> a;
+    int i=2;
+    while ( a%i > 0 ) {
+        i++;
+    }
+    cout << i;
 
 };

src/main/cpp/t03_twos.cpp

@@ -23,5 +23,17 @@
 using namespace std;
 
 int t03_twos() {
+    int a;
+    cin >> a;
+    int i=1;
+    while ( a>i ) {
+        i=i*2;
+    }
+    if ( a==i) {
+        cout << "YES";
+    }
+    else {
+        cout << "NO";
+    }
 
 };

src/main/cpp/t04_sum.cpp

@@ -20,5 +20,13 @@
 using namespace std;
 
 int t04_sum() {
+    int a, sum;
+    cin >> a;
+    sum = 0;
+    while ((a>0) || (a<0)) {
+        sum=sum+a;
+        cin >> a;
+    }
+    cout << sum;
 
 };

src/main/cpp/t05_max.cpp

@@ -20,5 +20,15 @@
 using namespace std;
 
 int t05_max() {
+    int a;
+    cin >> a;
+    int max=a;
+    while ((a>0) || (a<0)) {
+        if (max<a) {
+            max=a;
+        }
+        cin >> a;
+    }
+    cout << max;
 
 };

src/main/cpp/t06_max_count.cpp

@@ -30,5 +30,20 @@
 using namespace std;
 
 int t06_max_count() {
+    int a;
+    cin >> a;
+    int max=a;
+    int i=0;
+    while ((a>0) || (a<0)) {
+        if (max == a) {
+            i++;
+        }
+        if (a > max) {
+            i=1;
+            max=a;
+        }
+        cin >> a;
+    }
+    cout << i;
 
 };

src/main/cpp/t07_max_2.cpp

@@ -29,5 +29,21 @@
 using namespace std;
 
 int t07_max_2() {
+    int a;
+    cin >> a;
+    int m1=a;
+    cin >> a;
+    int m2=a;
+    while ((a>0) || (a<0)) {
+        if (a>=m1) {
+            m2=m1;
+            m1=a;
+        }
+        else if ((a>m2) && (a<m1)) {
+            m2=a;
+        }
+        cin >> a;
+    }
+    cout << m2;
 
 };

src/main/cpp/t08_fibb.cpp

@@ -21,5 +21,25 @@
 using namespace std;
 
 int t08_fibb() {
+    int N, F, F1, s;
+    cin >> N;
+    F=1;
+    F1=0;
+    s=0;
+    if (N==0) {
+        cout << "0";
+    }
+    else if (N==1) {
+        cout << "1";
+    }
+    else {
+        while (N>1) {
+            N=N-1;
+            s=F+F1;
+            F1=F;
+            F=s;
+        }
+        cout << s;
+    }
 
 };

src/main/cpp/t09_row.cpp

@@ -23,5 +23,27 @@
 using namespace std;
 
 int t09_row() {
+    int a,a1,i,m;
+    cin >> a;
+    a1=a;
+    i=1;
+    m=i;
+    while (a!=0) {
+        cin >> a;
+        if (a==a1) {
+            i=i+1;
+        }
+        else {
+            if (m<i) {
+                m=i;
+                i=1;
+            }
+            else {
+                i=1;
+            }
+        }
+        a1=a;
+    }
+    cout << m;
 
 };

src/main/cpp/t10_max_local.cpp

@@ -24,5 +24,24 @@
 using namespace std;
 
 int t10_max_local() {
+    int a,a1,a2,i;
+    cin >> a;
+    a1=a;
+    cin >> a;
+    a2=a;
+    cin >> a;
+    i=0;
+    if ((a2>a1) && (a2>a)) {
+        i=i+1;
+    }
+    while (a != 0) {
+        a1=a2;
+        a2=a;
+        cin >> a;
+        if ((a2>a) && (a2>a1) && (a != 0)) {
+            i=i+1;
+        }
+    }
+    cout << i;
 
 };