Submission #1123943


Source Code Expand

                            #include <bits/stdc++.h>
                            #include<iostream>
                            #include<cstdio>
                            #include<vector>
                            #include<queue>
                            #include<map>
                            #include<cstring>
                            #include<string>
                            #include <math.h>
                            #include<algorithm>
                        //    #include <boost/multiprecision/cpp_int.hpp>
                            #include<functional>
                     #define int long long
                            #define inf  1000000007
                            #define pa pair<int,int>
                            #define ll long long
                            #define pal pair<double,int>
                            #define ppa pair<int,pa>
                            #define ssa pair<string,int>
                            #define  mp make_pair
                            #define  pb push_back
                            #define EPS (1e-10)
                            #define equals(a,b) (fabs((a)-(b))<EPS)
                     
                            using namespace std;
                     //priority_queue<int, vector<int>, greater<int> > que;
                            class Point{
                            	public:
                            	double x,y;
                            	Point(double x=0,double y=0):x(x),y(y) {}
                            	Point operator + (Point p) {return Point(x+p.x,y+p.y);}
                            	Point operator - (Point p) {return Point(x-p.x,y-p.y);}
                            	Point operator * (double a) {return Point(x*a,y*a);}
                            	Point operator / (double a) {return Point(x/a,y/a);}
                            	double absv() {return sqrt(norm());}
                            	double norm() {return x*x+y*y;}
                            	bool operator < (const Point &p) const{
                            		return x != p.x ? x<p.x: y<p.y;
                            	}
                            	bool operator == (const Point &p) const{
                            		return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
                            	}
                            };
                            typedef Point Vector;
                     
                            struct Segment{
                            Point p1,p2;
                            };
                     
                        double hen(Vector a){
                        if(fabs(a.x)<EPS && a.y>0) return acos(0);
                        else if(fabs(a.x)<EPS && a.y<0) return 3*acos(0);
                        else if(fabs(a.y)<EPS && a.x<0) return 2*acos(0);
                        else if(fabs(a.y)<EPS && a.x>0) return 0.0;
                        else if(a.y>0) return acos(a.x/a.absv());
                        else return 2*acos(0)+acos(-a.x/a.absv());
                     
                        }
                     
                string itos( int i ) {
                ostringstream s ;
                s << i ;
                return s.str() ;
                }
                 
                int gcd(int v,int b){
                	if(v>b) return gcd(b,v);
                	if(v==b) return b;
                	if(b%v==0) return v;
                	return gcd(v,b%v);
                }
                            double dot(Vector a,Vector b){
                            	return a.x*b.x+a.y*b.y;
                            }
                            double cross(Vector a,Vector b){
                            	return a.x*b.y-a.y*b.x;
                            }
                        
                double distans(double x1,double y1,double x2,double y2){
                	double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
                	return sqrt(rr);
                	
                }

                            //----------------kokomade tenpure------------

void no(){
	cout<<"No"<<endl;
	return;
}

int beki(int r, int k){
	if(k==0) return 1;
	else return r*beki(r,k-1);
}

 signed  main(){
 string s;
 	cin>>s;
 	int l=s.length();
 	for(int i=0;i<l;i++){
 		if(s.substr(i,6)=="HAGIYA"){
 			cout<<s.substr(0,i)<<"HAGIXILE"<<s.substr(i+6)<<endl;
 			return 0;
 		}
 	}
                   //  	printf("%.10f\n",ans[n-1]);
                    	return 0;
}

Submission Info

