Coder Social home page Coder Social logo

oj's People

Contributors

5lipper avatar evensgn avatar sjtufs avatar xjia1 avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

oj's Issues

评测状态表格增加使用提示

需要增加的提示包括:

  • 点击运行编号,可以固定这条记录在顶端
  • 点击评测结果,可以查看各测试点细节

提示的形式,可以是直接在表头里“运行编号”和“评测结果”这两个文字上面加 tooltip,也可以是在旁边弄一个小的 icon,鼠标移上去显示 tooltip

tooltip 就用:http://twitter.github.com/bootstrap/javascript.html#tooltips
icon 就用:http://twitter.github.com/bootstrap/base-css.html#icons
icon-question-sign或者icon-info-sign都可以

此外,鼠标悬停在一条记录上的时候,会显示出重新提交的图标,需要对此图标增加 tooltip,提示“重新提交”;在评测记录详情的页面里也一样

One Account for all ACM-class services?

We have already Accounts for acm students profiles,
and we may have more and more services for acm students.
It is better if we use one account for all acm-class services.

The online judge may support external users.
But it is still useful for the internal acm students if one account is supported.

Is this issue related to Issue #5

OJ评测机bug

2001题两个简单的单层循环,提交三次,一次50分,5个点超时,一次90分,1个点超时,一次通过,耗时最长的点只有不到0.5s
代码如下:

#include <iostream>
using namespace std;
long n,sum[11000]={0};
long m;
int main()
{
    cin >> n;
    for (int i=1,tmp;i<=n;i++)
    {
        cin >> tmp;
        sum[i]=sum[i-1]+tmp;
    }
    cin >> m;
    for (int i=1,a,b;i<=m;i++)
        {
        cin >> a >> b;
        cout << sum[b]-sum[a-1]<< endl;
    }
    return 0;
}

3039题MLE代码主要的内存使用

#define maxbit 27
struct big_int
{
    long num[maxbit],bit;
    bool flag;
    static const long mod=10000;
};
big_int a[200010]={0},tmp[200010]={0};

仅有不到43000K,win7下用cena测试也显示不到50000K,但OJ上提示MLE;
该题AC后的代码主要的内存使用

#define compbit 14
struct big_int
struct comp_int
{
    long num[compbit],bit;
    bool flag;
    static const long mod=100000000;
};
comp_int a[200010]={0},tmp[200010]={0};

超过了20000K,但OJ上前几个测试点显示内存消耗仅5000K左右

计分错误

经常显示“正确”但是report里分数不到100,重测之后就会100分

More Programming Languages Support

Is it difficult to support more programming languages?

If not, it is better to support as many programming languages as possible.
It is useful for someone who practice a new touched languages.

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.