C/С++ programmirleme dilini öwrenýän #1.

men un sheyle ansadyrakmyka diyyan
Include
void main()
{
Int a,b,jem;
//cin>>a>>b;
Jem=a+b;

Cout

Include < iostream.h >
void main()
{
Int a,b,jem;
Jem=a+b;
Cout

Aý dost problema boldaý şu ýazyş stilini üýtgetmek (temamyň)

Sagjabol!

Sagjabol!

cout

Bet-bet dowamyna garashyan dossum

void, stdio.h, include.... düşündirip goybersen hasam bet bolmaly 🙂

Tuweleme maladis! 😆

C dili birnqce kitaphanalardan ybarat bolýar.
Käbir funksiýalary ulanjak bolsaň şoň kitaphanasyny inсlude etmeli bolýar.

mervas na derejede bilyan?
Sheyle sorag sorajak. (hol gun bir yerde soraldy)

Sorag :meka gazet okamagy halaya. Yone bir zady gaty kop ish edinya. Bir sozun shol textda nace gezek gecyanini bilesi gelya. Shona komek etmek ucin programyny yazmaly. Mysal :
Input :
asdas
asdasdassdasdas

Output :
3

Ps. Shu soragy m.orazow, hiroshi, unknown cozer imho...

Barney:
mervas na derejede bilyan?

Sheyle sorag sorajak. (hol gun bir yerde soraldy)

Sorag :meka gazet okamagy halaya. Yone bir zady gaty kop ish edinya. Bir sozun shol textda nace gezek gecyanini bilesi gelya. Shona komek etmek ucin programyny yazmaly. Mysal :

Input :

asdas

asdasdassdasdas

Output :

3

Ps. Shu soragy m.orazow, hiroshi, unknown cozer imho...

Mervas diyipdirin, killer bolmaly... 🙂

Birem birinji soz in kop 10000harp
Ikinji soz 1 000 000harp bolup bilya

c++ (part1) AA tabshyrypdymam welin... 🙂 ya pas

WONAMA:
c++ (part1) AA tabshyrypdymam welin... 🙂 ya pas

Sorag gaty ansat yone shol 10000x1000000 ishlemi 1sekuntdan gecmez yaly has gysga cozuw tapmaly.
Uniwerdaki goryanlerimiz gaty chunga (derine) inenoklar... 🙂

Barney:

WONAMA:

c++ (part1) AA tabshyrypdymam welin... 🙂 ya pas

Sorag gaty ansat yone shol 10000x1000000 ishlemi 1sekuntdan gecmez yaly has gysga cozuw tapmaly. Uniwerdaki goryanlerimiz gaty chunga (derine) inenoklar... 🙂

@Barney 🙂)
Algorithm Preprocessing time Matching time
Naive 0 O((n - m + 1)m)
Rabin-Karp Θ(m) O((n - m + 1)m)
Finite automaton O(m |Σ|) Θ(n)
Knuth-Morris-Pratt Θ(m) Θ(n)

ine dossum aşakdaky pseudecody gerek bolsa (KMP)
KMP-MATCHER(T, P)
1 n ← length[T]
2 m ← length[P]
3 π ← COMPUTE-PREFIX-FUNCTION(P)
4 q ← 0 ▹Number of characters matched.
5 for i ← 1 to n ▹Scan the text from left to right.
6 do while q > 0 and P[q + 1] ≠ T[i]
7 do q ← π[q] ▹Next character does not match.
8 if P[q + 1] = T[i]
9 then q ← q + 1 ▹Next character matches.
10 if q = m ▹Is all of P matched?
11 then print Pattern occurs with shift i - m
12 q ← π[q] ▹Look for the next match.
COMPUTE-PREFIX-FUNCTION(P)
1 m ← length[P]
2 π[1] ← 0
3 k ← 0
4 for q ← 2 to m
5 do while k > 0 and P[k + 1] ≠ P[q]
6 do k ← π[k]
7 if P[k + 1] = P[q]
8 then k ← k + 1
9 π[q] ← k
10 return π

Killer:

@Barney 🙂) Algorithm Preprocessing time Matching time Naive 0 O((n - m + 1)m) Rabin-Karp Θ(m) O((n - m + 1)m) Finite automaton O(m |Σ|) Θ(n) Knuth-Morris-Pratt Θ(m) Θ(n)
ine dossum aşakdaky pseudecody gerek bolsa (KMP) KMP-MATCHER(T, P) 1 n ← length[T] 2 m ← length[P] 3 π ← COMPUTE-PREFI.............................

bolmasa yarysh geciraelin shutayda kim programm.. bilyan bolsa her hili meseleleri cozmek eyle beyle?

dushunsume gora (kan dushunmedim c dal bu) prostoy ishlem edipsin... Bir birden barlap gormek... Olam 10^10 ishlem kop bolya...
Ps. Menem cozup bilemok sebabi 7nji klasda gorupdim c'ni...
Ps2. Killer men seni tanayanmy ya sen meni?

<a href=index.php?
q=users&uid=149>Barney

koroce men dushunshima gora textde nache gezek shu sozun gaytalanyanyny sanayan programma yazmaly c++ sheylemi?men pikirimce bu ansat name beryaniz yazsam name bayrak?