기본 콘텐츠로 건너뛰기

10809 : 알파벳 찾기 [C++]

#include <iostream>
#include <string>

using namespace std;

int main()
{
 cin.tie(NULL);

 string Input;
 getline(cin,Input);

 int Count[26] = { 0, };
 bool Visited[26] = { false, };

 Count[Input[0] - 97] = -1;
 Visited[Input[0] - 97] = true;

 for (int i = 1; i < Input.size(); i++)
 {
  if (Visited[Input[i] - 97])
   continue;
  else
  {
   Visited[Input[i] - 97] = true;
   Count[Input[i] - 97] = i;
  }
 }

 for (int i = 0; i < 26; i++)
 {
  if (Count[i] == 0)
   cout << "-1 ";
  else if (Count[i] == -1)
   cout << "0 ";
  else
   cout << Count[i] << " ";
 }

 return 0;
}

댓글

이 블로그의 인기 게시물

1978 : 소수 찾기 [C++]

# include < iostream > # include < vector > using namespace std ; int main ( ) { cin . tie ( NULL ) ; vector < int > Primes ; Primes . push_back ( 2 ) ; Primes . push_back ( 3 ) ; for ( int i = 4 ; i < 1000 ; i + + ) { bool IsPrime = true ; if ( i % 2 = = 0 | | i % 3 = = 0 ) continue ; for ( int j = 4 ; j < i ; j + + ) { if ( i % j = = 0 ) { IsPrime = false ; break ; } } if ( IsPrime ) Primes . push_back ( i ) ; } int N , Count = 0 ; cin > > N ; for ( int i = 0 ; i < N ; i + + ) { int Input ; cin > > Input ; for ( int j = 0 ; j < Primes . size ( ) ; j + + ) if ( Input = = Primes [ j ] ) Count + + ; } cout < < Count < < " \n " ; return 0 ; }

10828 : 스택 [Python]

Stack = [ ] def push ( num ) : Stack . append ( int ( num ) ) def pop ( ) : if len ( Stack ) > 0 : print ( Stack . pop ( ) ) else : print ( - 1 ) def size ( ) : print ( len ( Stack ) ) def empty ( ) : if len ( Stack ) == 0 : print ( 1 ) else : print ( 0 ) def top ( ) : if len ( Stack ) > 0 : print ( Stack [ len ( Stack ) - 1 ] ) else : print ( - 1 ) TestCase = int ( input ( ) ) while TestCase > 0 : Command = input ( ) if Command == 'top' : top ( ) elif Command == 'pop' : pop ( ) elif Command == 'empty' : empty ( ) elif Command == 'size' : size ( ) else : push ( Command [ 5 : ] ) TestCase - = 1