New Year Camera Frames 1.00
Use our New Year Frames to spice your photos with 100 photo effects, 50 stickers and messages.You can share your memories with friends and family on social apps like Whatsapp, Twitter, G , Facebook, hike, Line, Wechat and others.You can save or share the final photo.Unique features:1. All work in single screen.2. Full view canvas.3. Share stickers to social apps.4. Share Quotes to social apps.5. Set Photo as wallpaper.6. Quotes to choose fROM.Help:1. User can set any image as background, just touch on background (curtain) icon.2. Messages can be personalize by handwriting messages, to do this just touch on signature icon. Message can be undone also.3. User can apply effects to image such as sketch, touch on star icon.4. Messages can be put in different fonts and colors, touch on T icon.5. Sticker can be applied on image, touch on rose icon.This app can be used as 1. New Year photo collage2. Photo Effects3. New Year p
using namespace std;
As meticulous Gerald sets the table and caring Alexander sends the postcards, Sergey makes snowmen. Each showman should consist of three snowballs: a big one, a medium one and a small one. Sergey's tw...
Bob programmed a robot to navigate through a 2d maze.The maze has some obstacles. Empty cells are denoted by the character '.', where obstacles are denoted by '#'.There is a single robot in the maze. ...
这是我从ORACLE官方网站上看到的SQL语句,执行的时候竟然提示:ERROR 位于第 1 行:rnORA-01843: 无效的月份rnrn但是,官方网站上给的运行结果是:rnTRUNC (date function)rnSyntaxrnPurposernTRUNC returns d with the time portion of the day truncated to the unit specified byrnthe format model fmt. If you omit fmt, d is truncated to the nearest day.rnSee Also: "ROUND and TRUNC Date Functions" on page 4-127rnfor the permitted format models to use in fmtNew YearrnExamplernSELECT TRUNC(TO_DATE(’27-OCT-92’,’DD-MON-YY’), ’YEAR’)rn"New Year" FROM DUAL;rnNew Yearrn---------rn01-JAN-92rnrn到底这个函数是啥意思呀?
In the land of Eden, all phone conversations are <em>happy</em> ones. People complaining on the phone are immediately put in jail. To enforce this law, the police taps all phone conversations.nnnThe police wants to hire the approriate number of operators to listen to all conversations in a given period of time. Unfortunately, each of their operators can listen to one conversation only before needing a really long break to rest from the effort.nnAs a contractor of the police department, you have been asked to provide a program capable of determining the required number of operators. If the program does not work correctly, you will be put in jail as well, along with all the un<em>happy</em> complainers. Do you really want to end up there?nnInputnnEach test case starts with two integers denoting the number of phone calls N (1 ≤ N < 10000) and the number of intervals M (1 ≤ M < 100). This is followed by N lines describing the telephone calls, each one consisting of four integers Source, Destination, Start and Duration. Source and Destination identify the pair of telephone numbers establishing the connection (0 ≤ Source, Destination ≤ 10000000). Start and Duration are the start time and duration of the call in seconds (1 ≤ Duration ≤ 10000 and Start ≥ 0). You can safely assume that the sum of Start and Duration fits into a 32-bit signed integer.nnAfterwards follow M lines containing the time intervals the police are interested in, each on described by two integers Start and Duration, in the same format and with the same meaning and constraints as those in the telephone calls. The last test case is represented by N = M = 0 and must not be processed.nnOutputnnFor each of the M intervals of each test case, print the number of calls that are active during at least one second of the interval.nnSample Inputnn3 2n3 4 2 5n1 2 0 10n6 5 5 8n0 6n8 2n1 2n8 9 0 10n9 1n10 1n0 0nSample Outputnn3n2n1n0n
Problem DescriptionnToday is Gorwin’s birthday. So her mother want to realize her a wish. Gorwin says that she wants to eat many cakes. Thus, her mother takes her to a cake garden. nnThe garden is splited into n*m grids. In each grids, there is a cake. The weight of cake in the i-th row j-th column is wij kilos, Gorwin starts from the top-left(1,1) grid of the garden and walk to the bottom-right(n,m) grid. In each step Gorwin can go to right or down, i.e when Gorwin stands in (i,j), then she can go to (i+1,j) or (i,j+1) (However, she can not go out of the garden). nnWhen Gorwin reachs a grid, she can eat up the cake in that grid or just leave it alone. However she can’t eat part of the cake. But Gorwin’s belly is not very large, so she can eat at most K kilos cake. Now, Gorwin has stood in the top-left grid and look at the map of the garden, she want to find a route which can lead her to eat most cake. But the map is so complicated. So she wants you to help her.n nnInputnMultiple test cases (about 15), every case gives n, m, K in a single line.nnIn the next n lines, the i-th line contains m integers wi1,wi2,wi3,⋯wim which describes the weight of cakes in the i-th rownnPlease process to the end of file.nn[Technical Specification]nnAll inputs are integers.nn1<=100n nnOutputnFor each case, output an integer in an single line indicates the maximum weight of cake Gorwin can eat.n nnSample Inputn1 1 2n3n2 3 100n1 2 3n4 5 6n nnSample Outputn0n16
Problem DescriptionnNo matter you know me or not. Bless you <em>happy</em> in 2009.n nnInputnThe input contains multiple test cases.nEach test case included one string. There are made up of ‘a’-‘z’ or blank. The length of string will not large than 10000. n nnOutputnFor each test case tell me how many times “<em>happy</em>” can be constructed by using the string. Forbid to change the position of the characters in the string. The answer will small than 1000.n nnSample Inputnhopppayppy <em>happy</em>nhapp acm ynha<em>happy</em>ppyn nnSample Outputn2n1n2n
Do you know Utopia? It's a perfect world in which everyone leads a <em>happy</em> life.nnA fairy wants to make a naive Utopia City. She studies the factors that have an impact on people's happiness and thinks that a person is <em>happy</em> if and only if all other persons' total "influence factor" on him (or her) is nonnegative. Each person has an influence factor on another person, which may be a positive integer or negative integer or 0. The influence factor is always symmetric, that is, if person A has an influence factor f on person B, it means that person B also has an "influence factor" f on A. So we can say the influence factor between person A and B is f without confusion. A person's influence factor on himself (or herself) is always 0. So let f(i, j) be the influence factor between person i and person j and person i's happiness(i) is well defined as follows:nnnnObviously there may be some persons who are not <em>happy</em>. Though the fairy cannot change any influence factor, she can give every person a property p(i) which is always +1 or -1. Under the fairy's magical definition, a person i's happiness(i)' is redefined as follow:nnnnPerson i feels <em>happy</em> if the value of happiness(i)' is nonnegative. But the fairy wonders whether she can give everyone a property to make all of them <em>happy</em> so that she can build her ideal naive Utopia successfully.nnSince you're an ace programmer, the fairy asks you to help her to fulfill her dream. Can you help her?nnInputnnThe input contains multiple test cases!nnEach test case starts with an integer N (2 < f(i,j) < 1000).nnProceed to the End Of File (EOF).nnOutputnnFor each test case, if the fairy fails, output a single line with "No" (without the quotations), otherwise output "Yes" (without the quotations) in the first line, followed by N lines, each line contains exactly a "+" (without the quotations) or a "-"(without the quotations) to indicate that the fairy should give the i-th person property +1 or -1 to fulfill her dream.nnSample Inputnn3n0 1 3n1 0 -1n3 -1 0n2n0 -10n-10 0nSample OutputnnYesn-n+n-nYesn+n-