2 projects for "problem a" with 2 filters applied:

  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • Paessler - Monitor Your Whole Network in Minutes Icon
    Paessler - Monitor Your Whole Network in Minutes

    Auto-discovery finds your devices and deploys pre-configured sensors instantly. No project plan required, just visibility from day one.

    Waiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
    Start Free 30-Day Trial
  • 1
    Advanced Trigonometry Calculator

    Advanced Trigonometry Calculator

    Open-source C/C++ math engine for advanced scientific computing

    ...Created in 2011 and maintained by Renato Alexandre dos Santos Freitas, ATC is designed as a practical Windows desktop application for advanced calculations, automation, and technical problem solving. ATC supports equation solving, polynomial tools, complex numbers, matrix calculations, statistics, physics, geometry, unit conversions, DSP/FFT operations, and scripting. It can also process batch TXT files, making it useful for repeatable calculations and automated workflows. The project also includes ATC Online Alpha, a WebAssembly-based version that brings parts of the ATC engine to the web. ...
    Leader badge
    Downloads: 10 This Week
    Last Update:
    See Project
  • 2
    TSP Solver and Generator

    TSP Solver and Generator

    Generate and solve Travelling Salesman Problem tasks

    TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later.
    Downloads: 2 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next