Get a Freelance Job

Project:

I need 120 articles written for the “metalworking” industry.

Please include time to complete with your quote.

I will supply a list of 120 keywords and each article needs to be optimized for exactly one keyword on that list.

Some sample keywords would be “metalworking fluids,” “metalworking additives,” “metalworking lubricants,” etc.

Qualifications:

- You absolutely must be able to write clearly in English for this project.

- You must have experience writing articles for SEO.

- Must provide at least 10 past articles from your portfolio that you or your organization has written before I make my selection so that I can review your writing ability. If you already have this in your portfolio, that’s fine.

Article Requirements:

My requirements are specific, so please read the following:

- Articles must be a minimum of 500 words each

- Articles must be free of spelling and gramatical errors

- Articles must have a title at the top, followed by a blank line, followed by the article body.

- Articles must all be in one plain text file with UTF-8 encoding

- Within the text file, articles must be in the same order as the keyword list I supply

- Each article must be separated by 1 blank line, followed by exactly 10 equals signs (==========), followed by 1 blank line

- Each article must have exactly 2 links to well-known, related, and reputable resources in the body (wikipedia, answers.com, etc).

- The links to related resources must be entered as HTML links with an “href” attribute and a “title” attribute

- Each article must have the keyword appear in the body a minimum of 1 time and no more than 2 times

- The first appearance of the keyword in the body must be wrapped in strong HTML tags

- Each article must have at least 1 sub-heading wrapped in h2 HTML tags with at least one appearance of the keyword in that sub-heading. The subheading must be preceded by a blank line. The subheading must NOT be followed by a blank line.

- Each article must be separated into at least 4 paragraphs

- Paragraphs should be separated by blank lines and must NOT be wrapped in p HTML tags.

- If any articles contain ordered lists, each list item should be preceded by 1 pound sign, followed by a space, followed by the list item text (# Ordered list item)

- If any articles contain unordered lists, each list item should be preceded by 1 asterisk, followed by a space, followed by the list item text (* Unordered list item)

- Lists should be preceded by 1 blank line and followed by 1 blank line (individual list items must be on their own lines and NOT separated by blank lines)

- Each article must be at least 90% unique. You can rewrite articles you find somewhere else if you want, but they must be changed enough so that they are at least 90% unique and completely unrecognizable from the source. I will review each source article.

- If you use a source to rewrite articles, you must provide a link to that source. The link should be included immediately after the body of the article, separated from the body by one blank line and followed by one blank line. It should be preceded by “Source: “. (See the attached example article 1 for an example of how rewrite sources should be included).

- The keyword for the article must be included immediately after the rewrite source (if there is one) and preceded by “Keyword: ” (See attached example articles 1 and 2 for an example of how keywords should be included). This is so I can match the article up with the keyword supplied in the keywords list.

Please review the attached txt file for a basic example of my formatting requirements.

Thanks for your time and interest!

You are to write a program that creates and maintains a binary search tree of items in a super market. Each item has a name and a value. All item names will be lowercase alphabetic strings of less than 30 letters. All values will be positive real numbers representing prices. Also, for each node in the tree, you are to maintain the value of all of the items in that subtree. Your tree should be “sorted” based on alphabetical ordering of the item names as determined by strcmp. Your program must allow the user to do the following:

1) Add an item to the inventory
2) Delete an item from the inventory
3) Print out all of the items in the inventory in alphabetical order.
4) Print out the value of all items underneath the subtree of a given item.

For example, if the user adds these items:

a) “soap”, $2.95
b) “raisins”, $2.00
c) “jellybeans”, $5.00
d) “tea”, $1.95

Input File Specification (inventory.txt)
The first line of the input file will contain a single positive integer, n, representing the number of commands to execute. The following n lines will contain one command each, in the other they are to be executed.

The first number of each of these lines will be either 1, 2, 3 or 4, to signify the choices listed above.

If the choice is 1, it will be followed by the name of the item added and its price (as a number), both separated by spaces.

If the choice is 2, it will be followed by the name of the item to be deleted.

Choice 3 will be on a line by itself.

Choice 4 will be followed by a single string storing an item.

Output Specification
For each command, your program should provide some output.
The output provided by each command should be separated by a blank line.

For choice 1, if the item to be added is NOT in the tree, output a line with the following format:

item has been added to the stock.

where item is the name of the item added. If the item is ALREADY in the tree, output a line with the following format:

Sorry, item is already in stock. No changes made.

For choice 2, if the item to be deleted is IN the tree and is successfully deleted, output a line with the following format:

item has been deleted from the stock.

If the item is NOT in the tree, then output a line with the following format:

