pair POJ 3100 Root of the Problem (내 수제의 길 - A^N을 취하여 B에 가장 가까운 A) Time Limit: 1000MS Memory Limit: 65536K Given positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that AN may be less than... Integerinputeachoutputpairmath.h pku 2231 Moo Volume 선형 방법구sig(sig|a[i]-a[j]|) Moo Volume Time Limit: 1000MS Memory Limit: 65536K FJ's N cows (1 <= N <= 10,000) all graze at various locations on a long one-dimensional pasture. The cows are very chatty animals. Every pair of cows simultaneously carr... iniinputeachoutputpairdistance POJ 2013 Symmetric Order(내 수제의 길 - 짝짓기 출력) Time Limit: 1000MS Memory Limit: 30000K In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by ... listIntegerinputeachoutputpair POJ 3300 Tour de France At any time the chain connects one of the front sprockets to one of the rear sprockets. The drive ratio -- the ratio of the angular velocity of the pedals to that of the wheels -- is n : m where n is the number of teeth ... velocityinputeachfloatoutputpair poj3713(무방향도 3연통 여부 판단) Transferring Sylla Time Limit: 5000MS Memory Limit: 65536K After recapturing Sylla, the Company plans to establish a new secure system, a transferring net! The Company staff choose N cities around the nation which are co... SecuritySysteminputeachoutputpair Oulipo 모드 일치 문제 Oulipo The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: Tout avait Pair normal, mais tout s’affirmait faux... StringFileinputeachoutputpair poj2599 A funny game---그림의 sg There are several airports in one country, and there are flights between some of them. A player mines an airport, chooses a flight and flies away together with his colleague. Given an initial list of flights and the numb... vectorlistinputeachpairNumbers POJ 1488 TEX Quotes(내 워터프루프-폭수, 문자 변환) Beautiful documents use double-left-quote and double-right-quote to delimit quotations, rather than the mundane "which is what is provided by most keyboards. Keyboards typically do not have an oriented double-quote, but ... inputeachnestedkeyboardoutputpair poj 2540 Hotter Colder(선형 계획 가능 영역) Hotter Colder Time Limit: 1000MS Memory Limit: 65536K The children's game Hotter Colder is played as follows. Player A leaves the room while player B hides an object somewhere in the room. Player A re-enters at position ... vectorobjectHPeachoutputpair 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 【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 poj3417(LCA 어플리케이션) Formally, there are N nodes in SN's network, N-1 bidirectional channels to connect the nodes, and there always exists a route from any node to another. In order to protect the network from the attack, Yixght builds M new... 도론RMQ&LCAnetworkpairintegerinputmanagereach 10010 - Where's Waldorf? A word matches a straight, uninterrupted line of letters in the grid. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters are to be treated as the same). The next m lines contai... listIntegerinputeachoutputpair poj3694 (구교+LCA 문제) Each of the following M lines contains two integers A and B ( 1≤ A ≠ B ≤ N), which indicates a link between computer A and B. The next line contains a single integer Q ( 1 ≤ Q ≤ 1,000), which is the number of new links t... IntegerinputNetWorkeachoutputpair 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 1118 Lining Up Lining Up Time Limit: 2000MS Memory Limit: 32768K "How am I ever going to solve this problem?"said the pilot. Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dang... Integeriniinputeachoutputpair uva 10020 - Minimal coverage Minimal coverage Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover the segment [0,M]. The first line is the number of... Integerinputeachoutputpair POJ 1828 Monkeys'Pride(이 TLE 제목)-from lanshui_Yang There are a lot of monkeys in a mountain. Every one wants to be the monkey king. It is your task to help them solve this problem. Monkeys live in different places of the mountain. Let a point (x, y) in the X-Y plane deno... 생활inputeachoutputpair hust 1024(2분 + 최대 흐름) Time Limit: 2 Sec Memory Limit: 128 MB You are organizing a dance party. The party will be attended by n boys and n girls. You are given the each pairs of boys and girls who agree to dance with each other .Find out the m... IntegerOOinputeachoutputpair poj--3349--Snowflake Snow Snowflakes(폭력) Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18980 Accepted: 4926 Description You may have heard that no two snowflakes are alike. Your task is to write a program to determine whet... Integerlesssearchinputeachpair Crazy tea party Grade: 10/Discount: 0.8 Time Limit:1000MS Memory Limit:65536K Description n participants of << crazy tea party >> sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in... Integerinputeachoutputpair VK Cup 2012 Qualification Round 1 ( E Phone Talks) If somebody calls him while he hasn't finished the previous conversation, Mr. Jackson puts the new call on hold in the queue. If Mr. Jackson started the call at the second t, and the call continues for d seconds, then Mr... inputeachoutputpair Find the top k sums of two sorted arrays I am looking for a solution involving either a min heap or a max heap. But to even consider pair (i, j) we need to have both (i-1, j) and (i, j-1) already selected, because they both are greater or equal than (i, j... Arraysinserteachideapair 2446 Chessboard//MaxMatch Alice and Bob often play games on chessboard. She wants Bob to use a lot of cards with size 1 * 2 to cover the board. However, she thinks it too easy to bob, so she makes some holes on the board (as shown in the figure b... inputeachoutputpair FOJ 1000 PKU 1000 FJNU 1000 A+B Problem Calculate a + b InputThe input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line. OutputFor each pair of input integers a and b you should output the sum of a and b... inputeachoutputpair uva340 - Master-Mind Hints In order to break the code, Breaker makes a number of guesses, each guess itself being a code. After each guess Designer gives a hint, stating to what extent the guess matches his secret code. In this problem you will be... inputeachoutputpaircolorsNumbers boj 220(상태 압축 DP) They have decided which place to start their tourism and in which order to visit these places. However, anyone can leave halfway during the tourism and will never back to the tourism again if he or she is not interested ... inputeachoutputpairNumbers joj1113 TIME Limit The next h lines describe the contents of the board; each of these lines contains exactly w characters: a ``X'' if there is a game piece at this location, and a space if there is no game piece. Each descriptio... propertiesinputPatheachoutputpair 이전 기사 보기
POJ 3100 Root of the Problem (내 수제의 길 - A^N을 취하여 B에 가장 가까운 A) Time Limit: 1000MS Memory Limit: 65536K Given positive integers B and N, find an integer A such that AN is as close as possible to B. (The result A is an approximation to the Nth root of B.) Note that AN may be less than... Integerinputeachoutputpairmath.h pku 2231 Moo Volume 선형 방법구sig(sig|a[i]-a[j]|) Moo Volume Time Limit: 1000MS Memory Limit: 65536K FJ's N cows (1 <= N <= 10,000) all graze at various locations on a long one-dimensional pasture. The cows are very chatty animals. Every pair of cows simultaneously carr... iniinputeachoutputpairdistance POJ 2013 Symmetric Order(내 수제의 길 - 짝짓기 출력) Time Limit: 1000MS Memory Limit: 30000K In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by ... listIntegerinputeachoutputpair POJ 3300 Tour de France At any time the chain connects one of the front sprockets to one of the rear sprockets. The drive ratio -- the ratio of the angular velocity of the pedals to that of the wheels -- is n : m where n is the number of teeth ... velocityinputeachfloatoutputpair poj3713(무방향도 3연통 여부 판단) Transferring Sylla Time Limit: 5000MS Memory Limit: 65536K After recapturing Sylla, the Company plans to establish a new secure system, a transferring net! The Company staff choose N cities around the nation which are co... SecuritySysteminputeachoutputpair Oulipo 모드 일치 문제 Oulipo The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book: Tout avait Pair normal, mais tout s’affirmait faux... StringFileinputeachoutputpair poj2599 A funny game---그림의 sg There are several airports in one country, and there are flights between some of them. A player mines an airport, chooses a flight and flies away together with his colleague. Given an initial list of flights and the numb... vectorlistinputeachpairNumbers POJ 1488 TEX Quotes(내 워터프루프-폭수, 문자 변환) Beautiful documents use double-left-quote and double-right-quote to delimit quotations, rather than the mundane "which is what is provided by most keyboards. Keyboards typically do not have an oriented double-quote, but ... inputeachnestedkeyboardoutputpair poj 2540 Hotter Colder(선형 계획 가능 영역) Hotter Colder Time Limit: 1000MS Memory Limit: 65536K The children's game Hotter Colder is played as follows. Player A leaves the room while player B hides an object somewhere in the room. Player A re-enters at position ... vectorobjectHPeachoutputpair 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 【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 poj3417(LCA 어플리케이션) Formally, there are N nodes in SN's network, N-1 bidirectional channels to connect the nodes, and there always exists a route from any node to another. In order to protect the network from the attack, Yixght builds M new... 도론RMQ&LCAnetworkpairintegerinputmanagereach 10010 - Where's Waldorf? A word matches a straight, uninterrupted line of letters in the grid. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters are to be treated as the same). The next m lines contai... listIntegerinputeachoutputpair poj3694 (구교+LCA 문제) Each of the following M lines contains two integers A and B ( 1≤ A ≠ B ≤ N), which indicates a link between computer A and B. The next line contains a single integer Q ( 1 ≤ Q ≤ 1,000), which is the number of new links t... IntegerinputNetWorkeachoutputpair 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 1118 Lining Up Lining Up Time Limit: 2000MS Memory Limit: 32768K "How am I ever going to solve this problem?"said the pilot. Indeed, the pilot was not facing an easy task. She had to drop packages at specific points scattered in a dang... Integeriniinputeachoutputpair uva 10020 - Minimal coverage Minimal coverage Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cover the segment [0,M]. The first line is the number of... Integerinputeachoutputpair POJ 1828 Monkeys'Pride(이 TLE 제목)-from lanshui_Yang There are a lot of monkeys in a mountain. Every one wants to be the monkey king. It is your task to help them solve this problem. Monkeys live in different places of the mountain. Let a point (x, y) in the X-Y plane deno... 생활inputeachoutputpair hust 1024(2분 + 최대 흐름) Time Limit: 2 Sec Memory Limit: 128 MB You are organizing a dance party. The party will be attended by n boys and n girls. You are given the each pairs of boys and girls who agree to dance with each other .Find out the m... IntegerOOinputeachoutputpair poj--3349--Snowflake Snow Snowflakes(폭력) Snowflake Snow Snowflakes Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18980 Accepted: 4926 Description You may have heard that no two snowflakes are alike. Your task is to write a program to determine whet... Integerlesssearchinputeachpair Crazy tea party Grade: 10/Discount: 0.8 Time Limit:1000MS Memory Limit:65536K Description n participants of << crazy tea party >> sit around the table. Each minute one pair of neighbors can change their places. Find the minimum time (in... Integerinputeachoutputpair VK Cup 2012 Qualification Round 1 ( E Phone Talks) If somebody calls him while he hasn't finished the previous conversation, Mr. Jackson puts the new call on hold in the queue. If Mr. Jackson started the call at the second t, and the call continues for d seconds, then Mr... inputeachoutputpair Find the top k sums of two sorted arrays I am looking for a solution involving either a min heap or a max heap. But to even consider pair (i, j) we need to have both (i-1, j) and (i, j-1) already selected, because they both are greater or equal than (i, j... Arraysinserteachideapair 2446 Chessboard//MaxMatch Alice and Bob often play games on chessboard. She wants Bob to use a lot of cards with size 1 * 2 to cover the board. However, she thinks it too easy to bob, so she makes some holes on the board (as shown in the figure b... inputeachoutputpair FOJ 1000 PKU 1000 FJNU 1000 A+B Problem Calculate a + b InputThe input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line. OutputFor each pair of input integers a and b you should output the sum of a and b... inputeachoutputpair uva340 - Master-Mind Hints In order to break the code, Breaker makes a number of guesses, each guess itself being a code. After each guess Designer gives a hint, stating to what extent the guess matches his secret code. In this problem you will be... inputeachoutputpaircolorsNumbers boj 220(상태 압축 DP) They have decided which place to start their tourism and in which order to visit these places. However, anyone can leave halfway during the tourism and will never back to the tourism again if he or she is not interested ... inputeachoutputpairNumbers joj1113 TIME Limit The next h lines describe the contents of the board; each of these lines contains exactly w characters: a ``X'' if there is a game piece at this location, and a space if there is no game piece. Each descriptio... propertiesinputPatheachoutputpair 이전 기사 보기