Show Posts

This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to.


Messages - dinosteven

Pages: 1 2 3 [4] 5 6 ... 13
46
TI Z80 / Re: AXECHESS - The First Chess made in Axe
« on: April 23, 2013, 11:04:13 pm »
I think he meant that the feature of having variables for all possible pieces, even those offscreen,  would be good idea.

47
Even though it says no pre-calculated lists... Can we use one for 2 and 3? The fastest algorithm I've got disregards 2 and 3...

48
I started in 7th grade getting a calc for Alg I. Then I got games from friends and got addicted, especially MEMPIE. I wanted to make games like those. So I found Boris Cherney's TIBASIC tutorial. I started making games, found TIBASICDEV while searching for getKey values, learned some more, and then found Omnimaga a year ago.

49
I have a TI-84+SE, purchased a little less than a year ago. I suppose that makes it a "new calc". More specs in case it's helpful: Originally boot code 1.03 and OS 2.55; downgraded to 1.02 and OS 2.41. zStart is installed.
The first program returned:
85
128
So I guess that means it has a TA1?

The second program sent me to a new line, nothing else. I noticed no changes after running it... So it passed and the first number wasn't a 69.
Hope this info helped!

EDIT:
I tested the new code. It froze up and Defragmented after battery removal and reset nearly everything in the archive :/

50
TI-BASIC / Re: Pi Day
« on: March 08, 2013, 07:48:05 pm »
Meeeh... My record was 263, but I can only recall 230 now. And my original plan was to get to 762 digits!
Wish my brain was like those people.

51
Portal X / Re: Portal X (Prelude) Bugs
« on: January 30, 2013, 11:23:03 pm »
idk why and how, but lvl 26 - I dropped the cube through a portal to the button. Then my calc went blank. I pressed on and everything seemed normal again, but when I finished the level, weird things happened. The first line of text was random stuff. Then it behaved as if I had completed the last level, with all that jazz, and I went back to the main menu.
No after effects noticed so far, and everything seems normal, but I'd like that to be reported. zStart and Omnicalc and DoorsCS installed (yes, I know DCS screws zStart up).

52
Computer Programming / Re: Ah! Help!
« on: January 18, 2013, 09:54:03 pm »
Well, it's not finished. Still gotta find the most common words - but that will be easy. My problem is that I got 140 unique words - my peers say it's supposed to be 139. Not having an at-home compiler is really annoying. Could you test/debug it?
How do I create a new ArrayList with the same contents as another? Not ArrayList <String> SortList = WordList;
That doesn't create a new array, just a new pointer. I couldn't figure out the syntax for it.
I had to work on another problem today, which is why I had so little time to test, but thankfully today's problem was easy - it was just to find all primes and emirps up to an input. I just used a loop and to limit/6 using 6k-1/6k+1 and tested with a loop to the sqrt.
I've got all weekend plus ML day to finally get these and then I'm back on track :)

53
Computer Programming / Re: Ah! Help!
« on: January 18, 2013, 02:48:23 pm »
So here is my code so far:

Code: [Select]
import java.util.Scanner;
import java.io.*;
import java.lang.*;
import java.util.ArrayList;
import java.util.List;



public class CoutWords {

public static void main(String[] args) throws IOException {
Scanner in = new Scanner (new File("C:\\Documents and Settings\\100020930\\Desktop\\Lincoln.txt"));
String line;
ArrayList <String> WordList = new ArrayList <String>();
int [] index = new int[154];
while(in.hasNext()) {
line = in.nextLine();
String[] s = line.split("\\s+");
for(String i : s) {
if (!(i.equals("-"))) {
i = i.replace(",","");
i = i.replace(".","");
if (!(WordList.contains(i.toLowerCase()))) {
WordList.add(i.toLowerCase());
}
index[WordList.indexOf(i.toLowerCase())]++;
}
}
}

int sum = 0;
for(int i : index)
sum += i;
System.out.println(sum);
System.out.println(WordList.size());
}

    public CoutWords() {
    }


}
This is the file:
Spoiler For file:
      The Gettysburg Address

   Fourscore and seven years ago our fathers brought forth on
this continent a new nation, conceived in liberty, and dedicated to
the proposition that all men are created equal.

   Now we are engaged in a great civil war, testing whether that
nation, or any nation so conceived and so dedicated, can long endure.
We are met on a great battlefield of that war. We have come to
dedicate a portion of that field as a final resting-place for those
who here gave their lives that the nation might live. It is altogether
fitting and proper that we should do this. But, in a larger sense, we
cannot dedicate, we cannot consecrate, we cannot hallow, this ground.
The brave men, living and dead, who struggled here have consecrated
it, far above our poor power to add or detract. The world will little
note, nor long remember, what we say here, but it can never forget
what they did here. It is for us the living, rather, to be dedicated
here to the unfinished work which they who fought here have thus far
so nobly advanced. It is rather for us to be here dedicated to the
great task remaining before us - that from these honored dead we take
increased devotion to that cause for which they gave the last full
measure of devotion - that we here highly resolve that these dead
shall not have died in vain - that this nation, under God, shall have
a new birth of freedom and that government of the people, by the
people, for the people, shall not perish from the earth.