Submission Time
Task A - HAGIXILE
User smiken
Language C++14 (GCC 5.4.1)
Score 20
Code Size 4541 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 20 / 20
Status
AC × 64
Set Name Test Cases
All 00_manual1.txt, 00_manual2.txt, 00_sample.txt, 00_small00.txt, 00_small01.txt, 00_small02.txt, 00_small03.txt, 00_small04.txt, 00_small05.txt, 00_small06.txt, 00_small07.txt, 00_small08.txt, 00_small09.txt, 00_small10.txt, 00_small11.txt, 00_small12.txt, 00_small13.txt, 00_small14.txt, 00_small15.txt, 00_small16.txt, 00_small17.txt, 00_small18.txt, 00_small19.txt, 00_small20.txt, 00_small21.txt, 00_small22.txt, 00_small23.txt, 00_small24.txt, 00_small25.txt, 00_small26.txt, 00_small27.txt, 00_small28.txt, 00_small29.txt, 01_large00.txt, 01_large01.txt, 01_large02.txt, 01_large03.txt, 01_large04.txt, 01_large05.txt, 01_large06.txt, 01_large07.txt, 01_large08.txt, 01_large09.txt, 01_large10.txt, 01_large11.txt, 01_large12.txt, 01_large13.txt, 01_large14.txt, 01_large15.txt, 01_large16.txt, 01_large17.txt, 01_large18.txt, 01_large19.txt, 01_large20.txt, 01_large21.txt, 01_large22.txt, 01_large23.txt, 01_large24.txt, 01_large25.txt, 01_large26.txt, 01_large27.txt, 01_large28.txt, 01_large29.txt, 03_manual00.txt
Case Name Status Exec Time Memory
00_manual1.txt AC 1 ms 256 KB
00_manual2.txt AC 1 ms 256 KB
00_sample.txt AC 1 ms 256 KB
00_small00.txt AC 1 ms 256 KB
00_small01.txt AC 1 ms 256 KB
00_small02.txt AC 1 ms 256 KB
00_small03.txt AC 1 ms 256 KB
00_small04.txt AC 1 ms 256 KB
00_small05.txt AC 1 ms 256 KB
00_small06.txt AC 1 ms 256 KB
00_small07.txt AC 1 ms 256 KB
00_small08.txt AC 1 ms 256 KB
00_small09.txt AC 1 ms 256 KB
00_small10.txt AC 1 ms 256 KB
00_small11.txt AC 1 ms 256 KB
00_small12.txt AC 1 ms 256 KB
00_small13.txt AC 1 ms 256 KB
00_small14.txt AC 1 ms 256 KB
00_small15.txt AC 1 ms 256 KB
00_small16.txt AC 1 ms 256 KB
00_small17.txt AC 1 ms 256 KB
00_small18.txt AC 1 ms 256 KB
00_small19.txt AC 1 ms 256 KB
00_small20.txt AC 1 ms 256 KB
00_small21.txt AC 1 ms 256 KB
00_small22.txt AC 1 ms 256 KB
00_small23.txt AC 1 ms 256 KB
00_small24.txt AC 1 ms 256 KB
00_small25.txt AC 1 ms 256 KB
00_small26.txt AC 1 ms 256 KB
00_small27.txt AC 1 ms 256 KB
00_small28.txt AC 1 ms 256 KB
00_small29.txt AC 1 ms 256 KB
01_large00.txt AC 1 ms 256 KB
01_large01.txt AC 1 ms 256 KB
01_large02.txt AC 1 ms 256 KB
01_large03.txt AC 1 ms 256 KB
01_large04.txt AC 1 ms 256 KB
01_large05.txt AC 1 ms 256 KB
01_large06.txt AC 1 ms 256 KB
01_large07.txt AC 1 ms 256 KB
01_large08.txt AC 1 ms 256 KB
01_large09.txt AC 1 ms 256 KB
01_large10.txt AC 1 ms 256 KB
01_large11.txt AC 1 ms 256 KB
01_large12.txt AC 1 ms 256 KB
01_large13.txt AC 1 ms 256 KB
01_large14.txt AC 1 ms 256 KB
01_large15.txt AC 1 ms 256 KB
01_large16.txt AC 1 ms 256 KB
01_large17.txt AC 1 ms 256 KB
01_large18.txt AC 1 ms 256 KB
01_large19.txt AC 1 ms 256 KB
01_large20.txt AC 1 ms 256 KB
01_large21.txt AC 1 ms 256 KB
01_large22.txt AC 1 ms 256 KB
01_large23.txt AC 1 ms 256 KB
01_large24.txt AC 1 ms 256 KB
01_large25.txt AC 1 ms 256 KB
01_large26.txt AC 1 ms 256 KB
01_large27.txt AC 1 ms 256 KB
01_large28.txt AC 1 ms 256 KB
01_large29.txt AC 1 ms 256 KB
03_manual00.txt AC 1 ms 256 KB