DOL - Largest Odd Divisor
Given a non-negative integers N. You have to find the largest odd divisor of N.
Input
Input starts with an integer T (1<=T<=5000) denoting the number of test cases. Each test case contains an integer N (1<=N<=1012).
Output
For each test case print the case number and the largest odd divisor of N.
|
Sample Input |
Output for Sample Input |
|
2 |
Case 1: 1 |
Problem Setter: Md Abdul Alim, Dept. of Computer Science, Bangladesh University of Business & Technology
hide comments
|
sandeep_4141:
2016-10-29 10:58:17
lollypop!!very easy..care about output format!! |
|
coder_hsnake:
2016-08-30 21:11:48
if input is 9 print 9 this may help :-) ac in one go
|
|
ayushraj:
2016-08-08 23:12:41
Very Easy Problem! :D Last edit: 2016-08-08 23:15:21 |
|
siddharth_0196:
2016-08-06 10:54:01
AC in 0.00! Probably the smallest code I've ever submitted on Spoj! :D |
|
pt97:
2016-07-19 17:25:36
tutorial
|
|
madhavgaba:
2016-07-15 16:30:25
Its like 0.5 points for free :D |
|
akshayjhamb2:
2016-06-18 15:25:47
very easy problem ! |
| Added by: | Alim |
| Date: | 2015-09-09 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 GOSU JS-MONKEY |
| Resource: | Own Problem |
RSS