COM's Project

Problem B : Digit Generator
http://acm.kaist.ac.kr/Problems/2005b.pdf

풀이

입력받은 수의 자리수만큼(216이면 3)
9를 곱한다음 입력수에 뺀다음
그 수부터 입력수까지 순환문을 돌리며 확인한다

각 자리수를 합하는건 대충 이런식?
for (i=ciphers-1; i>0; i--){
   result += (loop / (int)pow(10, i)) ;
   temp = (loop / (int)pow(10, i)) ;
   loop = loop - temp*(int)pow(10, i);
}
이런식의 계산법은 다들 외워두면 좋을듯
더 나은방법 있으면 알려주고!

소스 :

invalid-file

Hal Burch conducted an analysis over spring break of 1999 and made an amazing discovery: there are only 16 types of programming contest problems! Furthermore, the top several comprise almost 80% of the problems seen at the IOI. Here they are:

• Dynamic Programming
• Greedy
• Complete Search
• Flood Fill
• Shortest Path
• Recursive Search Techniques
• Minimum Spanning Tree
• Knapsack
• Computational Geometry
• Network Flow
• Eulerian Path
• Two-Dimensional Convex Hull
• BigNums
• Heuristic Search
• Approximate Search
• Ad Hoc Problems

김용혁 교수님께서 알려주신 USACO
첫문제 통과!
문제풀이보다
봇 돌려본데 의의를 둬봤음

invalid-file