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.|

ABR0088V - Эхлэл ба төгсгөл

n натурал тоо өгөгдөв. n тооны эхний болон эцсийн цифрүүдийн байрыг соль.

Input

n натурал тоо өгөгдөнө (n < 4 000 000 000)

Output

эхний ба эцсийн цифрүүдийн байрыг солиход үүссэн тоог хэвлэнэ

Example

Input:
1960

Output:
961

Нэмсэн:sw40
Огноо:2007-11-28
Хугацааны хязгаарлалт:1s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:Бүгд дараах хэлүүдээс бусад: ASM32-GCC MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR ERL FANTOM FORTH GOSU GRV JS-RHINO JS-MONKEY JULIA KTLN NIM NODEJS OBJC OBJC-CLANG OCT PERL6 PICO PROLOG PYPY PYPY3 PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET
Эх сурвалж:Абрамов С. А.

hide comments
2011-02-22 11:11:20 olziidelger
yaj bodhuu pascal deer
2011-01-10 12:40:28 rinao2
pascal deer yaj bodoh we??????????????????????


Last edit: 2011-01-10 12:46:22
2011-01-08 06:01:53 BATGEREL
#include <stdio.h>
#include <stdlib.h>

int main() {
int n;
scanf("%d" , &n);

int first=n;
int rest=1;

while(n>9){
first/=10;
rest*=10;
}
int last=n%10;
n/=10;
n*=10;
n+=first;
n=n%rest;
n=last*rest+n;
printf("%d" , n);

system("pause");
return 0;
}
2010-07-24 16:04:33 Piotr KÄ…kol
Briliant! :-D
I don't know why I didn't hit on this idea.
Thank You. :-)
2010-06-01 06:22:06 Piotr KÄ…kol
What is the task?
2009-09-22 07:26:51 Morningstar
yaj bodoh we
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.