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 pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , (y) )
#define umin( x , y ) x = min( x , (y) )
#define all(x) x.begin() , x.end()
using namespace std;
int n;
ll ans=0,mod=1000000007;
int a[505],b[505];
int main(){
//cin.tie(0);ios_base::sync_with_stdio(0);
//freopen("boat.in","r",stdin);
//freopen(".out","w",stdout);
cin>>n;
return 0;
for(int i=0;i<n;i++)
cin>>a[i]>>b[i];
ll dp[505][10000];
for(int i=0;i<505;i++)
for(int j=0;j<10000;j++)
dp[i][j]=0;
dp[0][0]=1;
dp[0][a[0]]=1;
for(int i=1;i<=n;i++){
for(int j=0;j<a[i];j++){//i yi alarak
dp[i][a[i]]+=dp[i-1][j];
dp[i][a[i]]%=mod;
}
for(int j=0;j<10000;j++){// i yi almiyarak
dp[i][j]+=dp[i-1][j];
dp[i][j]%=mod;
}
}
for(int i=0;i<10000;i++){
ans+=dp[n][i];
ans%=mod;
}
return 0;
}
# | 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... |