Sorry, item couldn’t be deleted because it’s not in stock.

For choice 3, the first line should read:

Here is a list of the items in stock:

Each following line should have information about one item and the list should be in alphabetical order by item name. Here is the format for one of these lines:

item $price

The price should be printed out to two decimal places exactly.

Finally, for choice 4, print out the sum of the values of all the items in the subtree rooted by the designated item. If this item is NOT in the tree, $0.00 should be printed out. Here is the format for the output for this option.

The value of all the items underneath item is $price.

Implementation Restrictions
You must store the data in nodes of a binary tree. Each binary tree node must store 3 pieces of information: the name of the item, its price, and the sum of the prices of all the items in its subtree.

Sample Input File
11
2 soap
1 soap 2.95
1 raisins 2.00
1 jellybeans 5.00
1 tea 1.95
4 raisins
3
2 raisins
4 soap
4 cereal
1 soap 3.50

Sample Output
Sorry, soap couldn’t be deleted because it’s not in stock.

soap has been added to the stock.

raisins has been added to the stock.

jellybeans has been added to the stock.

tea has been added to the stock.

The value of all the items underneath raisins is $7.00.

Here is a list of the items in stock:
jellybeans $5.00
raisins $2.00
soap $2.95
tea $1.95

raisins has been deleted from the stock.

The value of all the items underneath soap is $9.90.

The value of all the items underneath cereal is $0.00.

Sorry, soap is already in stock. No changes made.

CAN I HAVE BEFOR AUGUST 15,2009
THANKS

(Need by Friday 10pm if possible)

The Problem
You are to write a program that creates and maintains a binary search tree of items in a super market. Each item has a name and a value. All item names will be lowercase alphabetic strings of less than 30 letters. All values will be positive real numbers representing prices. Also, for each node in the tree, you are to maintain the value of all of the items in that subtree. Your tree should be “sorted” based on alphabetical ordering of the item names as determined by strcmp. Your program must allow the user to do the following:

1) Add an item to the inventory
2) Delete an item from the inventory
3) Print out all of the items in the inventory in alphabetical order.
4) Print out the value of all items underneath the subtree of a given item.

For example, if the user adds these items:

a) “soap”, $2.95
b) “raisins”, $2.00
c) “jellybeans”, $5.00
d) “tea”, $1.95

in this order, then the structure of the binary tree would be as follows:

soap 2.95
total: 11.90
/
raisins 2.00 tea 1.95
total: 7.00 total 1.95
/
jellybeans 5.00
total: 5.00

Input File Specification (inventory.txt)
The first line of the input file will contain a single positive integer, n, representing the number of commands to execute. The following n lines will contain one command each, in the other they are to be executed.

The first number of each of these lines will be either 1, 2, 3 or 4, to signify the choices listed above.

If the choice is 1, it will be followed by the name of the item added and its price (as a number), both separated by spaces.

If the choice is 2, it will be followed by the name of the item to be deleted.

Choice 3 will be on a line by itself.

Choice 4 will be followed by a single string storing an item.

Output Specification
For each command, your program should provide some output.
The output provided by each command should be separated by a blank line.

For choice 1, if the item to be added is NOT in the tree, output a line with the following format:

item has been added to the stock.

where item is the name of the item added. If the item is ALREADY in the tree, output a line with the following format:

Sorry, item is already in stock. No changes made.

For choice 2, if the item to be deleted is IN the tree and is successfully deleted, output a line with the following format:

item has been deleted from the stock.

If the item is NOT in the tree, then output a line with the following format:

Sorry, item couldn’t be deleted because it’s not in stock.

For choice 3, the first line should read:

Here is a list of the items in stock:

Each following line should have information about one item and the list should be in alphabetical order by item name. Here is the format for one of these lines:

item $price

The price should be printed out to two decimal places exactly.

Finally, for choice 4, print out the sum of the values of all the items in the subtree rooted by the designated item. If this item is NOT in the tree, $0.00 should be printed out. Here is the format for the output for this option.

The value of all the items underneath item is $price.

Implementation Restrictions
You must store the data in nodes of a binary tree. Each binary tree node must store 3 pieces of information: the name of the item, its price, and the sum of the prices of all the items in its subtree.

Sample Input File
11
2 soap
1 soap 2.95
1 raisins 2.00
1 jellybeans 5.00
1 tea 1.95
4 raisins
3
2 raisins
4 soap
4 cereal
1 soap 3.50

Sample Output
Sorry, soap couldn’t be deleted because it’s not in stock.

soap has been added to the stock.

raisins has been added to the stock.

jellybeans has been added to the stock.

tea has been added to the stock.

The value of all the items underneath raisins is $7.00.

Here is a list of the items in stock:
jellybeans $5.00
raisins $2.00
soap $2.95
tea $1.95

raisins has been deleted from the stock.

The value of all the items underneath soap is $9.90.

The value of all the items underneath cereal is $0.00.

Sorry, soap is already in stock. No changes made.

Project due to me by 6 p.m. EST US time on Jul-22-09.
You are to write a C program that creates and maintains a binary search tree of items in a super market. Each item has a name and a value. All item names will be lowercase alphabetic strings of less than 30 letters. All values will be positive real numbers representing prices. Also, for each node in the tree, you are to maintain the value of all of the items in that subtree. Your tree should be “sorted” based on alphabetical ordering of the item names as determined by strcmp. Your program must allow the user to do the following:

1) Add an item to the inventory
2) Delete an item from the inventory
3) Print out all of the items in the inventory in alphabetical order.
4) Print out the value of all items underneath the subtree of a given item.

For example, if the user adds these items:

a) “soap”, $2.95
b) “raisins”, $2.00
c) “jellybeans”, $5.00
d) “tea”, $1.95

Input File Specification (inventory.txt)
The first line of the input file will contain a single positive integer, n, representing the number of commands to execute. The following n lines will contain one command each, in the other they are to be executed.

The first number of each of these lines will be either 1, 2, 3 or 4, to signify the choices listed above.

If the choice is 1, it will be followed by the name of the item added and its price (as a number), both separated by spaces.

If the choice is 2, it will be followed by the name of the item to be deleted.

Choice 3 will be on a line by itself.

Choice 4 will be followed by a single string storing an item.

Output Specification
For each command, your program should provide some output.
The output provided by each command should be separated by a blank line.

For choice 1, if the item to be added is NOT in the tree, output a line with the following format:

item has been added to the stock.

where item is the name of the item added. If the item is ALREADY in the tree, output a line with the following format:

Sorry, item is already in stock. No changes made.

For choice 2, if the item to be deleted is IN the tree and is successfully deleted, output a line with the following format:

item has been deleted from the stock.

If the item is NOT in the tree, then output a line with the following format:

Sorry, item couldn’t be deleted because it’s not in stock.

For choice 3, the first line should read:

Here is a list of the items in stock:

Each following line should have information about one item and the list should be in alphabetical order by item name. Here is the format for one of these lines:

item $price

The price should be printed out to two decimal places exactly.

Finally, for choice 4, print out the sum of the values of all the items in the subtree rooted by the designated item. If this item is NOT in the tree, $0.00 should be printed out. Here is the format for the output for this option.

The value of all the items underneath item is $price.

Implementation Restrictions
You must store the data in nodes of a binary tree. Each binary tree node must store 3 pieces of information: the name of the item, its price, and the sum of the prices of all the items in its subtree.

Sample Input File
11
2 soap
1 soap 2.95
1 raisins 2.00
1 jellybeans 5.00
1 tea 1.95
4 raisins
3
2 raisins
4 soap
4 cereal
1 soap 3.50

Sample Output
Sorry, soap couldn’t be deleted because it’s not in stock.

soap has been added to the stock.

raisins has been added to the stock.

jellybeans has been added to the stock.

tea has been added to the stock.

The value of all the items underneath raisins is $7.00.

Here is a list of the items in stock:
jellybeans $5.00
raisins $2.00
soap $2.95
tea $1.95

raisins has been deleted from the stock.

The value of all the items underneath soap is $9.90.

The value of all the items underneath cereal is $0.00.

Sorry, soap is already in stock. No changes made.

You are to write a program that creates and maintains a binary search tree of items in a super market. Each item has a name and a value. All item names will be lowercase alphabetic strings of less than 30 letters. All values will be positive real numbers representing prices. Also, for each node in the tree, you are to maintain the value of all of the items in that subtree. Your tree should be “sorted” based on alphabetical ordering of the item names as determined by strcmp. Your program must allow the user to do the following:

1) Add an item to the inventory
2) Delete an item from the inventory
3) Print out all of the items in the inventory in alphabetical order.
4) Print out the value of all items underneath the subtree of a given item.

For example, if the user adds these items:

a) “soap”, $2.95
b) “raisins”, $2.00
c) “jellybeans”, $5.00
d) “tea”, $1.95

Input File Specification (inventory.txt)
The first line of the input file will contain a single positive integer, n, representing the number of commands to execute. The following n lines will contain one command each, in the other they are to be executed.

The first number of each of these lines will be either 1, 2, 3 or 4, to signify the choices listed above.

