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
2023-11-21 10:43:58
uilseelagAkXs.aternos.me:21088
2023-11-20 11:18:51
bayraabn0204.aternos.me:55502
2023-11-17 10:20:55
#include<iostream>
using namespace std;
int main(){
int a,b,c,d,e;
cin>>a>>b>>c>>d>>e;
cout<<a-(70*b)-(80*c)-(19*d)-(24*e);
}
2023-11-16 06:28:53
AMARTUVSHIN GUNSAN-YNJINTAI UERHDEG OMAYGADDDD
2023-11-15 12:40:03
#include<iostream>
using namespace std;
int main(){
int n,t,a,b,c,d,k=1;
cin>>a>>b>>c;
if (a==b){
k=0;
}
if (a==c){
k=0;
}
if (b==c){
k=0;
}
cout<<k;
}
2023-11-15 12:34:22
#include<iostream>
using namespace std;
int main () {
int a, n, m=0, t,e, b, x, c, d, i,shar, ulaan, nogoon, k;
cin>>a>>b>>c>>d;
cout<<min(min(a,b),min(c,d));
}
2023-11-15 12:17:01
#include <iostream>
using namespace std;

int main() {

int a,b,c;
cin>>a>>b>>c;
if(a>0 && b>0){
cout<<"I";
}
if(a>0 && b<0){
cout<<"IV";
}
if(a<0 && b<0){
cout<<"III";
}
if(a<0 && b>0){
cout<<"II";
}
return 0;
}
2023-11-15 12:14:07
#include<cmath>
#include<iostream>
using namespace std;
int main(){
int a,b,c,d,e,f,g,h,i;
cin>>a>>b>>c;
d=a*b*c;
e=sqrt(d);
f=e/a;
g=e/b;
h=e/c;
i=(f+g+h)*4;
cout<<i;
}
2023-11-15 11:14:30
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int a,b,c,k[1234],h,g,i;
for(i=0 ; i<6 ; i++){
cin>>k[i];
}
cout<<(k[1]+k[2]+k[0])*(k[1]+k[2]+k[0])-k[0]*k[0]-k[2]*k[2]-k[4]*k[4];
}
2023-11-15 10:24:28
#include <iostream>
using namespace std;
int main() {
long long i,r,k,s,l,a,b,c,d,e,n;
cin>>n;
if(n>499){
cout<<"YES";

}
else{
cout<<"NO";
}
return 0;
}
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.