#include <iostream> #include <cstdio> #include <cstdio> #include <cstring> #include <vector> #include <cmath> #include <cstdlib> #define INF 1000000 #define ll long long using namespace std; int main() { int t,kase=1; double r,len,width; double up_left_x,up_left_y,up_right_x,up_right_y,lo_right_x,lo_right_y,lo_left_x,lo_left_y; scanf("%d",&t); while(t–) { scanf("%lf",&r); len = r/.2; width = len*.6; up_left_x = (-len)*.45; up_left_y = width/2; up_right_x = (len)*.55; up_right_y = width/2;
Category: Ad Hoc
11715
#include <iostream> #include <cstdio> #include <cstdio> #include <cstring> #include <vector> #include <cmath> #include <cstdlib> #define INF 1000000 #define ll long long using namespace std; int main() { int kase=1; int n; double u,v,t,a,s; while(scanf("%d",&n),n) { if(n==1) { scanf("%lf%lf%lf",&u,&v,&t); a = (v-u)/t; s=u*t+.5*a*(t*t); printf("Case %d: %.3lf %.3lf\n",kase++,s,a); } else if(n==2) { scanf("%lf%lf%lf",&u,&v,&a); t = (v-u)/a; s=u*t+.5*a*(t*t);
11428
#include <iostream> #include <cstdio> #include <cstdio> #include <cstring> #include <vector> #include <cmath> #include <cstdlib> #define INF 1000000 #define ll long long using namespace std; struct node{ int x,y; }; node arr[10005]; int main() { int n,diff; int difference_arr[10005]; for(int i=2;i<61;i++) { for(int j=1;j<i;j++) { diff = i*i*i – j*j*j; if(diff>10001) continue; difference_arr=1; if(arr.x==0 || arr.y==0)
10101
#include <iostream> #include <cstdio> #include <cstdio> #include <cstring> #include <vector> #include <cmath> #include <cstdlib> #define INF 1000000 #define ll long long using namespace std; string ans; int i=0; void check() { if(ans.size()) ans.append(1u,' '); } void banglaNumb(string s) { int len = s.size(); if(len>=8) { check(); ans.append(1u,s[i++]); ans.append(" kuti"); } if(len>=7) { if(s[i]!='0') { check();
11824
#include <iostream> #include <cstdio> #include <cstdio> #include <cstring> #include <vector> #include <cmath> #include <cstdlib> #include <algorithm> #define LMT 5000000 #define ll long long using namespace std; bool cmp(int a,int b) { return a>b; } ll _pow(int a,int p) { ll ans=1; while(p–) { ans=ans*a; if(ans>=LMT) return LMT; } return ans; } int main() { vector<int>
10188
#include <iostream> #include <cstdio> #include <cstdio> #include <cstring> #include <string> #include <vector> #include <cmath> #include <cstdlib> using namespace std; string s,ans; string str,str1; int n,m; bool accept() { if(n!=m) return 0; if(str==str1) return 1; return 0; } bool presentation() { string num1="",num2=""; for(int i=0;i<str.size();i++) { if(isdigit(str[i])) num1.append(1u,str[i]); } for(int i=0;i<str1.size();i++) { if(isdigit(str1[i])) num2.append(1u,str1[i]); } if(num1==num2)
11917
#include <iostream> #include <cstdio> #include <sstream> #include <string> #include <map> using namespace std; int main() { int t,n,d,D; scanf("%d",&t); string sub,s; int kase=1,res; while(t–) { scanf("%d",&n); map<string,int> mp; for(int i=1;i<=n;i++) { cin>>s; scanf("%d",&d); mp[s]=d; } scanf("%d",&D); cin>>sub; res = mp[sub]; if(res==0 || res>(D+5)) printf("Case %d: Do your own homework!\n",kase++); else if(res>D && res<=(D+5)) printf("Case %d:
11369
#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <vector> #include <algorithm> #define ll long long using namespace std; vector<int> vb; bool cmp(int a,int b) { return a>b; } int main() { int t,n,a; cin>>t; ll sum; while(t–) { cin>>n; vb.clear(); for(int i=0;i<n;i++) { cin>>a; vb.push_back(a); } sort(vb.begin(),vb.end(),cmp); if(n<3) printf("0\n"); else { sum=0; for(int i=2;i<n;i+=3)
11059
#include <iostream> #include <cstdio> #include <cstring> #define ll long long //-1000000000000000000 using namespace std; int main() { int n,kase=1; int a[20]; ll max_end_here,max_so_far; while(scanf("%d",&n)!=EOF) { for(int i=0;i<n;i++) { scanf("%d",&a[i]); } max_so_far=0; for(int i=0;i<n;i++) { for(int j=i;j<n;j++) { max_end_here=1; for(int k=i;k<=j;k++) { max_end_here*=a[k]; } if(max_so_far<max_end_here) max_so_far = max_end_here; } } printf("Case #%d: The maximum product is
10714
#include <iostream> #include <cstdio> #include <cstring> #include <string> //#define INF 10000000 using namespace std; int main() { int t,diff,mn,mx; int len,num,a,c,d; int early,late; scanf("%d",&t); while(t–) { scanf("%d%d",&len,&num); mn=0; mx=0; for(int i=0;i<num;i++) { scanf("%d",&a); diff= len-a; c = max(diff,a); d = min(diff,a); mx = max(mx,c); mn = max(mn,d); //early=max(d,mn); } printf("%d %d\n",mn,mx); } return 0; }