Submission #696684
Source Code Expand
#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 55
#define MOD 1000000007
void RI(){}
template<typename... T>
void RI( int& head, T&... tail ) {
scanf("%d",&head);
RI(tail...);
}
using namespace std;
typedef long long LL;
int n,A,B;
LL in[M];
void pre()
{
sort(in+1,in+n+1);
while(B>0 && in[n]/in[1]>=A)
{
in[1]*=A;
B--;
sort(in+1,in+n+1);
}
}
void out(int st)
{
REP(i,st,n) printf("%lld\n",in[i]);
REP(i,1,st-1)printf("%lld\n",in[i]);
}
LL pw(LL x,LL y)
{
LL re=1, tmp=x;
while(y)
{
if(y&1) re*=tmp;
tmp *= tmp;
y>>=1;
tmp%=MOD;
re%=MOD;
}
return re;
}
int main()
{
while(~scanf("%d %d %d",&n,&A,&B))
{
REP(i,1,n) scanf("%lld",&in[i]);
if(A==1)
{
sort(in+1,in+n+1);
out(1);
continue;
}
else
{
pre();
int tmp = B/n;
REP(i,1,n)
{
in[i] *= pw(A, tmp);
in[i] %= MOD;
}
tmp = B%n;
REP(i,1,tmp)
{
in[i] *= A;
in[i] %= MOD;
}
out(tmp+1);
}
}
return 0;
}
Submission Info
Submission Time
2016-04-16 21:51:10+0900
Task
C - 掛け算
User
Nekosyndrome
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1320 Byte
Status
AC
Exec Time
4 ms
Memory
256 KiB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:58:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,1,n) scanf("%lld",&in[i]);
^
Judge Result
Set Name
all
Score / Max Score
100 / 100
Status
Set Name
Test Cases
all
example_0.txt, example_1.txt, example_2.txt, one_0.txt, one_1.txt, one_2.txt, one_3.txt, one_4.txt, random_0.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, smallB_0.txt, smallB_1.txt, smallB_2.txt, smallB_3.txt, smallB_4.txt
Case Name
Status
Exec Time
Memory
example_0.txt
AC
4 ms
256 KiB
example_1.txt
AC
4 ms
256 KiB
example_2.txt
AC
4 ms
256 KiB
one_0.txt
AC
4 ms
256 KiB
one_1.txt
AC
4 ms
256 KiB
one_2.txt
AC
4 ms
256 KiB
one_3.txt
AC
4 ms
256 KiB
one_4.txt
AC
4 ms
256 KiB
random_0.txt
AC
4 ms
256 KiB
random_1.txt
AC
4 ms
256 KiB
random_2.txt
AC
4 ms
256 KiB
random_3.txt
AC
4 ms
256 KiB
random_4.txt
AC
4 ms
256 KiB
smallB_0.txt
AC
4 ms
256 KiB
smallB_1.txt
AC
4 ms
256 KiB
smallB_2.txt
AC
4 ms
256 KiB
smallB_3.txt
AC
4 ms
256 KiB
smallB_4.txt
AC
4 ms
256 KiB