ENIGMA-0x01 (2023) - J0 (The fullest piggy bank)

View as PDF
Submit solution
Points: 10 (partial)
Time limit: 1.0s
Memory limit: 16M
Authors:
ENIGMA, vasiliki
Problem types
Allowed languages
Blockly, C, C++, Fortran, Java, JS, Pascal, Python
The fullest piggy bank

It's New Year's Eve. Totos and his sister Annoula, are getting ready to open their piggy banks. However, Totos has been a spendthrift all year round and Annoula managed to save more money than him. How much more money than Totos has Annoula collected throughout the year?

We want to write a program that reads from the STDIN input 2 positive integers A and T, separated by a line break character ('\n'), where A is the money that Annoula collected and T is the money that Totos collected.

The program will print STDOUT a positive integer N, the difference of Annoula's and Toto's savings.

Attention! Each line of input or output should end with the line change character '\n'.

Examples
1st

STDIN

73
39

STDOUT

34
2nd

STDIN

108
45

STDOUT

63

Comments


  • 0
    trompoukis_konstantinos  commented on Feb. 26, 2025, 5:29 p.m.

    Nsndndndnfnfnfnf


  • 0
    ROBOTONIO  commented on Dec. 13, 2024, 5:51 p.m.

    A = int(input()) T = int(input()) print(A - T)


  • 0
    ROBOTONIO  commented on Dec. 13, 2024, 5:47 p.m.

    a = int(input()) t = int(input()) print(a-t)


  • -1
    5odimotiko_agriniou  commented on Nov. 21, 2024, 10:56 a.m.

    afvghnjmk,l