Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- function mxmlt($n, $r){
- $i = 1;
- $res = 0;
- while($res < $r){
- if(($n*$i) <= $r){
- $res = $n*$i;
- }
- else{
- break;
- }
- $i++;
- }
- return $res;
- }
- function mxmlti($n, $r){
- $i = 1;
- $res = 0;
- while($res < $r){
- if(($n*$i) <= $r){
- $res = $n*$i;
- }
- else{
- break;
- }
- $i++;
- }
- return $i;
- }
- function mxp($n, $r){
- $i = 1;
- $res = 0;
- while($res <= $r){
- if(($n**$i) <= $r){
- $res = $n**$i;
- }
- else{
- break;
- }
- $i++;
- }
- return $res;
- }
- function mxpi($n, $r){
- $i = 1;
- $res = 0;
- while($res <= $r){
- if(($n**$i) <= $r){
- $res = $n**$i;
- }
- else{
- break;
- }
- $i++;
- }
- return $i;
- }
- function nmst_encode($n, $p2 = true){
- $str = "";
- if(gettype($n) != "integer") return 0;
- $characters = 'abcdefghijklmnopqrstuvwxyz';
- $l = strlen($characters);
- $str = "";
- $n = $n-1;
- if(($n/26)<1){
- $str .= $characters[$n];
- }
- else{
- if(($n/(26**2+26))<1){
- $str .= $characters[mxmlti(26, $n)-2];
- $str .= $characters[$n%mxmlt(26, $n)];
- }
- else{
- $str .= $characters[mxpi(26, $n)-3];
- $str .= nmst_encode($n-mxp(26, $n)+1, false)." ".mxp(26, $n);
- }
- }
- // $str[0] = $characters[ceil($n/26)-26];
- //return $l;
- //return ceil($n/$l)." ".ceil(ceil($n/$l)/$l);
- if($p2) return ($n+1).": ".$str;
- else return $str;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement