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

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];
}

2019-02-18 17:07:11
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a=-92,b,c[1000005],ans1=0,d,e,i,j,n,ans=0;
string s,s1;
vector<int> v;
pair<int,int> p[10005];
map<int,int> m;
cin>>n;
for(i=1;i<=n;i++){
cin>>c[i];
}
for(i=1;i<=n;i++){
a=max(a,c[i]);
}
for(i=1;i<=n;i++){
if(c[i]==a) ans1++;
else {ans=max(ans,ans1); ans1=0;}
}
cout<<max(ans,ans1);
}

2019-02-18 15:35:11
#include<bits/stdc++.h>
using namespace std;
int main(){
char a[5][5];
long long b,c,d,n,i,k,m,j;
for(i=1; i<=4; i++){
for(j=1; j<=4; j++){
cin>>a[i][j];
}
}
for(i=1; i<=3; i++){
for(j=1; j<=3; j++){
if(a[i][j]=='#' && a[i+1][j]=='#' && a[i+1][j+1]=='#' && a[i][j+1]=='#') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='#' && a[i+1][j]=='#' && a[i+1][j+1]=='#' && a[i][j+1]=='.') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='#' && a[i+1][j]=='#' && a[i+1][j+1]=='.' && a[i][j+1]=='#') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='#' && a[i+1][j]=='.' && a[i+1][j+1]=='#' && a[i][j+1]=='#') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='.' && a[i+1][j]=='#' && a[i+1][j+1]=='#' && a[i][j+1]=='#') {
cout<<"YES";
exit(0);
}
//dsfdsfsdf
if(a[i][j]=='.' && a[i+1][j]=='.' && a[i+1][j+1]=='.' && a[i][j+1]=='.') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='#' && a[i+1][j]=='.' && a[i+1][j+1]=='.' && a[i][j+1]=='.') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='.' && a[i+1][j]=='#' && a[i+1][j+1]=='.' && a[i][j+1]=='.') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='.' && a[i+1][j]=='.' && a[i+1][j+1]=='#' && a[i][j+1]=='.') {
cout<<"YES";
exit(0);
}
if(a[i][j]=='.' && a[i+1][j]=='.' && a[i+1][j+1]=='.' && a[i][j+1]=='#') {
cout<<"YES";
exit(0);
}
}
}
cout<<"NO";
}

2019-02-18 04:50:43
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,d,e,i,j,n;
string s,s1,s2;
cin>>s>>s1;
sort(s.begin(),s.end());
for(i=0;i<s.size();i++){
if(s[i]!='0'){s2+=s[i]; s[i]='a'; break;}
}
for(i=0;i<s.size();i++){
if(s[i]!='a') s2+=s[i];
}
if(s2==s1)
cout<<"OK";
else cout<<"WRONG_ANSWER";
}

2019-02-12 11:01:44
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b=1,c,d,e,i,j,n;
map<char,int> m;
map<char,int> ::iterator it;
pair<int , char> p[100005];
string s,s1;
cin>>s;
a=s.size();
for(i=0;i<=a;i++){
m[s[i]]++;
}
for(it=m.begin();it!=m.end();it++){
p[b].first=200-it->second;
p[b].second=it->first;
b++;
}
sort(p+1,p+1+a);
for(i=1;i<=a;i++){
for(j=1;j<=200-p[i].first;j++)
cout<<p[i].second;
}
}

2019-01-14 16:52:58
#include<bits/stdc++.h>
main(){
int a,b,c;
scanf("%d %d",&a,&b);
c=a+b;
printf("%d",c);
}

2018-12-05 03:39:15
#include<stdio.h>
main()
{
//freopen("a,in","r",stdin);
//freopen("a.out","w",stdout);
int a,b,S;
scanf("%d%d",&a,&b);
S=a+b;
printf("%d",S);
}
ez

2018-11-30 03:56:46
g

2018-11-29 02:45:42
gg

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

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

Input

Output

Example