히더

출처 : https://www.hackerrank.com/challenges/staircase/problem #include using namespace std; void staircase(int n) { for(int i=1; i

출처 : https://www.hackerrank.com/challenges/plus-minus/problem #include using namespace std; vector split_string(string); void plusMinus(vector arr) { float n1,n2,n3,s; n1=0;n2=0;n3=0; s=arr.size(); for(int i=0; i0)n1++; else if(arr[i]

출처 : https://www.hackerrank.com/challenges/diagonal-difference/problem #include using namespace std; int diagonalDifference(vector arr) { int ans1=0; int ans2=0; int s = arr.size(); for(int i=0,j=0; i>=0 && i> n; cin.ignore(numeric_limits::max(), '\n'); vector arr(n); for (int i = 0; i > arr[i][j]; } cin.ignore(numeric_limits::max(..

출처 : https://www.hackerrank.com/challenges/a-very-big-sum/problem #include using namespace std; vector split_string(string); long aVeryBigSum(vector ar) { long ans=0; for(int i=0; i> ar_count; cin.ignore(numeric_limits::max(), '\n'); string ar_temp_temp; getline(cin, ar_temp_temp); vector ar_temp = split_string(ar_temp_temp); vector ar(ar_count); for (int i = 0; i < ar_count; i++) { long ar_item..

출처 : https://www.hackerrank.com/challenges/compare-the-triplets/problem #include using namespace std; string ltrim(const string &);string rtrim(const string &);vector split(const string &); vector compareTriplets(vector a, vector b) { vector v(2); for(int i=0; ib[i]) v[0]++; else if(a[i]

출처 : https://www.hackerrank.com/challenges/solve-me-first/problem #include #include #include #include #include using namespace std; int solveMeFirst(int a, int b) { return a+b;} int main() { int num1, num2; int sum; cin>>num1>>num2; sum = solveMeFirst(num1,num2); cout

SW Expert Academy :: SWEA :: 5658 :: 보물상자 비밀번호 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRUN9KfZ8DFAUo&categoryId=AWXRUN9KfZ8DFAUo&categoryType=CODE #include #include #include #include #include using namespace std; int N, K;string s; int main() {int T; cin >> T;for (int tc = 1; tc > N >> K;vectorv; int ans = 0;cin >> s; int tmp; for (int i = 0; i < ..

2차원 벡터 또는 3차 이상의 벡터의 정의는 아래와 같이 한다.만약 2차원 pair 벡터 또는 3차 이상의 pair 벡터 또한 같다. vector v;v.assign(11, vector(11)); 물론 vector v(11, vector(11)); 와 같이 합칠 수 있다. 작성자 : 히더

SW Expert Academy :: SWEA :: 5644 :: 무선 충전 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRDL1aeugDFAUo #include #include #include #include using namespace std; struct BC {int x, y, c, p, n;}; int M, N, ans;int user[2][101];int dir[5][2] = { {0,0},{0,-1},{1,0},{0,1},{-1,0} };vector map; inline bool check(int x, int y, BC bc) { return bc.c >= ((abs(bc.x-x..

SW Expert Academy :: SWEA :: 5648 :: 원자 소멸 시뮬레이션 출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWXRFInKex8DFAUo&categoryId=AWXRFInKex8DFAUo&categoryType=CODE #include #include #include using namespace std; struct atom { int n, i, j, d, e; float c;}; int N, ans;vector v;vector ev; inline void check(atom n1, atom n2) {if (n1.d == 0) {if (n2.d == 1 && n1.j ==..