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

2023-12-22 05:28:02

2023-12-20 03:47:19
#include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
long long asdakhgfdaf,hritughfgvbgf,aasdgad;
cin>>asdakhgfdaf>>hritughfgvbgf;
aasdgad=asdakhgfdaf+hritughfgvbgf;
cout<<aasdgad;
return 0;
}

2023-12-20 03:47:08
#include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
int main()
{
long long asdakhgfdaf,hritughfgvbgf,aasdgad;
cin>>asdakhgfdaf>>hritughfgvbgf;
aasdgad=asdakhgfdaf+hritughfgvbgf;
cout<<aasdgad;
return 0;
}

2023-11-29 04:51:42
n = int(input())
a=input()
b = a.split(" ")
max = 0
max_j = 0
for i in range (0,n):
if max < int(b[i]):
max = int(b[i])
max_j = i+1

print(max)
print(max_j)

2023-11-28 10:17:00
#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a;
if (a%2!=0){
cout<<0;}
else {
if (a%4==0)
cout<<a/4-1; else
cout<<a/4;
}
}#include<iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a;
if (a%2!=0){
cout<<0;}
else {
if (a%4==0)
cout<<a/4-1; else
cout<<a/4;
}
}

2023-11-28 06:01:53
ᘛ⁐̤ᕐᐷ

2023-11-28 06:01:11
This

2023-11-28 05:49:35
thughunter.com

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

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

Input

Output

Example