[ Winner!! ] (814pts)

 : gs12117

Gold Medal List!! (over 698pts)

  : gs12117, ainta, railgun, gs11048

Silver Medal List (over 457pts)

  : tncks0121, ryanchl, pl0892029, ajou991, ssw1591, gs12006, gs12109, takuma

Bronze Medal List (over 230pts)

  : kk1401, gs11008, gs12065, opera1114, gs11103, gshs291221, gshs291422, gs12059, issac, nobe0716, pkizone

#include<stdio.h>
long long N;              // by gs11048
long long cnt;
int main()
{
	long long i;
	scanf("%lld",&N);

	for(i=1 ; i<=N-1 ; i++)
	{
		cnt+=i*(N+1);
	}
	printf("%lld",cnt);
	return 0;
}

#include <stdio.h>    

int main(){                 // by mufflin
	long long int n;
	scanf("%lld",&n);
	printf("%lld",n*(n-1)*(n+1)/2);
	return 0;
}

#include <stdio.h>
#define MIN(x,y) ((x)<(y)?(x):(y))   //by k5888200
#define MOD 9901

int n,m;
int dy[101][201];

int main(){


    int i,j,k,l;
    int N;

    scanf("%d%d",&n,&m);

    dy[1][1]=1;
    for(i=2;i<=m;i++){
        for(j=2*i-1;j<=n;j++){
            for(k=1;k<=j-2;k++){
                for(l=1;l<i-1;l++){
                    dy[i][j]=(dy[i][j]+dy[i-1][k]*dy[l][j-1-k]*2)%MOD;
                }
                dy[i][j]+=dy[i-1][k]*dy[l][j-1-k];
            }
        }
    }
    printf("%d",dy[m][n]);


} 

#include <stdio.h>
int b[205][105];     //gs11028

int main()
{
	int i,j,k,n,m;
	scanf("%d %d",&n,&m);
	for(j=0;j<=m;j++)
	{
		b[0][j] = 1;
		b[1][j] = 1;
	}
	b[1][0] = 0;
	for(i=2;i<=n;i++)
	{
		for(j=0;j<=m;j++)
		{
			for(k=2;k<i;k++)
			{
				b[i][j] += b[i-k][j-1]*b[k-1][j-1]%9901;
			}
			b[i][j]%=9901;
		}
	}
	printf("%d\n",b[n][m]-b[n][m-1]);
}

#include<stdio.h>     // ainta
#include<string.h>
bool p[1000001];
int q[200001],c,i,j,K,n,m,ta[110],mod;
char a[110];
int main(){
	scanf("%s",a);
	scanf("%d",&K);
	n=strlen(a);
	q[c++]=2;
	for(i=3;i<=K;i+=2){
		if(!p[i])q[c++]=i;
		for(j=i;j<=K;j+=i*2)p[j]=1;}
	for(i=0;i<c;i++){
		for(j=0;j<n;j++)ta[j]=a[j]-0;
		j=mod=0;
		while(j<n){
			mod=mod*10+ta[j];
			if(mod>=q[i])mod%=q[i];j++;}
		if(mod==0){printf("BAD %d\n",q[i]);break;}}
	if(i==c)printf("GOOD\n");
}

#include<stdio.h>    // gs12117
#include<string.h>
int pwd[110];
int c[210];
int pwdlen;
int f(int mod){
	int i,left=0;
	for(i=0;i<pwdlen;i++){
		left*=10;
		left+=pwd[i];
		left%=mod;
	}
	return left;
}
int main(){
	int n,i,j;
	char p[110];
	scanf("%s%d",p,&n);
	pwdlen=strlen(p);
	for(i=0;i<pwdlen;i++){
		pwd[i]=p[i]-0;
	}
	for(i=2;i<=n&&i<8;i++){
		if(f(i)==0){
			printf("BAD %d",i);
			return 0;
		}
	}
	for(i=0;i<210;i+=3)c[i]=1;
	for(i=0;i<210;i+=5)c[i]=1;
	for(i=0;i<210;i+=7)c[i]=1;
	for(i=11;i<=n;i+=2){
		if(c[i%210]==1)continue;
		if(f(i)==0){
			printf("BAD %d",i);
			return 0;
		}
	}
	printf("GOOD");
	return 0;
}

#include<stdio.h>      // gs12117
int loctime[5100];
int conn[5100];
int con[5100][5100][2];
int ans=999999999;
void f(int loc,int time){
	if(time>=ans)return;
	if(loctime[loc]<=time)return;
	loctime[loc]=time;
	int i;
	for(i=0;i<conn[loc];i++){
		f(con[loc][i][0],time+con[loc][i][1]);
	}
	return;
}
int main(){
	int a,b,c,d,i,j,k;
	scanf("%d%d",&a,&b);
	for(i=0;i<b;i++){
		scanf("%d%d%d%d",&c,&d,&j,&k);
		con[c][conn[c]][0]=d;
		con[c][conn[c]][1]=j;
		con[d][conn[d]][0]=c;
		con[d][conn[d]][1]=k;
		conn[c]++;
		conn[d]++;
	}
	for(i=0;i<conn[1];i++){
		for(j=1;j<=a;j++){
			loctime[j]=999999999;
		}
		for(j=0;j<conn[con[1][i][0]];j++){
			if(con[con[1][i][0]][j][0]==1){
				k=j;
				con[con[1][i][0]][j][0]=con[1][i][0];
				break;
			}
		}
		f(con[1][i][0],con[1][i][1]);
		if(loctime[1]<ans)ans=loctime[1];
		con[con[1][i][0]][k][0]=1;
	}
	printf("%d",ans);
	return 0;
}