2025.5.24
/*#include <iostream>
#include <vector>
using namespace std;
int main()
{
int x, y;
vector<int> arr;
arr.push_back(10);
arr.push_back(20);
arr.push_back(30);
arr.push_back(40);
//arr.insert(2,100);
for(int i=0; i<arr.size(); i++) {
cout << arr[i] << endl;
}
cin >> x >> y;
cout << x + y << endl;
return 0;
}
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n, x, i, a, l, r, cnt=0;
vector<int> arr;
cin >> n;
for(i=0; i<n; i++){
cin >> a;
arr.push_back(a);
}
cin >> x;
sort(arr.begin(), arr.end());
l=0;
r=n-1;
while(r>l){
if(arr[l]+arr[r]==x){
cnt++;
l++;
r--;
}
else if(arr[l]+arr[r]<x){
l++;
}
else{
r--;
}
}
cout << cnt;
}
#include<iostream>
#include<stack>
#include<vector>
using namespace std;
int main()
{
stack<int> st;
vector<int> arr;
int n, i, a;
cin >> n;
for(i=0; i<n; i++){
cin >> a;
arr.push_back(a);
}
for(i=0; i<n; i++){
while(st.top()!=arr[i]){
st.push(i+1);
cout << '+' << endl;
}
st.pop();
cout << '-' << endl;
}
}
(회전, 확인, 대칭, 확인)*3
<회전>
n=3
0, 0<=>2, 2
0, 1<=>1, 1
1, 1<=>1, 2
0, 2<=>0, 0
1, 2<=>0, 1
2, 2<=>0, 2
y1&x2 반비례
x1=반비례 하는 만큼 y2보다 큼
*/
#include<stdio.h>
int main()
{
int n, i, j, temp=0;
int arr[12][12]={};
scanf("%d", &n);
for(i=0; i<n; i++){
for(j=0; j<=i; j++){
scanf("%d", &arr[i][j]);
}
}
}