MrGrj

@Silviu

Da

M-am lovit de problema asta de multe ori si ma ofticam ca nu puteam pune mereu poza intreaga. 1. Instead of inputting the desktop site in the address bar (https://www.facebook.com/) change it to mobile site (m.facebook.com) 2. If you are already logged in, just click on photos, select the photo you want to make as profile picture. 3. Click confirm. Then your new profile photo will be updated without cropping. (This is for the photos already uploaded in your albums or any photos tagged in your timeline. For photos not yet uploaded, you can simply click on upload photo) Implicit, se va asigura CALITATEA ORIGINALA a pozei. Nu de 24 MPX bineinteles, ci un factor de crop de 2048 pixeli .... ( Facebook Policy ) Poate ajuta pe careva

@Hoster.ro, in loc sa mai faci off-topic, ai putea intelege ca in viata,uneori, experienta cumulata e mai importanta decat banii. Te rog sa incerci sa eviti subiectul asta. E problema noastra cat timp ne dedicam si in ce fel o facem.

Te ajut si eu cu programarea si cu partea de comunicare/moderare Da-mi un PM

Nu stiu de ce am impresia ca te limitezi doar la lumina solara cand pui aceasta problema cu rotatia Pamantului. Pleci de la o ipoteza gresita, de-aia nu-ti dau 'calculele'

Uite, ai aici ( pe langa teoria relativitatii a lui Einstein ) , niste info foarte utile. Trebuie sa intelegi ca in momentul in care s-a calculat cu precizie viteza luminii (in vid) , s-a folosit un sistem de referinta (static). Uite aici unul din experimente: //EDIT: Da, ar mai ajunge la acel punct in ambele cazuri pentru ca daca galaxia are o miscare de rotatie / translatie whatever echidistanta in toate punctele sale, viteza va fi aceeasi

Ca sa ma refer strict la intrebarile tale: - cu ce viteza se deplaseaz? P?mântul? Depinde. Depinde de sistemul de referin?? în care îl încadr?m. F?r? a stabili un element de raportare, o astfel de întrebare nu are sens. - lumina se misca si ea impreuna cu galaxia ? Uuhmm, ciudata intrebare. Lumina este pur si simplu compusa dintr-un camp electric ?i unul magnetic, orientate perpendicular unul pe cel?lalt, amandou? variabile în timp ?i spa?iu, ?i care se genereaz? reciproc. Nu poti spune ca "lumina se misca". Nu e un corp, lumina e o marima fizica. La fel cum nu poti spune ca energia "se misca". //EDIT: da, s-a luat asta in calcul. S-a luat un pct de referinta si s-a calculat

Poti detalia un pic prin cuvinte ce ai vrut tu sa desenezi acolo ? E putin ambiguu. Care e nelamurirea ? EDIT: Daca am inteles bine ce vrei tu: Ne invartim in jurul soarelui la o distanta de aprox. 150 milioane de km. Viteza luminii fiind de aprox. 300.000 km/s. Impartite, acestea vor da undeva la 500 secunde, adica 8 minute si 20 secunde(timpul in care lumina ajunge pe Pamant) Acum, asta e un numar mediu. Sa ne reamintim ca Pamantul urmeaza o orbita eliptica in jurul soarelui variind de la 147 la 152 milioane de km. In punctul cel mai apropiat este, lumina Soarelui are nevoie de doar 490 secunde pentru a ajunge la Pamant, iar in cel mai indepartat punct...este nevoie de 507 secunde.

Sa-ti deie D-zeu sanatate din toate partile. Cat am cautat asta !

Ceva de genu' asta ? #include <iostream> #include <cstdlib> #include <string> #include <ctime> using namespace std; int main() { srand(time(0)); int deck[52]; int i; string suitnames[4]={"spades", "diamonds", "clubs", "hearts"}; string ranknames[13]={"ace", "2", "3", "4", "5", "6", "7", "8", "9", "10", "jack", "queen", "king"}; // create a new deck, with cards in order, but unique for(i=0; i<52; i++) { deck[i] = i; } // shuffle the deck: for(i=0; i<52; i++) { // generate a random index to swap with the card at index i. int j = rand() % 52; int temp = deck[i]; deck[i] = deck[j]; deck[j] = temp; } // print all the cards for(i=0; i<52; i++) { int suitnumber = deck[i] / 13; // 0 - 3 int rank = deck[i] % 13; cout << ranknames[rank] << " of " << suitnames[suitnumber]<< "\n"; } // Check first 5 cards for an ace cout << endl; for(i=0; i<5; i++) { int acerank = 0; int currentCardRank = deck[i]%13; if(currentCardRank == acerank) { cout << "Got an ace!" << endl; } } // Get the rank of the first 5 cards int R[5]; // = {4, 7, 6, 3, 5}; // rank of the first 5 cards int S[5]; for(i=0; i<5; i++) { R[i] = deck[i]%13; S[i] = deck[i]/13; } // Sort the R array bool swapped = false; do { // 1 pass of the bubble sort swapped = false; for(int i=0; i<4; i++) { if(R[i] > R[i+1]) { int temp = R[i]; R[i] = R[i+1]; R[i+1] = temp; swapped = true; } } } while(swapped == true); // print the sorted ranks and suits for(i=0; i<5; i++) { cout << ranknames[R[i]] << " of " << suitnames[S[i]]<< "\n"; } // Check for a straight: if(R[1]==R[0]+1 && R[2]==R[1]+1 && R[3]==R[2]+1 && R[4]==R[3]+1) { cout << "You got a straight! (you must have cheated)" << endl; } else { cout << "No straight" << endl; } // Check first 5 cards for any pair if(R[0] == R[1] || R[1]==R[2] || R[2]==R[3] || R[3]==R[4]) { cout << "You got a pair!" << endl; } else { cout << "No pair" << endl; } // Check for a flush (all the same suit) if(S[0] == S[1] && S[1]==S[2] && S[2]==S[3] && S[3]==S[4]) { cout << "You got a flush!" << endl; } else { cout << "No flush" << endl; } // Check for straight flush // Check for 4 of a kind // Check for full house system("pause"); return 0; } Nu e facut de mine dar iti poti face o idee destul de rapid despre algoritm. //EDIT: asta e cel mai simplu exemplu pe care l-am gasit tinand cont de cunostintele tale actuale din diveresele posturi

Frumos. Urmatorul pas ar fi acela de a face cate o functie pt. fiecare operatie. Apoi, ca sa progresezi, incearca sa treci usor la programarea orientata pe obiecte.

Inca doua examene. Facultatea vietii. Apoi ma ocup serios de aplicatie. Multumesc tuturor pt. idei si feedback-uri.

Forget the trial and error - maths has now proved where the best spot to place your router is. Physics PhD student Jason Cole, from the Imperial College London in the UK, has figured out a formula that can work out the best place to position your wireless router, and it ultimately depends on your house's floor plan. As Greg Seals explains for The Daily Dot, Cole started investigating the science behind router placement in an attempt to optimise his wifi signal. To do this, Cole first mapped his floorplan, assigning refraction values to the walls, and then used the Helmholtz equation, which allowed him to model the electromagnetic waves being emitted by his router. Over on his blog Almost Looks Like Work, Cole describes the tricky mathematics that followed (bonus points if you can follow that equation). Initially, he came up with the not surprising solution that putting your router right in the middle of your home results in the best wifi signal. But, of course, it doesn’t necessarily look great to stick a router in the middle of the living room, and it’s not always feasible given power points etc. To investigate further, as Seals explains, Cole modified his model to take into account the absorption in wall materials such as concrete, and to stop perfect reflections forming a standing wave. This gave him a model that looked much more like wifi signals. Finally, he concluded what many of us already suspect - the further away you are from the router, the tougher it’ll be to try to catch the tendrils of signal. But if positioned properly, you can place your router in a spot that fills nearly every room of your house with beautifully oscillating waves of wifi, like in the video below. Cole has now even created an Android app that lets you map your own wifi signal around your house, to help you work out where your router should go (without the need for pages of formulae). You're welcome. Watch a of the app in action below.

Cred ca ai gresit titlul job-ului. Administratorul de sistem are cu totul si cu totul alte indatoriri. Asta e mai mult helpdesk

Incearca sa bagi in CMD: ipconfig /release Apoi: ipconfig /renew Poa' sa fie si de la driverul de la placa de retea. Asa ca il poti reinstala.

Da, asta e bug-ul despre care vorbeam in primul post. Voi incerca sa il repar.

Bafta sal

Eu nu sunt curios. Cei care isi vor da seama ca e teapa, sa bage un 'laic' aici. O sa ma-mbogatesc.

#include <string> #include <iostream> using namespace std; int askNumber(string prompt = "Enter a number: "); int askNumber(int guess); int main() { int number = askNumber("Introduceti un nr:: "); cout << "Ai introdus: " << number << endl; int guess; cout << "Introduceti alt numar: "; cin >> guess; guess = askNumber(guess); cout << "Ai introdus: " << guess << endl; } int askNumber(string prompt) { int guess; cout << prompt; cin >> guess; return guess; } int askNumber(int guess) { int guess2 = guess; return guess2; } Nu stiu de ce ai scris asa mult in problema asta. Cred ca e suficient ce ai aici. Vad si inmultiri si adunari. Nu stau sa analizez ca n-am timp, da' nu pare tocmai in regula.

Pai ala e doar un model. Tu poti sa faci altfel. Adica poti incerca sa gasesti alta modalitate ( asa o sa devina mai challenging) Bafta sal

#include <iostream> #include <vector> #include <algorithm> #include <cstdlib> using namespace std; int main() { int choice; vector<string> games; cout << "1. Listeaza jocurile\n"; cout << "2. Adauga jocuri\n"; cout << "3. Sterge jocuri\n"; cout << "4. Iesi\n"; cout << "Alege o optiune: "; cin >> choice; while(choice == 1 || choice == 2 || choice == 3) { switch(choice) { case 1: for(int i = 0; i < games.size(); i++) { cout << games[i] << endl; cout << "Alege o optiune: "; cin >> choice; } break; case 2: { cout << "Numele jocului de adaugat: "; string game; cin >> game; games.push_back(game); cout << "Lista noua:\n"; for(int i = 0; i < games.size(); i++) { cout << games[i] << endl; cout << "Alege o optiune: "; cin >> choice; } } break; case 3: { cout << "Lista:\n"; for(int i = 0; i < games.size(); i++) { cout << (i + ". " + games[i]) << endl; cout << "Introdu numarul jocului pe care vrei sa il stergi: "; int remove; cin >> remove; games.erase((games.begin() + remove)); cout << "Lista noua::\n"; for(int i = 0; i < games.size(); i++) { cout << games[i] << endl; cout << "Alege o optiunr: "; cin >> choice; } } } break; } } cout << "Multumesc pentru ca ai folosit programul"; return 0; } E ok indiciul asta ?

Multumesc pentru sfaturi. Voi incepe dupa sesiune sa adaug noi functii.

Asta este deja posibil. In momentul in care apesi pe Download iti apare File Browser.