| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 473344 | AbdoMo | San (COCI17_san) | C++17 | 1087 ms | 312 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(string a,string b)
{
    if(a.size()==b.size())
    {
        return a<b;
    }
    return a.size()<b.size();
}
int n,k;
int arr[50][2];
int rec(int i,int x)
{
    int ans=0;
    if(i == n-1)
    {
        return(x>=k);
    }
    bool flag=0;
    if(x>=k)ans++;
    for(int j=i+1;j<n;j++)
    {
        if(arr[j][0]>=arr[i][0])
        {
            ans+=rec(j,x+arr[j][1]);
        }
    }
    return ans;
}
void solve(){
    cin>>n>>k;
    for(int i=0;i<n;i++)
    {
        cin>>arr[i][0]>>arr[i][1];
    }
    int ans=0;
    for(int i=0;i<n;i++)
    {
        ans+=rec(i,arr[i][1]);
    }
    cout<< ans;
}
int32_t main(){
	int t=1;
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
   // cin>>t;
	while(t--){solve();}
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
