Numbers joj2511 TIME Limit MEMORY Limit Run Times AC Times 65536K A number trangle is composed of N(N<=100) line numbers, the i-th line contains i positive integers(<=100). Suppose the chess is on the k-th number of one line, then it ca... IntegerinputPatheachoutputNumbers 2154 Color//POLYA Color Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 2967 Accepted: 1016 Description Beads of N colors are connected together into a circular necklace of N beads (N<=1000000000). Your job is to calculate how ... IntegerinputeachoutputcolorsNumbers poj 2723 Get Luffy Out(2-sat 구도제) Ratish can pass through a door if he opens either of the two locks in it. Later, Ratish found N pairs of keys under the rock and a piece of paper recording exactly what kinds of locks are in the M doors. But Ratish doesn... IntegerinputeachoutputNumbersTypes poj2096 Collecting Bugs---기대 복습 When Ivan gets a new program, he classifies all possible bugs into n categories. Each day he discovers exactly one bug in the program and adds information about it and its category into a spreadsheet. When he finds bugs ... IntegereachspreadsheetbugsNumbersTypes poj 1252 Euro Efficiency(전체 가방 여러 번) Other ways of paying were: 50+25-5-1-1, or 100-25-5-1-1.Either way, there are always 5 units (banknotes or coins) involved in the payment process, and it Buying a 68 Euro book is easier these days: 50+20-2 = 68, so only ... lessinputeachoutputpaymentNumbers poj 1837 Balance (01 가방) Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Knowing the repartition of... eachhookoutputdistanceNumbersstructure ZOJ-1003-Crashing Balloon(검색) After the referee shouts "Let's go!"the two players, who each starts with a score of "1", race to crash the balloons by their feet and, at the same time, multiply their scores by the numbers written on the balloons they... inputeachCrashoutputpairNumbers procrastination---불평등 게임 For example, suppose a tower is composed of the following cubes (from bottom to top): black, white, black, white. A partial configuration C is defined as a set of 3 towers, note that a partial configuration C together wi... Integerinputeachn2NumbersForms SGU 499:Greatest Greatest Common Divisor friendship number (a positive integer). quality of friendship between two persons is equal to the greatest common divisor of their friendship number. people (with a prime friendship number) who just can't find a good fri... Integerinputeach64bitoutputNumbers 【ProjectEuler】ProjectEuler_021 // Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). // If d(a) = b and d(b) = a, where a b, then a and b are an amicable pair and each of a and b are called amicabl... IntegerlesseachpairNumbers uva 820 - Internet Bandwidth(최대 유입 문항) The total message-carrying capacity (bandwidth) between two given nodes is the maximal amount of data per unit time that can be transmitted from one node to the other. For example, the following figure shows a network wi... PathNetWorkeachinternetpairNumbers zoj 2773 Triangular Sums Time Limit: 1 Second Memory Limit: 32768 KB The nth Triangular number, T(n) = 1 + ... + n, is the sum of the first n integers. It is the number of points in a triangular array with n points on side. For e... IntegerinputeachdatasetoutputNumbers poj3211 Washing Clothes(01 가방 문제) Washing Clothes Dearboy was so busy recently that now he has piles of clothes to wash. The clothes are in varieties of colors but each piece of them can be seen as of only one color. In order to prevent the clothes from ... lessinputeachoutputcolorsNumbers POJ1775 문제 풀이 보고서...답답하다 Sum of Factorials Time Limit: 1000MS Memory Limit: 30000K Feb. 8, 1957, was a Hungarian-American mathematician who made important contributions to the foundations of mathematics, logic, quantum physics,meteorology, scien... IntegerinputeachbehaviorNumbers POJ 1142 Smith Numbers Smith Numbers Smith had the following peculiar property: The sum of the digits of that number was equal to the sum of the digits of the prime factors of that number. Smith's telephone number was 493-7775. The sum of all ... IntegeriteratorinputeachoutputNumbers magic square Magic Square Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu [Submit] [Go Back] [Status] Description If you have good observations skills, you may found that building a Magic Square is simple. A Mag... FileIntegerinputeach64bitNumbers HDOJ 1829 A Bug's Life 및 쿼드 세트 제목은 다음과 같습니다. Problem Description In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs. Problem The first line of the input contains the number of s... inputeachoutputbugsbehaviorNumbers uva 357 - Let Me Count The Ways Let Me Count The Ways After making a purchase at a large department store, Mel's change was 17 cents. He received 1 dime, 1 nickel, and 2 pennies. Later that day, he was shopping at a convenience store. Again his change ... FileinputeachoutputNumberscombinations Poj 1837 Balance Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Knowing the repartition of... eachhookoutputdistanceNumbersstructure 1274 The Perfect Stall//MaxMatch For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data... IntegerinputeachoutputNumbers sgu 326 Perspective(최대 흐름) input: standard Being his advisor, you need to determine whether it's possible for your team to finish first in its division or not. Teams are grouped into divisions, some games are between the teams in the same division... OOinputeachoutputpairNumbers Power of Cryptography POJ2109 Power of Cryptography Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 11348 Accepted: 5847 Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among t... IntegerinputeachCryptographyoutputNumbers poj 1276 Cash Machine(다중 가방 + 배율) Cash Machine The machine is able to deliver appropriate @ bills for a requested cash amount. Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash ... lessinputeachn2outputNumbers POJ 1149 PIGS//MAXFLOW More precisely, the procedure is as following: the customer arives, opens all pig-houses to which he has the key, Mirko sells a certain number of pigs from all the unlocked pig-houses to him, and, if Mirko wants, he can ... piginputPatheachoutputNumbers zoj1039 Number Game 게임 + DP+ 상태 압축 Number Game Background Christiane and Matthias are playing a new game, the Number Game. The rules of the Number Game are: Christian and Matthias take turns in choosing integer numbers greater than or equal to 2. The play... listIntegerinputeachoutputNumbers POJ 3308 Paratroopers//최소 베기 Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in the m × n grid yard of one their main weapon factories in order to destroy it. column) and by ... SAPSystemeachoutputNumbersfiring sequence---더미 복습 Sequence Time Limit: 6000MS Memory Limit: 65536K Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^... IntegeriniinputeachoutputNumbers ZOJ 2587 Unique Attack은 최소 베기가 유일한지 여부를 판단합니다. A network has a simple topology: M different pairs of supercomputers are connected to each other by an optical fibre. That is, they want to know if there are no two different sets of fibre connections that can be destroy... structinputinsertNetWorkeachNumbers 더미 응용 프로그램: Sequence Sequence Time Limit:6000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2442 Description Given m sequences, each contains n non-negative integer. Now we may select one number from e... Integerinputeach64bitoutputNumbers 이전 기사 보기
joj2511 TIME Limit MEMORY Limit Run Times AC Times 65536K A number trangle is composed of N(N<=100) line numbers, the i-th line contains i positive integers(<=100). Suppose the chess is on the k-th number of one line, then it ca... IntegerinputPatheachoutputNumbers 2154 Color//POLYA Color Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 2967 Accepted: 1016 Description Beads of N colors are connected together into a circular necklace of N beads (N<=1000000000). Your job is to calculate how ... IntegerinputeachoutputcolorsNumbers poj 2723 Get Luffy Out(2-sat 구도제) Ratish can pass through a door if he opens either of the two locks in it. Later, Ratish found N pairs of keys under the rock and a piece of paper recording exactly what kinds of locks are in the M doors. But Ratish doesn... IntegerinputeachoutputNumbersTypes poj2096 Collecting Bugs---기대 복습 When Ivan gets a new program, he classifies all possible bugs into n categories. Each day he discovers exactly one bug in the program and adds information about it and its category into a spreadsheet. When he finds bugs ... IntegereachspreadsheetbugsNumbersTypes poj 1252 Euro Efficiency(전체 가방 여러 번) Other ways of paying were: 50+25-5-1-1, or 100-25-5-1-1.Either way, there are always 5 units (banknotes or coins) involved in the payment process, and it Buying a 68 Euro book is easier these days: 50+20-2 = 68, so only ... lessinputeachoutputpaymentNumbers poj 1837 Balance (01 가방) Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Knowing the repartition of... eachhookoutputdistanceNumbersstructure ZOJ-1003-Crashing Balloon(검색) After the referee shouts "Let's go!"the two players, who each starts with a score of "1", race to crash the balloons by their feet and, at the same time, multiply their scores by the numbers written on the balloons they... inputeachCrashoutputpairNumbers procrastination---불평등 게임 For example, suppose a tower is composed of the following cubes (from bottom to top): black, white, black, white. A partial configuration C is defined as a set of 3 towers, note that a partial configuration C together wi... Integerinputeachn2NumbersForms SGU 499:Greatest Greatest Common Divisor friendship number (a positive integer). quality of friendship between two persons is equal to the greatest common divisor of their friendship number. people (with a prime friendship number) who just can't find a good fri... Integerinputeach64bitoutputNumbers 【ProjectEuler】ProjectEuler_021 // Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). // If d(a) = b and d(b) = a, where a b, then a and b are an amicable pair and each of a and b are called amicabl... IntegerlesseachpairNumbers uva 820 - Internet Bandwidth(최대 유입 문항) The total message-carrying capacity (bandwidth) between two given nodes is the maximal amount of data per unit time that can be transmitted from one node to the other. For example, the following figure shows a network wi... PathNetWorkeachinternetpairNumbers zoj 2773 Triangular Sums Time Limit: 1 Second Memory Limit: 32768 KB The nth Triangular number, T(n) = 1 + ... + n, is the sum of the first n integers. It is the number of points in a triangular array with n points on side. For e... IntegerinputeachdatasetoutputNumbers poj3211 Washing Clothes(01 가방 문제) Washing Clothes Dearboy was so busy recently that now he has piles of clothes to wash. The clothes are in varieties of colors but each piece of them can be seen as of only one color. In order to prevent the clothes from ... lessinputeachoutputcolorsNumbers POJ1775 문제 풀이 보고서...답답하다 Sum of Factorials Time Limit: 1000MS Memory Limit: 30000K Feb. 8, 1957, was a Hungarian-American mathematician who made important contributions to the foundations of mathematics, logic, quantum physics,meteorology, scien... IntegerinputeachbehaviorNumbers POJ 1142 Smith Numbers Smith Numbers Smith had the following peculiar property: The sum of the digits of that number was equal to the sum of the digits of the prime factors of that number. Smith's telephone number was 493-7775. The sum of all ... IntegeriteratorinputeachoutputNumbers magic square Magic Square Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu [Submit] [Go Back] [Status] Description If you have good observations skills, you may found that building a Magic Square is simple. A Mag... FileIntegerinputeach64bitNumbers HDOJ 1829 A Bug's Life 및 쿼드 세트 제목은 다음과 같습니다. Problem Description In his experiment, individual bugs and their interactions were easy to identify, because numbers were printed on their backs. Problem The first line of the input contains the number of s... inputeachoutputbugsbehaviorNumbers uva 357 - Let Me Count The Ways Let Me Count The Ways After making a purchase at a large department store, Mel's change was 17 cents. He received 1 dime, 1 nickel, and 2 pennies. Later that day, he was shopping at a convenience store. Again his change ... FileinputeachoutputNumberscombinations Poj 1837 Balance Some hooks are attached to these arms and Gigel wants to hang up some weights from his collection of G weights (1 <= G <= 20) knowing that these weights have distinct values in the range 1..25. Knowing the repartition of... eachhookoutputdistanceNumbersstructure 1274 The Perfect Stall//MaxMatch For the first week, Farmer John randomly assigned cows to stalls, but it quickly became clear that any given cow was only willing to produce milk in certain stalls. For the last week, Farmer John has been collecting data... IntegerinputeachoutputNumbers sgu 326 Perspective(최대 흐름) input: standard Being his advisor, you need to determine whether it's possible for your team to finish first in its division or not. Teams are grouped into divisions, some games are between the teams in the same division... OOinputeachoutputpairNumbers Power of Cryptography POJ2109 Power of Cryptography Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 11348 Accepted: 5847 Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among t... IntegerinputeachCryptographyoutputNumbers poj 1276 Cash Machine(다중 가방 + 배율) Cash Machine The machine is able to deliver appropriate @ bills for a requested cash amount. Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash ... lessinputeachn2outputNumbers POJ 1149 PIGS//MAXFLOW More precisely, the procedure is as following: the customer arives, opens all pig-houses to which he has the key, Mirko sells a certain number of pigs from all the unlocked pig-houses to him, and, if Mirko wants, he can ... piginputPatheachoutputNumbers zoj1039 Number Game 게임 + DP+ 상태 압축 Number Game Background Christiane and Matthias are playing a new game, the Number Game. The rules of the Number Game are: Christian and Matthias take turns in choosing integer numbers greater than or equal to 2. The play... listIntegerinputeachoutputNumbers POJ 3308 Paratroopers//최소 베기 Recently, the commanders of the Earth are informed by their spies that the invaders of Mars want to land some paratroopers in the m × n grid yard of one their main weapon factories in order to destroy it. column) and by ... SAPSystemeachoutputNumbersfiring sequence---더미 복습 Sequence Time Limit: 6000MS Memory Limit: 65536K Given m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers. It's clear that we may get n ^... IntegeriniinputeachoutputNumbers ZOJ 2587 Unique Attack은 최소 베기가 유일한지 여부를 판단합니다. A network has a simple topology: M different pairs of supercomputers are connected to each other by an optical fibre. That is, they want to know if there are no two different sets of fibre connections that can be destroy... structinputinsertNetWorkeachNumbers 더미 응용 프로그램: Sequence Sequence Time Limit:6000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2442 Description Given m sequences, each contains n non-negative integer. Now we may select one number from e... Integerinputeach64bitoutputNumbers 이전 기사 보기