Submission #213695

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<ctime>
#include<complex>
using namespace std;
#define M_PI 3.141592653589793238
#define EPS 1e-9
#define INF 1e30
#define P complex<long double>
static const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
long double ccw(long double kari,long double kari1,long double kari2,long double kari3){  //内積
	return kari*kari3-kari1*kari2;
}
long long int oneday(int year,int month,int day){  //1年1月1日からの、経過日数
	return 365+(year/4)-(year/100)+(year/400)+(306*(month+1)/10)+day-429;
}
/*宣言*/
int flag[10];
int main(){
	memset(flag,-1,sizeof(flag) );
	int a=0;
	int b=0;
	cin>>a>>b;
	flag[a]=1;
	queue<int> q;
	q.push(a);
	while(!q.empty()){
		int kari=q.front();
		q.pop();
		if(kari==9){
			if(flag[0]==-1){
				flag[0]=flag[kari]+1;
				q.push(kari);
			}
		}else{
			if(flag[kari+1]==-1){
				flag[kari+1]=flag[kari]+1;
				q.push(kari+1);
			}
		}
		if(kari==0){
			if(flag[9]==-1){
				flag[9]=flag[kari]+1;
				q.push(kari);
			}
		}else{
			if(flag[kari-1]==-1){
				flag[kari-1]=flag[kari]+1;
				q.push(kari-1);
			}
		}
	}
	cout<<flag[b]<<endl;
	cin.get();
	cin.get();
	return 0;
}

Submission Info

Compile Error

./Main.cpp:22:0: warning: "M_PI" redefined [enabled by default]
/usr/include/math.h:367:0: note: this is the location of the previous definition

Judge Result