URI Online Judge | 1018 Banknotes Solve with source code

-
URI Online Judge | 1018
Banknotes
Adapted by Neilor Tonin, URI  Brazil

Timelimit: 1
In this problem you have to read an integer value and calculate the smallest possible number of banknotes in which the value may be decomposed. The possible banknotes are 100, 50, 20, 10, 5, 2 e 1. Print the read value and the list of banknotes.

Input
The input file contains an integer value N (0 < N < 1000000).

Output
Print the read number and the minimum quantity of each necessary banknotes in Portuguese language, as the given example. Do not forget to print the end of line after each line, otherwise you will receive “Presentation Error”.


SOLVE

                      num = int(input())
                      print(num)
                      print('%d'%(num/100),'nota(s) de R$ 100,00')
                      num%=100
                      print('%d'%(num/50),'nota(s) de R$ 50,00')
                      num%=50
                      print('%d'%(num/20),'nota(s) de R$ 20,00')
                      num%=20
                      print('%d'%(num/10),'nota(s) de R$ 10,00')
                      num%=10
                      print('%d'%(num/5),'nota(s) de R$ 5,00')
                      num%=5
                      print('%d'%(num/2),'nota(s) de R$ 2,00')
                      num%=2
                      print('%d'%(num/1),'nota(s) de R$ 1,00')





Comments

Post a Comment

Popular posts from this blog

How to solve an 8 puzzle problem using A* Algorithm in python

-
Two heuristics for an  8 puzzle problem   GoalNode=[[7,2,4],[5,0,6],[8,3,1]] StartNode=[[0,1,2],[3,4,5],[6,7,8]] temp = [] h1 = -1 h2 = 0 print("Given StartNode is: ",StartNode) print("\n\n\t Given GoalNode is: ",GoalNode) print("\n\n######################################") for i in range(len(StartNode)):     for j in range (len(StartNode)):         if StartNode[i][j] != GoalNode[i][j]:             h1+=1 print("\n\n\t h1 : Number of misplaced tiles =>",h1) print("\n\n######################################") print("\n\nDistances of the tiles from their goal positions are: \n") for i in range(len(StartNode)):     for j in range (len(StartNode)):         if (StartNode[i][j]==0):             pass         else:             if (GoalNode[0][0] == StartNode[i][j]):                 temp.append(abs(i-0) + abs(j-0))                 print("\t",temp)  
Read more

Timus Online Judge 1000. A+B Problem question and SOLVE with sudo code

-
                                  1000. A+B Problem                                                                   Time limit: 1.0 second                                                                    Memory limit: 64 MB Calculate a + b Input a and b Output a+b   Sample input output 1 5 6                                                                           SOLVE #include <stdio.h> int main(void) {     // your code goes here     int a,b;         scanf("%d %d",&a,&b);         printf("%d",a+b);         return 0; }
Read more

URI Online Judge | 1013 The Greatest Solve with source code

-
Image
URI Online Judge | 1013 The Greatest Adapted by Neilor Tonin, URI  Brazil Timelimit: 1 Make a program that reads 3 integer values and present the greatest one followed by the message "eh o maior". Use the following formula: Input The input file contains 3 integer values. Output Print the greatest of these three values followed by a space and the message “eh o maior”. SOLVE                     A,B,S = input().split()                      A = int(A)                      B = int(B)                      S =int(S)                      P=max(A,B,S)                      print(P,"eh o maior")
Read more