标签:iostream lld mil class fine for i++ can size
2 1 1 2 1
1 2
#include <cstdio> #include <iostream> #include <cmath> #include <string> #include <cstring> #include <algorithm> #include <queue> #include <vector> #include <map> using namespace std; #define ll long long int t, n, m; ll sum1; int main() { scanf("%d", &t); while(t--) { sum1 = 1; scanf("%d%d", &n, &m); for(int i = 1; i <= m; i++) { sum1 *= (n-i+1); sum1 /= i; } printf("%lld\n", sum1); } return 0; }
SDNU 1245.这题超难的,建议先做其他的,看都不要看(思维)
标签:iostream lld mil class fine for i++ can size
原文地址:https://www.cnblogs.com/RootVount/p/10991748.html