Thursday, 28 February 2013

PROBLEM #8


Good Evening DCLites,

Today, we again have a source code problem for you. Given an executable file which do some task. You have develop the source code for it. But you can’t use the inbuilt functions like delay. However, you may create one if you can.

Click here to download : Problem 8

Wednesday, 27 February 2013

PROBLEM #7

Good Evening DCLites !

Today, Problem no. 7 carries a deal for you. There are 2 problems namely Problem 7a and Problem 7b. You can attempt any one of these. Each problem has different weight-age in terms of score.


Problem 7a: Write a code that accepts two integers as input and prints all the prime numbers between (and including) these two numbers.

1. Problem 7a carries 40 marks.

Sample:

Input:
2
12

Output:
2
3
5
7
11

OR

Problem 7b: Your input should be an array.And you have to output all the pairs (each pair comprising two numbers each) of numbers which are co-prime.

1. Problem 7b carries 60 marks.

Sample:

Input:
Array :{2,3,5,8,9} 

Output:
Possible Pairs are
2,3
2,5
2,9
3,5
3,8
5,8
5,9
8,9

Rules:
1.Only one submission will be considered.
2.Any participant with more than one submission will not gain any marks.

Tuesday, 26 February 2013

PROBLEM #6


Hello DCLites !

Here is your problem no. 6. This is a source code problem. Given an executable which accepts an input and produces an output based on some logic behind it. All you have to do is decode the logic and write the code. 

Click here to download : http://bit.ly/XdyFIP

Monday, 25 February 2013

Results: Phase #1


Congratulations ! Here is the list of top 30 contestants with their respective scores of Phase 1.




Contestants who are not listed here need not to be disheartened. As you can see score-cards show heavy variations even in a single day. With every correct solution you can earn up-to 60 points according to your solution's timing and efficiency. That means, all contestants have equal chances of winning this round. So make yourself fast and sharp to showcase your skills and try to solve the as many problems as possible. 

Important Information !


Hello DCLites !

This is to inform you all that today on February 25, 2013 no problem will be posted. Revive your mind and prepare yourself for tomorrow. 

We will come back to you within 2 hours with the result of first phase. Check In again at 11:00 PM to see your score. 





Sunday, 24 February 2013

PROBLEM #5


Good Evening DCLites ! Here we are on the refreshing Sunday. We hope you must have enjoyed the day and got yourself prepared for your next task.

After having hands on the pattern puzzles, its time to have some taste of strings again. Yeah, right we got a string problem for you this time.


Problem Statement :

You have to accept 2 strings. First string (String) must be 10 characters long and the second string (Sub-String) must be 5 characters long. Both the strings should contain a sequence of 0's and 1's.

You have to find whether the first string (String) contains the second string (Sub-String) or not. It should output 1, if first string (String) contains the second string (Sub-String) and 0 otherwise.

Sample :






Saturday, 23 February 2013

PROBLEM #4


Good Evening DCLites, its time for your next problem but without any digression from last night it is of the same type, yes its a pattern problem again. So, here is your problem.

Problem:

Following figures are displaying some of the sample outputs for sample inputs.

Some important points : 
1.Be careful regarding the odd number as input.
2.Outputs for small inputs like 3,5,7 may seem to be based on some different logic, but it is not so, all the figures are based on same logic. 

Sample:


Friday, 22 February 2013

PROBLEM #3


Do you recognize this logo




It is the default logo for windows 8 apps. And this is your NEXT TASK.

Don’t worry you need not develop a windows 8 app but you certainly have to prepare this logo and yes through coding.

Confused, let us elaborate, you have to print this pattern using symbol “*” and you have to take input a number to determine its size.


SAMPLE:

Thursday, 21 February 2013

Important Information !


It is to inform all the DCLites that first day of competition has been a success on both ours' as well as yours' part.

But, After evaluating the submissions of Problem No. 1, some major issues has come to our focus that we need to inform you.

Follow all the submission rules carefully before submitting your code.so have a look at the rules again.

  • Submission will not be accepted without DCL-ID. 
  • Please give Subject to your submission mail as DCL Problem no.<Problem no.> e.g. DCL Problem no. 1 
  • Late entries will not be accepted. 
  • Also provide your these details in the body of email: Your NAME and your DCL-ID. 
  • send your solutions as a zip(or rar) file to us, rar file should have name in this format, your "dclid_problem_number".For example: participant with dclid "DCLHS201" is sending its solution for "Problem 1" to us then rar file should have name in this format "DCLHS201_problem_1.rar". 
  • Early submission will attract more points. 
  • Multiple submissions are not allowed, only the first submission will be considered. 
  • Concise Source code will attract more points. 
  • Submit solutions to our email id : codingleague@gmail.com. 
  • For any queries contact us on our email-id : codingleague@gmail.com. 

Do-not send your source code as part of email body, any such submissions shall be directly rejected.

Do-not send your source code as a .doc file, any such submissions shall be directly rejected.

All the problem specific rules mentioned along the problem statement must be followed.

Two or more similar submissions from different DCLites are subject to be discarded. So, don't send any duplicate solutions.

We hope you all DCLites will follow these rules. So, Keep coding and Keep Happy and be ready for surprises.


With regards
Team Daviet Coding League (DCL)

PROBLEM #2


Here is your second problem DCLites.

