// // main.cpp // win // // Created by Mikołaj Korulczyk on 09/12/2019. // Copyright © 2019 Mikołaj Korulczyk. All rights reserved. // #include <bits/stdc++.h> using namespace std; int n, k; int main() { scanf("%i%i", &n, &k); int s, idx, val; int res = 1e9; for(int i = 1; i <= n; i++) { for(int j = 1; j <= i; j++) { //cin >> val; scanf("%i", &val); s = i+1; idx = (s-j)*j; if(idx <= k) { res = min(res, val); } } } printf("%i\n", res); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 | // // main.cpp // win // // Created by Mikołaj Korulczyk on 09/12/2019. // Copyright © 2019 Mikołaj Korulczyk. All rights reserved. // #include <bits/stdc++.h> using namespace std; int n, k; int main() { scanf("%i%i", &n, &k); int s, idx, val; int res = 1e9; for(int i = 1; i <= n; i++) { for(int j = 1; j <= i; j++) { //cin >> val; scanf("%i", &val); s = i+1; idx = (s-j)*j; if(idx <= k) { res = min(res, val); } } } printf("%i\n", res); return 0; } |