結果

問題 No.434 占い
ユーザー koyumeishi
提出日時 2016-05-04 21:40:18
言語 C++14
(gcc 8.2.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 3,988 Byte
コンパイル時間 1,093 ms
使用メモリ 143,476 KB
最終ジャッジ日時 2019-03-26 05:03:47

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_sample_1.in AC 1,443 ms
143,212 KB
0_sample_2.in AC 1,466 ms
143,208 KB
0_sample_3.in AC 1,437 ms
143,208 KB
0_sample_4.in AC 1,408 ms
143,212 KB
1_easy_small_1.in AC 1,430 ms
143,208 KB
1_easy_small_2.in AC 1,421 ms
143,208 KB
2_easy_large_1.in AC 1,442 ms
143,208 KB
2_easy_large_2.in AC 1,414 ms
143,208 KB
3_small_1.in AC 1,437 ms
143,208 KB
3_small_2.in AC 1,421 ms
143,208 KB
3_small_3.in AC 1,492 ms
143,212 KB
3_small_4.in AC 1,430 ms
143,208 KB
3_small_5.in AC 1,488 ms
143,208 KB
3_small_6.in AC 1,407 ms
143,212 KB
3_small_7.in AC 1,431 ms
143,208 KB
4_large_1.in AC 1,551 ms
143,472 KB
4_large_2.in AC 1,536 ms
143,212 KB
4_large_3.in AC 1,650 ms
143,208 KB
4_large_4.in AC 1,609 ms
143,204 KB
4_large_5.in TLE -
4_large_6.in TLE -
4_large_7.in AC 1,722 ms
143,476 KB
4_large_8.in AC 1,465 ms
143,212 KB
7_special_0.in AC 1,407 ms
143,212 KB
7_special_3.in AC 1,590 ms
143,208 KB
7_special_4.in AC 1,398 ms
143,472 KB
9_rand_1.in AC 1,388 ms
143,208 KB
9_rand_2.in AC 1,428 ms
143,208 KB
9_rand_3.in AC 1,462 ms
143,212 KB
9_rand_4.in AC 1,406 ms
143,212 KB
9_rand_5.in AC 1,457 ms
143,208 KB
テストケース一括ダウンロード

ソースコード

diff #
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
using namespace std;

namespace {
	using Integer = long long; //__int128;
	template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
	template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
	template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(int i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
	template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

	template<class H> void print(const H& head){ cout << head; }
	template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
	template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

	template<class H> void eprint(const H& head){ cerr << head; }
	template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
	template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

	string operator "" _s (const char* str, size_t size){ return move(string(str)); }
	constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
	constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
	constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

	inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

	mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

	template<class T> string join(const vector<T>& v, const string& sep){
		stringstream ss; for(int i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str();
	}
}

constexpr long long mod = 9_ten + 7;

char buff[6_ten+6_ten+6_ten+10];

vector<long long> Eratosthenes(long long N){
	vector<bool> v(N+1, true);
	v[0] = v[1] = false;
	long long sqN = sqrt(N);
	for(int i=2; i<=sqN; i++){
		if(v[i] == false) continue;
		for(long long j=i*i; j<=N; j+=i){
			v[j] = false;
		}
	}
	vector<long long> Prime;
	for(long long i=2; i<=N; i++){
		if(v[i]==true) Prime.push_back(i);
	}
	return Prime;
}

int main_(){
	int t;
	cin >> t;

	const long long sz = 6_ten+6_ten+1;
	auto prime = Eratosthenes(sz);

	vector<vector<int>> f(sz, vector<int>(9, 0));	//f[x] := x!
	for(int i=0; i<prime.size(); i++){
		int p = prime[i];
		long long tmp = p;
		int k = p%9;
		while(tmp < sz){
			int r = 0;
			for(int x = tmp; x%p==0; x/=p, r++);
			f[tmp][k] += r;
			tmp += p;
		}
	}

	for(int i=1; i<sz; i++){
		for(int j=0; j<9; j++){
			f[i][j] += f[i-1][j];
		}
	}

	while(t--){
		scanf("%s", buff);
		string s(buff);
		//cin >> s;

		bool zero = true;
		for(int i=0; i<s.size(); i++){
			if(s[i] != '0'){
				zero = false;
				break;
			}
		}
		if(zero){
			puts("0");
			continue;
		}

		int n = s.size();
		long long ans = 0;
		for(int i=0; i<n; i++){
			long long k = 1;
			for(int j=1; j<=8; j++){
				int y = f[n-1][j] - f[i][j] - f[n-1-i][j];
				k *= my_pow_mod(j, y, 9);
			}
			ans += k*(s[i]-'0');
			ans %= 9;
		}

		if(ans == 0) ans = 9;

		printf("%d\n", ans);
	}
	return 0;
}


template<class T, class ... Args> void get_process_time(T (*func)(Args...), const Args& ... a){
	auto start_time = chrono::steady_clock::now();
	func(a...);
	auto end_time   = chrono::steady_clock::now();
	eprintln("executed in", chrono::duration_cast<chrono::milliseconds>(end_time-start_time).count(), " [ms]");
}

int main(){
	get_process_time(main_);
	return 0;
}
0