Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- /// Typedef
- typedef long long ll;
- typedef unsigned long ul;
- typedef unsigned long long ull;
- typedef vector<int> vi;
- typedef vector<vi> vvi;
- typedef vector<ll> vll;
- typedef pair<int,int> pii;
- typedef pair<ll,ll> pll;
- typedef vector< pii > vii;
- #define pb push_back
- #define ppb pop_back
- #define MP make_pair
- #define ff first
- #define ss second
- #define sf scanf
- #define pf printf
- #define SQR(x) ((x)*(x))
- #define loop(i, y) for(ll i=0; i<ll(y); i++)
- #define FOR(i, x, y) for(int i=int(x); i<=int(y); i++)
- #define ROF(i, x, y) for(int i=int(x); i>=int(y); i--)
- #define SZ(c) int(c.size())
- #define CLR(x, y) memset(x, y, sizeof(x))
- #define READ(f) freopen(f, "r", stdin)
- #define WRITE(f) freopen(f, "w", stdout)
- #define FastIO ios_base::sync_with_stdio(false)
- #define tr(it, container) for(auto it = container.begin(); it != container.end(); it++)
- #define sci(x) scanf("%d", &x)
- #define scii(x, y) scanf("%d %d", &x, &y)
- #define sciii(x, y, z) scanf("%d %d %d", &x, &y, &z)
- #define scl(x) scanf("%lld", &x)
- #define scll(x, y) scanf("%lld %lld", &x, &y)
- #define sclll(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
- #define bitCheck(N,in) ((bool)(N&(1<<(in))))
- #define bitOff(N,in) (N&(~(1LL<<(in))))
- #define bitOn(N,in) (N|(1LL<<(in)))
- #define bitFlip(a,k) (a^(1LL<<(k)))
- #define unq(v) sort(all(v)), (v).erase(unique(all(v)),v.end())
- #define common(a,b) sort(all(a)), sort(all(b)), a.erase(set_intersection(all(a),all(b),a.begin()),a.end())
- #define uncommon(a,b) sort(all(a)), sort(all(b)), a.erase(set_symmetric_difference(all(a),all(b),a.begin()),a.end())
- #define dbg(x) cout<<#x<<" = "<<x<<endl;
- #define _ccase printf("Case %lld: ",++cs)
- #define _case cout<<"Case "<<++cs<<": "
- #define rev(v) reverse(v.begin(),v.end())
- #define srt(v) sort(v.begin(),v.end())
- #define grtsrt(v) sort(v.begin(),v.end(),greater<ll>())
- #define all(v) v.begin(),v.end()
- #define mnv(v) *min_element(v.begin(),v.end())
- #define mxv(v) *max_element(v.begin(),v.end())
- #define toint(a) atoi(a.c_str())
- #define fout(x) fixed<<setprecision(x)
- string tostr(int n) {stringstream rr;rr<<n;return rr.str();}
- inline void yes(){cout<<"YES\n";exit(0);}
- inline void no(){cout<<"NO\n";exit(0);}
- ll dx[]={1,0,-1,0,1,-1,-1,1};
- ll dy[]={0,1,0,-1,1,1,-1,-1};
- //random_device rd;
- //mt19937 rnd(rd());
- #define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); deb(_it, args); }
- void deb(istream_iterator<string> it) {}
- template<typename T, typename... Args>
- void deb(istream_iterator<string> it, T a, Args... args) {
- cerr << *it << " = " << a << endl;
- deb(++it, args...);
- }
- const int mod=1e9+7;
- const int N=3e5+9;
- const ll eps=1e-9;
- const ll PI=acos(-1.0);
- ll gc(ll a,ll b){while(b){ll x=a%b;a=b;b=x;}return a;}
- ll lc(ll a,ll b){return a/gc(a,b)*b;}
- ll qpow(ll n,ll k) {ll ans=1;assert(k>=0);n%=mod;while(k>0){if(k&1) ans=(ans*n)%mod;n=(n*n)%mod;k>>=1;}return ans%mod;}
- string s[505];
- double log101(double n){
- return log(n)/log(10);
- }
- int32_t main()
- {
- FastIO;
- ll n, m, b, a, c, d,k;
- while(scll(n, m)==2){
- double ans=0;
- for(int i=0; i<m; i++){
- ans+=log101(n-i)-log101(i+1);
- }
- b=floor(ans)+1;
- cout<<b<<endl;
- }
- return 0;
- }
- ///Before submit=>
- /// *check for integer overflow,array bounds
- /// *check for n=1
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement