Advertisement
theo830

ψοιψι

Jun 5th, 2019
98
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.00 KB | None | 0 0
  1. #include <iostream>
  2. #include <list>
  3. using namespace std;
  4. typedef long long ll;
  5. ll n;
  6. bool find(list<ll>b){
  7. list<ll>w;
  8. w = b;
  9. ll i=1;
  10. while(i <= n){
  11. ll f=0;
  12. ll j=i;
  13. while(j > 0){
  14. f+=w.front();
  15. //cout<<w.front()<<" ";
  16. w.pop_front();
  17. j--;
  18. }
  19. w=b;
  20. if(f < 0){
  21. //cout<<0<<endl;
  22. return 0;
  23. break;
  24. }
  25. i++;
  26. }
  27. //cout<<1<<endl;
  28. return 1;
  29. }
  30. int main(void){
  31. ios_base::sync_with_stdio(0);
  32. cin.tie(0);
  33. cout.tie(0);
  34. cin>>n;
  35. list<ll>b;
  36. ll c;
  37. ll g=0;
  38. for(ll i=0;i<n;i++){
  39. cin>>c;
  40. g+=c;
  41. b.push_back(c);
  42. }
  43. ll o=0;
  44. ll temp;
  45. for(int i=0;i<n;i++){
  46. if(g <= 0){
  47. break;
  48. }
  49. if(find(b)){
  50. o++;
  51. }
  52. temp = b.front();
  53. b.pop_front();
  54. b.push_back(temp);
  55. }
  56. cout<<o;
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement