package com.javarush.task.task39.task3904;
import java.util.HashMap;
import java.util.Map;
/*
Лестница
*/
public class Solution {
private static int n = 70;
public static void main(String[] args) {
System.out.println("The number of possible ascents for " + n + " steps is: " + numberOfPossibleAscents(n));
}
public static long numberOfPossibleAscents(int n) {
if(n < 0 ) return 0;
int a1 = 1;
int a2 = 2;
int a3 = 4;
int t = 0;
switch (n){
case 0:
case 1: return 1;
case 2: return 2;
case 3: return 4;
default:
for(int i = 4; i < n; i++) {
t = a1 + a2 + a3;
a1 = a2;
a2 = a3;
a3 = t;
}
return a1 + a2 + a3;
}
}
}
package com.javarush.task.task39.task3904;
import java.util.HashMap;
import java.util.Map;
/*
Лестница
*/
public class Solution {
private static int n = 70;
public static void main(String[] args) {
System.out.println("The number of possible ascents for " + n + " steps is: " + numberOfPossibleAscents(n));
}
public static long numberOfPossibleAscents(int n) {
if(n < 0 ) return 0;
int a1 = 1;
int a2 = 2;
int a3 = 4;
int t = 0;
switch (n){
case 0:
case 1: return 1;
case 2: return 2;
case 3: return 4;
default:
for(int i = 4; i < n; i++) {
t = a1 + a2 + a3;
a1 = a2;
a2 = a3;
a3 = t;
}
return a1 + a2 + a3;
}
}
}