DCP-215: Too Easy Back to All Problems

Easy Beginners Problems > Ad-hoc

You are given a number N upto 100000 digits. You have to find N modulo 100000. Input: ------ First line of the Input consist of an integer T ***(T<=500)*** denoting the number of test case and then each of the T line consist of a single integer N denoting the given number. Output: ------- For each of the test case print the output in a single line without any leading '0'(ZERO). Sample Input ------------ 1 1432321 Sample Output ------------- 32321

Problem Limits

 Language Time Limit (seconds) C 1.00 C++ 1.00 C++14 1.00 C# 2.00 Go 2.00 Java 2.00 JavaScript 2.00 Objective-C 2.00 Perl 2.00 PHP 2.00 Python 2.00 Python3 2.00 Ruby 2.00 VB.Net 2.00

227/795

Solve/Submission

Ranking

# User Language Timing
01 red23495 Cpp14 0.00s
02 mir003 Cpp14 0.00s
03 undefined_error Cpp14 0.00s
04 prottoy919 Cpp14 0.00s
05 sakib_ruet_13 Cpp14 0.00s
06 maxhasan Cpp14 0.00s
07 Log_out Cpp14 0.00s
08 HM39 Cpp14 0.00s
09 Chayti_Saha98 Cpp14 0.00s
10 Robbinb1993 Cpp14 0.00s
11 SakibAlamin Cpp14 0.01s
12 Morass Cpp14 0.01s
13 Nasif_44th C 0.01s
14 rana_cse Cpp14 0.01s
15 Dinar Cpp14 0.01s
16 murad_al_wajed Cpp14 0.01s
17 terminator_c Cpp14 0.01s
18 giash_uddin Cpp14 0.01s
19 ssavi Cpp14 0.01s
20 skmonir Cpp14 0.01s
21 arafatduha Cpp14 0.01s
22 Glitch Cpp14 0.01s
23 belal_mbstu Cpp14 0.01s
24 onucsecu Cpp14 0.01s
25 asma_chy Cpp14 0.01s
26 MRITuhin Cpp14 0.01s
27 sp_rahul Cpp14 0.01s
28 mh4746 Cpp14 0.01s
29 Najat Cpp14 0.01s
30 myhobby Cpp14 0.01s
31 dip_BRUR Cpp14 0.01s
32 indroneel Cpp14 0.01s
33 Anubis Cpp14 0.01s
34 ATIK161 Cpp14 0.01s
35 Nazmul0092 Cpp14 0.01s
36 BlurryFace Cpp14 0.01s
37 prantacse14 Cpp14 0.01s
38 tahmidsami Cpp14 0.01s
39 CodeMechanix Cpp14 0.02s
40 prdx9_abir Cpp14 0.02s
41 iamsadee Cpp14 0.02s
42 Zayed Cpp14 0.02s
43 ZERO Cpp14 0.02s
44 imunir Cpp14 0.02s
45 zahid119 Cpp14 0.02s
46 SaikatS Cpp14 0.02s
47 rajdipsaha Cpp14 0.02s
48 feodorv Cpp14 0.02s
49 souravahmed C 0.02s
50 masba Python 0.03s
Feedback