結果

問題 No.432 占い(Easy)
ユーザー torus711
提出日時 2016-10-14 22:30:54
言語 C++14
(gcc 8.2.0)
結果
AC  
実行時間 6 ms
コード長 3,143 Byte
コンパイル時間 799 ms
使用メモリ 1,564 KB
最終ジャッジ日時 2019-06-16 07:48:13

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_sample_1.in AC 3 ms
1,536 KB
0_sample_2.in AC 2 ms
1,520 KB
0_sample_3.in AC 3 ms
1,532 KB
0_sample_4.in AC 4 ms
1,532 KB
1_easy_small_1.in AC 4 ms
1,548 KB
1_easy_small_2.in AC 3 ms
1,532 KB
1_easy_small_3.in AC 3 ms
1,520 KB
1_easy_small_4.in AC 3 ms
1,544 KB
1_easy_small_5.in AC 4 ms
1,536 KB
2_easy_large_1.in AC 5 ms
1,524 KB
2_easy_large_2.in AC 4 ms
1,540 KB
2_easy_large_3.in AC 4 ms
1,556 KB
2_easy_large_4.in AC 6 ms
1,564 KB
2_easy_large_5.in AC 5 ms
1,560 KB
2_easy_large_6.in AC 3 ms
1,556 KB
7_special_0.in AC 3 ms
1,536 KB
7_special_1.in AC 3 ms
1,532 KB
7_special_2.in AC 6 ms
1,560 KB
8_easy_rand_1.in AC 5 ms
1,548 KB
8_easy_rand_2.in AC 4 ms
1,556 KB
8_easy_rand_3.in AC 4 ms
1,552 KB
8_easy_rand_4.in AC 4 ms
1,552 KB
8_easy_rand_5.in AC 4 ms
1,548 KB
8_easy_rand_6.in AC 4 ms
1,552 KB
8_easy_rand_7.in AC 5 ms
1,536 KB
8_easy_rand_8.in AC 5 ms
1,524 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using SS = stringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( std::remove_all_extents< decltype( a ) >::type * )a, ( std::remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( std::remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) ( c ).begin(), ( c ).begin() + ( p ), ( c ).end()

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	int T;
	cin >> T;

	REP( T )
	{
		string S;
		cin >> S;

		const int L = SZ( S );

		VI A;
		transform( ALL( S ), BI( A ), bind( minus< char >(), _1, '0' ) );

		REP( L - 1 )
		{
			REP( i, SZ( A ) - 1 )
			{
				A[i] = A[i] + A[ i + 1 ];
				A[i] = A[i] / 10 + A[i] % 10;
			}
		}

		cout << A[0] << endl;
	}

	return 0;
}
0