Igor K. always used to trust his favorite Kashpirovsky Antivirus. That is why he didn't hesitate to download the link one of his groupmates sent him via QIP Infinium. The link was said to contain "some real funny stuff about swine influenza". The antivirus had no objections and Igor K. run the flash application he had downloaded. Immediately his QIP Infinium said: "invalid login/password".
Igor K. entered the ISQ from his additional account and looked at the info of his main one. His name and surname changed to "H1N1" and "Infected" correspondingly, and the "Additional Information" field contained a strange-looking binary code 80 characters in length, consisting of zeroes and ones. "I've been hacked" — thought Igor K. and run the Internet Exploiter browser to quickly type his favourite search engine's address.
Soon he learned that it really was a virus that changed ISQ users' passwords. Fortunately, he soon found out that the binary code was actually the encrypted password where each group of 10 characters stood for one decimal digit. Accordingly, the original password consisted of 8 decimal digits.
Help Igor K. restore his ISQ account by the encrypted password and encryption specification.
The input data contains 11 lines. The first line represents the binary code 80 characters in length. That is the code written in Igor K.'s ISQ account's info. Next 10 lines contain pairwise distinct binary codes 10 characters in length, corresponding to numbers 0, 1, ..., 9.
Print one line containing 8 characters — The password to Igor K.'s ISQ account. It is guaranteed that the solution exists.
水题，斟酌了半天，找了个string类函数过了。
string的子串：
string substr(int pos = 0,int n = npos) const;//返回pos开始的n个字符组成的字符串#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
using namespace std;
const int maxn=1000+5;
int main()
{
string s,ss;
map<string,int>q;
cin>>s;
//getchar();
for(int i=0;i<=9;i++){
cin>>ss;
q[ss]=i;
}
for(int i=0;s[i];i+=10)
{
ss=s.substr(i,10);
//cout<<ss<<endl;
cout<<q[ss];
}
cout<<endl;
return 0;
}One day Igor K. stopped programming and took up math. One late autumn evening he was sitting at a table reading a book and thinking about something.
The following statement caught his attention: "Among any six people there are either three pairwise acquainted people or three pairwise unacquainted people"
Igor just couldn't get why the required minimum is 6 people. "Well, that's the same for five people, too!" — he kept on repeating in his mind. — "Let's take, say, Max, Ilya, Vova — here, they all know each other! And now let's add Dima and Oleg to Vova — none of them is acquainted with each other! Now, that math is just rubbish!"
Igor K. took 5 friends of his and wrote down who of them is friends with whom. Now he wants to check whether it is true for the five people that among them there are either three pairwise acquainted or three pairwise not acquainted people.
The first line contains an integer m (0 ≤ m ≤ 10), which is the number of relations of acquaintances among the five friends of Igor's.
Each of the following m lines contains two integers ai and bi (1 ≤ ai, bi ≤ 5;ai ≠ bi), where (ai, bi) is a pair of acquainted people. It is guaranteed that each pair of the acquaintances is described exactly once. The acquaintance relation is symmetrical, i.e. if x is acquainted with y, then y is also acquainted with x.
Print "FAIL", if among those five people there are no either three pairwise acquainted or three pairwise unacquainted people. Otherwise print "WIN".
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <map>
#include <iostream>
using namespace std;
const int maxn=1000+5;
int hash[maxn];
int main()
{
int n;
cin>>n;
memset(hash,0,sizeof(hash));
for(int i=0;i<n;i++){
int u,v;
cin>>u>>v;
hash[u]++;hash[v]++;
}
bool flag=true;
for(int i=1;i<=5;i++)
if(hash[i]!=2) flag=false;
if(flag) cout<<"FAIL";
else cout<<"WIN";
return 0;Throughout Igor K.'s life he has had many situations worthy of attention. We remember the story with the virus, the story of his mathematical career and of course, his famous programming achievements. However, one does not always adopt new hobbies, one can quit something as well.
This time Igor K. got disappointed in one of his hobbies: editing and voicing videos. Moreover, he got disappointed in it so much, that he decided to destroy his secret archive for good.
Igor K. use Pindows XR operation system which represents files and folders by small icons. At that, m icons can fit in a horizontal row in any window.
Igor K.'s computer contains n folders in the D: disk's root catalog. The folders are numbered from 1 to n in the order from the left to the right and from top to bottom (see the images). At that the folders with secret videos have numbers from a to b inclusive. Igor K. wants to delete them forever, at that making as few frame selections as possible, and then pressing Shift+Delete exactly once. What is the minimum number of times Igor K. will have to select the folder in order to select folders from a to b and only them? Let us note that if some selected folder is selected repeatedly, then it is deselected. Each selection possesses the shape of some rectangle with sides parallel to the screen's borders.
The only line contains four integers n, m, a, b (1 ≤ n, m ≤ 109, 1 ≤ a ≤ b ≤ n). They are the number of folders in Igor K.'s computer, the width of a window and the numbers of the first and the last folders that need to be deleted.
Print a single number: the least possible number of times Igor K. will have to select the folders using frames to select only the folders with numbers from a to b.
特判的情况较多。
1.m=1时显然次数最小值为1.
2.b=n时特判：如果a在第一列或者a,b同行，次数为1，否则次数为2
3.所有a在第1列，b在最后一列的情况下或a,b同行，最小次数都是1.
4.a在第一列或b在最后一列或者a,b的列相邻(对角的两个矩形)或者a,b所在行相邻则次数为2
5.剩下的次数都是3.
#include <cstdio>
#include <iostream>
using namespace std;
const int maxn =1000+5;
int main()
{
long long n,m,a,b;
cin>>n>>m>>a>>b;
int st=a/m+(a%m!=0);int ed=b/m+(b%m!=0);
if(m==1){
cout<<1;
return 0;
}
if(b==n){
if(a%m==1||st==ed) cout<<1;
else cout<<2;
return 0;
}
if((a%m==1&&b%m==0)||st==ed) {cout<<1;return 0;}
if(a%m==1||b%m==0||st+1==ed||(b+1)%m==a%m) cout<<2;
else cout<<3;
return 0;
}
扫一扫
1536
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
