From: Marius Gavrilescu Date: Sat, 18 Apr 2015 08:26:59 +0000 (+0300) Subject: Remove some UTF-8 from a/ X-Git-Url: http://git.ieval.ro/?a=commitdiff_plain;h=899c809defcd27f6c8141618acb68ae64ebd7391;p=gruntmaster-page.git Remove some UTF-8 from a/ --- diff --git a/a/about.en b/a/about.en index e46f67e..ec02bf0 100644 --- a/a/about.en +++ b/a/about.en @@ -1,8 +1,8 @@ We are a group of coders of all ages, passionate about problem solving and algorithms. Together, we created MindCoding, an online platform where anyone can learn algorithms and test their skills. Join us, teach yourself new things and have fun!

-Our website provides a problem list with an online evaluation system, which means you'll find out on the spot if your solution is correct. We support a wide rande of programming languages, allowing all programers to participate, regardless of their technical background. Read from stdin and print to stdout. +Our website provides a problem list with an online evaluation system, which means you'll find out on the spot if your solution is correct. We support a wide rande of programming languages, allowing all programers to participate, regardless of their technical background. Read from stdin and print to stdout.

-If you take part in our coding competition (which we strongly recommend!) don't forget to check out our standings and see how well you did compared to your friends. +If you take part in our coding competition (which we strongly recommend!) don't forget to check out our standings and see how well you did compared to your friends.

Put your mind to work and code! @@ -13,7 +13,3 @@ To submit a problem you can either paste your code into the text area for the co To take part in a contest, you don't need to register to a particular one, you just need to access its page after the contest starts.

Here are example solutions for the A+B problem in all languages. - - diff --git a/a/guide.en b/a/guide.en index c270379..76a4380 100644 --- a/a/guide.en +++ b/a/guide.en @@ -1,72 +1,72 @@ -

-

Quick Start Guide:

- - -
-

STEP 1: Choosing a problem from the list

- -

In order to choose a problem click the Problems button from the - navbar.

-

Then click on the problem you want to solve. -
For example let's choose A+B problem.

-
- -
-

STEP 2: Starting to fill the form

- -
-

From now on we focus on Submit solution area.

-

Here we can find the form to be filled in order to upload a solution to any given problem.

-
- -
-

STEP 3: Solution source code

- - - - - - -
1st Option - Upload the source file
-
- Go to Choose file button from File area and then choose the source file. -
or 2nd Option - Paste the code
- -
- Here are some examples for how to submit: - -
- - -
-

STEP 4: Selecting the file format

- -

After uploading the source code we have to choose the format - corresponding to the code we provided as solution.

-
- -
-

...and SUBMIT

- -

Click the Submit job button and wait for the results.

You will be redirected - to Job log page where you can see the results.

- -
-
- -

Good luck!

- - -
+
+

Quick Start Guide:

+ + +
+

STEP 1: Choosing a problem from the list

+ +

In order to choose a problem click the Problems button from the + navbar.

+

Then click on the problem you want to solve. +
For example let's choose A+B problem.

+
+ +
+

STEP 2: Starting to fill the form

+ +
+

From now on we focus on Submit solution area.

+

Here we can find the form to be filled in order to upload a solution to any given problem.

+
+ +
+

STEP 3: Solution source code

+ + + + + + +
1st Option - Upload the source file
+
+ Go to Choose file button from File area and then choose the source file. +
or 2nd Option - Paste the code
+ +
+ Here are some examples for how to submit: + +
+ + +
+

STEP 4: Selecting the file format

+ +

After uploading the source code we have to choose the format + corresponding to the code we provided as solution.

+
+ +
+

...and SUBMIT

+ +

Click the Submit job button and wait for the results.

You will be redirected + to Job log page where you can see the results.

+ +
+
+ +

Good luck!

+ + +
diff --git a/a/index.en b/a/index.en index bad716f..014d6b0 100644 --- a/a/index.en +++ b/a/index.en @@ -16,7 +16,7 @@ View the combined standings
-

MindCoding Competition — The Second Edition

+

MindCoding Competition — The Second Edition

We are excited to announce the return of MindCoding, the fun but still challenging programming competition! It doesn't matter if you have a job, you're in college or still in school, what really matters diff --git a/a/rules.en b/a/rules.en index 332c964..97a1efb 100644 --- a/a/rules.en +++ b/a/rules.en @@ -4,10 +4,10 @@

  • Each round will consist of 4 algorithmic problems.
  • Your final score will be calculated by adding your scores for all the problems in the round.
  • After submitting a solution it will be evaluated on a few pretests and you will be able to see your result for that given test set. -
  • At the end of a round, the solution will be evaluated on a set of tests. If it doesn’t output the correct answer for all the tests or it exceeds our memory/time limit for at least one test, it will be scored with 0 points. -
  • Each problem will have a maximum score between 1000 and 100, depending on it’s difficulty. -
  • The maximum score you can obtain on a problem decreases as time passes after you’ve read it. +
  • At the end of a round, the solution will be evaluated on a set of tests. If it doesn't output the correct answer for all the tests or it exceeds our memory/time limit for at least one test, it will be scored with 0 points. +
  • Each problem will have a maximum score between 1000 and 100, depending on it's difficulty. +
  • The maximum score you can obtain on a problem decreases as time passes after you've read it.
  • In order to decide whether your solution is correct, only your last uploaded source file will be taken into consideration. -
  • If the contestant wishes to resend a solution for a problem, the problem’s maximum score will decrease by 10%. +
  • If the contestant wishes to resend a solution for a problem, the problem's maximum score will decrease by 10%.
  • Each problem will have a minimum score under which the score can not decrease, no matter how many solutions a contstant submits.