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

RGB7308 - Тонгорогсон тоо

Өгөгдсөн тооны тонгорогсон тоог ол.

Input

Бүхэл тоо өгөгдөнө.

Output

Тонгорогсон тоо.

Example

Input:
1234

Output:
4321

Нэмсэн:Bataa
Огноо:2013-01-09
Хугацааны хязгаарлалт: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
2022-12-09 08:24:26
https://www.youtube.com/watch?v=-tJYN-eG1zk
2022-12-09 08:23:47
#include <stdio.h>

int main(void) {
// your code here
int n, tong=0;
scanf("%d", &n);
while(n>0){
tong = tong * 10 + n % 10;
n/=10;

}
printf("%d",tong);
return 0;
}
https://www.youtube.com/watch?v=-tJYN-eG1zk

Last edit: 2022-12-09 08:24:48
2022-11-17 06:26:17
#include<bits/stdc++.h> //698069
using namespace std;
int main(){
long n,s,a,b;
s=0;
cin>>n;
while (n>0){
a=n%10;
s=s*10+a;
n=n/10;
}
cout<<s<<endl;
}
2022-11-15 07:13:25
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int a, n, b, c, d, e, i;
cin>>a;
c=a;
n=1;
d=0;
e=0;
i=0;
while(c>9) {
c=c/10;
n=n*10;
e=e+1;
}
while(a>0) {
b=a%10;
d=b*(n/pow(10,i))+d;
i=i+1;
a=a/10;
}
cout<<d;

return 0;
}


ezzzz Erbi
2022-10-29 07:47:19
RGB7308 - Тонгорогсон тоо
2022-09-16 03:54:49
package jk;

import java.util.Scanner;

public class a {

public static void main(String[] args) {
// TODO Auto-generated method stub
int a=0,b=0,c=0,d=0;
Scanner scan = new Scanner(System.in);
System.out.print("A=");
int nu1 = scan.nextInt();
//
while(nu1>0)
{a=nu1%10;
System.out.print(a);
nu1=nu1/10;
}




}

}
2022-09-16 03:42:41
package jk;

import java.util.Scanner;

public class a {

public static void main(String[] args) {
// TODO Auto-generated method stub
int a=0,b=0,c=0,d=0;
Scanner scan = new Scanner(System.in);
System.out.print("A=");
int nu1 = scan.nextInt();
//
if(nu1>1000)
{a=nu1/1000;
nu1=nu1-a*1000;

}
if(nu1>100)
{
b=nu1/100;
nu1=nu1-b*100;
}
if(nu1>10)
{
c=nu1/10;
nu1=nu1-c*10;
d=nu1%10;

}
System.out.print(d);
System.out.print(c);
System.out.print(b);
System.out.print(a);



}

}
2022-07-28 20:34:37
soroo caught in 4k
2022-07-26 11:34:15
@usuerpert bro so gay shuu chi neeree mai eniig huul lalruda #include <iostream>
using namespace std;

int main() {

int n,s=10;
cin>>n;
while(n>0){
if(s>n%10){
s=n%10;
}
n=n/10;
}

cout<<s ;
return 0;
}
2022-06-24 12:59:20
RGB7308 - Тонгорогсон тоо
Өгөгдсөн тооны тонгорогсон тоог ол.

Input
Бүхэл тоо өгөгдөнө.

Output
Тонгорогсон тоо.

Example
Input:
1234

Output:
4321
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.