#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include //#include //#include //#include //#include //#include //#include //#include //#include //#if __cplusplus >= 201103L //#include //#include //#include //#include // //#define cauto const auto& //#else //#endif using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; typedef vector vint; typedef vector > vvint; typedef vector vll, vLL; typedef vector > vvll, vvLL; #define VV(T) vector > template void initvv(vector > &v, int a, int b, const T &t = T()){ v.assign(a, vector(b, t)); } template void convert(const F &f, T &t){ stringstream ss; ss << f; ss >> t; } #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define reep(i,a,b) for(int i=(a);i<(b);++i) #define rep(i,n) reep((i),0,(n)) #define ALL(v) (v).begin(),(v).end() #define PB push_back #define F first #define S second #define mkp make_pair #define RALL(v) (v).rbegin(),(v).rend() #define DEBUG #ifdef DEBUG #define dump(x) cout << #x << " = " << (x) << endl; #define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; #else #define dump(x) #define debug(x) #endif #define LDcout(x,n) fixed<>d; vll v(3); rep(i,3) cin>>v[i]; vint p(3); rep(i,3){ p[i]=i; } if(d==0){ set se; rep(i,3){ se.insert(v[i]); } if(se.size()!=3){ cout<<-1<v[1]&&v[1]v[2]){ cout<<0<tmp[1]-d*100) break; tans+=100; tmp[1]-=d*100; // cout<tmp[1]) break; tans++; tmp[1]-=d; } if(tmp[1]<=0) continue; while(1){ if(tmp[1]>tmp[0]-d*100) break; tans+=100; tmp[0]-=d*100; } rep(i,110){ if(tmp[1]>tmp[0]) break; tans++; tmp[0]-=d; } if(tmp[0]<0) continue; ans=min(ans,tans); }while(next_permutation(ALL(p))); if(ans==INFL) ans=-1; cout<