-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLadderophilia.c
501 lines (410 loc) · 7.89 KB
/
Ladderophilia.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
/*All Tracks --> Basic Programming --> Input/Output --> Basics of Input/Output
Ladderophilia
Tag(s): Easy
Aditya is fond of ladders. Everyday he goes through pictures of ladders online but unfortunately today he ran out of ladder pictures online.
Write a program to print “ladder with N steps”, which he can use to get his daily dose of ladder love.
INPUT:
Input contains integer N, the number of steps in the ladder
OUTPUT:
Print the ladder with the gap between two side rails being 3 spaces(“ “).
Check the sample output for format of printing the ladder.
CONSTRAINTS:
1<=N<=40
SAMPLE INPUT
4
SAMPLE OUTPUT
* *
* *
*****
* *
* *
*****
* *
* *
*****
* *
* *
*****
* *
* *
// Write your code here
#include <stdio.h>
int main(){
int lad,n,i;
scanf("%d",&n);
for(i=0;i<n;i++){
printf("* *\n");
printf("* *\n");
printf("*****\n");
}
printf("* *\n");
printf("* *\n");
return 0;
}
//Python solution
n=int(input(""))
print("* *")
for i in range (n):
- print("* *")
- print("*****")
- print("* *")
print("* *")
*/
//Cpp solution
/*
#include<iostream>
using namespace std;
int main()
{
int n,i,j,k;
cin>>n;
for(i=1;i<=((n*3)+2);i++)
{
for(j=1;j<=5;j++)
{
{
if(j==1||j==5)
{
cout<<"*";
}
else if ((i%3==0)&&(j!=1&&j!=(n+1)))
{
cout<<"*";
}
else
{
cout<<" ";
}
}
}
cout<<"\n";
}
return 0;
}
*/
/*Best Submissions:
C:
#include<stdio.h>
#include<stdlib.h>
int main()
{
int i;
scanf("%d\n",&i);
printf("* *\n");
printf("* *\n");
while(i--)
{
printf("*****\n");
printf("* *\n");
printf("* *\n");
}
return 0;
}
C++:
#include<iostream>
using namespace std;
int main()
{
short n;
cin>>n;
while(n--)
{
cout<<"* *\n";
cout<<"* *\n";
cout<<"*****\n";
}
cout<<"* *\n";
cout<<"* *\n";
return 0;
}
C++14:
#include<iostream>
#include<string>
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
int count=1,m=0;
int loop=0;
for(int x=0;x<n;x++)
{
if(loop==0)
{
for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{
if(count==1 || count==5)
{
cout<<"*";
}
else if(m==2)
{
cout<<"*";
}
else
{
cout<<" ";
}
count++;
}
count=1;
if(m==3)
m=0;
m++;
cout<<endl;
}
loop=1;
}
else
{
for(int i=0;i<3;i++)
{
for(int j=0;j<5;j++)
{
if(count==1 || count==5)
{
cout<<"*";
}
else if(m==2)
{
cout<<"*";
}
else
{
cout<<" ";
}
count++;
}
count=1;
if(m==3)
m=0;
m++;
cout<<endl;
}
}
}
return 0;
}
C#:
// Write your code here
using System;
class Program
{
static void Main(String[] args)
{
int n=Convert.ToInt32(Console.ReadLine());
for(int i=0;i<n;i++)
{
for(int k=0;k<2;k++)
{
for(int m=0;m<5;m++)
{
if(m==0 || m==4)
Console.Write("*");
else
Console.Write(" ");
}
Console.WriteLine("");
}
for(int j=0;j<5;j++)
{
Console.Write("*");
}
Console.WriteLine("");
}
for(int k=0;k<2;k++)
{
for(int m=0;m<5;m++)
{
if(m==0 || m==4)
Console.Write("*");
else
Console.Write(" ");
}
Console.WriteLine("");
}
}
}
Java:
//imports for BufferedReader
import java.io.BufferedReader;
import java.io.InputStreamReader;
//import for Scanner and other utility classes
import java.util.*;
class TestClass {
public static void main(String args[] ) throws Exception {
Scanner reader = new Scanner(System.in);
int N = reader.nextInt();
int steps = (N*2)+(N+2);
for(int i=1; i<=steps; i++)
{
for(int j=1; j<=5; j++)
{
if(i%3==0 && i!=0)
{
System.out.print("*");
}
else if(j==1 || j==5)
{
System.out.print("*");
}
else
{
System.out.print(" ");
}
}
System.out.println();
}
}
}
Java8:
import java.util.Scanner;
class HackerEarthBP1
{
public static void main(String args[])
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
for(int i=0;i<(n-1)*6+11;i++)
{
for(int j=0;j<5;j++)
{
if(i%2!=0)
if(j==0 || j==4)
System.out.print("*");
else
if((i+1)%6==0)
System.out.print("*");
else
System.out.print(" ");
//if(j==1||j==2||j==3)
}
System.out.print("\n");
}
}
}
Javascript(Node.js):
// Sample code to perform I/O:
//process.stdin.resume();
//process.stdin.setEncoding("utf-8");
//var stdin_input = "";
//process.stdin.on("data", function (input) {
// stdin_input += input; // Reading input from STDIN
//});
//process.stdin.on("end", function () {
// main(stdin_input);
//});
//function main(input) {
// process.stdout.write("Hi, " + input + ".\n"); // Writing output to STDOUT
//}
// Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
// Write your code here
process.stdin.resume();
process.stdin.setEncoding("utf-8");
var stdin_input = "";
process.stdin.on("data", function (input) {
stdin_input += input; // Reading input from STDIN
});
process.stdin.on("end", function () {
main(stdin_input);
});
function main(input) {
let len = +input;
const lad = `* * \n* *`;
let final = lad;
let i = 0;
while(i < len) {
final = final + '\n' + '*****' + '\n' + lad;
i++;
}
console.log(final)
}
Perl:
=comment
use feature say;
# Sample code to perform I/O:
my $name = <STDIN>; # Reading input from STDIN
print "Hi, $name.\n"; # Writing output to STDOUT
# Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
=cut
# Write your code here
my $n= <STDIN>;
my $big = qq{*****};
my $hand = qq{* *};
for ($i=0;$i<$n;$i++){
print "$hand \n";
print "$hand \n";
print "$big \n";
}
print "$hand \n";
print "$hand \n";
PHP:
<?php
fscanf(STDIN, "%d\n", $n); // Reading input from STDIN
for($i=0; $i<=$n;$i++){
echo "* *\n";
echo "* *\n";
if($i<$n){
echo "*****\n";
}
}
?>
Python:
'''
# Sample code to perform I/O:
name = raw_input() # Reading input from STDIN
print 'Hi, %s.' % name # Writing output to STDOUT
# Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
'''
# Write your code here
n=input()
for i in range (n):
print "* *"
print "* *"
print "*****"
print "* *"
print "* *"
Python 3:
'''
# Sample code to perform I/O:
height = input() # Reading input from STD
# Warning: Printing unwanted or ill-formatted data to output will cause the test cases to fail
'''
# Write your code here
height=int(input())
def legs():
for i in range(5):
if(i ==1 or i==3):
print("* *")
def rails():
print("*****")
def ladder(height):
legs()
for k in range(height):
rails()
legs()
ladder(height)
R(Rscript):
n<- scan('stdin',what=integer(),quiet =T)
for(i in 1:(((n+1)*3)-1)){
if(i %% 3 ==0){
cat("*****","\n")
} else{
cat("* *","\n")
}
}
Ruby:
n=gets.chomp.to_i
puts "* *"
puts "* *"
n.times do
puts "*****"
puts "* *"
puts "* *"
end
*/