oj.uz

답안 #9429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
9429 2014-09-28T06:21:45 Z maniac Uniting (kriii2_U) C++
0 / 4
 0 ms 1676 KB 
#include<cstdio>
#include<cassert>
#include<cstring>
#include<map>
#include<set>
#include<time.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<utility>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<limits>
   
using namespace std;
#define LL long long 
#define mod 1000000007
LL n,re,cnt;
queue <LL> q;

long long gcd( long long b, long long s ){
	return (s!=0) ? gcd( s, b%s ) : b;
}


void solve(){
	scanf("%lld",&n);
	cnt = 1;
	for(LL i = 1; i <= n; i++){
		cnt *=i;
		cnt %= mod;
		LL a ;
		scanf("%lld",&a);
		q.push(a);
	}
	if( n == 1){
		re = 0;
		cnt = 1;
		printf("%lld\n%lld\n",re,cnt);
		return ;
	}

	while( !q.empty() ){
		LL a,b;
		a = q.front(); q.pop();
		b = q.front(); q.pop();
		re += (a*b)%mod;
		re%=mod;
		if( !q.empty() )
			q.push( (a+b)%mod);
	}
	printf("%lld\n%lld\n",re,cnt);
}

int main(){
	//freopen("in.txt", "r", stdin);
	//freopen("input.txt", "r", stdin);
	solve();

}

Subtask #1
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 0 ms 1676 KB Output is partially correct
2 Partially correct 0 ms 1676 KB Output is partially correct
3 Partially correct 0 ms 1676 KB Output is partially correct
4 Partially correct 0 ms 1676 KB Output is partially correct
5 Incorrect 0 ms 1676 KB Output isn't correct
6 Halted 0 ms 0 KB -