whitespace

Solution

#include<stdio.h>

int main(void)
{
	int n, num;

	scanf("%d", &n);

	scanf("%d", &num);
	while(num!=0)
	{
		if(num>=n && num%n==0)
			printf("%d is a multiple of %d.\n", num, n);
		else
			printf("%d is NOT a multiple of %d.\n", num, n);

		scanf("%d", &num);
	}

	return 0;
}

Solution

#include<stdio.h>
#include<stdlib.h>

int compare(const void *x,const void *y)
{
	return *(int *)x>*(int *)y?1:*(int *)x==*(int *)y?0:-1;
}

int main(void)
{
	int N, *score=NULL;

	scanf("%d", &N);
	score=(int *)malloc(N*sizeof(int));
	for(int i=0;i<N;i++)
		scanf("%d", &score[i]);

	qsort((void *)score,(size_t)N,sizeof(int),compare);

	printf("%d\n", score[N-1]-score[0]);
	free(score);
	return 0;
}

Solution

#include<stdio.h>

int main(void)
{
	unsigned long long int A, B, lcm;

	scanf("%llu %llu", &A, &B);
	if(A<B)
	{
		lcm=A;
		A=B;
		B=lcm;
	}
	lcm=A;

	while(lcm%B!=0)
		lcm+=A;

	printf("%llu\n", lcm);
	return 0;
}

Solution

#include<stdio.h>

int main(void)
{
	int total=0, score;

	for(int i=0;i<5;i++)
	{
		scanf("%d", &score);
		total+=score;
	}

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

Solution

#include<stdio.h>

int main(void)
{
	unsigned long long int n;

	scanf("%llu", &n);
	printf("%llu\n", 4*n);

	return 0;
}

Solution

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

int main(void)
{
	int A, B, min[2], max[2];
	char num[10]={'\0', };

	scanf("%d %d", &A, &B);

	sprintf(num,"%d", A);
	for(int i=0;i<strlen(num);i++)
		num[i]+=num[i]=='5';
	max[0]=atoi(num);
	for(int i=0;i<strlen(num);i++)
		num[i]-=num[i]=='6';
	min[0]=atoi(num);

	for(int i=0;i<10;i++)
		num[i]='\0';
	sprintf(num,"%d", B);
	for(int i=0;i<strlen(num);i++)
		num[i]+=num[i]=='5';
	max[1]=atoi(num);
	for(int i=0;i<strlen(num);i++)
		num[i]-=num[i]=='6';
	min[1]=atoi(num);

	printf("%d %d\n", min[0]+min[1], max[0]+max[1]);
	return 0;
}

Solution

#include<stdio.h>
#include<stdlib.h>

int main(void)
{
	int n, **triangle=NULL, **max=NULL, max_number;

	scanf("%d", &n);
	triangle=(int **)malloc(n*sizeof(int *));
	for(int i=0;i<n;i++)
		triangle[i]=(int *)malloc((i+1)*sizeof(int));
	max=(int **)malloc(n*sizeof(int *));
	for(int i=0;i<n;i++)
		max[i]=(int *)calloc(i+1,sizeof(int));

	for(int i=0;i<n;i++)
		for(int j=0;j<=i;j++)
			scanf("%d", &triangle[i][j]);

	max[0][0]=triangle[0][0];
	for(int i=1;i<n;i++)
	{
		max[i][0]=max[i-1][0]+triangle[i][0];
		max[i][i]=max[i-1][i-1]+triangle[i][i];
	}
	for(int i=1;i<n;i++)
		for(int j=1;j<i;j++)
			max[i][j]=triangle[i][j]+(max[i-1][j-1]>max[i-1][j]?max[i-1][j-1]:max[i-1][j]);
	max_number=max[n-1][0];
	for(int i=1;i<n;i++)
		max_number=max[n-1][i]>max_number?max[n-1][i]:max_number;

	printf("%d\n", max_number);
	for(int i=0;i<n;i++)
		free(max[i]);
	free(max);
	for(int i=0;i<n;i++)
		free(triangle[i]);
	free(triangle);
	return 0;
}

Solution

#include<stdio.h>
#include<stdlib.h>

int main(void)
{
	int N, K, front=0, rear, *Y=NULL;

	scanf("%d%d", &N, &K);
	Y=(int *)malloc(N*sizeof(int));

	for(rear=0;rear<N;rear++)
		Y[rear]=rear+1;

	printf("<");
	for(int n=0;n<N;n++)
	{
		for(int k=1;k<K;k++)
			Y[(rear++)%N]=Y[(front++)%N];
		printf("%d", Y[(front++)%N]);
		printf("%s", n==N-1?">":", ");
	}

	free(Y);
	return 0;
}

Solution

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb=new StringBuilder();

		StringTokenizer st=new StringTokenizer(br.readLine());
		int N=Integer.parseInt(st.nextToken()), K=Integer.parseInt(st.nextToken()), front=0, rear;
		int[] Y=new int[N];
		
		for(rear=0;rear<N;rear++)
			Y[rear]=rear+1;
		sb.append("<");
		for(int n=0;n<N;n++) {
			for(int k=1;k<K;k++)
				Y[(rear++)%N]=Y[(front++)%N];
			sb.append(Y[(front++)%N]);
			sb.append(n==N-1?">":", ");
		}
		
		System.out.println(sb.toString());
	}
}