steloflute

http://www.syntax-k.de/projekte/go-review

http://www.hoons.kr/board.aspx?Name=cshaptip&BoardIdx=27138&Page=1&Mode=2 를 참고하여 using System; using System.Data; using System.Data.OleDb; namespace OracleTest { class Program { private static void Main(string[] args) { Console.Write("Data Source: "); string dataSource = Console.ReadLine(); Console.Write("User ID: "); string userID = Console.ReadLine(); Console.Write("Password: "); string passwo..

http://stackoverflow.com/questions/897796/how-do-i-open-an-already-opened-file-with-a-net-streamreader using (Stream s = new FileStream(fullFilePath, FileMode.Open, FileAccess.Read, FileShare.ReadWrite)) { ... } or, using (Stream s = System.IO.File.Open(fullFilePath, FileMode.Open, FileAccess.Read, FileShare.ReadWrite)) { }

http://linux.about.com/od/commands/l/blcmdl1_bc.htm NAME bc - An arbitrary precision calculator language SYNTAX bc [ -hlwsqv ] [long-options] [ file ... ] DESCRIPTION bc is a language that supports arbitrary precision numbers with interactive execution of statements. There are some similarities in the syntax to the C programming language. A standard math library is available by command line opti..

Problem 10 08 February 2002 The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. Answer: 142913828922 C# using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Euler { class Program { static void Main(string[] args) { const long pmax = 2000000; bool[] isPrime = new bool[pmax]; for (long i = 2; i

Problem 9 25 January 2002 A Pythagorean triplet is a set of three natural numbers, a b c, for which, a2 + b2 = c2For example, 32 + 42 = 9 + 16 = 25 = 52.There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc. Answer: 31875000 C# using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Euler9 { class Program { static vo..

Problem 8 11 January 2002 Find the greatest product of five consecutive digits in the 1000-digit number. 73167176531330624919225119674426574742355349194934 96983520312774506326239578318016984801869478851843 85861560789112949495459501737958331952853208805511 12540698747158523863050715693290963295227443043557 66896648950445244523161731856403098711121722383113 62229893423380308135336276614282806444..

Problem 7 28 December 2001 By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10 001st prime number? Answer: 104743 Solution in C# using System; namespace ConsoleApplication1 { class Program { static bool isPrime(int n) { for (int i = 2; i * i

Problem 6 14 December 2001 The sum of the squares of the first ten natural numbers is, 12 + 22 + ... + 102 = 385 The square of the sum of the first ten natural numbers is, (1 + 2 + ... + 10)2 = 552 = 3025 Hence the difference between the sum of the squares of the first ten natural numbers and the square of the sum is 3025 385 = 2640. Find the difference between the sum of the squares of the firs..

Problem 5 30 November 2001 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20? Answer: 232792560 Solution in C# using System; namespace ConsoleApplication1 { class Program { static void Main(string[] args) { var n = 20; for (var i = 19; i >= 2; ..