Walking through the streets of Marshmallow City, Slastyona have spotted some merchants selling a kind of useless toy which is very popular nowadays – caramel spinner! Wanting to join the craze, she has immediately bought the strange contraption.
Spinners in Sweetland have the form of V-shaped pieces of caramel. Each spinner can, well, spin around an invisible magic axis. At a specific point in time, a spinner can take 4 positions shown below (each one rotated 90 degrees relative to the previous, with the fourth one followed by the first one):
After the spinner was spun, it starts its rotation, which is described by a following algorithm: the spinner maintains its position for a second then majestically switches to the next position in clockwise or counter-clockwise order, depending on the direction the spinner was spun in.
Slastyona managed to have spinner rotating for exactly n seconds. Being fascinated by elegance of the process, she completely forgot the direction the spinner was spun in! Lucky for her, she managed to recall the starting position, and wants to deduct the direction given the information she knows. Help her do this.
There are two characters in the first string – the starting and the ending position of a spinner. The position is encoded with one of the following characters: v (ASCII code 118, lowercase v), < (ASCII code 60), ^ (ASCII code 94) or > (ASCII code 62) (see the picture above for reference). Characters are separated by a single space.
In the second strings, a single number n is given (0 ≤ n ≤ 109) – the duration of the rotation.
It is guaranteed that the ending position of a spinner is a result of a n second spin in any of the directions, assuming the given starting position.
Output cw, if the direction is clockwise, ccw – if counter-clockwise, and undefined otherwise.
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { char ch1,ch2; int n; char a[4]; int i; cin >> ch1 >> ch2; cin >> n; if (ch1 == '^') { a[0] = '^'; a[1] = '>'; a[2] = 'v'; a[3] = '<'; } else if (ch1 == '>') { a[3] = '^'; a[0] = '>'; a[1] = 'v'; a[2] = '<'; } else if (ch1 == 'v') { a[2] = '^'; a[3] = '>'; a[0] = 'v'; a[1] = '<'; } else if (ch1 == '<') { a[1] = '^'; a[2] = '>'; a[3] = 'v'; a[0] = '<'; } int temp = n % 4; if (ch1 == ch2) printf("undefined "); else if ((a[temp] == ch2) && (a[4 - temp] != ch2)) { printf("cw "); } else if ((a[temp] != ch2) && (a[4 - temp] == ch2)) { printf("ccw "); } else printf("undefined "); }
It's the end of July – the time when a festive evening is held at Jelly Castle! Guests from all over the kingdom gather here to discuss new trends in the world of confectionery. Yet some of the things discussed here are not supposed to be disclosed to the general public: the information can cause discord in the kingdom of Sweetland in case it turns out to reach the wrong hands. So it's a necessity to not let any uninvited guests in.
There are 26 entrances in Jelly Castle, enumerated with uppercase English letters from A to Z. Because of security measures, each guest is known to be assigned an entrance he should enter the castle through. The door of each entrance is opened right before the first guest's arrival and closed right after the arrival of the last guest that should enter the castle through this entrance. No two guests can enter the castle simultaneously.
For an entrance to be protected from possible intrusion, a candy guard should be assigned to it. There are k such guards in the castle, so if there are more than k opened doors, one of them is going to be left unguarded! Notice that a guard can't leave his post until the door he is assigned to is closed.
Slastyona had a suspicion that there could be uninvited guests at the evening. She knows the order in which the invited guests entered the castle, and wants you to help her check whether there was a moment when more than k doors were opened.
Two integers are given in the first string: the number of guests n and the number of guards k (1 ≤ n ≤ 106, 1 ≤ k ≤ 26).
In the second string, n uppercase English letters s1s2... sn are given, where si is the entrance used by the i-th guest.
Output "YES" if at least one door was unguarded during some time, and "NO" otherwise.
You can output each letter in arbitrary case (upper or lower).
#include<iostream>
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { int n,k,i,j; char str[1000050]; int a[150]; bool vis[150]; bool f = false; scanf("%d%d",&n,&k); scanf("%s",str); memset(a,0,sizeof(a)); memset(vis,0,sizeof(vis)); for (i = 0;i < n;i++) a[str[i]]++; for (i = 0;i < n;i++) { if (!vis[str[i]]) { if (!k) { f = true; break; } k--; vis[str[i]] = true; } a[str[i]]--; if (!a[str[i]]) k++; } if (f) printf("YES "); else printf("NO "); }
Slastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.
The game consists of multiple rounds. Its rules are very simple: in each round, a natural number k is chosen. Then, the one who says (or barks) it faster than the other wins the round. After that, the winner's score is multiplied by k2, and the loser's score is multiplied by k. In the beginning of the game, both Slastyona and Pushok have scores equal to one.
Unfortunately, Slastyona had lost her notepad where the history of all n games was recorded. She managed to recall the final results for each games, though, but all of her memories of them are vague. Help Slastyona verify their correctness, or, to put it another way, for each given pair of scores determine whether it was possible for a game to finish with such result or not.
Input
In the first string, the number of games n (1 ≤ n ≤ 350000) is given.
Each game is represented by a pair of scores a, b (1 ≤ a, b ≤ 109) – the results of Slastyona and Pushok, correspondingly.
Output
For each pair of scores, answer "Yes" if it's possible for a game to finish with given score, and "No" otherwise.
You can output each letter in arbitrary case (upper or lower).
Example