content stringlengths 19 11k |
|---|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(void)
{
int num;
long int sec, push[200000], ans = 0, plus;
scanf("%d %ld", &num, &sec);
for (int i = 0; i < num; i++) {
scanf("%ld", &push[i]);
}
ans += sec;
plus = 0;
for (int i = 1; i < num; i++) {
if (push[i] - push[i - 1] < sec) {
plus += push[i] - push[i - 1];
}
if (plus) {
ans += plus;
plus = 0;
}
else {
ans += sec;
}
}
printf("%ld\n", ans);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void) {
int flag, i, N;
long long P, T, s[200010];
scanf("%d%lld", &N, &T);
for (i=0;i<N;i++) scanf("%lld", &s[i]);
P = 0LL; flag = 0;
for (i=0;i<N;i++) {
if (i<N-1) {
if (s[i] + T > s[i+1]) {
P += s[i+1] - s[i];
flag = 1;
} else {
P += T;
flag = 0;
}
} else {
P += T;
}
}
printf("%lld\n", P);
return 0;
} |
#include<stdio.h>
long long max(long long x,long long y){if(x>y){return x;}return y;}
int main(void){
long long res=0,n,l,w[128],v[128],i,j,k,dp[128][512]={0};//dp[choose][diff]
scanf("%lld%lld",&n,&l);
for(i = 1;i <= n;i++){scanf("%lld%lld",&w[i],&v[i]);}
for(i = 1;i <= n;i++){
for(j = (i-1);j >= 0;j--){
for(k = j*3;k >= 0;k--){
dp[j+1][k+(w[i]-w[1])] = max(dp[j+1][k+(w[i]-w[1])],dp[j][k]+v[i]);
}
}
}
for(i = 0;i <= n;i++){
for(j = 0;j <= 3*i;j++){
if(w[1]*i+j <= l){res = max(res,dp[i][j]);}
}
}
printf("%lld\n",res);
return 0;
} |
#include<stdio.h>
#include<stdlib.h>
#define ll long long
#define rep(i,l,r) for(ll i=(l);i<(r);i++)
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
ll dp[101000];
ll v[110],w[110];
int main(){
int n,W;
scanf("%d%d",&n,&W);
rep(i,0,n)scanf("%d%d",w+i,v+i);
if(w[0]>=1000){
ll q=W/w[0],r=W%w[0];
if(r>500)r=500;
W=900*q+r;
rep(i,1,n)w[i]=900+(w[i]-w[0]);
w[0]=900;
}
dp[0]=1;
rep(i,0,n)for(ll k=100000;k>=0;k--)if(dp[k])dp[k+w[i]]=max(dp[k+w[i]],dp[k]+v[i]);
W=min(W,100000);
ll ans=0;
rep(i,0,W+1)ans=max(ans,dp[i]);
printf("%d\n",ans-1);
return 0;
} |
#include<stdio.h>
long long MAX(long long a,long long b){return a<b?b:a;}
long long MIN(long long a,long long b){return a<b?a:b;}
long long n,w,a,i,j,k,max=0,m[110][2],d[110][110][410]={1};
int main(){
scanf("%lld %lld",&n,&w);
for(i=0;i<n;i++)scanf("%lld %lld",&m[i][0],&m[i][1]);
a=m[0][0];
for(i=0;i<n;i++)m[i][0]-=a;
for(i=0;i<n;i++){
for(j=i;j>-1;j--){
for(k=0;k<=400;k++){
if(d[i][j][k]==0)continue;
d[i+1][j][k]=d[i][j][k];
d[i+1][j+1][k+m[i][0]]=MAX(d[i+1][j+1][k+m[i][0]],d[i][j][k]+m[i][1]);
}
}
}
for(i=0;i<=n;i++){
for(j=0;j<400;j++){
if(i*a+j<=w)max=MAX(max,d[n][i][j]);
}
}
printf("%lld\n",max-1);
return 0;
}
|
#include <stdio.h>
int main()
{
int i, N, W, w[101], v[101];
scanf("%d %d", &N, &W);
for (i = 1; i <= N; i++) scanf("%d %d", &(w[i]), &(v[i]));
int j, k, l, dp[2][101][301] = {};
for (i = 1; i <= N; i++) {
l = w[i] - w[1];
for (j = l; j <= i * 3; j++) {
for (k = 0; k < i; k++) if (dp[0][k][j-l] + v[i] > dp[1][k+1][j]) dp[1][k+1][j] = dp[0][k][j-l] + v[i];
}
for (j = 0; j <= i * 3; j++) {
for (k = 0; k <= i; k++) dp[0][k][j] = dp[1][k][j];
}
}
int max = 0;
for (k = 0; k <= 100 && w[1] * k <= W; k++) {
for (j = 0; j <= k * 3 && w[1] * k + j <= W; j++) if (dp[0][k][j] > max) max = dp[0][k][j];
}
printf("%d\n", max);
fflush(stdout);
return 0;
} |
#include <stdio.h>
#include <string.h>
int N, W;
int dp[101][300];
int max(int a, int b) { return a > b ? a : b; }
int min(long long int a, long long int b) {
long long int tmp;
tmp = a < b ? a : b;
if (tmp < 0) tmp = -1;
return (int)tmp;
}
int main(void) {
int i, j, k, w1, w, v, ans = 0;
memset(dp, -1, sizeof(dp));
scanf("%d%d", &N, &W);
scanf("%d%d", &w1, &v);
dp[0][0] = 0;
dp[1][0] = v;
for (i = 1; i < N; i++) {
scanf("%d%d", &w, &v);
w -= w1;
for (j = i; j >= 0; j--) {
for (k = 299 - w; k >= 0; k--) {
if (dp[j][k] != -1) {
dp[j + 1][k + w] = max(dp[j + 1][k + w], dp[j][k] + v);
}
}
}
}
for (i = 0; i <= N; i++) {
for (j = min(W - (long long int)w1 * i, 299); j >= 0; j--) {
if (dp[i][j] != -1) {
ans = max(dp[i][j], ans);
}
}
}
printf("%d\n", ans);
return 0;
} |
#include<stdio.h>
#define MAX(a,b) (((a)>(b))?(a):(b))
long dp[100][101][301];
int main(int argc, char const *argv[]){
long n,w,i,we,va,w1,j,k,max=0;
scanf("%ld %ld",&n,&w);
scanf("%ld %ld",&w1,&va);
for(i=0;i<n;i++){
for(j=0;j<=i+1;j++){
for(k=0;k<=3*j;k++){
dp[i][j][k]=-1;
}
}
}
dp[0][0][0]=0;
dp[0][1][0]=va;
for(i=1;i<n;i++){
scanf("%ld %ld",&we,&va);
dp[i][0][0]=0;
for(j=1;j<=i+1;j++){
for(k=0;k<=j*3;k++){
if(k-(we-w1)<0 || dp[i-1][j-1][k-(we-w1)]==-1){
if(dp[i-1][j][k]!=-1) dp[i][j][k]=dp[i-1][j][k];
}else{
dp[i][j][k]=dp[i-1][j-1][k-(we-w1)]+va;
if(dp[i-1][j][k]!=-1) dp[i][j][k]=MAX(dp[i-1][j][k],dp[i][j][k]);
}
}
}
}
for(i=0;i<=n;i++){
for(j=0;j<=i*3;j++){
if(w1*i+j>w) break;
if(dp[n-1][i][j]!=-1) max=MAX(max,dp[n-1][i][j]);
}
}
printf("%ld\n",max);
return 0;
} |
#include<stdio.h>
long long MAX(long long a,long long b){return a<b?b:a;}
int main(){
long long n,m,a,b,i,j,k,l,w,d[4][100],r[4]={1};
long long max=0,s[4][100]={};
scanf("%lld %lld %lld %lld",&n,&m,&a,&b);
d[0][0]=b;
for(i=1;i<n;i++){
scanf("%lld %lld",&w,&b);
w-=a;
for(j=r[w]++;j&&d[w][j-1]<b;j--)d[w][j]=d[w][j-1];
d[w][j]=b;
}
/*for(i=0;i<4;i++){
for(j=0;j<r[i];j++)printf("%lld ",d[i][j]);printf("\n");
}//*/
for(i=0;i<4;i++){
for(j=0;j<r[i];j++)s[i][j+1]=d[i][j]+s[i][j];
}
/*for(i=0;i<4;i++){
for(j=0;j<=r[i];j++)printf("%lld ",s[i][j]);printf("\n");
}//*/
for(i=0;i<=r[0];i++){
for(j=0;j<=r[1];j++){
for(k=0;k<=r[2];k++){
for(l=0;l<=r[3];l++){
if((a+0)*i+(a+1)*j+(a+2)*k+(a+3)*l>m)continue;
max=MAX(max,s[0][i]+s[1][j]+s[2][k]+s[3][l]);
}
}
}
}
printf("%lld\n",max);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
int asc(const void* a, const void* b)
{
if (*(int*)a < *(int*)b)return 1;
if (*(int*)a > * (int*)b)return -1;
return 0;
}
int main()
{
int n, W;
scanf("%d %d", &n, &W);
int i, j;
int w[102], v[102];
for (i = 0; i < n; i++)
scanf("%d %d", &w[i], &v[i]);
int vv[4][102], l[4];
l[0] = l[1] = l[2] = l[3] = 0;
for (i = 0; i < n; i++)
{
vv[w[i] - w[0]][l[w[i] - w[0]]] = v[i];
l[w[i] - w[0]]++;
}
qsort(vv[0], l[0], sizeof(int), asc);
qsort(vv[1], l[1], sizeof(int), asc);
qsort(vv[2], l[2], sizeof(int), asc);
qsort(vv[3], l[3], sizeof(int), asc);
int sum[4][102];
for (i = 0; i < 4; i++)
{
sum[i][0] = 0;
for (j = 0; j < l[i]; j++)
sum[i][j + 1] = sum[i][j] + vv[i][j];
}
int ans = 0;
int a, b, c, d;
for (a = 0; a * w[0] <= W && a <= l[0]; a++)
for (b = 0; a * w[0] + b * (w[0] + 1) <= W && b <= l[1]; b++)
for (c = 0; a * w[0] + b * (w[0] + 1) + c * (w[0] + 2) <= W && c <= l[2]; c++)
for (d = 0; a * w[0] + b * (w[0] + 1) + c * (w[0] + 2) + d * (w[0] + 3) <= W && d <= l[3]; d++)
if (ans < sum[0][a] + sum[1][b] + sum[2][c] + sum[3][d])
ans = sum[0][a] + sum[1][b] + sum[2][c] + sum[3][d];
printf("%d\n", ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#define swap(type,a,b) do{type t=a;a=b;b=t;}while(0);
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define ll long long
#define INF 100000000
#define FOR(i,a,n) for(i=(a);i<(n);i++)
int comp(const void* a,const void* b){
return *(int*)b-*(int*)a;
}
void fill(int a[],int b,int c){
int i;
FOR(i,0,b) a[i]=c;
return;
}
int bag[4][100];
int sum[4][101];
int size[4];
int w[100],v[100];
ll ws[4];
int main(void)
{
int n,W,index,vsum,i,j,k,l;
int w_0=INT_MAX,ans=0;
ll s;
scanf("%d%d",&n,&W);
FOR(i,0,n){
scanf("%d%d",&w[i],&v[i]);
w_0=MIN(w_0,w[i]);
}
FOR(i,0,4) ws[i]=w_0+i;
FOR(i,0,n){
index=w[i]-w_0;
bag[index][size[index]++]=v[i];
}
FOR(i,0,4){
qsort(bag[i],size[i],sizeof(int),comp);
sum[i][1]=bag[i][0];
FOR(j,2,size[i]+1){
sum[i][j]=sum[i][j-1]+bag[i][j-1];
}
}
FOR(i,0,size[0]+1){
FOR(j,0,size[1]+1){
FOR(k,0,size[2]+1){
FOR(l,0,size[3]+1){
s=ws[0]*i+ws[1]*j+ws[2]*k+ws[3]*l;
if(s<=W){
vsum=sum[0][i]+sum[1][j]+sum[2][k]+sum[3][l];
ans=MAX(ans,vsum);
}
}
}
}
}
printf("%d\n",ans);
return 0;
}
|
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int N, v[110];
long long W, w[110], w0[110], w1[110], w2[110], w3[110];
long long max(int len, ...) {
long long i, _max, num;
va_list ap;
va_start(ap, len);
_max = va_arg(ap, long long);
for (i = 1; i < len; i++) {
num = va_arg(ap, long long);
if (num > _max)
_max = num;
}
va_end(ap);
return _max;
}
int llcmp(const void *a, const void *b) {
if (*(long long *)a < *(long long *)b) return 1;
else if (*(long long *)a > *(long long *)b) return -1;
else return 0;
}
int main(void) {
int a, b, c, d, i, j, k, l, m;
long long res, weight;
scanf("%d%lld", &N, &W);
for (i=0;i<N;i++) scanf("%lld%d", &w[i], &v[i]);
j = 0; k = 0; l = 0; m = 0;
for (i=0;i<N;i++) {
if (w[i] == w[0]) w0[++j] = v[i];
else if (w[i] == w[0]+1) w1[++k] = v[i];
else if (w[i] == w[0]+2) w2[++l] = v[i];
else w3[++m] = v[i];
}
qsort(w0+1,j,sizeof(long long),llcmp);
qsort(w1+1,k,sizeof(long long),llcmp);
qsort(w2+1,l,sizeof(long long),llcmp);
qsort(w3+1,m,sizeof(long long),llcmp);
for (a=1;a<=j;a++) w0[a] += w0[a-1];
for (b=1;b<=k;b++) w1[b] += w1[b-1];
for (c=1;c<=l;c++) w2[c] += w2[c-1];
for (d=1;d<=m;d++) w3[d] += w3[d-1];
res = 0; weight = 0;
for (a=0;a<=j;a++) for (b=0;b<=k;b++) for (c=0;c<=l;c++) for (d=0;d<=m;d++) {
weight = w[0]*a + (w[0]+1)*b + (w[0]+2)*c + (w[0]+3)*d;
if (weight <= W) res = max(2,res,w0[a]+w1[b]+w2[c]+w3[d]);
}
printf("%lld\n", res);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#define min(X, Y) ((X) < (Y) ? (X) : (Y))
#define max(X, Y) ((X) > (Y) ? (X) : (Y))
typedef long long ll;
ll N, W;
ll value[5][105];
ll st[4];
ll min_w = 1ll << 60ll;
ll v, w;
ll ans;
int cmp(const void *x, const void *y);
int main()
{
scanf("%lld %lld", &N, &W);
for (int i = 1; i <= N; i++) {
scanf("%lld %lld", &w, &v);
min_w = min(w, min_w);
st[w - min_w]++;
value[w - min_w][st[w - min_w]] = v;
}
for (int i = 0; i < 4; i++) {
qsort(value[i] + 1, N, sizeof(ll), cmp);
}
for (int i = 0; i < 4; i++) {
for (int j = 1; j <= N; j++) {
value[i][j] += value[i][j - 1];
}
}
for (int i = 0; i <= N; i++) {
for (int j = 0; j <= N; j++) {
for (int k = 0; k <= N; k++) {
for (int l = 0; l <= N; l++) {
if (i + j + k + l <= N &&
(i * min_w) +
(j * (min_w + 1)) +
(k * (min_w + 2)) +
(l * (min_w + 3)) <= W) {
ans = max(ans,
value[0][i] - value[0][0] +
value[1][j] - value[1][0] +
value[2][k] - value[2][0] +
value[3][l] - value[3][0]);
}
}
}
}
}
printf("%lld\n", ans);
return 0;
}
int cmp(const void *x, const void *y)
{
if (*(ll *)x > *(ll *)y) {
return -1;
}
else if (*(ll *)x == *(ll *)y) {
return 0;
}
else {
return 1;
}
}
|
#include <stdio.h>
#include <stdlib.h>
#define datatype long long int
datatype max(datatype a, datatype b){
if(a > b){
return a;
}
else{
return b;
}
}
datatype min(datatype a, datatype b){
if(a < b){
return a;
}
else{
return b;
}
}
int compare(datatype a, datatype b){
if(a < b){
return 1;
}
else if(a > b){
return -1;
}
else{
return 0;
}
}
datatype *sort_sub(datatype *origin, int N){
datatype *ans = (datatype *)malloc(sizeof(datatype) * N);
if(N == 1){
ans[0] = origin[0];
}
else{
int N1 = N / 2;
int N2 = (N + 1) / 2;
datatype *sub1 = sort_sub(&origin[0] , N1);
datatype *sub2 = sort_sub(&origin[N1], N2);
int i, j, k;
for(i = 0, j = 0, k = 0; i < N; i++){
if((compare(sub1[j], sub2[k]) == -1 && j != N1) || (k == N2)){
ans[i] = sub1[j];
j++;
}
else{
ans[i] = sub2[k];
k++;
}
}
free(sub1);
free(sub2);
}
return ans;
}
datatype *sort(datatype *origin, int N){
datatype *ans;
if(N == 0){
ans = NULL;
}
else{
ans = sort_sub(origin, N);
}
free(origin);
return ans;
}
int main(){
int N, W, i, j, k, w1, wi;
scanf("%d%d", &N, &W);
datatype **v = (datatype **)malloc(sizeof(datatype *) * 4);
int *vnum = (int *)malloc(sizeof(int) * 4);
for(i = 0; i < 4; i++){
v[i] = (datatype *)malloc(sizeof(datatype) * N);
vnum[i] = 0;
}
scanf("%d%lld", &w1, &v[0][0]);
vnum[0]++;
for(i = 1; i < N; i++){
scanf("%d", &wi);
scanf("%lld", &v[wi - w1][vnum[wi - w1]]);
vnum[wi - w1]++;
}
datatype **vsum = (datatype **)malloc(sizeof(datatype *) * 4);
for(i = 0; i < 4; i++){
v[i] = sort(v[i], vnum[i]);
vsum[i] = (datatype *)malloc(sizeof(datatype) * (vnum[i] + 1));
vsum[i][0] = 0;
for(j = 0; j < vnum[i]; j++){
vsum[i][j + 1] = vsum[i][j] + v[i][j];
}
}
datatype ans = 0;
for(i = 0; i <= vnum[3] && W - (w1 + 3) * i >= 0; i++){
for(j = 0; j <= vnum[2] && W - (w1 + 3) * i - (w1 + 2) * j >= 0; j++){
for(k = 0; k <= vnum[1] && W - (w1 + 3) * i - (w1 + 2) * j - (w1 + 1) * k >= 0; k++){
ans = max(vsum[3][i] + vsum[2][j] + vsum[1][k] + vsum[0][min(vnum[0], (W - (w1 + 3) * i - (w1 + 2) * j - (w1 + 1) * k) / w1)], ans);
}
}
}
printf("%lld\n", ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
struct item_t {
int w;
int v;
} ;
int compare_item(const void *a, const void *b) {
struct item_t *A = (struct item_t *)a;
struct item_t *B = (struct item_t *)b;
return A->w - B->w;
}
int compare_int(const void *a, const void *b)
{
return *(int*)b - *(int*)a;
}
int main(void)
{
//変数の宣言
int n;
long int weight;
int i,j,k,l;
struct item_t item[110];
long int kati[4][110];
long int katilen[4]={0,0,0,0};
long int katisum[4][110];
long int temp;
long int w1;
long int ans;
//データの読み込み
scanf("%d %ld",&n,&weight);
for(i=0;i<n;i++){
scanf("%d %d",&item[i].w,&item[i].v);
}
// printf("nは%dです\n", n);
// printf("データの読み込み終了\n");
//実際の処理
w1=item[0].w;
qsort(item, n, sizeof(struct item_t), compare_item);
// printf("qsort１回目完了\n");
for(i=0;i<n;i++){
// printf("w=%d,v=%d\n",item[i].w,item[i].v);
}
j=0;
k=0;
for(i=0;i<n;i++){
if(i==0){
//なにもしない
}else if(item[i].w!=item[i-1].w){
katilen[j]=k+1;
j++;
k=0;
}else{
k++;
}
kati[j][k]=item[i].v;
}
katilen[j]=k+1;
for(i=0;i<4;i++){
qsort(kati[i], katilen[i], sizeof(long int), compare_int);
for(j=0;j<katilen[i];j++){
if(j==0){
katisum[i][j]=kati[i][j];
}else{
katisum[i][j]=katisum[i][j-1]+kati[i][j];
}
}
}
for(i=0;i<4;i++){
// printf("w=%dの価値配列は\n{",w1+i);
for(j=0;j<katilen[i];j++){
if(j==0){
// printf("%d",katisum[i][j]);
}else{
// printf(",%d",katisum[i][j]);
}
}
// printf("}\n");
}
ans=0;
for(i=0;i<katilen[0]+1;i++){
for(j=0;j<katilen[1]+1;j++){
for(k=0;k<katilen[2]+1;k++){
// printf("i=%d,j=%d,k=%d,wsum=%d\n",i,j,k,w1*i+(w1+1)*j+(w1+2)*k);
if(weight-w1*i-(w1+1)*j-(w1+2)*k>=0){
l=(weight-w1*i-(w1+1)*j-(w1+2)*k)/(w1+3);
if(l>katilen[3]) l=katilen[3];
temp=0;
if(i!=0) temp=temp+katisum[0][i-1];
if(j!=0) temp=temp+katisum[1][j-1];
if(k!=0) temp=temp+katisum[2][k-1];
if(l!=0) temp=temp+katisum[3][l-1];
// printf("i=%d,j=%d,k=%d,l=%d,temp=%d\n\n",i,j,k,l,temp);
if(ans<temp) ans=temp;
}
}
}
}
// printf("計算部分終了\n");
//出力
printf("%ld",ans);
// printf("結果の出力終了\n");
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define INF ((1LL<<62)-(1LL<<31))
#define max(p,q)((p)>(q)?(p):(q))
#define min(p,q)((p)<(q)?(p):(q))
typedef struct piar{ll l,r;}I;
int hikaku(const void*p,const void*q){
I pp=*(I*)p,qq=*(I*)q;
if(pp.l<qq.l)return -1;
if(pp.l>qq.l)return 1;
return 0;
}
I a[200010];
ll rm[200010],rM[200010];
int main(){
int n;
scanf("%d",&n);
rep(i,0,n){
int x,y;
scanf("%d%d",&x,&y);
if(x>y){ll t=x;x=y;y=t;}
a[i].l=x;
a[i].r=y;
}
qsort(a,n,sizeof(I),hikaku);
rm[0]=INF,rM[0]=0;
rep(i,0,n){
rm[i+1]=min(rm[i],a[i].r);
rM[i+1]=max(rM[i],a[i].r);
}
ll ans=(a[n-1].l-a[0].l)*(rM[n]-rm[n]);
rep(i,0,n)ans=min(ans,(max(a[n-1].l,rM[i])-min(a[i].l,rm[i]))*(rM[n]-a[0].l));
printf("%lld\n",ans);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#define inf (int)(1e9 + 1)
int max(int a, int b){
if(a > b){
return a;
}
else{
return b;
}
}
int min(int a, int b){
if(a < b){
return a;
}
else{
return b;
}
}
typedef struct {
int x;
int y;
}pair;
#define datatype pair
int compare(datatype a, datatype b){
if(a.y < b.y){
return 1;
}
else if(a.y > b.y){
return -1;
}
else{
return 0;
}
}
datatype *sort_sub(datatype *origin, int N){
datatype *ans = (datatype *)malloc(sizeof(datatype) * N);
if(N == 1){
ans[0] = origin[0];
}
else{
int N1 = N / 2;
int N2 = (N + 1) / 2;
datatype *sub1 = sort_sub(&origin[0] , N1);
datatype *sub2 = sort_sub(&origin[N1], N2);
int i, j, k;
for(i = 0, j = 0, k = 0; i < N; i++){
if((compare(sub1[j], sub2[k]) == 1 && j != N1) || (k == N2)){
ans[i] = sub1[j];
j++;
}
else{
ans[i] = sub2[k];
k++;
}
}
free(sub1);
free(sub2);
}
return ans;
}
datatype *sort(datatype *origin, int N){
datatype *ans = sort_sub(origin, N);
free(origin);
return ans;
}
int main(){
int N, i, tmp, xmax = 0, xmin = inf, ymax = 0, ymin = inf;
scanf("%d", &N);
pair *ball = (pair *)malloc(sizeof(pair) * N);
for(i = 0; i < N; i++){
scanf("%d%d", &ball[i].x, &ball[i].y);
if(ball[i].x < ball[i].y){
tmp = ball[i].x;
ball[i].x = ball[i].y;
ball[i].y = tmp;
}
if(ball[i].x > xmax){
xmax = ball[i].x;
}
if(ball[i].x < xmin){
xmin = ball[i].x;
}
if(ball[i].y > ymax){
ymax = ball[i].y;
}
if(ball[i].y < ymin){
ymin = ball[i].y;
}
}
long long int ans1, ans2;
ans1 = (long long int)(xmax - xmin) * (ymax - ymin);
ball = sort(ball, N);
int dy = ball[N - 1].y - ball[0].y, _ymax = ball[N - 1].y, _ymin = inf;
for(i = 0; ball[i].y < _ymin && ball[i].x != xmax; i++){
_ymax = max(ball[i].x, _ymax);
_ymin = min(ball[i].x, _ymin);
dy = min(_ymax - min(ball[i + 1].y, _ymin), dy);
}
ans2 = (long long int)(xmax - ymin) * dy;
if(ans1 < ans2){
printf("%lld\n", ans1);
}
else{
printf("%lld\n", ans2);
}
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 200000
#define INF 0x3f3f3f3f3f3f3f3fLL
long long min(long long a, long long b) { return a < b ? a : b; }
void update(long long *ft, int i, int n, long long x) {
while (i < n) {
ft[i] = min(ft[i], x);
i |= i + 1;
}
}
long long query(long long *ft, int i) {
long long x = INF;
while (i >= 0) {
x = min(x, ft[i]);
i &= i + 1, i--;
}
return x;
}
int main() {
static long long dp[N], ft1[N], ft2[N];
int n, q, i, j;
long long d, ans;
scanf("%d%d%d%d", &n, &q, &i, &j), i--, j--;
memset(ft1, 0x3f, n * sizeof *ft1);
memset(ft2, 0x3f, n * sizeof *ft2);
update(ft1, j, n, -j);
update(ft2, n - 1 - j, n, j);
d = 0;
while (q--) {
int i_;
long long x;
scanf("%d", &i_), i_--;
d += abs(i - i_);
x = min(query(ft1, i_) + i_, query(ft2, n - 1 - i_) - i_) - abs(i - i_);
dp[i] = min(dp[i], x);
update(ft1, i, n, x - i);
update(ft2, n - 1 - i, n, x + i);
i = i_;
}
ans = INF;
for (i = 0; i < n; i++)
ans = min(ans, dp[i]);
ans += d;
printf("%lld\n", ans);
return 0;
}
|
main(c,v)char**v;{for(;~scanf("%s",v);putchar(*v-32));} |
main(a){for(;a>33||putchar((a=getchar())<0?10:a-32)>10;a=getchar());} |
#include<stdio.h>
char a[55],b[55],c[55];
int main(){
scanf("%s %s %s",&a,&b,&c);
printf("%c%c%c",a[0]-32,b[0]-32,c[0]-32);
}
|
#include<stdio.h>
main(){char s[4][16];for(s[0][0]=1;s[0][0]<4;s[0][0]++){scanf("%s",s[s[0][0]]);}printf("%c%c%c\n",s[1][0]-' ',s[2][0]-' ',s[3][0]-' ');} |
#include <stdio.h>
int main(void){
char s[3][11];
int i;
for(i=0;i<3;i++) scanf("%s",s[i]);
for(i=0;i<3;i++) printf("%c",s[i][0]-'a'+'A');
return 0;
}
|
#include <stdio.h>
char buf[3][11];
int main() {
scanf("%s %s %s",buf[0],buf[1],buf[2]);
printf("%c%c%c",buf[0][0]-32,buf[1][0]-32,buf[2][0]-32);
return 0;
} |
#include <stdio.h>
int main(void)
{
char s1[12], s2[12], s3[12];
int i;
scanf("%s %s %s", s1, s2, s3);
printf("%c%c%c\n", s1[0]-32, s2[0]-32, s3[0]-32);
return 0;
}
|
#include <stdio.h>
int main(void){
char s1[11], s2[11], s3[11];
scanf("%s %s %s", s1, s2, s3);
printf("%c%c%c\n", s1[0]-'a'+'A', s2[0]-'a'+'A', s3[0]-'a'+'A');
return 0;
} |
#include <stdio.h>
int main(){
char s1[11],s2[11],s3[11];
char d = 'A'-'a';
scanf("%s %s %s", s1,s2,s3);
printf("%c%c%c\n", s1[0]+d,s2[0]+d,s3[0]+d);
return 0;
}
|
#include <stdio.h>
int main(void)
{
char S1[16],S2[16],S3[16];
char A,B,C;
scanf("%s %s %s",S1,S2,S3);
A=S1[0]-32;
B=S2[0]-32;
C=S3[0]-32;
printf("%c%c%c",A,B,C);
return 0;
} |
#include <stdio.h>
int main(void){
for(int i=0; i<3; i++){
char S[11];
scanf("%s", S);
char A = S[0] - 0x20;
printf("%c", A);
}
} |
#include<stdio.h>
int main()
{
char s1[1005], s2[1005], s3[1005];
char a, b, c;
scanf("%s %s %s", s1, s2, s3);
a = s1[0] - 32;
b = s2[0] - 32;
c = s3[0] - 32;
printf("%c%c%c\n", a, b, c);
} |
#include<stdio.h>
int main(void)
{
char s1[11],s2[11],s3[11];
int L='a'-'A';
scanf("%s", s1);
scanf("%s", s2);
scanf("%s", s3);
putchar(s1[0]-L);
putchar(s2[0]-L);
putchar(s3[0]-L);
return 0;
} |
#include <stdio.h>
int main(){
char s[3];
char s1[10],s2[10],s3[10];
scanf("%s %s %s",s1,s2,s3);
s1[0] -='a'-'A';
s2[0] -='a'-'A';
s3[0] -='a'-'A';
printf("%c%c%c\n",s1[0],s2[0],s3[0]);
} |
#include <stdio.h>
char s[3][10];
int main(void) {
// your code goes here
scanf("%s %s %s",s[0],s[1],s[2]);
int tmp = 'A'-'a';
printf("%c%c%c",s[0][0]+tmp,s[1][0]+tmp,s[2][0]+tmp);
return 0;
}
|
#include <stdio.h>
#include <ctype.h>
int main() {
char s1[15], s2[15], s3[15];
scanf("%s %s %s", s1, s2, s3);
printf("%c%c%c", toupper(s1[0]), toupper(s2[0]), toupper(s3[0]));
return 0;
} |
#include <ctype.h>
#include <stdio.h>
#define MAX_CH 11
int
main(void)
{
char s[MAX_CH];
int i;
for (i = 0; i < 3; i++) {
scanf("%s", s);
putchar(toupper(s[0]));
if (i == 2)
puts("");
}
return 0;
}
|
#include <stdio.h>
int main(void){
char a[10];
char b[10];
char c[10];
int add;
add='A'-'a';
scanf("%s %s %s",a,b,c);
a[0]=a[0]+add;
b[0]=b[0]+add;
c[0]=c[0]+add;
printf("%c%c%c",a[0],b[0],c[0]);
return 0;
} |
#include<stdio.h>
#include<ctype.h>
int main()
{
char a[11],b[11],c[11],d[3];
int j=0;
char ch;
scanf("%s%s%s",a,b,c);
d[0]=a[0];
d[1]=b[0];
d[2]=c[0];
for(int i=0;i<3;i++){
ch=d[i];
putchar(toupper(ch));
}
} |
#include<stdio.h>
#define WORD_NUM 3
#define STR_MAX 35
int main(void)
{
char text[STR_MAX];
for(int i = 0; i < WORD_NUM; i++)
{
scanf("%s",text);
printf("%c",text[0] + ('A' - 'a'));
}
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main() {
char s1[11];
char s2[11];
char s3[11];
scanf("%s %s %s", s1, s2, s3);
printf("%c%c%c",s1[0]-32,s2[0]-32,s3[0]-32);
return 0;
}
|
#include<stdio.h>
int i;
char c;
int main(){
c=getchar();
putchar(c-'a'+'A');
while(c!=32){
c=getchar();
}
c=getchar();
putchar(c-'a'+'A');
while(c!=32){
c=getchar();
}
c=getchar();
putchar(c-'a'+'A');
putchar(10);
}
|
#include <stdio.h>
#include<string.h>
int main()
{
int aa,bb,cc;
char a[1000],b[1000],c[1000];
scanf("%s %s %s",a,b,c);
aa=(int)a[0]-97;
bb=(int)b[0]-97;
cc=(int)c[0]-97;
printf("%c%c%c",65+aa,65+bb,65+cc);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[11]={},s2[11]={},s3[11]={};
char t1,t2,t3;
scanf("%s %s %s",s1,s2,s3);
t1=s1[0]-('a'-'A');
t2=s2[0]-('a'-'A');
t3=s3[0]-('a'-'A');
printf("%c%c%c\n",t1,t2,t3);
return 0;
} |
#include <stdio.h>
void head(char s[]) {
if (s[0] >= 97 && s[0] <= 122) {
s[0] -= 32;
}
printf("%c", s[0]);
}
int main(void) {
char s1[10], s2[10], s3[10];
scanf("%s %s %s", s1, s2, s3);
head(s1);
head(s2);
head(s3);
printf("\n");
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdbool.h>
#include <math.h>
int main(void){
char s1[16], s2[16], s3[16];
scanf("%s%s%s", s1, s2, s3);
printf("%c%c%c\n", s1[0]+'A'-'a', s2[0]+'A'-'a', s3[0]+'A'-'a');
return 0;
} |
#include <stdio.h>
#include <ctype.h>
int main(void) {
char s1[16], s2[16], s3[16];
if (scanf("%15s%15s%15s", s1, s2, s3) != 3) return 1;
printf("%c%c%c\n",
toupper((unsigned char)s1[0]), toupper((unsigned char)s2[0]), toupper((unsigned char)s3[0]));
return 0;
}
|
#include <ctype.h>
#include <stdio.h>
#define MAX_CH 11
int
main(void)
{
char s1[MAX_CH], s2[MAX_CH], s3[MAX_CH];
scanf("%s %s %s", s1, s2, s3);
char f = toupper(s1[0]);
char s = toupper(s2[0]);
char t = toupper(s3[0]);
printf("%c%c%c\n", f, s, t);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <math.h>
int main(void)
{
char s[3][10+1];
scanf("%s %s %s\n",s[0],s[1],s[2]);
int i;
for (i=0;i<3;i++){
printf("%c",(char)((int)s[i][0]+'A'-'a'));
}
printf("\n");
return 0;
}
|
#include<stdio.h>
int main()
{
char s1[10],s2[10],s3[10],temp,temp2,temp3;
scanf("%s %s %s",&s1,&s2,&s3);
temp=s1[0];
temp=temp-32;
temp2=s2[0];
temp2=temp2-32;
temp3=s3[0];
temp3=temp3-32;
printf("%c%c%c\n",temp,temp2,temp3);
return 0;
}
|
#include<stdio.h>
#include<ctype.h>
int main() {
//int i=0;
char a[101],b[101],c[101];
scanf("%s %s %s",a,b,c);
char out[4];
snprintf(out,4,"%c%c%c",a[0]-32,b[0]-32,c[0]-32);
/*for (i = 0; i < 101;i++) {
if(isupper(str[i]) !=0)*/
printf("%s",out);
//}
return 0;
}
|
#include<stdio.h>
int main(){
int unused __attribute__((unused));
char s1[10], s2[10], s3[10];
unused = scanf("%s %s %s", s1, s2, s3);
s1[0] = s1[0] - ('a'-'A');
s2[0] = s2[0] - ('a'-'A');
s3[0] = s3[0] - ('a'-'A');
printf("%c%c%c", s1[0], s2[0], s3[0]);
return 0;
} |
# include <stdio.h>
# include <ctype.h>
int main(){
char s1[11], s2[11], s3[11], res[3];
scanf("%s %s %s", s1, s2, s3);
res[0] = toupper(s1[0]);
res[1] = toupper(s2[0]);
res[2] = toupper(s3[0]);
for (int i = 0; i<3; ++i)
printf("%c", res[i]);
printf("\n");
return 0;
}
|
#include <stdio.h>
int main(void){
char input[3][15];
char ans[5];
for (int i = 0; i < 3; i++){
scanf(" %s", &input[i]);
}
ans[0] = input[0][0]-0x20;
ans[1] = input[1][0]-0x20;
ans[2] = input[2][0]-0x20;
ans[3] = '\0';
printf("%s\n", ans);
return 0;
} |
/*
A - Three-letter acronym
<http://abc059.contest.atcoder.jp/tasks/abc059_a>
*/
#include <stdio.h>
int main(int argc, char const *argv[]) {
char s1[11], s2[11], s3[11];
scanf("%s %s %s", s1, s2, s3);
printf("%c%c%c", s1[0]+'A'-'a', s2[0]+'A'-'a', s3[0]+'A'-'a');
return 0;
}
|
#include <stdio.h>
#include<stdlib.h>
#include<string.h>
char s1[20],s2[20],s3[20];
void input(){
scanf("%s%s%s",s1,s2,s3);
}
int main(){
char captal[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
input();
printf("%c%c%c\n",captal[s1[0]-'a'],captal[s2[0]-'a'],captal[s3[0]-'a']);
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
int main(){
char one[10] = {0};
char two[10] = {0};
char three[10] = {0};
scanf("%s %s %s",one,two,three);
char alpha = one[0] - 32;
char beta = two[0] -32;
char gamma = three[0]-32;
printf("%c%c%c\n",alpha,beta,gamma);
return 0;
} |
#include <stdio.h>
#include <string.h>
#include <ctype.h>
int main(){
char s1[10],s2[10],s3[10];
scanf("%s %s %s", &s1,&s2,&s3);
char RYAKUGO[3+1];
memset(RYAKUGO,'\0',sizeof(RYAKUGO));
RYAKUGO[0] = toupper(s1[0]);
RYAKUGO[1] = toupper(s2[0]);
RYAKUGO[2] = toupper(s3[0]);
printf("%s",RYAKUGO);
} |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main(){
char str1[50] , str2[50] ,str3[50] ;
scanf("%s%s%s",str1,str2,str3);
int count1=0 , count2 = 0 , i;
char a = str1[0] - 32 ;
char b = str2[0] -32 ;
char c = str3[0] - 32 ;
//char *sd[] = strcat(a,b,c);
printf("%c%c%c",a,b,c);
}
|
#include<stdio.h>
#include<string.h>
#include<ctype.h>
int main()
{
char a[11],b[11],c[11];
scanf("%s %s %s",a,b,c);
char init[4]={a[0],b[0],c[0]};
char ans[4];
for(int i=0;i<=strlen(init);i++){
ans[i]=toupper(init[i]);
// printf("%s\n",init[i]);
}
printf("%s\n",ans);
return 0;
} |
//
// main.c
// procon
//
// Created by L on 2017. 10. 17..
// Copyright © 2017년 L. All rights reserved.
//
#include <stdio.h>
int main(int argc, const char * argv[]) {
// insert code here...
char a[10], b[10], c[10];
scanf("%s %s %s", &a, &b, &c);
printf("%c%c%c", a[0]-32, b[0]-32, c[0]-32);
return 0;
}
|
#include <stdio.h>
int yomisute(char str[],int i)
{
while(str[i] != ' ')
{
i++;
}
i++;
return i;
}
int main(void)
{
int b_num,c_num;
char a,b,c;
char str[72];
fgets(str,sizeof(str),stdin);
a = str[0];
b_num = yomisute(str,0);
b = str[b_num];
c_num = yomisute(str,b_num);
c = str[c_num];
printf("%c%c%c",a-32,b-32,c-32);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(void){
int A,B,C,D,E,N,M,x,y,i,j,cou=0,cou2,cou3,v[1000000],w[1000000],min_i,en=0;
char S[100],W[100],s[100],X,Y;
scanf("%s %s %s",&S,&W,&s);
if(S[i]>=97&&S[i]<=122){
S[i]=S[i]-32;
}
if(W[i]>=97&&W[i]<=122){
W[i]=W[i]-32;
}
if(s[i]>=97&&s[i]<=122){
s[i]=s[i]-32;
}
printf("%c%c%c",S[0],W[0],s[0]);
} |
#include <stdio.h>
#include <string.h>
int main()
{
char s[1002];
int i,h,len,j,n,k;
scanf(" %[^\n]", s);
len=strlen(s);
for(i=0;i<len;i++){
if(i==0) {
k = s[i]-32;
printf("%c",k);
}
}
len=strlen(s);
for(j=0;j<len;j++) {
if (s[j] == ' ') {
s[j] = s[j + 1];
n=s[j]-32;
printf("%c",n);}
}
printf("\n");
return 0;
} |
#include <stdio.h>
char a[20],b[20],c[20],d[30]="abcdefghijklmnopqrstuvwxyz",e[30]="ABCDEFGHIJKLMNOPQRSTUVWXYZ" ;
int x,y,z ;
int main(void){
scanf ("%s%s%s",a,b,c) ;
for (int i=0; i<30; i++ ){
if ( a[0]==d[i] ){
x = i ;
}
if ( b[0]==d[i] ){
y = i ;
}
if ( c[0]==d[i] ){
z = i ;
}
}
printf ("%c%c%c",e[x],e[y],e[z]) ;
return 0 ;
} |
#include <stdio.h>
#include <string.h>
int main()
{
char s1[10], s2[10], s3[10], S1, S2, S3;
scanf("%s %s %s", s1, s2, s3);
if(s1[0]>='a' && s1[0]<='z')
{
S1 = s1[0]-32;
}
else
{
S1 = s1[0];
}
if(s2[0]>='a' && s2[0]<='z')
{
S2 = s2[0]-32;
}
else
{
S2 = s2[0];
}
if(s3[0]>='a' && s3[0]<='z')
{
S3 = s3[0]-32;
}
else
{
S3 = s3[0];
}
printf("%c%c%c\n", S1, S2, S3);
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<ctype.h>
char str[3][10];
int len(char*);
int main(void){
for(int i=0;i<3;i++){
scanf("%s", str[i]);
if(len(str[i])<1 || len(str[i])>10){
printf("Error\n");
return 0;
}
printf("%c", toupper(str[i][0]));
}
printf("\n");
return 0;
}
int len(char arr[]){
char* p = arr;
int count=0;
char end = '\0';
while(strcmp(p,&end)){
count++;
p++;
}
return count;
}
|
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#define SIZE_STRING 10
#define NUM_STRING 3
#define SIZE_RESULT 4
int main(void)
{
/* 変数宣言 */
char cS[NUM_STRING][SIZE_STRING]; // 入力文字列
char cResult[SIZE_RESULT]; // 結果文字列
int iLoop; // ループカウンタ
/* 変数初期化 */
memset(cS, 0x00, sizeof(cS));
memset(cResult, 0x00, SIZE_RESULT);
/* 文字列読み込み */
for(iLoop = 0; iLoop < NUM_STRING; iLoop++)
{
scanf("%s", cS[iLoop]);
}
/* 入力文字列の先頭文字を結果文字列へコピー */
for(iLoop = 0; iLoop < NUM_STRING; iLoop++)
{
cResult[iLoop] = *cS[iLoop];
}
/* 結果文字列を大文字に変換 */
for(iLoop = 0; iLoop < NUM_STRING; iLoop++)
{
cResult[iLoop] = toupper(cResult[iLoop]);
}
/* 結果出力 */
printf("%s\n", cResult);
return 0;
} |
#include <stdio.h>
#include <ctype.h>
int main(){
int size = 10;
char s1[size+5],s2[size+5],s3[size+5];
scanf("%s%s%s",s1,s2,s3);
//translate to Capital
printf("%c%c%c\n",toupper(s1[0]),toupper(s2[0]),toupper(s3[0]));
return 0;
} |
#include <stdio.h>
int main() {
char s[3][11];
scanf("%s%s%s", s[0], s[1], s[2]);
for (int i = 0; i < 3; i++)
{
if (s[i][0] == 'a') printf("A");
else if (s[i][0] == 'b') printf("B");
else if (s[i][0] == 'c') printf("C");
else if (s[i][0] == 'd') printf("D");
else if (s[i][0] == 'e') printf("E");
else if (s[i][0] == 'f') printf("F");
else if (s[i][0] == 'g') printf("G");
else if (s[i][0] == 'h') printf("H");
else if (s[i][0] == 'i') printf("I");
else if (s[i][0] == 'j') printf("J");
else if (s[i][0] == 'k') printf("K");
else if (s[i][0] == 'l') printf("L");
else if (s[i][0] == 'm') printf("M");
else if (s[i][0] == 'n') printf("N");
else if (s[i][0] == 'o') printf("O");
else if (s[i][0] == 'p') printf("P");
else if (s[i][0] == 'q') printf("Q");
else if (s[i][0] == 'r') printf("R");
else if (s[i][0] == 's') printf("S");
else if (s[i][0] == 't') printf("T");
else if (s[i][0] == 'u') printf("U");
else if (s[i][0] == 'v') printf("V");
else if (s[i][0] == 'w') printf("W");
else if (s[i][0] == 'x') printf("X");
else if (s[i][0] == 'y') printf("Y");
else if (s[i][0] == 'z') printf("Z");
else printf("%c",s[i][0]);
}
return 0;
} |
main(){double a,b;scanf("%lf%lf",&a,&b);puts(a==b?"EQUAL":a>b?"GREATER":"LESS");} |
char s[999];i;b;main(a){for(gets(s);(a=getchar())>10;b=a>9?:b?b:a)a-=s[i++];puts(s[i]||b<0?"GREATER":b?"LESS":"EQUAL");} |
#include <stdio.h>
int main(){
double a,b;
scanf("%lf%lf",&a,&b);
puts(a==b?"EQUAL":a>b?"GREATER":"LESS");
return 0;
} |
#include <stdio.h>
int main(){
double A,B;
scanf("%lf",&A);
scanf("%lf",&B);
if(A>B){
printf("GREATER\n");
}else if(A<B){
printf("LESS\n");
}else if(A=B){
printf("EQUAL\n");
}
} |
#include<stdio.h>
#include<string.h>
int main(){
char a[111],b[111];
int ans=0;
scanf("%s%s",a,b);
if(strlen(a)==strlen(b)){
ans=strcmp(a,b);
}
else if(strlen(a)>strlen(b)){
ans++;
}
else {
ans--;
}
puts(ans?ans>0?"GREATER":"LESS":"EQUAL");
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX(a,b) (a > b) ? a : b
#define MIN(a,b) (a < b) ? a : b
const int inf = 1000000000; // 10^9
int main(){
double a,b;scanf("%lf%lf",&a,&b);
if(a > b)printf("GREATER\n");
else if(a < b)printf("LESS\n");
else printf("EQUAL\n");
return 0;
} |
#include<stdio.h>
int main(){
char a[101],b[101];
int s=0,t=0,i;
scanf("%s%s",a,b);
for(s=0;a[s];s++);for(t=0;b[t];t++);
if(s<t){printf("LESS");return 0;}
if(s>t){printf("GREATER");return 0;}
for(i=0;i<s;i++){if(a[i]<b[i]){printf("LESS");return 0;}if(a[i]>b[i]){printf("GREATER");return 0;}}
printf("EQUAL");
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdlib.h>
int main(void){
char a[101],b[101];
int aa=0;
scanf("%s",a);
scanf("%s",b);
if(strlen(a)>strlen(b)){printf("GREATER");}
else if(strlen(a)<strlen(b)){printf("LESS");}
else if(strcmp(a,b)==0){printf("EQUAL");}
else if(a[0]>b[0]) {printf("GREATER");}
else{printf("LESS");}
} |
#include<stdio.h>
#include<string.h>
int main()
{
int n,m,i,f=0;
char a[111],b[111];
scanf("%s%s",a,b);
n=strlen(a);
m=strlen(b);
if(n>m)
f=1;
else if(n<m)
f=-1;
for(i=0;i<n&&f==0;i++){
if(a[i]>b[i])
f=1;
else if(a[i]<b[i])
f=-1;
}
if(f==1)
puts("GREATER");
else if(f==0)
puts("EQUAL");
else
puts("LESS");
return 0;
}
|
#include<stdio.h>
int main(){
char a[2][101];
int i=0,j=0,f=0;
scanf("%s %s",a[0],a[1]);
while(a[0][i]!=0)i++;
while(a[1][j]!=0)j++;
if(i>j)f=1;
else if(i<j)f=-1;
else{
for(i=0;i<j;i++){
if(a[0][i]-'0'>a[1][i]-'0'){
f=1;
break;
}
if(a[0][i]-'0'<a[1][i]-'0'){
f=-1;
break;
}
}
}
if(f==1)puts("GREATER");
if(f==-1)puts("LESS");
if(f==0)puts("EQUAL");
return 0;
} |
#include<stdio.h>
int main(void)
{
char a[101],b[101];
int i, flg;
scanf("%s", a);
scanf("%s", b);
for(i=0;a[i]!='\0' && b[i]!='\0';i++);
if(a[i]!='\0' && b[i]=='\0'){
printf("GREATER\n");
}else if(a[i]=='\0' && b[i]!='\0'){
printf("LESS\n");
}else {
flg = strcmp(a,b);
if(flg==0){
printf("EQUAL\n");
}else if(flg < 0){
printf("LESS\n");
}else{
printf("GREATER\n");
}
}
return 0;
} |
#include<stdio.h>
#include<string.h>
int main(){
int len1 = 0, len2 = 0;
char s1[101], s2[101];
scanf("%s %s", s1, s2);
while(s1[len1]){
len1++;
}
while(s2[len2]){
len2++;
}
if(len1 > len2 || (len1 == len2 && strcmp(s1, s2) > 0)){
printf("GREATER\n");
} else if(strcmp(s1, s2) == 0){
printf("EQUAL\n");
} else {
printf("LESS\n");
}
return 0;
} |
#include<stdio.h>
#include<string.h>
int main()
{
char a[105],b[105],i;
scanf("%s",&a);
scanf("%s",&b);
if(strlen(a)>strlen(b))
{
printf("GREATER\n\n");
}
if(strlen(a)==strlen(b))
{
if(strcmp(a,b)>0)
{
printf("GREATER\n\n");
}
else if(strcmp(a,b)==0)
{
printf("EQUAL");
}
else if(strcmp(a,b)<0)
{
printf("LESS");
}
}
if(strlen(a)<strlen(b))
printf("LESS");
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(){
char a[110];
char b[110];
scanf("%s %s",a,b);
int c = strcmp(a,b);
if(strlen(a)>strlen(b))
printf("GREATER");
else if(strlen(a)<strlen(b))
printf("LESS\n");
else{
if(c<0)
puts("LESS");
else if(c>0)
puts("GREATER");
else
puts("EQUAL");
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
char a[104],b[104];
int lena,lenb,i;
int main(){
scanf("%s %s",&a,&b);
lena=strlen(a);
lenb=strlen(b);
if(lena>lenb)
printf("GREATER");
else if(lenb>lena)
printf("LESS");
else{
for(i=0;i<lena;i++){
if(a[i]>b[i]){
printf("GREATER");
break;
}
else if(b[i]>a[i]){
printf("LESS");
break;
}
}
if(i==lena)printf("EQUAL");
}
}
|
#include <stdio.h>
#include <limits.h>
#include <string.h>
int main(void)
{
char s1[102];
char s2[102];
scanf("%s%s", s1,s2);
if (strlen(s1) == strlen(s2))
{
if (strcmp(s1,s2) > 0)
printf("GREATER\n");
else if (strcmp(s1,s2) < 0)
printf("LESS\n");
else if (strcmp(s1, s2) == 0)
printf("EQUAL\n");
}
else if (strlen(s1) > strlen(s2))
printf("GREATER\n");
else
printf("LESS\n");
return (0);
}
|
#include <stdio.h>
#include <string.h>
int main(void) {
// your code goes here
char a[101],b[101];
gets(a);
gets(b);
int l= strlen(a),x = strlen(b),i = 0;
if(l<x)
printf("LESS");
else if(l>x)
printf("GREATER");
else
{
for(i = 0;a[i]!='\0';i++)
{
if(a[i]>b[i])
{
printf("GREATER");
break;
}
else if(a[i]<b[i])
{printf("LESS");
break;
}
}
if(a[i]=='\0')
printf("EQUAL");
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main() {
char a[102];
char b[102];
int c, d;
scanf("%s", a);
fflush(stdin);
scanf("%s", b);
fflush(stdin);
c = strlen(a); d = strlen(b);
if (c>d) {
printf("GREATER\n");
}
else if (c < d) {
printf("LESS\n");
}
else if (strcmp(a, b) < 0) {
printf("LESS\n");
}
else if (strcmp(a, b) == 0) {
printf("EQUAL\n");
}
else if (strcmp(a, b) > 0) {
printf("GREATER\n");
}
return 0;
} |
#include<stdio.h>
#include<string.h>
int main( ){
char a[101],b[101];
scanf("%s %s",a,b);
if( strlen( a ) < strlen( b ) ) {
printf("LESS\n");
}
else if( strlen( a ) > strlen( b ) ) {
printf("GREATER\n");
} else {
if( strcmp( a, b ) == 0 ){
printf("EQUAL\n");
}
else if( strcmp( a,b ) < 0 ){
printf("LESS\n");
}
else if( strcmp( a,b ) > 0 ){
printf("GREATER\n");
}
}
return 0;
} |
#include<stdio.h>
#include<string.h>
#define FOR(i,a,b) for(int i=a;i<b;i++)
int main(){
char A[100],B[100];
int ans = 0;
scanf("%s %s",A,B);
if(strlen(A) > strlen(B)) ans = 1;
if(strlen(A) < strlen(B)) ans = -1;
if(strlen(A) == strlen(B)){
FOR(i,0,strlen(A)){
if(A[i] > B[i]){ ans = 1; break; }
if(A[i] < B[i]){ ans = -1; break; }
}
}
if(ans == 1) printf("GREATER\n");
if(ans == -1) printf("LESS\n");
if(ans == 0) printf("EQUAL\n");
} |
#include<stdio.h>
#include<string.h>
const int maxn = 1e5+5;
int main()
{
char a[maxn],b[maxn];
int i;
gets(a);
gets(b);
long long len = strlen(a);
long long len1 = strlen(b);
if ( len > len1) printf("GREATER\n");
if ( len < len1) printf("LESS\n");
if( len == len1){
if ( strcmp(a,b) < 0 ) printf("LESS\n");
else if ( strcmp(a,b) == 0) printf("EQUAL\n");
else if( strcmp(a,b) > 0) printf("GREATER\n");
}
return 0;
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main() {
char *a = malloc(105*sizeof(char)), *b = malloc(105*sizeof(char));
scanf("%s %s", a, b);
int x = strlen(a), y = strlen(b);
if (x>y)
puts("GREATER");
else if (x<y)
puts("LESS");
else {
int z = strcmp(a, b);
if (z>0)
puts("GREATER");
else if (z<0)
puts("LESS");
else
puts("EQUAL");
}
return 0;
}
|
#include<stdio.h>
int A, B, i;
char c, a[102], b[102];
int main(){
c=getchar();
while(c!=10){
a[A]=c;
c=getchar(); A++;
}
c=getchar();
while(c!=10){
b[B]=c;
c=getchar(); B++;
}
if(A>B){
printf("GREATER\n");
return 0;
}else if(A<B){
printf("LESS\n");
return 0;
}
for(i=0; i<A; i++){
if(a[i]>b[i]){
printf("GREATER\n");
return 0;
}else if(a[i]<b[i]){
printf("LESS\n");
return 0;
}
}
printf("EQUAL\n");
}
|
#include<stdio.h>
#include<string.h>
const int Max = 1e6;
int main(){
char a[Max], b[Max];
int A, B, flag = 0;
gets(a);
gets(b);
if(strlen(a) > strlen(b)) flag = -1;
if(strlen(a) < strlen(b)) flag = 1;
if(strlen(a) == strlen(b)){
for(int i = 0; i < strlen(a); i++){
A = a[i], B = b[i];
if(A > B) { flag = -1; break; }
if(A < B) { flag = 1; break; }
}
}
if(flag == -1) printf("GREATER\n");
if(flag == 0) printf("EQUAL\n");
if(flag == 1) printf("LESS\n");
return 0;
} |
#include <stdio.h>
#include <string.h>
int main(void)
{
char a[101],b[101];
scanf("%s%s",a,b);
int lena,lenb,len;
lena=strlen(a);
lenb=strlen(b);
if(lena>lenb){printf("GREATER");}
else if(lena<lenb){printf("LESS");}
fprintf(stderr,"A=%s\nB=%s\n",a,b); /* case:lena=lenb */
int i;
if(a != b && lena==lenb)
{
for(i=0;i<=lena-1;i++)
{
if(a[i]>b[i]){printf("GREATER"); break;}
else if(a[i]<b[i]){printf("LESS"); break;}
if(i==lena-1 && a[i]==b[i]){printf("EQUAL");}
}
}
return 0;
}
|
#include <stdio.h>
int main(void)
{
char A[102],B[102];
int Ac,Bc;
int i;
scanf("%s",A);
scanf("%s",B);
for(i=0;i<100;i++){
if(A[i]=='\0')
break;
}
Ac=i;
for(i=0;i<100;i++){
if(B[i]=='\0')
break;
}
Bc=i;
if(Ac>Bc){
printf("GREATER");
}else if(Ac<Bc){
printf("LESS");
}else{
for(i=0;i<100;i++){
if(A[i]>B[i]){
printf("GREATER");
break;
}else if(A[i]<B[i]){
printf("LESS");
break;
}
if(Ac==i){
printf("EQUAL");
break;
}
}
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char sa[110],sb[110],max[110],min[110];
int n,flag = 0,i;
scanf("%s",sa);
scanf("%s",sb);
if(strlen(sa) > strlen(sb))
printf("GREATER\n");
else if(strlen(sa) < strlen(sb))
printf("LESS\n");
else
{
for(i = 0;sa[i] != '\0';i++)
{
if(sa[i] > sb[i])
{
printf("GREATER\n");
flag = 1;
break;
}
else if(sa[i] < sb[i])
{
printf("LESS\n");
flag = 1;
break;
}
}
if(flag == 0)
printf("EQUAL\n");
}
return 0;
}
|
#include <stdio.h>
int main() {
char s[2][110];
int d[2];
scanf("%s%s", s[0], s[1]);
for (int i = 0; i < 2; i++)
{
int j = 0;
for (; s[i][j] != '\0'; j++);
d[i] = j;
}
if (d[0] > d[1]) printf("GREATER");
else if (d[0] < d[1]) printf("LESS");
else
{
int i = 0;
while (1)
{
if (s[0][i] > s[1][i])
{
printf("GREATER");
break;
}
else if (s[0][i] < s[1][i])
{
printf("LESS");
break;
}
i++;
if (i > d[0])
{
printf("EQUAL");
break;
}
}
}
return 0;
} |
#include<stdio.h>
#include<string.h>
#define rep(i,n) for(int i = 0; i < n; i++)
int main(void) {
char A[128];
char B[128];
scanf("%s", A);
scanf("%s", B);
int LA = strlen(A);
int LB = strlen(B);
if(LA < LB) {
printf("LESS\n");
return 0;
} else if(LB < LA) {
printf("GREATER\n");
return 0;
}
rep(i, LA) {
if(A[i] < B[i]) {
printf("LESS\n");
return 0;
} else if(A[i] > B[i]) {
printf("GREATER\n");
return 0;
}
}
printf("EQUAL\n");
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(){
char a[103], b[103];
scanf("%s %s", a, b);
int alen = strlen(a), blen = strlen(b);
int ans = 0;
if(alen > blen){
ans = 1;
}else if(alen < blen){
ans = -1;
}else{
int now = 0;
while(now < alen){
if(a[now] > b[now]){
ans = 1;
break;
}else if(a[now] < b[now]){
ans = -1;
break;
}else{
now++;
}
}
}
if(ans == 1) printf("GREATER\n");
else if(ans == -1) printf("LESS\n");
else printf("EQUAL\n");
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(void)
{
char a[100], b[100];
int i, j, num, equal = 0;
scanf("%s", a);
scanf("%s", b);
i = strlen(a);
j = strlen(b);
if (i > j){
equal++;
printf("GREATER");
}
else if(i < j){
printf("LESS");
equal++;
}
else {
for(num = 0; num < i; num++){
if (a[num] > b[num]){
printf("GREATER");
equal++;
break;
}
else if(a[num] < b[num]){
printf("LESS");
equal++;
break;
}
else
continue;
}
}
if(!equal)
printf("EQUAL");
return 0;
} |
#include"stdio.h"
int main(){
char a[101],b[101];
scanf("%s %s",a,b);
int cnt_a=0,cnt_b=0,i;
while(a[cnt_a]!='\0') cnt_a++;
while(b[cnt_b]!='\0') cnt_b++;
if(cnt_a>cnt_b){
printf("GREATER\n");
}else if(cnt_a<cnt_b){
printf("LESS\n");
}else{
for( i=0;i<cnt_a;i++){
if(a[i]>b[i]){
printf("GREATER\n");
break;
}else if(a[i]<b[i]){
printf("LESS\n");
break;
}
}
if(i==cnt_a) printf("EQUAL\n");
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.