Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

RGB7001 - 2 тооны нийлбэр

Өгөгдсөн бүхэл тооны нийлбэрийг ол.

Input

2 бүхэл тоо зайгаар тусгаарлагдан нэг мөрөнд өгөгдөнө.

Output

2 тооны нийлбэр.

Example

Input:
12 23

Output:
35

Нэмсэн:Bataa
Огноо:2011-01-15
Хугацааны хязгаарлалт:1s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:ADA95 ASM32 BASH BF C NCSHARP CSHARP C++ 4.3.2 CPP C99 CLPS LISP sbcl LISP clisp D ERL FORTRAN HASK ICON ICK JAVA JS-RHINO JULIA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON PYPY3 PYTHON3 RUBY SCALA SCM guile ST TCL WHITESPACE

hide comments
2024-12-17 04:42:26
CREATE TABLE movies (
id INT PRIMARY KEY,
movie_title VARCHAR(255),
imdb_rating DECIMAL(3,1),
year_released INT,
budget DECIMAL(10,2),
box_office DECIMAL(10,2),
distribution_company_id INT,
language VARCHAR(255)
);

INSERT INTO movies (id, movie_title, imdb_rating, year_released, budget, box_office, distribution_company_id, language)
VALUES
(1, 'The Shawshank Redemption', 9.2, 1994, 25.00, 73.30, 1, 'English'),
(2, 'The Godfather', 9.2, 1972, 7.20, 291.00, 2, 'English'),
(3, 'The Dark Knight', 9.0, 2008, 185.00, 1006.00, 3, 'English'),
(4, 'The Godfather Part II', 9.0, 1974, 13.00, 93.00, 2, 'English, Sicilian'),
(5, '12 Angry Men', 9.0, 1957, 0.34, 2.00, 4, 'English'),
(6, 'Schindler\'s List', 8.9, 1993, 22.00, 322.20, 5, 'English, German, Yiddish'),
(7, 'The Lord of the Rings: The Return of the King', 8.9, 2003, 94.00, 1146.00, 6, 'English'),
(8, 'Pulp Fiction', 8.8, 1994, 8.50, 213.90, 7, 'English'),
(9, 'The Lord of the Rings: The Fellowship of the Ring', 8.8, 2001, 93.00, 898.20, 6, 'English'),
(10, 'The Good, the Bad and the Ugly', 8.8, 1966, 1.20, 38.90, 8, 'English, Italian, Spanish');

CREATE TABLE distribution_companies (
id INT PRIMARY KEY,
company_name VARCHAR(255)
);

INSERT INTO distribution_companies (id, company_name)
VALUES
(1, 'Columbia Pictures'),
(2, 'Paramount Pictures'),
(3, 'Warner Bros. Pictures'),
(4, 'United Artists'),
(5, 'Universal Pictures'),
(6, 'New Line Cinema'),
(7, 'Miramax Films'),
(8, 'Produzioni Europee Associate'),
(9, 'Buena Vista'),
(10, 'StudioCanal');
2024-12-10 02:02:16
int main() {

int a, b;

int perimeter;
cin>>a>>b;

perimeter=a+b;

cout<<perimeter;

return 0;
}
2024-12-07 13:40:59
#include <iostream>
#include <set>
#include <utility>
using namespace std;

int dx[8] = {0, 0, -1, 1, -1, -1, 1, 1}; // Array for possible x-direction movements
int dy[8] = {-1, 1, 0, 0, -1, 1, -1, 1}; // Array for possible y-direction movements

int main() {
int N, K;
cin >> N >> K; // Input for the size of the board and number of obstacles

pair<int, int> queen;
cin >> queen.first >> queen.second; // Input for queen's position

set<pair<int, int>> obstacles; // Set to hold the obstacles' positions
for (int i = 0; i < K; i++) {
int r, c;
cin >> r >> c; // Input for obstacles' positions
obstacles.insert(make_pair(r, c)); // Insert the obstacles into the set
}

int result = 0, step = 1;
bool direction[8]; // Track active directions
for (int i = 0; i < 8; i++) direction[i] = true; // Initialize all directions as active
int direction_count = 8; // Total directions

while (direction_count > 0) {
for (int i = 0; i < 8; i++) {
if (direction[i]) {
int newR = queen.first + dx[i] * step; // Calculate new row
int newC = queen.second + dy[i] * step; // Calculate new column
if (newR < 1 || newR > N || newC < 1 || newC > N || obstacles.count(make_pair(newR, newC)) > 0) {
direction[i] = false; // Disable direction if out of bounds or hits an obstacle
direction_count--; // Decrease direction count
continue; // Go to the next direction
}
result++; // Count valid moves
}
}
step++; // Move to the next step distance
}

cout << result << endl; // Output the result
}
2024-12-04 11:24:39
#include <iostream>
using namespace std;

