結果

問題 No.1081 和の和
ユーザー tsuishi
提出日時 2021-04-19 14:44:18
言語 C
(gcc 13.3.0)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 3,331 bytes
コンパイル時間 268 ms
コンパイル使用メモリ 32,640 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-04 04:59:11
合計ジャッジ時間 851 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
extern int getchar_unlocked(void);
extern int putchar_unlocked(int);
#define DEBUGd
// ---------------------------
#define NOP do{}while(0)
#define gc(d) (d)=getchar_unlocked()
#define pc(d) putchar_unlocked(d)
#define mygc(c) (c)=getchar()
#define PRINCR pc('\n')
#ifdef DEBUG
#include <time.h>
#define TRACE(...) do{fprintf(stderr,__VA_ARGS__);}while(0)
#define TRACECR do{fprintf(stderr,"\n");}while(0)
static clock_t startclock;
void DEBUGSTART(void){TRACE("--DEBUG MODE --\n");startclock=clock();}
void DEBUGEND(void){startclock=clock()-startclock;TRACE("--finish --\ntime is %.3fms\n",startclock/1000.);}
#else
#define TRACE(...) NOP
#define TRACECR NOP
void DEBUGSTART(void){return;}
void DEBUGEND(void){return;}
#endif
// ---------------------------
#define NOCR(strig) do{char *p;p=strchr(strig,'\n');if(p)*p='\0';}while(0)
#define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MID(a,b,c) ((a)>(b)?(b)>(c)?(b):(a)>(c)?(c):(a):(c)>(b)?(b):(c)>(a)?(c):(a))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define REP(a,b) for(int a=0;a<(int)(b);++a)
#define REP1(a,b) for(int a=1;a<=(int)(b);++a)
#define ll long long
#define INPUT GETLINE
#define ull unsigned ll
#define ui unsigned int
static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];gc(c);while(c!=EOF){if((c==' ')||(c=='\n'))break;*cp++=c;gc(c);}*cp='\0';return &str[0];}
#define GETLINE(str) do{char *p;fgets(str,sizeof(str),stdin);p=strchr(str,'\n');if(p)*p='\0';}while(0)
#define REP(a,b) for(int a=0;a<(int)(b);++a)
static int GETLINEINT(void) {char s[34];GETLINE(s);return atoi(s);}
static int GETWORDINT(void) {char s[34];GETWORD(s);return atoi(s);}
static ll GETWORDLL(void) {char s[34];GETWORD(s);return atoll(s);}
static long GETLINELONG(void) {char s[34];GETLINE(s);return atol(s);}
static ll GETLINELL(void) {char s[34];GETLINE(s);return atoll(s);}
static long GETWORDLONG(void) {char s[34];GETWORD(s);return atol(s);}
static int cmpint123(const void *a,const void *b){if(*(int *)a>*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
static int cmpint321(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;}
static ll midll(ll a,ll b,ll c){if(a>b){if(b>c){return b;}else if(a>c){return c;}
else{return a;}}else{if(c>b){return b;}else if(c>a){return c;}else{return a;}}}
static int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;} //
static ll gcdll(ll a,ll b){ll c;while(b!=0){c=a%b;a=b;b=c;}return a;} //
#define Yes(a) printf("%s\n",((a)?"Yes":"No"))
// ---------------------------
//
long N;
long dt[121];
long wk[121];
// ---------------------------
void read(void)
{
N = GETWORDLONG();
for(long i; i < N ; i++ ) {
dt[i] = GETWORDLONG();
}
}
void addadd(void)
{
long *lp;
long *dp1,*dp2;
long k;
while( N != 1 ) {
lp = &wk[0];
dp1 = &dt[0];
dp2 = dp1 + 1;
k = 0;
for( long i = 0; i < N-1 ; i++ ) {
*lp++ = ((*dp1++) + (*dp2++)) % 1000000007 ;
k++;
}
memcpy( &dt[0] , &wk[0], k* sizeof(long) );
REP(i,k) TRACE("%ld,",dt[i]);TRACECR;
N = k;
}
}
// *********************
int main( void )
{
read();
addadd();
printf("%ld\n",dt[0] );
DEBUGEND();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0