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-08-15 18:08:20
#include <iostream>
using namespace std;

int main() {

long long a,b,c,i,t;
cin>>t;
for(i=0;i<t;i=i+1){
cin>>a>>b>>c;
if((a>=b && c%2==1)||(a>b))
cout<<"First"<<endl;
else
cout<<"Second"<<endl;
}

return 0;
}

2023-08-14 07:02:26
#include<bits/stdc++.h>
using namespace std;
int main(){
int a[10000],b,c,d,e,f,g,h,i,j,x,y,k,z,t=0,s=0,n;
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i];
if(a[i]==1){
cout<<3<<endl;
}
if(a[i]==2){
cout<<2<<endl;
}
if(a[i]>2&&a[i]%2==1){
cout<<1<<endl;
}
if(a[i]>2&&a[i]%2==0){
cout<<0<<endl;
}


}
return 0;
}
Judged Example Tests
2023-06-15 12:48:13
java code
import java.util.*;

public class Main {

public static void main(String[] args) {

Scanner scanner=new Scanner(System.in);
int a=scanner.nextInt();
int b=scanner.nextInt();
int c=scanner.nextInt();
System.out.println(a+b+c);
}
}


Last edit: 2023-06-15 12:48:40
2023-06-15 12:23:17
public class Main {
public static void main(String[] args) {
int buf,byter,core,result;
buf=3; byter=4;core=5;
result = buf+byter+core;
System.out.println(result);
}
}
2023-05-23 14:08:56
|Notes:|
1. Don't post any source code here.|
2. Please be careful, leave short comments only. Don't spam here.|
3. For more discussion (hints, ideas, solutions) please visit our forum.|
4. Authors are allowed to delete the post and use html code here (e.g. to provide some useful links).|

2023-05-15 08:08:27
.. -- / - .. .-. . -..
2023-05-15 03:02:18
zest fest in here bruh
2023-05-15 02:56:16
ogay

Last edit: 2023-05-15 03:04:23
2023-05-10 09:51:48
2023-03-24 02:52:14
#include <iostream>

using namespace std;

int main()
{
int a[1000],n,i,s=0,b[1000],t=0;
cin>>n;
for (i=1;i<=n;i++) {
cin>>a[i];
s+=a[i];
}
for (i=1;i<=n;i++)
if (s%a[i]==0 && s/a[i]==n) {
t=t+1;
b[t]=i;
}
if (t!=0) {
cout<<t<<endl;
for (i=1;i<=t;i++){
cout<<b[i]<<" ";
}}
else
cout<<0<<endl;
cout<<" ";


return 0;
}
2023-05-06 14:14:03
ta nar bugd gomo
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.