fork download
  1. #include <iostream>
  2. #define P sorts
  3. #include<cmath>
  4. using namespace std;
  5.  
  6. int main() {
  7. string s="banana";
  8. int n=s.length();
  9. int sorts[n+1][50];
  10. int k=0;
  11.  
  12. while(k<3){
  13. int val=(int)(pow(2,k))-1;
  14. cout<<"this is val "<<val<<endl;;
  15. for(int i=0;i<n;i++){
  16. int index=i+val;
  17. if(index>=n){
  18. P[i][index]=-1;
  19. }else{
  20. P[i][index]=s[index]-'a';
  21. }
  22.  
  23. }
  24. k++;
  25.  
  26. }
  27. for(int i=0;i<n;i++){
  28. for(int j=0;j<3;j++){
  29. cout<<P[i][j]<<" ";
  30. }
  31. cout<<endl;
  32. }
  33.  
  34. return 0;
  35. }
Success #stdin #stdout 0s 4808KB
stdin
Standard input is empty
stdout
this is val 0
this is val 1
this is val 3
1 0 377952864 
377946112 0 13 
379916033 0 13 
0 0 0 
0 0 0 
0 0 0