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.|

RGB7002 - Гурвалжин

Өгөгдсөн гурвалжны периметрийг ол.

Input

Гурвалжны талууд бүхэл тоогоор нэг мөрөнд зайгаар тусгаарлагдан өгөгдөнө.

Output

Гурвалжны периметр.

Example

Input:
3 4 5

Output:
12


Нэмсэн: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-02-29 02:18:51
Bat erdene t bagsh namaig ailgadag
2024-02-28 02:42:54
,

Last edit: 2024-02-28 02:53:24
2024-02-26 02:34:32
what is yaoi ???
2024-02-26 02:33:56
oaf uck
2024-02-26 02:29:56
ooh sigma
2024-02-21 09:30:21
10
2024-02-21 08:14:19
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;

for (int num = n; num > 1; num--) {
bool isPrime = true;
for (int i = 2; i < num; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
cout << num << " ";
}
}
cout << endl;
return 0;
}
2024-02-21 08:13:26
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;

for (int num = n; num > 1; num--) {
bool isPrime = true;
for (int i = 2; i < num; i++) {
if (num % i == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
cout << num << " ";
}
}
cout << endl;
return 0;
}
2024-02-21 08:04:55
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int i, j, n, z;
cin>>n;
for(j=n; j>1; j--){
for(i=2; i<j; i++){
if(j%i==0) break;
else cout<<j<<" ";

}


}
cout<<endl;
return 0;
}
2024-02-21 01:56:03
a=int(input("ehnii toog oruul:"))
b=int(input("ehnii toog oruul:"))
c=int(input("ehnii toog oruul:"))
if a>b and c<a:
print(a)
if a<b and c<b:
print(b)
if c>b and c>a:
print(c)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.