Ever wondered about longest words in english(or any other long sequences) and about counting the number of distinct characters and frequency of those characters in that word or sequence?

Let us take example of this one of  the longest words in english

‘Pneumonoultramicroscopicsilicovolcanoconiosis’

Seems to be onerous task  to count the repititions of ‘a’,’o’,’c’ and etc. in this rubbbish lung disease ! But for your computer processors it is not so,so use it.


Problem Statement:

You have to take string or a number sequence or a combination of both  as input and have to output the frequency of diifferent characters or numbers in the input.



New Submission Rule:
1.Send your solutions as a zip(or rar) file to us.
Your rar file should have name in this format, "your dclid_problem_number".For example:
if participant with dclid 'DCLHS201' is sending its solution for 'Problem 2' to us then rar file should have name in this  format "DCLHS201_problem_2.rar".
2.Don't write your source code in the body of mail and don't send us your source code in .doc file.Source code files must be in their respective extensions.E.g : for a C++ file .cpp,C# file .cs and so  is for other languages.

Sample:

Information: Results Round #1


Hello DCLites !

Congratulations to all. Results of written test conducted on Feb. 20th, 2013 has been compiled and will be intimated after 3:00 pm. Check for your result on these following places:
  1. Information Corner
  2. Canteen
  3. Sai Refreshment
Results will be displayed according to DCL_IDs. if anyone has-not received their result contact us with your details on our email id: codingleague@gmail.com.


With Regards
Team Daviet Coding League (DCL)

Wednesday, 20 February 2013

PROBLEM #1



Have you ever seen your name in reverse order ? If no,then its time to do it with your name and others’ also.

But if your name is having more than 15 alphabets then sorry you can’t do it..........hahahahahah ...don’t worry ,name doesn’t matter guys.

So here is your problem statement : -
You have to take input in the form of string not longer than 15 alphabets and output should be a string written in reverse order. 

Rules:
1.Don’t use inbuilt functions for string reversal and string length calculation.
2.More earlier and harder you code the problem,more points you will gain.
3.Follow all the submission rules strictly.

Sample:


Submission Rules


  1. Submission will not be accepted without registration no.
  2. Please give Subject to your submission mail as DCL Problem no.<Problem no.> e.g. DCL     Problem no. 1.
  3. Late entries will not be accepted.
  4. Also provide your these details in the body of email: Your NAME and your DCL-ID.
  5. Please submit your source code i.e.  .cpp , .java, .c, or .cs file as the attachment
  6. Early submission will attract more points.
  7. Multiple submissions are not allowed, only the first submission will be considered.
  8. Concise Source code will attract more points.
  9. Submit solutions to our email id : codingleague@gmail.com.
  10. For any queries contact us on our email-id : codingleague@gmail.com.



Information Round #1



Written test conducted successfully, congratulation to all participants ....

Tuesday, 19 February 2013

About Us


-- aDAVitya --

DAV Institute Of Engineering & Technology, Jalandhar



Description:

For the first time DAVIET will be the proud host of  one-of-its-kind coding competition. Put your coding skills to a nail-biting test that will gratify your expertise. This competition will be spanned over the whole tech-fest. With a new coding challenge for a new day. The conqueror will be proudly entitled as the first aDAVitya CODING CHAMP ever.

Round 1:

Round 1st will be conducted on 20 February 2013. This will be a written test based on programming language C++. Students have to get themselves register till 19th. There will be no elimination in this round. But students have to appear in this test if they want to be eligible for next round.

Round 2:

Round 2 will start from 20th February 2013 and will end on 5th March 2013. This will be an online round. Every day one programming question will be posted on our Blog codingleague.blogspot.in. Selected candidates from Round 1 will be only eligible for this series.

Procedure:

  • Question will be posted on mentioned places at 9:00 pm daily.
  • Answers have to be submitted on our email-id codingleague@gmail.com before the 9:00 am next day.
  • At the end of each subsequent week a list of ranks of all contestants will be posted on mentioned places.
  • On 5th March 2013, final list will be published.
  • Top 5 contestants will go for finals on 8th March 2013 on college campus with 5 other contestants selected via Round 3 (open round for all).
  • Round 2 is open for 1st,2nd year.
  • Only first submission of each contestant will be considered so be careful with submissions.

Round 3: Open Round for All Students with Valid ID cards.

  • Each participant has to download an EXE file from Tech-Fest website and our blog codingleague.blogspot.com, which will be available on the website at 6 p.m. on-wards on 6th March 2013.
  • There are 9 aptitude/general questions. Answer to each question is the key to corresponding locked programming question.
  • Enter the key and get your question. Questions are of 3 types:

    1.      Statement type programming questions
    2.      Source Code programming questions
    3.      Puzzle and Pattern based programming questions.

  • Contestants have to submit their answers (Text & Executable file) till 6 p.m. next day on our email-id codingleague@gmail.com.
  • Top 5 contestants will be selected and have to appear for finals in college campus at 8th March 2013 with Top 5 contestants of  Round 2.


Round 4: (Finals)

  • 10 selected contestants will face the final battle at college campus.
  • This will be a 2 hours challenge.
  • 5 questions will be given and students have to solve the maximum within the stipulated time.
  • Students have to put their answers in a folder with their registration id and save on the same system.
  • Results will be communicated to them via email.



        Winner will be entitled as "aDAVitya Coding Champ"