블루베리의 블로그

#include #include #include using namespace std; int N, T;int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> T; string s; int cnt; while(T--){ cin >> N; vector> V; for(int i=0; i> s >> cnt; V.push_back({cnt, s}); } sort(V.begin(), V.end(), greater()); cout

#include using namespace std;int N, M;int Arr[2001];bool DP[2001][2001];void solve(){ for(int i=1; i> N; for(int i=1; i> Arr[i]; } solve(); cin >> M; int s, e; for(int i=0; i> s >> e; cout

#include #include using namespace std;int N, M;int Arr[101][101];bool Visit[101][101];int Dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};int Cheese;void init(){ for(int i=0; i> Q; Q.push({0, 0}); Visit[0][0] = true; while(Q.empty() == false){ int y = Q.front().first; int x = Q.front().second; Q.pop(); for(int i=0; i= N || nx >= M) continue; if(V..

#include #include using namespace std;int N;int Arr[26];int pow(int n){ int res = 1; for(int i=0; i> N; string S; for(int i=0; i> S; for(int j=0; j()); int Ans = 0; for(int i=0; i

#include using namespace std;int main(){ int T; cin >> T; cout > N; for(int i=0; i> tmp >> d; C += tmp; G += d * tmp; } cout

#include using namespace std;unsigned long long a, b;int main(){ cin >> a >> b; if(a > b){ unsigned long long tmp = b; b = a; a = tmp; } if(a == b){ cout

#include using namespace std;int Arr[5];int Ans = 1;int main(){ for(int i=0; i> Arr[i]; } while(true){ int cnt = 0; for(int i=0; i= 3){ cout

#include using namespace std;int N;int A[6] = {1,2,3,4,5,6};int AC[6] = {500,300,200,50,30,10};int B[6] = {1,2,4,8,16};int BC[6] = {512,256,128,64,32}; int main(){ cin >> N; int a, b; for(int i=0; i> a >> b; int tmp = 0; int tmpA = 0, tmpB = 0; for(int j=0; j

#include using namespace std;int main(){ int A, B; float pi = 3.141592; cin >> A >> B; cout

#include using namespace std;int Arr[10][10];bool check(int y, int x, int k){ for(int i=0; i> s; for(int j=0; j