URI Problem 2344 Solution Tasting Notes - URI Online Judge Solution

URI Online Judge Solution 2344 Tasting Notes Using Python Programming Language.

Rosy is a talented high school teacher who has won many awards for the quality of her class. Her recognition was such that she was invited to teach at a school in England. Even speaking English well, Rosy was a little apprehensive about the responsibility, but decided to accept the proposal and face it as a good challenge.

Everything went well for Rosy until the day of the race. Accustomed to giving grades from 0 (zero) to 100 (one hundred), she did the same in the first test of students from England. However, the students found it strange, because in England the rating system is different: grades should be given as concepts from A to E. Concept A is the highest, while concept E is the lowest.

Talking to other teachers, she received the suggestion to use the following table, relating the numeric notes to the concept notes:

The problem is that Rosy has already given the notes in the numerical system, and will have to convert the notes to the letter system. However, Rosy needs to prepare the next classes (to maintain the quality that made her recognized), and she does not have enough time to manually convert the grades.

You must write a program that receives a score in the numerical system and determines the corresponding concept.

Input

The input contains a single set of tests, which must be read from the standard input device (usually the keyboard). The entry contains a single line with an integer N (0 ≤ N ≤ 100), representing a test note in the numerical system.

Output

Your program should print, in standard output, a letter (A, B, C, D, or E in uppercase) representing the concept corresponding to the note given in the entry.

Entry Examples	Output Examples
12	D

87	A

0	E

URI 2344 Solution Using Python:


A = int(input())
if A == 0:
    print("E")
elif A>=1 and A<=35:
    print("D")
elif A>=36 and A<=60:
    print("C")
elif A>=61 and A<=85:
    print("B")
elif A>=86 and A<=100:
    print("A")

Comments

URI Problem 1001 Solution Extremely Basic - - URI Online Judge Solution

URI Online Judge Problem 1001 Extremely Basic Solution using C, Python Programming Language. Read 2 variables, named A and B and make the sum of these two variables, assigning its result to the variable X . Print X as shown below. Print endline after the result otherwise you will get “ Presentation Error ”. Input The input file will contain 2 integer numbers. Output Print the letter X (uppercase) with a blank space before and after the equal signal followed by the value of X, according to the following example. Obs.: don't forget the endline after all. Samples Input Samples Output 10 9 X = 19 -10 4 X = -6 15 -7 X = 8 URI 1001 Solution in Python A = int(input()) B = int(input()) X = A + B print("X =",X); URI 1001 Solution in C: #include int main() { int A,B,X; scanf ("%d %d", &A, &B); X=A+B; printf("X = %d\n",X); return 0; }

URI Online Judge Solution 1151 Easy Fibonacci

URI Online Judge Solution 1151 Easy Fibonacci using C Programming Language. he following sequence of numbers 0 1 1 2 3 5 8 13 21 ... is known as the Fibonacci Sequence. Thereafter, each number after the first 2 is equal to the sum of the previous two numbers. Write an algorithm that reads an integer N (N < 46) and that print the first N numbers of this sequence. Input The input file contains an integer number N (0 < N < 46). Output The numbers should be printed on the same line, separated by a blank space. There is no space after the last number. Thanks to Cássio F. Input Sample Output Sample 5 0 1 1 2 3 Solution using C : #include <stdio.h> int main() { int n,i,n1,n2,t; scanf("%d",&n); for(i=1; i<=n; i++) { if(i==1) { ...

URI Online Judge Solution 1069 Diamonds and Sand

URI Online Judge Solution 1069 Diamonds and Sand using Python Programming Language. John is working in a diamond mine, trying to extract the highest number of diamond "<>". He must exclude all sand particles found "." in this process and after a diamond can be extracted, new diamonds can be formed. If he has as an input. <... << .. >> ....> .... >>>. three diamonds are formed. The first is taken from <..> resulting. <... <> ....> .... >>>. The second diamond is then removed, leaving. <.......> .... >>>. The third diamond is then removed, leaving at the end ..... >>>. without the possibility of extracting new diamonds. Input Read an integer N that is the number of test cases. Then follows N lines each up to 1000 characters, including "<" ,">" and "." Output You must print the amount of diamonds that can be extrated in each test ca...

URI Online Judge Solution

Search This Blog