Rezolvare BAC Informatica 2009 – Varianta 34 – Subiectul al III-lea problema 3
Mai jos puteti gasi rezolvarea problemei 3 de la subiectul III din varianta 34 pentru examenul de bacalaureat din anul 2009
This file contains 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 <fstream.h> | |
| fstream f("f.in", ios::in); | |
| int max(int a[100], int n) { | |
| if (a[1] > a[2]) | |
| return a[1]; | |
| else | |
| return a[n]; | |
| } | |
| int prog(int a[100], int n) { | |
| int i; | |
| for (i = 2; i < n; i++) | |
| if (a[i + 1] - a[i] != a[2] - a[1]) | |
| return 0; | |
| return 1; | |
| } | |
| void main() { | |
| int n, i, j; | |
| int a[100]; | |
| int max1 = -10000; | |
| f >> n; | |
| for (i = 1; i <= n; i++) { | |
| for (j = 1; j <= n; j++) | |
| f >> a[j]; | |
| if (prog(a, n)) | |
| if (max(a, n) > max1) | |
| max1 = max(a, n); | |
| } | |
| cout << max1; | |
| } |
by Spor la lucru! Daca aveti intrebari nu ezitati sa le lasati in comentarii, va vom raspunde cat de repede putem 