Results 1 to 25 of 30
Hybrid View
-
16th December 2010 15:52 #1

, . , . ) , .
:
#include<iostream>
#include <stdlib.h>
using namespace std;
#define N 100;
int broj;
int A[6][3]
void generate();
int konkreten();
int kolichestwa();
int desette();
int menu();
void main()
{int choice,i,n;
do{
cout<<"Broj tiraji:";
cin>>broj;
}
while(broj<1||broj>100);
do{ choice=menu();
switch(choice)
{case 1:generate();break;
case 2:kolichestwa();break;
case 3:desette();break;
case4:konkreten();break;
default:cout<<"Greshen izbor!";break;
}
}while(choice!=5);
}
int menu()
{int choice;
cout<<"\n Izberete opciq:";
cout<<"\n 1.Generirane na chisla!";
cout<<"\n 2.Kolichestwa chisla ot vsqko ot izteglenite chisla";
cout<<"\n 3.Desette nai-chesto izteglqni chisla";
cout<<"\n 4.Konkreten tiraj i chislata ot nego";
cout<<"\n 5.Exit";
cout<<"\Izbor:";
cin>>choice;
return choice;
}
void generate()
{int k,i,j,gen;
for(k=0;k<broj;k++)
for(i=0;i<6;i++)
for(j=0;j<3;j++)
{gen=rand();
do{ gen=A[i][j];}
while(gen<6||gen>49);
}
}, .
-
16th December 2010 17:46 #2Game programmer
Join Date: Feb:2007
Location:
Posts: 1,948
. , ,

. -, .Code:{int k,i,j,gen;
Code:for(int k=0;k<broj;k++) for(int i=0;i<6;i++) for(int j=0;j<3;j++)
rand() . . , time() srand() - google rand() srand() .Code:{gen=rand();
?!Code:do{ gen=A[i][j];}
6 49Code:while(gen<6||gen>49);
,
-
16th December 2010 19:28 #3
#include<iostream>
#include<stdlib.h>
#include<time.h>
using namespace std;
int main()
{int A[6][3],gen;
time_t t;
srand ((unsigned) time(&t));
for(int i=0;i<7;i++)
for(int j=0;j<4;j++)
{gen=rand()%50;
if(gen>6) gen=A[i][j];
}
for(int i=0;i<7;i++)
for(int j=0;j<4;j++)
cout<<A[i][j]<<endl;
}
.. ?
, .
-
16th December 2010 21:19 #4
-
16th December 2010 21:39 #5
-
16th December 2010 22:33 #6
-
16th December 2010 20:38 #7Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
rand() % 49 + 1
, 100 , 3 . . ! 10- -. 49 ( 1 ). .
Edit: ...Last edited by IBM370; 17th December 2010 at 07:37.
-
18th December 2010 19:16 #8Registered User
Join Date: Oct:2003
Location:
Posts: 4,317
, " 6 49" , 6 49?
"" . , , .. .
-
18th December 2010 20:31 #9
-
18th December 2010 21:21 #10Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
49 . . '' :
Code:counters[tiraj/*0;1;2*/][num - 1]++.
-
18th December 2010 21:45 #11
, :
for(i=0;i<3;i++)
for(j=0;j<6;j++)
if(A[i][j]==1), .
-
19th December 2010 16:05 #12Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
, ?
-
19th December 2010 17:12 #13
-
19th December 2010 17:19 #14Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
49 ? 49 ?
-
19th December 2010 17:23 #15
A 1 , , 2 , 49 ? , , ..
:
for(i=0;i<3;i++)
for(j=0;j<6;j++)
if(A[i][j]==1) counters[broj/*0;1;2*/][num - 1]++;
else if (A[i][j]==2) counters[broj/*0;1;2*/][num - 1]++;, .
-
19th December 2010 17:53 #16Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
:
Code:int main() { unsigned i, j, k, num; unsigned long long mask, l; unsigned char data[100][3][6]; unsigned counters[3][49], top10[10]; memset( counters, 0, sizeof(counters) ); for( i = 0; i < 100; i++ ) /* */ for( j = 0; j < 3; j++ ) /* */ { mask = 0; for( k = 0; k < 6; k++ ) /* */ { num = rand() % 49; /* [0 - 48] */ if( num > 24 ) for( l = 0x01LL << num; mask & l; l >>= 1 ) num--; else for( l = 0x01LL << num; mask & l; l += l ) num++; mask |= l; data[i][j][k] = num + 1; /* [1 - 49] */ counters[j][num]++; } } /* 3- ( ?). */ ... /* 10- - counters . (top10) */ ... return 0; }
-
19th December 2010 18:45 #17
-
19th December 2010 19:21 #18Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
. data . counters , . 0 1, 1 2.. 5 counters[1 - 1][5 - 1]. top10. -.
-
19th December 2010 19:43 #19
, 10 - . 49 , , - . :
{int i,j,k,p,z,temp;
int counters[49];
int chisla[49]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16 ,17,18,19,20,21,22,23,24,25,26,27,28,29, 30,31,32,33,34,35,36,37,38,39,40,41,42,4 3,44,45,46,47,48,49};
memset( counters, 0, sizeof(counters) );
for(p=0;p<49;p++)
for(k=0; k<broj; k++)
{
for(i=0; i<3; i++)
{
for(j=0;j<6;j++)
{
if(tiraji[k].A[i][j]==chisla[p])
counters[p]++;
}
}
}
for(p=0;p<48;p++)
for(z=p+1;z<49;z++)
if(counters[p]>counters[z])
{temp=counters[p];
counters[p]=counters[z];
counters[z]=temp;
}
for(p=0;p<10;p++)
{
cout<<counters[p]<<"pyti \t\t"<<chisla[p]<<endl;
}
}Last edited by demonskater; 19th December 2010 at 21:29.
, .
-
19th December 2010 22:13 #20Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
. - chisla counters. . counters[chisla[0] - 1] > counters[chisla[10] - 1] 2 chisla ( 1 11 ). . counters[chisla[0] - 1] - counters[chisla[48] - 1] -. 10 ( chisla ).
-
19th December 2010 22:27 #21
-
20th December 2010 01:18 #22Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
. - - 1 ( 1 49 0 48 ). , .
-
20th December 2010 20:45 #23
if(tiraji[k].A[i][j]==chisla[p])
counters[p]++;
?, .
-
21st December 2010 14:40 #24Registered User
Join Date: Aug:2008
Location: Varna
Posts: 291
. . p + 1 == chisla[p]. p ? counters[ tiraji[k].A[i][j] - 1 ]++. p.
-
21st December 2010 19:46 #25
, :
counters[chisla[0] - 1] > counters[chisla[10] - 1]
?, .




Reply With Quote

Lenovo ThinkPad 15 IdeaPad 15
5th May 2023, 22:16 in