We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • Practice
  • Certification
  • Compete
  • Career Fair
  • Hiring developers?
  1. Practice
  2. Algorithms
  3. Warmup
  4. Plus Minus
  5. Discussions

Plus Minus

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • plmuon 3 years ago+ 0 comments

    The primitive way is not that longer

    int main() { int n; cin >> n; int cpos = 0, cmin = 0, czero = 0; for (int i = 0; i < n; i++) { int num; cin >> num; if (num < 0) cmin++; else if (num > 0) cpos++; else czero++; } cout << static_cast (cpos) / n << endl << static_cast (cmin) / n << endl << static_cast (czero) / n << endl; return 0; }

    0|
    ParentPermalink
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature