2022.04.29

bin1225·2022년 4월 29일
0

c++ 알고리즘

목록 보기
3/35
post-thumbnail
  1. 선생님 퀴즈
#include<stdio.h>
#include<iostream>

using namespace std;
int main(){

	int n;
	int number,sum;
	//freopen("input.txt","rt",stdin);
	
	cin>>n;
	
	for(int i = 0 ; i < n; i++){
		
		cin>> number;
		cin>> sum;
		
		if((number+1)*number/2 == sum)
			cout<< "YES"<<endl;
		else
			cout<< "NO"<<endl;
	}
	
	
	return 0;
	
}
  1. 층간소음
int main(){

	int sec,standardNum;
	//freopen("input.txt","rt",stdin);
	cin>>sec>>standardNum;
	
	
	int measureNum, count;
	int answer = 0;
	for(int i = 0 ; i < sec; i++){
		
		cin>> measureNum;
		
		if(measureNum>standardNum){
			count++;
		}
		else{
			if(count>answer){
				answer = count;
			}
			count = 0;
			
		}
		
	}
	if(count>answer){
		answer = count;
	}
	else if(answer == 0)
		answer=-1;
	cout<< answer;
	
	return 0;
	
}
  1. 분노 유발자
int main(){

	//freopen("input.txt","rt",stdin);
	int n,a,answer;
	cin>>n;
	
	vector<int> numbers;
	int max=44;
	
	for(int i = 0; i <n; i++ ){
		cin>>a;
		numbers.push_back(a);
	}
	
	for(int i = numbers.size()-1; i>=0;i--){
		if(numbers[i]>max){
			answer++;
			max = numbers[i];
		}
	}
	
	cout<<--answer;
	return 0;
	
}

20 가위바위보

int main(){

	//freopen("input.txt","rt",stdin);
	int n,k,result;
	cin>>n;
	
	vector<int> a,b;
	
	
	for(int i = 0; i <n; i++ ){
		cin>>k;
		a.push_back(k);
	}
	for(int i = 0; i <n; i++ ){
		cin>>k;
		b.push_back(k);
	}

	for(int i = 0; i <n; i++ ){
	
		switch(a[i]-b[i]){
			
			case 0:
				cout<<"D";
				break;
			case 1:
				cout<<"A";
				break;
			case 2:
				cout<<"B";
				break;
			case -1:
				cout<<"B";
				break;
			case -2:
				cout<<"A";
				break;
		}
		cout<<endl;
	}
	
	return 0;
	
}

0개의 댓글