54
Computer Programming / Re: Ah! Help!
« on: January 17, 2013, 08:52:14 pm »
Ah, thanks!

55
Computer Programming / Re: Ah! Help!
« on: January 17, 2013, 06:30:59 pm »
I've never even heard of that class... But as the oracle docs says about it, split does the same thing. I used split.
Quote
StringTokenizer is a legacy class that is retained for compatibility reasons although its use is discouraged in new code. It is recommended that anyone seeking this functionality use the split method of String or the java.util.regex package instead.
Do you have any idea how one would go about removing puncutation? Maybe a substring...

56
Computer Programming / Re: Ah! Help!
« on: January 17, 2013, 05:35:36 pm »
I'm using JCreator. The teacher lets us use either JCreator or Eclipse, and I've never learned how to use Eclipse.
JCreator autocompletes parenthesis and curly brackets for me, but that's all I know that it does.
I couldn't get Dictionary to work; my teacher says the's never used it either. I ended up using a String ArrayList with words, and an integer array index of how many times the word occurred. Anyone know how to remove punctuation? Ex "war," becomes "war". I need help with that.
Sorting will be difficult with 2 arrays, so I'll just find maximums 1 at a time.
I'll deal with my second problem later...
Thanks for all the help, guys!

57
Computer Programming / Ah! Help!
« on: January 16, 2013, 10:08:50 pm »
Our teacher has been giving us a program to do each day since the start of the year, and I can't quite finish them before the class period is done. I'm falling behind, each day finishing the previous day's program before starting the next. ARRGH - I'm behind 2 programs already after only 8 days! So I'm really sorry for asking for you to do my homework (not entirely, I know it's not right, I want to do it myself), but I need help fast tonight. I don't have a compiler on my computer - well, it's not working - so I can't test.
So the 2 problems are:
Spoiler For Problem1:
Read a text file of Lincoln's Gettysburg Address. Just output the total number of words in it, the total number of unique words ("the" 8 times counts as 1 word), and the top 30 words that occur most frequently.
Special cases are "sixty-three" is 1 word. "joyous - sparkling" as 2 words, " 'tis " as 1 word, "can't" as 1 word, and "The" and "the" are the same, capitals negligible.
So I just need to split the string on spaces, don't add the word if it's a hyphen, convert it to all lowercase, check if it's already in the String Arraylist, and then add it to the arraylist if it meets all the criteria. I can figure out the total number of words by taking the .size() of the Arraylist, and figure out the total number of words by taking the .size() of the array made by the split.
I dunno how to figure out the 30 most frequent, though. Output should be like:
103   the
97    of
59   to
etc.
# words used: 525
# of words: 1577

Spoiler For Problem2:
This one is even easier. I finished this one, but it wasn't working and I couldn't figure out why. Unfortunately, I don't have my code with me.
In a while loop until the user enters in a "?", determine if an input is a valid identifier or not. Criteria for a valid input:
Less than 256 characters; first character is a letter or an underscore, and then followed by numbers, underscores, and digits; no more than one underscore in a row.

This is Java, by the way. My main issue is syntax - I don't know what command does what or how to spell the commands. So I use trial/error until it doesn't give me compile errors. That's what is slowing me down.
Please - I need this soon...

58
Computer Usage and Setup Help / Re: Steam Games on Ubuntu / Debian
« on: January 13, 2013, 07:31:18 pm »
The Portal games aren't on that list??? o.o I was sure they would, being of the Source engine...

59
TI Z80 / Re: Flow
« on: December 29, 2012, 02:08:22 pm »
I haven't been able to get tilem working... :(
I won't be able to make them, but if someone could download the src, compile it, and screenshot it, I'd be thankful.
As soon as I get some more things sorted, I'll upload it again with the build this time.

60
Axe / Re: Variable locations?
« on: December 29, 2012, 02:04:27 pm »
Ok, I have another thing I need to optimize. (idk why I named the topic var locations, the solution had nothing to do with that, and it really is just for optimizations that I can't do)
Code: [Select]
Pt-On(C*9+1,D*9+1,Pic1)
Pt-On(E*9+1,F*9+1,Pic1)
Pt-On(G*9+1,H*9+1,Pic2)
Pt-On(I*9+1,J*9+1,Pic2)
Pt-On(K*9+1,L*9+1,Pic3)
Pt-On(M*9+1,N*9+1,Pic3)
Pt-On(O*9+1,P*9+1,Pic4)
Pt-On(Q*9+1,R*9+1,Pic4)
I defined Pic1-Pic4 like this:
[stuff]->Pic1
[stuff]
[stuff]->Pic2
[stuff]
[stuff]->Pic3
[stuff]
[stuff]->Pic4
[stuff]

Pages: 1 2 3 [4] 5 6 ... 13