Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define max 5
- struct queue{
- int item[max];
- int fim;
- int inicio;
- }F,G,H;
- void inicia(struct queue *F){
- F->inicio = F->fim = 0;
- }
- int inserir(struct queue *F, int x){
- if(F->fim == max){
- return 0;
- }
- else{
- F->item[F->fim] = x;
- F->fim++;
- }
- }
- int remover(struct queue *F, int x){
- if(F->inicio == F->fim){
- return 0;
- }
- else{
- x = F->item[F->inicio];
- F->inicio = F->inicio + 1;
- return x;
- }
- }
- void verificar(struct queue *F, struct queue *G, struct queue *H){
- int x;
- for(int i = F->inicio; i < F->fim; i++){
- x = remover(F, x);
- if(x < 100){
- inserir(G, x);
- }
- else
- inserir (H, x);
- }
- }
- void main(){
- int i, x, y;
- inicia(&F);
- inicia(&G);
- inicia(&H);
- for(i = 0; i < max; i++){
- printf("digite o valor pra inserir\n");
- scanf("%d", &x);
- y = inserir(&F, x);
- if(y == 0){
- printf("fila esta cheia\n");
- }
- }
- verificar(&F, &G, &H);
- printf("a fila com numeros menores de 100\n");
- for(i = 0; i < G.fim; i++){
- printf("%d ", G.item[i]);
- }
- printf("\na lista com numeros maiores que 100\n");
- for(i = 0; i < H.fim; i++){
- printf("%d ", H.item[i]);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement