재오니소스의 저장공간

/*https://jaeonysos.tistory.comCompare RecursiveP with DynamicPWriter : Mun Jae InDate : 2017.12.16*/#include #include long long Fibonacci_dynamic(int n);long long Fibonacci_recur(int n); long long m[40]={0}; int main(int argc, char * argv[]){clock_t t1,t2;int n;m[1] = 1;m[2] = 2;for(n=20 ; n

Click to download. 접근방법1. 지금까지 해왔던 isPrime 함수를 그대로 사용.2. 시간이 조금 걸렸던 이유는 변수의 존재 범위에 따라 답이 다르게 나옴. /*https://www.acmicpc.net/problem/4948Bertrand's postulateWriter : Mun Jae InDate : 2017.12.16*/#include #include int isPrime(int n){if(n==1){return 0;}else if(n

Click to download. The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million./*https://projecteuler.net/problem=10Summation of primesWriter : Mun Jae InDate : 2017.12.15*/ #include #include int isPrime(int n){if(n==1){return 0;}else if(n

Click to download. 접근 방법1. 처음 든 생각 : Combination 도저히 풀리지 않음.2. 배열을 만들어 볼까 생각 이것도 안풀림.3. Dynamic programming으로 접근해야함. #include int theNumberOfCase[102][102][2]={0}; int main(int argc, char * argv[]){int testCase;int lenSequence;int adjacentBits;int i,j; theNumberOfCase[1][0][0]=theNumberOfCase[1][0][1]=1; // 0 이나 1을 뜻함 for(lenSequence=2; lenSequence

Click to download. 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? If a good upper bound for the target prime is known in advance, using a sieve of Eratosthenes is a much more efficient method. Some useful facts:1 is not a prime.All primes except 2 are odd.All primes greater than 3 can be written in the form ...

수평분할 : ctrl + shift + o 수직분할 : ctrl + shift + e 실행 : ctrl + alt + t 종료 : ctrl + shift + q 전체 : f11 다음 창 활성화 : ctrl + tab 이전 창 활성화 : ctrl + shift + tab $ sudo apt-get install terminator 위 명령어로 설치하시면 프로그램 목록에 terminator가 있습니다. 터미네이터의 단축키는 기존 터미널과 거의 유사하구요. 창분할 관련 단축키는 다음과 같습니다. * 수평 분할 : Ctrl + Shift + O * 수직 분할 : : Ctrl + Shift + E * 다음 창 활성화 : Ctrl + Tab or Ctrl + Shift + N * 이전 창 활성화 : Ctrl + S..

nQueens 문제 풀다가 도저히 안돼서 다른거 풀어보겠음...ㅠㅠ A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.Find the largest palindrome made from the product of two 3-digit numbers. #include int reverse(int n){ int reversed = 0; while(n>0) { reversed = 10*reversed+ n%10; n = n/10; } return reversed;} int isPalindrome(int n){ if(n==re..

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? 접근방법// 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 // 4 = 2*2 6 = 2*3 8 = 2*2*2 9 = 3 * 3 10 = 2 *5 // 12 = 2*2*3 14 = 2*2*7 15 = 3*5 16 = 2*2*2*2 18 = 3*3*2 20 = 2*2*5 // 2520 = 2*2*2*5*..

The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ? #include int main(int argc, char* argv[]){long long number = 600851475143;int i; for(i=2; i

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 1, the first 10 terms will be:1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. #include int Fibonacci(int n); int main(int argc, char * argv[]){int sum = 0;int i=0; for(..