If the choice is 1, it will be followed by the name of the item added and its price (as a number), both separated by spaces.

If the choice is 2, it will be followed by the name of the item to be deleted.

Choice 3 will be on a line by itself.

Choice 4 will be followed by a single string storing an item.

Output Specification
For each command, your program should provide some output.
The output provided by each command should be separated by a blank line.

For choice 1, if the item to be added is NOT in the tree, output a line with the following format:

item has been added to the stock.

where item is the name of the item added. If the item is ALREADY in the tree, output a line with the following format:

Sorry, item is already in stock. No changes made.

For choice 2, if the item to be deleted is IN the tree and is successfully deleted, output a line with the following format:

item has been deleted from the stock.

If the item is NOT in the tree, then output a line with the following format:

Sorry, item couldn’t be deleted because it’s not in stock.

For choice 3, the first line should read:

Here is a list of the items in stock:

Each following line should have information about one item and the list should be in alphabetical order by item name. Here is the format for one of these lines:

item $price

The price should be printed out to two decimal places exactly.

Finally, for choice 4, print out the sum of the values of all the items in the subtree rooted by the designated item. If this item is NOT in the tree, $0.00 should be printed out. Here is the format for the output for this option.

The value of all the items underneath item is $price.

Implementation Restrictions
You must store the data in nodes of a binary tree. Each binary tree node must store 3 pieces of information: the name of the item, its price, and the sum of the prices of all the items in its subtree.

Sample Input File
11
2 soap
1 soap 2.95
1 raisins 2.00
1 jellybeans 5.00
1 tea 1.95
4 raisins
3
2 raisins
4 soap
4 cereal
1 soap 3.50

Sample Output
Sorry, soap couldn’t be deleted because it’s not in stock.

soap has been added to the stock.

raisins has been added to the stock.

jellybeans has been added to the stock.

tea has been added to the stock.

The value of all the items underneath raisins is $7.00.

Here is a list of the items in stock:
jellybeans $5.00
raisins $2.00
soap $2.95
tea $1.95

raisins has been deleted from the stock.

The value of all the items underneath soap is $9.90.

The value of all the items underneath cereal is $0.00.

Sorry, soap is already in stock. No changes made.

You are to write a program that creates and maintains a binary search tree of items in a super market. Each item has a name and a value. All item names will be lowercase alphabetic strings of less than 30 letters. All values will be positive real numbers representing prices. Also, for each node in the tree, you are to maintain the value of all of the items in that subtree. Your tree should be “sorted” based on alphabetical ordering of the item names as determined by strcmp. Your program must allow the user to do the following:

1) Add an item to the inventory
2) Delete an item from the inventory
3) Print out all of the items in the inventory in alphabetical order.
4) Print out the value of all items underneath the subtree of a given item.

For example, if the user adds these items:

a) “soap”, $2.95
b) “raisins”, $2.00
c) “jellybeans”, $5.00
d) “tea”, $1.95

in this order, then the structure of the binary tree would be as follows:

soap 2.95
total: 11.90
/
raisins 2.00 tea 1.95
total: 7.00 total 1.95
/
jellybeans 5.00
total: 5.00

Input File Specification (inventory.txt)
The first line of the input file will contain a single positive integer, n, representing the number of commands to execute. The following n lines will contain one command each, in the other they are to be executed.

The first number of each of these lines will be either 1, 2, 3 or 4, to signify the choices listed above.

If the choice is 1, it will be followed by the name of the item added and its price (as a number), both separated by spaces.

If the choice is 2, it will be followed by the name of the item to be deleted.

Choice 3 will be on a line by itself.

Choice 4 will be followed by a single string storing an item.

Output Specification
For each command, your program should provide some output.
The output provided by each command should be separated by a blank line.

For choice 1, if the item to be added is NOT in the tree, output a line with the following format:

item has been added to the stock.

where item is the name of the item added. If the item is ALREADY in the tree, output a line with the following format:

Sorry, item is already in stock. No changes made.

For choice 2, if the item to be deleted is IN the tree and is successfully deleted, output a line with the following format:

item has been deleted from the stock.

If the item is NOT in the tree, then output a line with the following format:

Sorry, item couldn’t be deleted because it’s not in stock.

For choice 3, the first line should read:

Here is a list of the items in stock:

Each following line should have information about one item and the list should be in alphabetical order by item name. Here is the format for one of these lines:

item $price

The price should be printed out to two decimal places exactly.

Finally, for choice 4, print out the sum of the values of all the items in the subtree rooted by the designated item. If this item is NOT in the tree, $0.00 should be printed out. Here is the format for the output for this option.

The value of all the items underneath item is $price.

Implementation Restrictions
You must store the data in nodes of a binary tree. Each binary tree node must store 3 pieces of information: the name of the item, its price, and the sum of the prices of all the items in its subtree.

Sample Input File
11
2 soap
1 soap 2.95
1 raisins 2.00
1 jellybeans 5.00
1 tea 1.95
4 raisins
3
2 raisins
4 soap
4 cereal
1 soap 3.50

Sample Output
Sorry, soap couldn’t be deleted because it’s not in stock.

soap has been added to the stock.

raisins has been added to the stock.

jellybeans has been added to the stock.

tea has been added to the stock.

The value of all the items underneath raisins is $7.00.

Here is a list of the items in stock:
jellybeans $5.00
raisins $2.00
soap $2.95
tea $1.95

raisins has been deleted from the stock.

The value of all the items underneath soap is $9.90.

The value of all the items underneath cereal is $0.00.

Sorry, soap is already in stock. No changes made.

PS: I may not answer right away to you bids, so after you bid please allow some time for answer.

Hello,

I am in need of the following site: NeedFollowers.com
It is related with Twitter and it requires some API knowledge.

So the process is simple:
- First page (main page) login to your Twitter account (if new user add his username into DB)
- Choose between 5 random messages and post in his/her profile
- Logged in now can see the VIP list and the normal 30 users. It should have already checked which he/she is already following and not include them in the list, the rest should be stored temporarily so we know which ones he/she has to follow
- 1 click button to add the VIP list and 1 more click button to add the 30 normal users (auto follow them)
- Check button, checks if he followed all the required members
- After verifying that he/she added all of them, add him/her on the list with users to be followed
- For more he must come back tomorrow

In DB you store:
- Twitter usernames
- Date and if he followed all the required users
- Number of times he got followed (According to the number of follow he/she did, will only get the same ammount of followers)

I keep all the rights of the script.

For more information please PMB me!

Thank you,
Tom

Follow concept

Background:
There’s tons of sports betting sites on the net – espcially in EU. It varies from top professional sites like Bet24, 888.com and bwin.com to minor amature sites. Some users are very good at beting on sport bets – some top gamblers actually out perform Bet24, 888.com etc. in the long run due their sport-insight. The philosophy of this site, is to allow ordinary players to “follow” these expert/top gamblers – enabling normal players to place the same bets as the top gamblers.

Measuring in “Units”:
Skill based betting on the internet is often meassured in “units”, instead of a fixed and absolute currency/value. Using “units” as measurements for the gamblers skill-level, ensures a good and realistic rating.

Introduction:
How the “follow gambler” concept should work….
The new user deposit an amount (from 10$ to 1000$) to a depot on the site. The user can then choose how much a “Unit” is (1$ to 100$). The user can choose to follow any other user (refered to as “gambler”). It is the gambler who decides how many units to be played (from 1 to 10).
Example: A gambler bets 3-units on away win for Man.C vs. Bolton – this will automatically have all his followers to bet 3 units – meaning that e.g. users having 5$ as the unit, will bet 15$ on away win for Man.C vs. Bolton.

Who are the “gamblers”?
The gamblers on the site are “pro gamblers”, meaning that ordinary users cannot become gamblers. This will ensure that only skillful
gamblers are being followed. Each gambler shall have a “blog”-like area, where basic informations about the gambler, stats, images etc can be put. Further more, comments to the bets made will be posted here, allowing other users to see why this bet is good.

Depot:
A simple page with a track history for all earnings/loss’s and who the user has followed.
The users should always be allowed re-deposit his money. A small fee (configurable) will be charged for this.

Requirements:
Betting strategy…
At the gamblers page, bets will be registrered – each game needs to be registered min. 2 days in advance. 1 day prior to the match begins, the followers are still allowed to abandon the specific bet.
After that period of time, the game is “locked” and the followers depots will be deduced with the correct unit amount. The bet can now be placed at the best betsite.
When the match is done, the Administrator will update the match with the actual result – after the result update, all followers will have their depots updated.

E-mail notifications:
When the gambler makes a bet, the followers should receive an email with an overview of the match (playing teams, odds, match time, gamblers-comments to the match, basic stats) – plus a visible option to “refuse to follow this match”. This will allow the followers to easily abandon the specific bet.
When a match is ended and the final result is ready, an email should be sent out to all the followers with the finial result + earnings/loss and total amount avivable in the users depot.

Roles at the site:
3 different user roles are defined:
1.) Gambler, the role that normal players are “following”.
2.) Player, the role that are following the gamblers – these are the “normal users”.
3.) Administrators, the role that actually makes the bet for all the users at the betting sites and update the results.

The Gambler login area:
Only Administrators will be allowed to create a new “Gambler” account.
In this area, the gamblers can choose what bets to make. Besides deciding what bets to make, the gambler can comment on the bets – these comments will be displayed as feeds at the frontpage.
All bets are made in units (1 to 10).
The gambler shall be allowed to upload profile images and update/edit his profile text at his login area.
Gamblers shall be able to see how much money they have earned/lost for their followers – their personal revenue will be dependent on this number (% of the revenue they have made for thier followers).

The Player (players are also refered to as “followers” ) login area:
This page is for all the “normal users” – the player can deposit/withdraw money to his depot, see all transactions, see stats (bets made, win/loss etc), change email/password etc.
Like in the email notification, it shall be possible to abandon a specific match if the timelimie is not exceeded (1 day prior to the game).

The Administration login area:
This is the page where the Administrator can see what bets to place for the gamblers and all its followers. The bets are being sum’ed up and the total amount to place for each bet, are shown on this page.
The Administrator page is also used for updating the finial result of the bets. The Administrators will be responsible for updating the correct results for all the bets.
The Administrators shall be allowed to add feeds to the frontpage – enabling them to do comments like the gamblers. This ensures the adminstrators to communicate with the players.
Simple stats like: “Todays revenue for the site”, “Todays revenue for the followers” etc. should be displayed at this Administrator login page.

The default area (not logged in):
- Front page: 1.) The front page will show what bets are in play today. 2.) A top-10 of all gamblers 2a.) What gamblers whom has most followers 3.) A general stat that teases like: “If you had deposit 100$ 3 months ago, and followed the 3 top gamblers, you would have 234$ by now!” 4.) Bet feeds from all the gambles (comments on the bets) 5.) Stats from the last 10 bets.
- Gambler page (when clicking on a gambler): 1.) A profile image is shown 2.) A profile description is shown 3.) A stat of all the bets made by the gambler. 4.) A stat of the last 10 bets made.
- Match page (when clicked on a match): Will show what gamblers are playing on that specific match. Besides showing what bets are being made for that match, comments(feeds) from the Gamblers should be shown here.

Revenue model for “gamblers”:
Gamblers will be legally forced to do the betting them self. Gamblers generating a positive revenue will be rewarded with a (configurable) x% in kick-back from its followers. Gamblers generating a negative revenue for its followers, will not generate any kick-back. The more followers, the more revenue can be earned for the Gamblers – this will truely encurage the Gamblers to promote a followship of thier bettings. This can eventually become a living for the very good betters.

Revenue model for the site:
Everytime a gambler makes a succesfully bet, and the followers makes money – a small (configurable) fee will be charged from the followers.

FAQ:
Q: Will normal players be able to create a profile?
A: No

Q: Can a player follow more than 1 gambler?
A: Yes

Q: Who are the Administrators?
A: To begin with, its the owners of the site.

Q: Should the “deposit money” system be included in system?
A: Preferably yes, but its not a requirement

Q: What happens if a match is not played or the result is vague?
A: The administrator should be allowed to mark a game as “void” – ensuring all the followers of the match to not loose/win the match.

Q: Is it possible to follow 2 gamblers that bets on the same match with different result? (e.g. home and away win)
A: Yes – however its possible for the player to abandon a specific match if he wants to

Q: Is it the Administrators who decides when a new Gamblers is to be added?
A: Yes

Q: What is the revenue-model for the site?
A: A small fee (configurable) of all positive-revenue-generating-for-the-players bets will be charged.

———–

Attached you’ll find a screenshot of what the frontpage should look like.

These are the specification you need to meet:
Article topic:Information related-car insurance advice

Project Budget:8

Article length: 300-700 words

Minimum of 8 paragraphs. It is better to have lots of small paragraphs than a few big ones, as it makes the resulting articles more unique..

Title on the top line (max length 65 characters), followed by a blank line, and then the first paragraph. The title should contain your keyword phrase.

A blank line between each paragraph.

Paragraphs may be formatted either as fixed-length, or as free-flow text, both formats will work.

Each bullet point or list item should also be separated by a blank line – i.e. each bullet point counts as a new paragraph – otherwise they will end up being concatenated (chained together) and it will no longer look like a list.
The whole article should be in basic ANSII text (i.e. a Notepad file).
Step 2: Re-write the Article Twice
needs to be rewritten twice in the following manner (each of the two versions should be a completely fresh re-write according to these specs):
1. The Title needs to be rewritten, but must still capture or describe the theme of the article in as engaging or interesting way as possible.
2. Each paragraph needs to be reworded. The number of words and sentences in the paragraph may change. The overall content and meaning of the paragraph must remain the same.
3. The number of paragraphs must NOT change. i.e. if the article starts with 8 paragraphs it must end up with 8 paragraphs, and each of those paragraphs should still say the same thing as the original article, but just using different words. Any subheadings that are a single line should be rewritten, and should remain as a single line.
4. If the article has bullet points or lists, then each line of the list should be reworded, but the number of points or lines must remain the same. The style of bullet must remain the same, i.e. if the bullets are asterisks, they should remain asterisks. If the bullet points are numbered, then the numbering must be done in the save format. Each bullet point or list item should also be separated by a blank line – i.e. each bullet point counts as a new paragraph – otherwise they will end up being concatenated and it will no longer look like a list.
5. Articles are to be formatted as follows: Title on top line. Empty line. Paragraph1 followed by empty line, Paragraph2 followed by empty line, etc.
Examples of Articles
Version 1
This is the title of a great article

Your first paragraph goes here. This paragraph will often also appear on its own as a summary/preview of your article. Note that it is written as a single line, followed by a double line break before the next paragraph.

It so happens that this paragraph is actually the start of a list. You don’t have to use a numbered list, but if you do, separate each point by a blank line:

1. point one on your list (these do not have to be numbered points)

2. Point two on your list (but if you do use numbers, make sure you use the same numbering system on all three versions)

3. Point three on your list

Closing paragraph, again all on one long line.
Version 2
Your great article has this title

Then comes a great introduction on a single line, followed by a double line break. This opening paragraph will often also be used as a summary of your article.

And some great points to be made. You might, or might not, do these as numbered points. Either way make sure the points are separated by blank lines:

1. Point one of a great list (which may or may not be numbered)

2. Your next point (remember to always use the same numbering system)

3. A final point
Version 3
What a fantastic title for an article

All you need is a good introduction which can alse serve as a summary for your article, all on one line, then move on to the next paragraph, using a double line break.

So we then introduce your main points. Mostly you will just do this as ordinary paragraphs. But if you choose to do a list (numbered or otherwise) make sure you separate each point with a blank line.

1. A great point here (which does not have to be numbered)

2. Another great point (but do use the same numbering system if you do number them)

3. Yet a third thing to consider

Now sum it all up with your closing paragraph, all on one long line.

Your closing points can be made in a summing up paragraph on one line. And that is how you finish off.

Follow concept

Background:
There’s tons of sports betting sites on the net – espcially in EU. It varies from top professional sites like Bet24, 888.com and bwin.com to minor amature sites. Some users are very good at beting on sport bets – some top gamblers actually out perform Bet24, 888.com etc. in the long run due their sport-insight. The philosophy of this site, is to allow ordinary players to “follow” these expert/top gambleres – enabling normal players to place the same bets and the top gamblers.

Measuring in “Units”:
Skill based betting on the internet is often meassured in “units”, instead of a fixed and absolute currency/value. Using “units” as measurements for the gamblers skill-level, ensures a good and realistic rating.

Introduction:
How the “follow gambler” should work….
The new user deposit an amount (from 10$ to 1000$) to a depot on the site. The user can then choose how much a “Unit” is (1$ to 100$). The user can choose to follow any other user (refered to as “gambler”). It is the gambler who decides how many units to be played (from 1 to 10).
Example: A gambler bets 3-units on away win for Man.C vs. Bolton – this will automatically have all his followers to bet 3 units – meaning that e.g. users having 5$ as the unit, will bet 15$ on away win for Man.C vs. Bolton.

Who are the “gamblers”?
The gamblers on the site are “pro gamblers”, meaning that ordinary users cannot become gamblers. This will ensure that only skillful
gamblers are being followed. Each gambler shall have a “blog”-like area, where basic informations about the gambler, stats, images etc can be put. Further more, comments to the bets made will be posted here, allowing other users to see why this bet is good.

Depot:
A simple page with a track history for all earnings/loss’s and who the user has followed.
The users should always be allowed re-deposit his money. A small fee (configurable) will be charged for this.

Requirements:
Betting strategy…
At the gamblers page, bets will be registrered – each game needs to be registered min. 2 days in advance. 1 day prior to the game, the followers are still allowed to abandon the specific bet.
After that period of time, the game is “locked” and the followers depots will be deduced with the correct unit amount. The bet can now be placed at the best betsite.
When the match is done, the Gambler can update the match with the actual result – all followers will have their depots updated if Gambler won the bet, otherwise no depot movements will be made.

E-mail notifications:
When the gambler makes a bet, the followers should receive an email with an overview of the match (playing teams, odds, match time, gamblers-comments to the match, basic stats) – plus a very visible option to “refuse to follow this match”. This allows the followers to easily abandon the specific bet.
When a match is ended and the final result is ready, an email should be sent out to all the followers with the finial result + earnings/loss and total amount avivable in the users depot.

Roles at the site:
3 different user roles are defined:
1.) Gambler, the role that normal players are “following”.
2.) Player, the role that are following the gamblers – these are the “normal users” with an account on the site.
3.) Administrators, the role that actually makes the bet for all the users at the betting sites.

The Gambler login area:
Only Administrators will be allowed to create new “Gambler” accounts.
In this area, the gamblers can choose what bets to make. Besides deciding what bets to make, the gambler can comment on the bets – these comments will be displayed as feeds at the frontpage.
All bets are made in units (1 to 10).
The gambler shall be allowed to upload profile images and update/edit his profile text at his login area.
Gamblers shall be able to see how much money they have earned/lost for their followers – their personal revenue will be dependent on this number (% of the revenue they have made for thier followers).

The Player (players are also refered to as “followers” )login area:
This page is for all the “normal users” – the player can deposit/withdraw money to his depot, see all transactions, see stats (bets made, win/loss etc), change email/password etc.
Like in the email notification, it shall be possible to abandon a specific match if the timelimie is not exceeded in the Player login area. (1 day prior to the game)

The Administration login area:
This is the page where the Administrator can see what bets to place for the gamblers and all its followers. The bets are being sum’ed up and the total amount to place for each bet, are shown on this page.
The Administrator page is also used for updating the finial result of the bets. The Administrators will be responsible for updating the correct results for all the bets.
The Administrators shall be allowed to add feeds to the frontpage – enabling them to do comments like the gamblers. This ensures that adminstrators can communicate with the players.
Simple stats like: “Todays revenue for the site”, “Todays revenue for the followers” etc. should be displayed at this Administrator login page.

The default area (not logged in):
- Front page: 1.) The front page will show what bets are in play today. 2.) A top-10 of all gamblers 2a.) What gamblers whom has most followers 3.) A general stat that teases like: “If you had deposit 100$ 3 months ago, and followed the 3 top gamblers, you would have 234$ by now!” 4.) Bet feeds from all the gambles (comments on the bets) 5.) Stats from the last 10 bets.
- Gambler page (when clicking on a gambler): 1.) A profile image is shown 2.) A profile description is shown 3.) A stat of all the bets made by the gambler. 4.) A stat of the last 10 bets made.
- Match page (when clicked on a match): Will show what gamblers are playing on that specific match. Besides showing what bets are being made for that match, comments(feeds) from the Gamblers should be shown here.

Revenue model for “gamblers”:
Gamblers will be legally forced to do the betting them self. Gamblers generating a positive revenue will be rewarded with a (configurable) x% in kick-back from its followers. Gamblers generating negative revenue for its followers, will not generate any kick-back. The more followers, the more revenue can be earned for the Gamblers – this will truely encurage the Gamblers to promote a followship of thier bettings. This can eventually become a living for the very good betters.

Revenue model for the site:
Everytime the gambler makes a succesfully bet, and the followers makes money – a small (configurable) fee will be charged from the followers.

FAQ:
Q: Will normal players be able to create a profile?
A: No

Q: Can a player follow more than 1 gambler?
A: Yes

Q: Who are the Administrators?
A: To begin with, its the owners of the site.

Q: Should the “deposit money” system be included in system?
A: Preferably yes, but its not a requirement

Q: What happens if a match is not played or the result is vague?
A: The administrator should be allowed to mark a game as “void” – ensuring all the followers of the match to not loose/win the match.

Q: Is it possible to follow 2 gamblers that bets on the same match with different result? (e.g. home and away win)
A: Yes – however its possible for the player to abandon a specific match if he wants to

Q: Is it the Administrators who decides when a new Gamblers is to be added?
A: Yes

Q: What is the revenue-model for the site?
A: A small fee (configurable) of all positive-revenue-generating-for-the-players bets will be charged.

xercise 2 uses a modified form of the solution to exercise 1.
Vectors and i/o streams exercise 1
Practice with files and string streams

Complete the program ~cs9f/lib/p3.1.cpp so that the program repeatedly recognizes and processes the commands from the following list.

update word number
list names
list quantities
batch file-name
quit

Each legal command must appear on a single line, and have the correct number and type of arguments. The update command must be followed by a word

we have a flash already at www.fire44.com.au we can give you the FLA
in addition to that we need to extend the flash in full screen as a sliding show.

I will provide all the images you need

Stage 1.

Start Flash