int main ()
{ int a, b;
scanf("%d%d",&a,&b);
printf("%d",a+b);
return 0;
}
2024-11-28 08:03:45
I'm going back to 505
If it's a seven hour flight or a forty-five minute drive
In my imagination, you're waitin' lyin' on your side
With your hands between your thighs
Stop and wait a sec
When you look at me like that, my darlin', what did you expect?
I'd probably still adore you with your hands around my neck
Or I did last time I checked
Not shy of a spark
The knife twists at the thought that I should fall short of the mark
Frightened by the bite, though it's no harsher than the bark
The middle of adventure, such a perfect place to start
I'm going back to 505
If it's a seven hour flight or a forty-five minute drive
In my imagination, you're waitin' lyin' on your side
With your hands between your thighs
But I crumble completely when you cry
It seems like once again you've had to greet me with goodbye
I'm always just about to go and spoil the surprise
Take my hands off of your eyes too soon
I'm going back to 505
If it's a seven hour flight or a forty-five minute drive
In my imagination, you're waitin' lyin' on your side
With your hands between your thighs and a smile
2024-11-21 16:20:41
//you guys using algorithm, here its very simple
#include <iostream>
using namespace std;

int main() {

int a, b;
cin >> a >> b;
cout << a+b;
return 0
}

Last edit: 2024-11-21 16:21:43
2024-11-21 04:18:43
#include <iostream>
#include <sstream>
#include <string>
#include <cstdlib>
#include <cmath>

using namespace std;

// Headers
string toString (double);
int toInt (string);
double toDouble (string);

int main() {
int a, b;

cin >> a;
cin >> b;
cout << a + b << endl;
return 0;
}

// The following implements type conversion functions.
string toString (double value) { //int also
stringstream temp;
temp << value;
return temp.str();
}

int toInt (string text) {
return atoi(text.c_str());
}

