This weblog is moved to the new address:
Nothing will be posted here until further notice.
Monday, September 15, 2008
Sunday, August 17, 2008
Saturday, August 9, 2008
Join our ACM club
Hi,
The IKIU ACM club directors are looking for students that like participate in programming contests.
We need students who can struggle with various problems ranging from easy to hard and have some programming skills in C/C++ or JAVA.
It's not necessary that you be a code-master but if you can write a "Hello world" program, it's enough for now and you can improve it by practicing in the club.
We really encourage students with good math skills to join us.
The more effort, the more skill, the faster progress... and the faster progress the better result in national or world wide competetions.
Everyone who likes participate should send a request to hamidreza.hamidi [at] ikiu [d·t] ac.ir while specifying his/her name, student id and studying field.
This invitation is open until this post is not deleted.
See you.
The IKIU ACM club directors are looking for students that like participate in programming contests.
We need students who can struggle with various problems ranging from easy to hard and have some programming skills in C/C++ or JAVA.
It's not necessary that you be a code-master but if you can write a "Hello world" program, it's enough for now and you can improve it by practicing in the club.
We really encourage students with good math skills to join us.
The more effort, the more skill, the faster progress... and the faster progress the better result in national or world wide competetions.
Everyone who likes participate should send a request to hamidreza.hamidi [at] ikiu [d·t] ac.ir while specifying his/her name, student id and studying field.
This invitation is open until this post is not deleted.
See you.
Thursday, May 15, 2008
OO Coding Contest
hi, dr. mahdavi has established a longtime contest for students whom have the advanced programming course during this semester. the task is to write some code in java to implement the objects described in 800 pages. then the codes will be judged by some specified rules and the functionality expected.
all the task documents and the contest rules are available at the lms (http://univertuality.com/lms/) in the ap course. the winner will also be rewarded one month after the submission deadline.
time to submit task: till the first week of Mehr 1387 !
REWARD: 2,000,000 rials !
try to take part in now!
good luck
all the task documents and the contest rules are available at the lms (http://univertuality.com/lms/) in the ap course. the winner will also be rewarded one month after the submission deadline.
time to submit task: till the first week of Mehr 1387 !
REWARD: 2,000,000 rials !
try to take part in now!
good luck
Wednesday, May 14, 2008
Internet Problem Solving Contest 2008
Fwd: Invitation to IPSC 2008 online contest
------------------------------------------------------------
The Internet Problem Solving Contest (IPSC) is an online, mostly programming contest for individuals and teams of up to three people.
Its purpose is to challenge programming and problem solving skills of people around the world and of course, to have fun. IPSC is known for making popular the open data problem type, and for its high quality, challenging and fun problem sets.
Date of the contest: Saturday May 24, 2008
Time and duration: 2:00pm - 7:00pm CEST (GMT+2)
Practice session (recommended): starting May 23, 12:00noon CEST (GMT+2)
Web page: http://ipsc.ksp.sk/
Archive of previous years: http://ipsc.ksp.sk/old.php
Feel free to distribute this message to anyone who might be interested.
Note that the contest is open for everybody, and we will be glad to see you all take part in it.
------------------------------------------------------------
The Internet Problem Solving Contest (IPSC) is an online, mostly programming contest for individuals and teams of up to three people.
Its purpose is to challenge programming and problem solving skills of people around the world and of course, to have fun. IPSC is known for making popular the open data problem type, and for its high quality, challenging and fun problem sets.
Date of the contest: Saturday May 24, 2008
Time and duration: 2:00pm - 7:00pm CEST (GMT+2)
Practice session (recommended): starting May 23, 12:00noon CEST (GMT+2)
Web page: http://ipsc.ksp.sk/
Archive of previous years: http://ipsc.ksp.sk/old.php
Feel free to distribute this message to anyone who might be interested.
Note that the contest is open for everybody, and we will be glad to see you all take part in it.
Monday, April 28, 2008
The ACM Club Introduction Session
Dr. Hamidi has decided to make the first ACM/ICPC club introduction session, so the members could become more familiar with each other and with the club programs.
Thus the members are invited to participate in this session according to the following time table.
The first session will be established on Wed 11 Ord 1387 2-3 PM and the place will be informed later.
Thus the members are invited to participate in this session according to the following time table.
The first session will be established on Wed 11 Ord 1387 2-3 PM and the place will be informed later.
Tuesday, April 15, 2008
Dijkstra Shortest Path Algorithm
hi,
i was just browsing the web and found an interesting algorithm which implements the Dijkstra (Dykstra) algorithm for finding the shortest path in a graph using the C++ language.
useful for studying but would not be the best could be implemented.
i was just browsing the web and found an interesting algorithm which implements the Dijkstra (Dykstra) algorithm for finding the shortest path in a graph using the C++ language.
useful for studying but would not be the best could be implemented.
download and study the code here ;)
from: ds for beginners
from: ds for beginners
Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path problem for a graph with non negative edge path costs, outputting a shortest path tree. This algorithm is often used in routing.
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities.
full description of the algorithm hereFor a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities.
Sunday, April 13, 2008
Advanced Programmers!
hi,
dr mahdavi has uploaded the translated files (en&fa) into the lms and now it's available for downloading.
just login to the lms and open the ap course, so you see allre there ;)
dr mahdavi has uploaded the translated files (en&fa) into the lms and now it's available for downloading.
just login to the lms and open the ap course, so you see allre there ;)
Thursday, April 10, 2008
Monday, April 7, 2008
INOI 2008 Online Contests
Fwd: Invitation to INOI 2008 online contests
------------------------------------------------------------
Dear all
We are glad to announce that we are hosting a series of Internet online contests with problems from Iranian National Olympiad in Informatics (INOI) 2008.
These contests are used in Iran to select members of the IOI team.
There will be 5 contests in one week. Each contest has 3 tasks and will be 5 hours long.
The contests are primarily intended for high school contestants, but are open to all interested!
Visit http://contest.inoi.ir for more information and registration.
Online contests last for 24 hours (to be convenient for people all around the world), although we encourage all participants to choose one five hours long period for solving the tasks.
They will be held on April, 11th through 17th.
The exact program of online competitions can be found at http://contest.inoi.ir/user.phtml?op=msg&m=info&id=5447&c=200
Regards,
INOI 2008 committee
------------------------------------------------------------
Dear all
We are glad to announce that we are hosting a series of Internet online contests with problems from Iranian National Olympiad in Informatics (INOI) 2008.
These contests are used in Iran to select members of the IOI team.
There will be 5 contests in one week. Each contest has 3 tasks and will be 5 hours long.
The contests are primarily intended for high school contestants, but are open to all interested!
Visit http://contest.inoi.ir for more information and registration.
Online contests last for 24 hours (to be convenient for people all around the world), although we encourage all participants to choose one five hours long period for solving the tasks.
They will be held on April, 11th through 17th.
The exact program of online competitions can be found at http://contest.inoi.ir/user.phtml?op=msg&m=info&id=5447&c=200
Regards,
INOI 2008 committee
Thursday, April 3, 2008
Saturday, March 15, 2008
Happy NEW YEAR!!
Happy new year Iranians!
Nowrūz (Persian: نوروز, (has various local pronunciations and spellings, e.g.: Kurdish: Newroz, نهورۆز, Azerbaijani: Novruz; Kazakh: Наурыз (Nauryz); Kyrgyz: Нооруз (Nooruz)) is the traditional Iranian new year holiday celebrated by various Iranian and Turkic people in Iran, Turkey, Azerbaijan, Afghanistan, Albania, Georgia, Turkmenistan, Tajikistan, Uzbekistan, Kyrgyzstan, Kazakhstan, Syria, Lebanon, Pakistan, India, Northwestern China, the Crimea, and the Balkans.
Nowruz marks the first day of spring and the beginning of the Persian Calendar. It is celebrated on the day of the astronomical vernal equinox (start of spring in northern hemisphere), which usually occurs on the March 21st or the previous/following day depending on where it is observed.
In Iran Nowruz is referred to as an Eid festival, although it is not an Islamic feast. The word comes from Old Persian: nava = new + rəzaŋh = day/daylight, meaning "new day/daylight", and has the same meaning in Kurdish (naw = new + roz = day; meaning "new day") and New Persian (now/naw = new + rūz = day; meaning "new day").
The term Nooroz first appeared in Persian records in the second century AD, but it was also an important day during the time of the Achaemenids (c. 648-330 BC), where kings from different nations under the Persian empire used to bring gifts to the emperor (Shahanshah) of Persia on Nowruz.
Nowruz marks the first day of spring and the beginning of the Persian Calendar. It is celebrated on the day of the astronomical vernal equinox (start of spring in northern hemisphere), which usually occurs on the March 21st or the previous/following day depending on where it is observed.
In Iran Nowruz is referred to as an Eid festival, although it is not an Islamic feast. The word comes from Old Persian: nava = new + rəzaŋh = day/daylight, meaning "new day/daylight", and has the same meaning in Kurdish (naw = new + roz = day; meaning "new day") and New Persian (now/naw = new + rūz = day; meaning "new day").
The term Nooroz first appeared in Persian records in the second century AD, but it was also an important day during the time of the Achaemenids (c. 648-330 BC), where kings from different nations under the Persian empire used to bring gifts to the emperor (Shahanshah) of Persia on Nowruz.
Sunday, March 9, 2008
Hi ACM friends!!
Salam,
the acm international collegiate programming contest club is being based in imam khomeini international university!; the virtual courses are now began!!
all students whom registered before in the courses are now able to join to the virtual courses. these make students ready for the real courses holding after Norouz and next stages.
acm friends! it is the first year we're going for. the try level is the success key!
lets go...!
the acm international collegiate programming contest club is being based in imam khomeini international university!; the virtual courses are now began!!
all students whom registered before in the courses are now able to join to the virtual courses. these make students ready for the real courses holding after Norouz and next stages.
acm friends! it is the first year we're going for. the try level is the success key!
lets go...!
Subscribe to:
Posts (Atom)
