Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- /*
- Zvezdara 1
- Zemun 2
- Novi Beograd 3
- Rakovica 4
- Stari Grad 5
- */
- void sort(int niz[], int n){
- int j,i,p;
- for(i=0; i<n-1; i++){
- for(j=i+1;j<n;j++)
- if(niz[i] > niz[j]){
- p = niz[i];
- niz[i]=niz[j];
- niz[j]=p;
- }
- }
- }
- int main(int argc, char *argv[]) {
- int dz[5][100],op,bk,i,i2;
- int ik[5]={0,0,0,0,0};
- char opstine[][20] = {
- "Zvezdara",
- "Zemun",
- "Novi Beograd",
- "Rakovica",
- "Stari Grad"
- };
- printf("1-Zvezdara\n"
- "2-Zemun\n"
- "3-Novi Beograd\n"
- "4-Rakovica\n"
- "5-Stari Grad\n"
- "Unesite br. opstine a zatim br. kartona:\n"
- "Da bi ste zavrsili unos unesite : 0 0\n"
- );
- while(1)
- {
- scanf("%d %d",&op,&bk);
- if(op==0) break;
- dz[op-1][ ik[op-1] ] = bk;
- ik[op-1]++;
- }
- for(i=0;i<5;sort(dz[i],ik[i]),i++);
- for(i=0; i<5; i++){
- for(i2=0; i2<ik[i]; i2++)
- printf("\nKarton u opstini %s br. %d je : %d",opstine[i],i2+1,dz[i][i2]);
- }
- printf("\nKoji karton zelite da pronadjete? ");
- int tk,kuo=-1,j,rbk=0;
- scanf("%d",&tk);
- for(i=0;i<5;i++)
- {
- for(j=0;j<ik[i];j++)
- {
- if(tk==dz[i][j])
- {
- kuo=i;
- rbk=j;
- break;
- }
- }
- if(kuo>=0)break;
- }
- if(kuo>=0) printf("\nVas karton je pronadjen u opstini %s pod rednim brojem %d.",opstine[kuo],rbk+1);
- else printf("\nVas karton nije pronadjen ni u jednoj opstini");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement