online-judge | ACM判题,对外提供HTTP判题服务

 by   1510460325 Java Version: Current License: No License

kandi X-RAY | online-judge Summary

kandi X-RAY | online-judge Summary

online-judge is a Java library. online-judge has no bugs, it has no vulnerabilities, it has build file available and it has low support. You can download it from GitHub.


            kandi-support Support

              online-judge has a low active ecosystem.
              It has 24 star(s) with 8 fork(s). There are no watchers for this library.
              It had no major release in the last 6 months.
              online-judge has no issues reported. There are 1 open pull requests and 0 closed requests.
              It has a neutral sentiment in the developer community.
              The latest version of online-judge is current.

            kandi-Quality Quality

              online-judge has 0 bugs and 0 code smells.

            kandi-Security Security

              online-judge has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.
              online-judge code analysis shows 0 unresolved vulnerabilities.
              There are 0 security hotspots that need review.

            kandi-License License

              online-judge does not have a standard license declared.
              Check the repository for any license declaration and review the terms closely.
              Without a license, all rights are reserved, and you cannot use the library in your applications.

            kandi-Reuse Reuse

              online-judge releases are not available. You will need to build from source code and install.
              Build file is available. You can build the component from source.
              Installation instructions are not available. Examples and code snippets are available.
              online-judge saves you 781 person hours of effort in developing the same functionality from scratch.
              It has 1796 lines of code, 135 functions and 41 files.
              It has low code complexity. Code complexity directly impacts maintainability of the code.

            Top functions reviewed by kandi - BETA

            kandi has reviewed online-judge and discovered the below as its top functions. This is intended to give you an instant insight into online-judge implemented functionality, and help decide if they suit your requirements.
            • Listen task
            • Creates the workspace
            • Run test
            • Main entry point
            • The Kafka listener container container factory bean
            • Create consumer config map
            • Creates a new consumer factory
            • Zips a file
            • Recursively zip a file path
            • Write the readme file
            • Creates source file
            • Replace the run word
            • Execute the compiler
            • Creates the main source file
            • Creates the source file
            • Creates the source file source file
            • Creates the js source file
            • Execute the compiler
            • Display result
            • Creates the main source script
            • Test
            • Test program
            • Execute compile word
            • The SimpleClientHttpRequestFactory bean
            • Main entry point for the producer application
            Get all kandi verified functions for this library.

            online-judge Key Features

            No Key Features are available at this moment for online-judge.

            online-judge Examples and Code Snippets

            No Code Snippets are available at this moment for online-judge.

            Community Discussions

            Trending Discussions on online-judge


            slice of struct uses too much memory
            Asked 2018-Feb-08 at 19:25

            I tried to solve this problem with BFS, but for input "99 100" my program uses more than 260 Mb and online-judge system throws MEMORY_LIMIT_EXCEEDED. I guess the problem is the way I use QUEUE. So what do you think is the problem? And how should I solve it?

            Here is my code. And thanks in advance!:



            Answered 2018-Feb-08 at 09:55

            Your algorithm is not BFS, because, you can visit the same state more than one.

            For example, 4 -> 3 -> 6 and 4 -> 8 -> 7 -> 6, which 6 will end up to be processed twice.

            Secondly, for number x that is greater than the target, the minimum number of step is always


            Community Discussions, Code Snippets contain sources that include Stack Exchange Network


            No vulnerabilities reported

            Install online-judge

            You can download it from GitHub.
            You can use online-judge like any standard Java library. Please include the the jar files in your classpath. You can also use any IDE and you can run and debug the online-judge component as you would do with any other Java program. Best practice is to use a build tool that supports dependency management such as Maven or Gradle. For Maven installation, please refer For Gradle installation, please refer .


            For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .
            Find more information at:

            Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items

            Find more libraries
          • HTTPS


          • CLI

            gh repo clone 1510460325/online-judge

          • sshUrl


          • Stay Updated

            Subscribe to our newsletter for trending solutions and developer bootcamps

            Agree to Sign up and Terms & Conditions

            Share this Page

            share link

            Consider Popular Java Libraries


            by CyC2018


            by Snailclimb


            by MisterBooo


            by spring-projects

            Try Top Libraries by 1510460325


            by 1510460325Java


            by 1510460325Java


            by 1510460325JavaScript


            by 1510460325C


            by 1510460325Java