Treceți la conținutul principal

Postări

Se afișează postări din 2017

canale tv romanesti fila m3u

utilizand aplicatia TV Online Universal din Windows Store puteti adauga fisierul m3u cu continutul de mai jos daca doriti sa vizionati cateva canale romanesti


file.m3u

#EXTM3U
#EXTINF:0,EUROSPORT
http://dgf.icx.ro/digiedge2/eurosportehq/index.m3u8?is=31&src=digi-online.ro&t=00000000000000000000000000000000
#EXTINF:0,EUROSPORT 2
http://dgf.icx.ro/digiedge2/eurosport2ehq/index.m3u8?is=32&src=digi-online.ro&t=00000000000000000000000000000000
#EXTINF:0,TVR 2
http://dgf.icx.ro/digiedge2/tvr2ehq/index.m3u8?is=38&src=digi-online.ro&t=00000000000000000000000000000000
#EXTINF:0,TV 1000
http://dgf.icx.ro/digiedge2/tv1000ehq/index.m3u8?is=43&src=digi-online.ro&t=00000000000000000000000000000000
#EXTINF:0,DIGI LIFE
http://dgf.icx.ro/digiedge2/digilifeehq/index.m3u8?is=6&src=digi-online.ro&t=00000000000000000000000000000000
#EXTINF:0,DIGI WORLD
http://dgf.icx.ro/digiedge2/digiworldehq/index.m3u8?is=5&src=digi-online.ro&t=00000000000000000000000000000000
#EXTINF:0,…

adaugarea unei legaturi pe taskbar in windows 10 s

adaugarea unei legaturi pe taskbar in windows 10 s

1.selecteaza directorul : C:\Users\numeutilizator\AppData\Roaming\Microsoft\Internet Explorer\Quick Launch\User Pinned\TaskBar


2. creaza in link cu urmatorul continut in care cele mai importante elemente sunt :

m i c r o s o f t - e d g e : ? t a s k b a r P i n & u r l = h t t p...
m s - a p p d a t a : / / / l o c a l / F a v i c o n s / T a s k b a r /...
t a s k b a r P i n & u r l = h t t p ...
M i c r o s o f t . E d g e . ? t a s k b a r P i n & u r l = h t t p...

iar continutul fisierul shortcut din directorul mai sus amintiti este cel de jos

"

L        À      F…                                                      Ô h€S ‡ Bi ¢ê +00¾ a€    m i c r o s o f t - e d g e : ? t a s k b a r P i n & u r l = h t t p % 3 A % 2 F % 2 F w w w . d i g i s p o r t . r o % 2 F P a g e s % 2 F T V % 2 F D i g i S p o r t % 2 B 1       D i g i S p o r t   1 P       c   1SPS#l WƆG¯²#aˆÈô           ÿÿ          …

limbajul c cpp vc

user input Scanner java

// To import an external class you use import
// You can import whole libraries of classes like this import java.util.*;
import java.util.Scanner; 

public class LessonTwo
{
/* static means that only a class can call for this function to execute
* Creates a new scanner object named userInput
* You create the Scanner object by calling new and passing the Scanner constructor
* the input stream to look at (System.in = keyboard input)
*/ 
static Scanner userInput = new Scanner(System.in);

public static void main(String[] args)
{
System.out.print("Your favorite number: "); // Same as println without a newline

/* The if statement will only execute the code that lies between {} if the value inside () is true
* userInput.hasNextDouble() returns true if the next value entered is a Double
* There are similar methods for the other data types
* hasNextInt() : Integer input
* hasNextFloat() : Float input
* There are others for Boolean, Byte, Long, and Short
*/

if (userInput.hasNextInt())
{

int numberEnter…

program nr prime pseudocod netestat

int [] nonprime20= {4,6,8,9,10,12,14,15,16,18,20};
int [] prime20={1,2,3,5,7,11,13,17,19};


int isPar(int nr){
  if(nr%2==0){return 1;}
else {return 0;}
}


int isImpar(int nr){
    if(nr%2!=0){return 0;}
else {return 1;}
}

int firstRightNr(int nr){
  return nr%10;
}

int isThisNrPrim(int n){
int  i;
int s= sqrt(n);
//we will verify just the odd numbers except 5
//the even numbers and 5 we have verify all ready before 
for (i=3; i< =s; i+=2){
 if((firstRightNr(nr)==5)&&(i<=s)){ i+=2;}//3 +2 will never be x0
 if(n%i==0) {  return 0; } //nu e prim 
else{ return 1; }//e prim
}
}

int howManyDigitsHave(int n){
    int nr = n;
int counter = 0;
while(nr){ 
nr=nr/10;
counter ++;
 }
return counter;
}


int singleDigitNumber(int n){
//will never be 11
if(n==11){return -1;} //we just say before 11 is prime
    int howlong = howManyDigitsHave();
    int curentDigit,firstDigit;
firstDigit = n%10;
for(int i = 1;i<=howlong;i++){
curentDigit = n%10;
n=n/10;
if( curentDigit!=firstDigit) {return 0;}
}
return 1;
}
int isPrim(int nr){
 if(…

NUMERE PRIME ALGORITM C++

// NUMERE PRIME ALGORITM C++//  reediting from scratch //on this page is just the study for a next algoritm for generating the parime nr series like Fibonnaci or ....if possibile

74111121313417374414124343447 if u know the red part you can generate the orange part
1 0 1 111112222 1 1 23