Cod sursa(job #3313378)
| Utilizator | Data | 3 octombrie 2025 22:00:33 | |
|---|---|---|---|
| Problema | Range minimum query | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
#include <vector>
using namespace std;
const int PRIMMAX = 1999999973;
int main() {
freopen("loto2.in", "r", stdin);
freopen("loto2.out", "w", stdout);
int n, i, apare = false;
scanf("%d", &n);
vector<int> v(n, 0);
for (i = 0; i < n; i++) {
scanf("%d", &v[i]);
if (v[i] == PRIMMAX)
apare = true;
}
printf("%d", PRIMMAX);
return 0;
}
