#include <iostream> using namespace std; typedef unsigned long long int ull; int n, k, pom, res=2019; ull newton(int a, int b) { double r=1; for(int i=1; i<=b; ++i) { r=r*(a-i+1)/i; } return (ull)r; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); cin >> n >> k; for(int i=0; i<n; ++i) { for(int j=0; j<i+1; ++j) { cin >> pom; if(i<k && newton(i, j)>=1) { if((newton(i, j)+i)<=k && pom<res) res=pom; } } } cout << res << endl; 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 | #include <iostream> using namespace std; typedef unsigned long long int ull; int n, k, pom, res=2019; ull newton(int a, int b) { double r=1; for(int i=1; i<=b; ++i) { r=r*(a-i+1)/i; } return (ull)r; } int main() { cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0); cin >> n >> k; for(int i=0; i<n; ++i) { for(int j=0; j<i+1; ++j) { cin >> pom; if(i<k && newton(i, j)>=1) { if((newton(i, j)+i)<=k && pom<res) res=pom; } } } cout << res << endl; return 0; } |