double toDouble (string text) {
return atof(text.c_str());
}
2024-11-13 06:38:09
▬▬ι═══════ﺤ
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⡤⠶⠦⢤⣀⠀⠀⠀⣼⣿⣧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⠟⠁⠀⠀⢀⡴⠾⢷⡤⣾⠟⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⣃⣀⣀⣀⣴⣿⡿⣷⣿⣧⠙⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣤⣦⣀⠀⠀⣿⣿⣿⣿⣿⠋⠉⠓⠛⡋⠁⠀⠈⢦⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠻⠿⠛⠛⢿⣿⠿⠾⢝⣧⣀⣀⣠⠶⠛⠓⢒⠶⡎⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣀⣴⡿⡿⠛⠋⠙⠀⣀⢴⡟⠀⠀⠘⠦⢄⣀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⡉⣿⣧⣠⣤⡴⢶⣫⣷⡟⠀⠀⠀⠀⠀⠀⠙⣿⣷⣶⣿⣧⢠⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣠⣤⣄⣼⣟⠙⢻⣟⣛⠿⠛⣛⡩⠔⠁⠀⠀⢀⡖⠀⢀⣾⣿⣿⣿⣿⠀⠈⠑⠦⡀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢀⣰⣿⣿⣿⡿⢻⣦⡀⠉⣉⠉⠉⠉⠀⠀⠀⠀⢀⠞⠁⣠⣾⣿⣿⣿⣿⣿⡄⠀⠀⠀⠈⠢⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⣠⠋⣿⣿⣿⣿⣿⣤⡙⠻⣦⣄⡀⠠⣤⡀⠀⣠⡴⣯⡴⣻⣿⣿⣿⢿⣿⣿⣿⡇⠀⠀⠀⠀⠀⠈⠢⡀⠀⠀⠀⠀
⠀⠀⠀⠀⣸⠃⣰⣿⣿⣿⣿⣿⣿⣟⣷⣤⣍⣿⣷⣾⡿⠟⠹⣚⣩⣾⣿⣿⣿⣿⣿⣿⣿⣿⢳⡄⠈⢲⡀⠀⠀⠀⠈⢦⠀⠀⠀
⠀⠀⠀⣼⡧⣴⡟⢿⣿⣿⣿⣿⣿⣿⣿⣥⣀⠀⠀⣀⣠⣴⣿⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠻⣆⠈⢿⡄⠀⠀⠀⠀⠣⡀⠀
⠀⠀⣾⢟⢘⣿⠀⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⡏⠉⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡷⣿⣦⣿⣿⣴⡦⠂⠀⠀⢱⠀
⠀⣼⡟⠈⠸⡿⢠⣾⣿⣿⣿⣿⣿⣿⣿⡿⠉⠀⠗⠉⠀⠘⣿⣷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⡈⢻⣿⡿⠋⠀⠀⠀⠀⠘⡆
⢸⡏⣠⠠⠶⠇⣾⣿⣿⣿⣿⣿⣿⣿⠟⠃⠀⠀⠀⠀⠀⠀⠉⠉⠁⠈⠉⠀⠀⠈⠉⠉⠉⠛⠻⠿⠃⣿⣿⡅⠀⠀⠀⠀⠀⢰⠇
⣿⡿⠡⠀⠀⠀⠙⣿⠉⣏⠉⠬⠛⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢀⣿⠇⠀⠀⠀⠀⠀⠀⡸⠀
⢹⣷⢐⠀⠀⠀⠀⠹⣇⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣸⡏⡀⠀⠀⠀⠀⠀⡸⠁⠀
⠀⢹⣿⣰⡀⠀⠀⠀⣿⠙⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣄⣈⡀⠀⠀⠀⢰⠃⠀⠀
⠀⠀⠹⣿⣷⢠⡄⠠⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⣟⠉⠙⠻⠷⢶⡦⡞⠀⠀⠀
⠀⠀⠀⠘⢿⣾⣧⣳⡿⣧⠀⠀⠘⢷⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣤⣾⢿⡟⠀⠀⠀⠀⠀⠁⣧⠀⠀⠀
⠀⠀⠀⠀⠀⠙⢿⣿⣿⣿⢿⣦⡀⠀⠙⠻⠧⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⢀⣀⣤⣶⣿⠿⠋⠁⢀⣯⣤⣄⣀⣀⣀⣴⡿⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠙⠿⣿⡇⠹⢿⣿⣶⣤⣤⣿⣿⣶⣶⣶⣶⣤⣶⣶⣿⣿⠿⠟⠋⠀⠀⠀⠀⢸⠀⠉⠉⠀⠉⠁⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⡤⠀⠀⠈⠙⠛⢻⣿⣿⠿⠿⠿⠿⠟⠛⠋⠉⠀⠀⠀⠀⠀⠀⠀⠀⣸⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣸⣿⡀⣌⣷⣀⠀⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢘⣻⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣷⣤⣀⠙⠂⢦⣤⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣀⣤⡤⢶⠞⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢺⣿⠙⢻⣿⣶⣤⠤⠭⣇⣀⣠⣀⣀⣀⣤⢤⣶⣶⣿⢋⠁⠀⢰⡾⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣷⣠⡟⣿⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠨⢿⣿⣿⣇⠀⠀⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣎⠹⣟⠺⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⡇⢰⠉⢣⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⢹⠃⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣇⣼⣧⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⣿⡆⣉⣴⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣿⣿⣿⡿⠀⣿⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢄⣠⣿⡧⠻⣿⡃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⣿⣿⣷⣖⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣩⣿⣿⣦⣶⣤⣿⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢴⣿⣿⣿⣯⣿⣿⠟⠆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣀⣴⣾⣿⣿⣿⣿⣿⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣿⣿⣿⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⣴⡾⡿⠟⠿⢻⣿⣿⣿⣿⣿⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣾⣿⣿⣿⣿⣿⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠉⠛⠓⠒⠛⠛⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣄⣉⣙⣛⣻⣛⣿⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠉⠉⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
2024-11-13 06:37:26
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
▬▬ι═══════ﺤ
2024-11-11 01:56:27
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⡤⠶⠦⢤⣀⠀⠀⠀⣼⣿⣧⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⠟⠁⠀⠀⢀⡴⠾⢷⡤⣾⠟⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⣃⣀⣀⣀⣴⣿⡿⣷⣿⣧⠙⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣤⣦⣀⠀⠀⣿⣿⣿⣿⣿⠋⠉⠓⠛⡋⠁⠀⠈⢦⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠻⠿⠛⠛⢿⣿⠿⠾⢝⣧⣀⣀⣠⠶⠛⠓⢒⠶⡎⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣀⣴⡿⡿⠛⠋⠙⠀⣀⢴⡟⠀⠀⠘⠦⢄⣀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⡉⣿⣧⣠⣤⡴⢶⣫⣷⡟⠀⠀⠀⠀⠀⠀⠙⣿⣷⣶⣿⣧⢠⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣠⣤⣄⣼⣟⠙⢻⣟⣛⠿⠛⣛⡩⠔⠁⠀⠀⢀⡖⠀⢀⣾⣿⣿⣿⣿⠀⠈⠑⠦⡀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢀⣰⣿⣿⣿⡿⢻⣦⡀⠉⣉⠉⠉⠉⠀⠀⠀⠀⢀⠞⠁⣠⣾⣿⣿⣿⣿⣿⡄⠀⠀⠀⠈⠢⡀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⣠⠋⣿⣿⣿⣿⣿⣤⡙⠻⣦⣄⡀⠠⣤⡀⠀⣠⡴⣯⡴⣻⣿⣿⣿⢿⣿⣿⣿⡇⠀⠀⠀⠀⠀⠈⠢⡀⠀⠀⠀⠀
⠀⠀⠀⠀⣸⠃⣰⣿⣿⣿⣿⣿⣿⣟⣷⣤⣍⣿⣷⣾⡿⠟⠹⣚⣩⣾⣿⣿⣿⣿⣿⣿⣿⣿⢳⡄⠈⢲⡀⠀⠀⠀⠈⢦⠀⠀⠀
⠀⠀⠀⣼⡧⣴⡟⢿⣿⣿⣿⣿⣿⣿⣿⣥⣀⠀⠀⣀⣠⣴⣿⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣇⠻⣆⠈⢿⡄⠀⠀⠀⠀⠣⡀⠀
⠀⠀⣾⢟⢘⣿⠀⢸⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⡏⠉⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡷⣿⣦⣿⣿⣴⡦⠂⠀⠀⢱⠀
⠀⣼⡟⠈⠸⡿⢠⣾⣿⣿⣿⣿⣿⣿⣿⡿⠉⠀⠗⠉⠀⠘⣿⣷⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⡈⢻⣿⡿⠋⠀⠀⠀⠀⠘⡆
⢸⡏⣠⠠⠶⠇⣾⣿⣿⣿⣿⣿⣿⣿⠟⠃⠀⠀⠀⠀⠀⠀⠉⠉⠁⠈⠉⠀⠀⠈⠉⠉⠉⠛⠻⠿⠃⣿⣿⡅⠀⠀⠀⠀⠀⢰⠇
⣿⡿⠡⠀⠀⠀⠙⣿⠉⣏⠉⠬⠛⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢀⣿⠇⠀⠀⠀⠀⠀⠀⡸⠀
⢹⣷⢐⠀⠀⠀⠀⠹⣇⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣸⡏⡀⠀⠀⠀⠀⠀⡸⠁⠀
⠀⢹⣿⣰⡀⠀⠀⠀⣿⠙⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣄⣈⡀⠀⠀⠀⢰⠃⠀⠀
⠀⠀⠹⣿⣷⢠⡄⠠⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⣟⠉⠙⠻⠷⢶⡦⡞⠀⠀⠀
⠀⠀⠀⠘⢿⣾⣧⣳⡿⣧⠀⠀⠘⢷⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣤⣾⢿⡟⠀⠀⠀⠀⠀⠁⣧⠀⠀⠀
⠀⠀⠀⠀⠀⠙⢿⣿⣿⣿⢿⣦⡀⠀⠙⠻⠧⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⢀⣀⣤⣶⣿⠿⠋⠁⢀⣯⣤⣄⣀⣀⣀⣴⡿⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠙⠿⣿⡇⠹⢿⣿⣶⣤⣤⣿⣿⣶⣶⣶⣶⣤⣶⣶⣿⣿⠿⠟⠋⠀⠀⠀⠀⢸⠀⠉⠉⠀⠉⠁⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⡤⠀⠀⠈⠙⠛⢻⣿⣿⠿⠿⠿⠿⠟⠛⠋⠉⠀⠀⠀⠀⠀⠀⠀⠀⣸⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣸⣿⡀⣌⣷⣀⠀⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢘⣻⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣷⣤⣀⠙⠂⢦⣤⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣀⣤⡤⢶⠞⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢺⣿⠙⢻⣿⣶⣤⠤⠭⣇⣀⣠⣀⣀⣀⣤⢤⣶⣶⣿⢋⠁⠀⢰⡾⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣷⣠⡟⣿⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠨⢿⣿⣿⣇⠀⠀⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣎⠹⣟⠺⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⡇⢰⠉⢣⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⢹⠃⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣇⣼⣧⣿⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⣿⡆⣉⣴⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⣿⣿⣿⡿⠀⣿⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⢄⣠⣿⡧⠻⣿⡃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⣿⣿⣷⣖⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣩⣿⣿⣦⣶⣤⣿⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢴⣿⣿⣿⣯⣿⣿⠟⠆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣀⣴⣾⣿⣿⣿⣿⣿⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣿⣿⣿⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⢀⣴⡾⡿⠟⠿⢻⣿⣿⣿⣿⣿⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣾⣿⣿⣿⣿⣿⣿⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠉⠛⠓⠒⠛⠛⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣿⣄⣉⣙⣛⣻⣛⣿⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠉⠉⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀

Last edit: 2024-11-11 01:59:42
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.