Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
- #define ll long long
- #define ld double
- #define llu long long unsigned
- #define mod 100000
- //int a[1100000];
- void merge(vector < int > &arr, int l, int m, int r)
- {
- int i, j, k;
- int n1 = m - l + 1;
- int n2 = r - m;
- int L[n1], R[n2];
- for (i = 0; i < n1; i++)
- L[i] = arr[l + i];
- for (j = 0; j < n2; j++)
- R[j] = arr[m + 1+ j];
- i = 0;
- j = 0;
- k = l;
- while (i < n1 && j < n2)
- {
- if (L[i] <= R[j])
- {
- arr[k] = L[i];
- i++;
- }
- else
- {
- arr[k] = R[j];
- j++;
- }
- k++;
- }
- while (i < n1)
- {
- arr[k] = L[i];
- i++;
- k++;
- }
- while (j < n2)
- {
- arr[k] = R[j];
- j++;
- k++;
- }
- }
- void mergeSort(vector < int > &arr, int l, int r)
- {
- if (l < r)
- {
- int m = l+(r-l)/2;
- mergeSort(arr, l, m);
- mergeSort(arr, m+1, r);
- merge(arr, l, m, r);
- }
- }
- //void fib( )
- //{
- // a[0] = 0;
- // a[1] = 1;
- // for( int i = 2 ; i < 1100000 ; i++ )
- // {
- // a[i] = ( a[ i - 1 ] % mod + a[ i - 2 ] % mod ) % mod;
- // }
- //}
- int main()
- {
- fast;
- // fib();
- int t ;
- cin>>t;
- t = t < 100 ? t : 100;
- for( int c = 1 ; c <= t ; c++ )
- {
- cout<<"Case "<<c<<":";
- int x , b;
- cin>>x>>b;
- vector < int > v;
- int pre1 = 0;
- if( x <= 1 )
- v.push_back( 0 );
- int pre2 = 1;
- if( x <= 2 )
- v.push_back( 1 );
- for( int i = 2 ; i < x + b ; i++ )
- {
- int ans = ( pre1 % mod + pre2 % mod ) % mod;
- if( i >= x - 1 )
- v.push_back( ans );
- pre1 = pre2;
- pre2 = ans;
- // v.push_back( a[i] );
- // cout<<" "<<a[i];
- }
- mergeSort( v , 0 , v.size() - 1 );
- for( int i = 0 ; i < v.size() ; i++ )
- cout<<" "<<v[i];
- cout<<"\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement