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

Нэмсэн: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
2019-11-19 13:16:35
IZ2
2019-11-10 11:16:44
#include<bits/stdc++.h>

using namespace std;

int main(){

int a,b;

cin>>a>>b;

p=a+b;

cout<<p<<endl;

return 0;
}
2019-11-10 08:20:36
#include<stdio.h>
main(){
int a,b,p;
scanf("%d%d",&a,&b);
p=a+b;
printf("%d",p);
}
2019-11-10 06:07:12


Last edit: 2019-11-10 06:10:39
2019-10-26 06:17:29
#include <cstdio>
int main(){
int a,b;
scanf("%d%d",&a,&b);
printf("%d",a+b);
}
SUPER
2019-10-20 08:54:51
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n;
scanf("%d",&n);
if(n%2==0){
for(int i=2;i<=n;i+=2){
for(int j=2;j<=i;j+=2){
printf("%d",j);
}
printf("\n");
}
}else{
for(int i=1;i<=n;i+=2){
for(int j=1;j<=i;j+=2){
}
printf("\n");
}
}
}
2019-06-10 04:47:50


Last edit: 2019-06-10 04:54:06
2019-04-01 07:39:58
#include<bits/stdc++.h>
main()
{
int a,b,c;
scanf("%d %d",&a,&b);
c=a+b;
printf("%d",c);
}

Last edit: 2019-04-01 07:46:28
2019-03-25 02:45:57
#include <iostream>
using namespace std;
main()
{
int a,b,c;
cin>>a>>b;
c=a+b;
cout<<c;
}
2019-02-18 17:27:31
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c[1000005],d[1000005],e,i,j,n,ans=0,k=0;
cin>>n>>a>>b;
for(i=1;i<=n;i++){
cin>>c[i];
}
sort(c+1,c+1+n);
k=n;
ans+=c[n-1]*(a/(b+1));
n=a/(b+1);
cout<<ans+(a-n)*c[k];
}
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.