SPOJ.com - Problem RGB7001

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

Submit solution!

Нэмсэн:	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-10-22 03:11:15
#include <iostream>
#include <iomanip> // for std::setprecision
using namespace std;

int main() {
double sideLength;
cin >> sideLength; // Input square side length

// Calculate area
double area = sideLength * sideLength;

// Output area with 3 decimal places
cout << fixed << setprecision(3) << area << endl;

return 0;
}

2024-10-22 03:08:59
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

void printDivisors(int n) {
vector<int> divisors;

for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
divisors.push_back(i); // i is a divisor
if (i != n / i) {
divisors.push_back(n / i); // n/i is also a divisor
}
}
}

// Sort divisors in ascending order
sort(divisors.begin(), divisors.end());

// Print divisors
for (size_t i = 0; i < divisors.size(); ++i) {
cout << divisors[i];
if (i < divisors.size() - 1) {
cout << " "; // Print space between numbers
}
}
cout << endl;
}

int main() {
int n;
cin >> n; // Input number
printDivisors(n); // Call the function
return 0;
}

2024-10-22 03:06:01
#include <iostream>

using namespace std;

int main() {
long long n;
cin >> n;

// Хавтгайг хуваах хамгийн их хэсгийн тоо
long long result = (n * (n + 1)) / 2 + 1;

cout << result << endl;

return 0;
}

2024-10-15 11:33:59
#include <stdio.h>

int main(void) {
int a ,b,c,e,f;
scanf ("%d %d %d",&a,&b,&c);
if (a%2==0){
e+=a;
}else {
e+=0;
}
if (b%2==0){
e+=b;
}else {
e+=0;
}
if (c%2==0){
e+=c;
}else {
e+=0;
}

printf("%d",e);
return 0;
}

7

2024-10-14 06:15:51
Code bichdeg naiztai boln
IG: ratitulation8
Holbogdooroi

2024-10-02 05:20:49
⣿⣿⣿⣿⣿⣿⣿⡇⡌⡰⢃⡿⡡⠟⣠⢹⡏⣦⢸⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡿⢰⠋⡿⢋⣐⡈⣽⠟⢀⢻⢸⡂⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣋⠴⢋⡘⢰⣄⣀⣅⣡⠌⠛⠆⣿⡄⣿⣿⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣶⣁⣐⠄⠹⣟⠯⢿⣷⠾⠁⠥⠃⣹⣿⣿⣿⣿⣿
⣿⣿⣿⣿⠟⠋⡍⢴⣶⣶⣶⣤⣭⡐⢶⣾⣿⣶⡆⢨⠛⠻⣿⣿⣿
⣿⣿⣿⢏⣘⣚⣣⣾⣿⣿⣿⣿⣿⣿⢈⣿⣿⣿⣧⣘⠶⢂⠹⣿⣿
⣿⣿⠃⣾⣿⣿⣿⣿⣿⣿⡿⠿⠿⠿⡀⢿⣿⣿⣿⣿⣿⣿⡇⣿⣿
⣿⣿⡄⣿⣿⣿⣿⣿⣿⡯⠄⠄⠾⠿⠿⢦⣝⠻⣿⣿⣿⣿⠇⣿⣿
⣿⣿⣷⣜⠿⢿⣿⡿⠟⣴⣾⣿⡇⢰⣾⣦⡹⣷⣮⡙⢟⣩⣾⣿⣿
⣿⣿⣿⣿⣿⣆⢶⣶⣦⢻⣿⣿⣷⢸⣿⣿⣷⣌⠻⡷⣺⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⡜⢿⣿⡎⢿⣿⣿⡬⣿⣿⣿⡏⢦⣔⠻⣿⣿⣿⣿
⣿⣿⣿⣿⣿⣿⣿⠎⠻⣷⡈⢿⣿⡇⢛⣻⣿⣿⢸⣿⣷⠌⡛⢿⣿
⣿⣿⣿⣿⣿⣿⡏⢰⣷⡙⢷⣌⢻⣿⣿⣿⣿⣿⢸⡿⢡⣾⣿⡶⠻
⣿⣿⣿⣿⣿⡟⣰⣶⣭⣙⠊⣿⣷⣬⣛⠻⣿⣿⠈⣴⣿⣿⣿⠃⠄
⣿⣿⣿⣿⡟⠄⠹⢿⣿⣿⣿⣤⠻⠟⠋⠡⠘⠋⢸⣿⣿⡿⠁⠄⠄
⣿⣿⣿⣿⠁⠄⠄⠄⠙⢻⣿⣿⣇⠄⠄⠄⠄⠄⣺⡿⠛⠄⠄⠄⠄
⣿⣿⣿⡏⠄⠄⠄⠄⠄⠄⠄⠉⠻⠷⠄⢠⣄⠄⠋⠄⠄⠄⠄⠄⠄
⣿⣿⣿⣿⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠄⠸⣿⠄⠄⠄⠄⠄⠄⠄⠄

2024-09-13 02:48:36
nahhh

2024-09-13 02:45:14
#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-06-12 04:07:32
aaaaa

2024-05-22 10:16:15
Anand why are you smelling davaa's gyatt

Last edit: 2024-05-22 10:16:51

АЛГОРИТМЫН ЦАГААН ТОЛГОЙ

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

Input

Output

Example