- #include <bits/stdc++.h>
- using namespace std;
- int s, t;
- int p[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29
- , 31, 37, 41, 43, 47, 53, 59, 61, 67, 71
- , 73, 79, 83, 89, 97, 101, 103, 107, 109, 113
- , 127, 131, 137, 139, 149, 151, 157, 163, 167, 173
- , 179, 181, 191, 193, 197, 199, 211, 223, 227, 229
- , 233, 239, 241, 251, 257, 263, 269, 271, 277, 281
- , 283, 293, 307, 311, 313, 317, 331, 337, 347, 349
- , 353, 359, 367, 373, 379, 383, 389, 397, 401, 409
- , 419, 421, 431, 433, 439, 443, 449, 457, 461, 463
- , 467, 479, 487, 491, 499, 503, 509, 521, 523, 541
- , 547, 557, 563, 569, 571, 577, 587, 593, 599, 601
- , 607, 613, 617, 619, 631, 641, 643, 647, 653, 659
- , 661, 673, 677, 683, 691, 701, 709, 719, 727, 733
- , 739, 743, 751, 757, 761, 769, 773, 787, 797, 809
- , 811, 821, 823, 827, 829, 839, 853, 857, 859, 863
- , 877, 881, 883, 887, 907, 911, 919, 929, 937, 941
- , 947, 953, 967, 971, 977, 983, 991, 997,1009};
- int visited[1005];
- int bfs(){
- list< pair<int,int> > q;
- q.push_back(make_pair(s, 0));
- while(!q.empty()){
- int source = q.front().first;
- int dist = q.front().second;
- visited[source] = 1;
- q.pop_front();
- if(source == t){
- return dist;
- }
- for(int i = 0; source+p[i]<=t; i++){
- if((source+p[i] == t )&& (source%p[i] == 0)&& (source != p[i])){
- return dist+1;
- }
- else if((!visited[source+p[i]])&& (source%p[i] == 0) && (source!= p[i])){
- q.push_back(make_pair(source+p[i], dist+1));
- }
- }
- }
- return -1;
- }
- int main()
- {
- int ts;
- cin>>ts;
- for(int i = 1; i <= ts; i++){
- cin>>s>>t;
- memset(visited, 0, sizeof(visited));
- cout<<"Case "<<i<<": "<<bfs()<<endl;
- }
- }
Thursday 27 July 2017
Lightoj 1141 - Number Transformation
Subscribe to:
Post Comments (Atom)
Most Featured Post
Lightoj 1159 - Batman
http://lightoj.com/volume_showproblem.php?problem=1159 problem analysis: First i thought of this as if s1, s2 and s3 are those three str...
-
Problem link: Problem Analysis: It is actually a basic Bisection problem , as we can see here we can not actually find a formula fo...
-
http://lightoj.com/volume_showproblem.php?problem=1382 Problem analysis: This is a rare problem i wrote about so far. After much strugg...
No comments:
Post a Comment