DISQUS

DISQUS Hello! iRant is using DISQUS, a powerful comment system, to manage its comments. Learn more.

Community Page

Jump to original thread »
Author

Bad Apples (Cont’d)

Started by jploh · 1 year ago

First off, iPodLinux won’t install on my iPod. It just keeps failing. I’m heart broken. Second, can’t Apple screw the fancy design for practical use? I always have a hard time unplugging the USB cable.

I’m still not in the mood to upload my songs. I’m putting up with Apache’s indexing until I get MythTV installed. […] ... Continue reading »

6 comments

  • if that is the case maybe your apple's hdd is broken.. why not bring it to a nearest apple store.
  • or maybe your ipod isn't supported yet by ipodlinux?!?
  • akin na lang ipod mo hehehe... ayusin ko basta sayaw ka algorithm march
  • Restore lang ang katapat nyan. Gumagana pa naman. Nakakatamad lang mag-upload kasi kailangan pa ng pesteng iTunes.
  • try another media player.. ah yamipod?, anapod explorer?
  • #include"stdafx.h"
    #include<stdio.h>
    #include<stdlib.h>
    #include<conio.h>
    struct list
    {
    int data;
    struct list *next;
    };
    typedef struct list node;

    void init(node* record)
    {
    record->next=NULL;
    }
    void addnode(node* record,int d)
    {
    node* fresh;
    fresh=(node *)malloc(sizeof(node));
    fresh->data=d;
    fresh->next=record->next;
    record->next=fresh;

    }
    void print(node *record)
    {
    node* temp;
    temp=(node *)malloc(sizeof(node));
    for(temp=record->next;temp;temp=temp->next)
    printf(" %d",temp->data);

    }
    void reverse(node* record)
    {
    node* temp;node* temp1;node* temp2;
    temp=(node *)malloc(sizeof(node));
    temp1=(node *)malloc(sizeof(node));
    temp2=(node *)malloc(sizeof(node));
    temp=record;temp1=temp->next;temp2=temp1->next;
    temp->next->next=NULL;
    while(temp2!=NULL)
    {
    temp=temp1;
    temp1=temp2;
    temp2=temp1->next;
    temp1->next=temp;

    }
    record->next=temp1;

    }
    int main(void)
    {
    node* start;
    node* start1;
    start=(node *) malloc(sizeof(node));
    init(start);
    int i=0;
    for(i=10;i>=0;i--)
    addnode(start,i);
    getch();
    print(start);
    getch();
    reverse(start);
    getch();
    print(start);
    getch();
    return 0;
    }

Add New Comment

Returning? Login