Advertisement
a53

Sir3

a53
May 18th, 2019
229
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.78 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. int v[10];
  5. int main()
  6. {
  7. unsigned long p,k,n,gr,nr=0, min, max,sum,x;
  8. long i,j;
  9. cin >> p >> n >> k;
  10. nr=0;gr=1;
  11.  
  12. while(nr+gr<p)
  13. { nr=nr+gr; gr++; }
  14.  
  15. min=2*(nr+1)-1;
  16. max=2*(nr+gr)-1;
  17. sum=max+min;
  18. x=2*p-1;
  19.  
  20. if(gr%2==0)
  21. x=sum-x;
  22. gr=1;
  23.  
  24. while(gr*gr*gr<k)gr++;
  25. if(gr*gr*gr>k)gr--;
  26.  
  27. cout << x << endl; //a si b
  28. nr=n*(n-1)/2;
  29.  
  30. int nrc=0;
  31.  
  32. for(i=1;i<=n;i++)
  33. { x=2*(nr+i)-1;
  34. do{ nrc++;
  35. v[x%10]++;
  36. x=x/10;
  37. }while(x);
  38. }
  39.  
  40.  
  41. int cif=-1;
  42. for(i=9;i>=0;i--)
  43. if(v[i])
  44. { for(j=1; j<=v[i]/2;j++) cout<<i;
  45. if((v[i]%2!=0)&&(cif==-1))cif=i;
  46. v[i]=v[i]/2;
  47. }
  48. if(cif>-1)
  49. cout << cif;
  50. for(i=0;i<=9;i++)
  51. if(v[i])
  52. for(j=1; j<=v[i];j++)
  53. cout<<i;
  54. cout<<endl<<gr<<endl;
  55. return 0;
  56. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement