Source_Code stringlengths 69 484k | IR_Original stringlengths 2.05k 17.9M |
|---|---|
#include <stdio.h>
int main(){
int k,x;
if(scanf("%d",&k)==1 && scanf("%d",&x)==1){
if(k >= 1 && k <= 100 && x >=0 && x <= 100){
for(int i = x-k+1;i < x+k;i++){
printf("%d ",i);
}
}else printf("error");
}else printf("error");
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220024/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220024/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(void)
{
int d[2000000];
int k,x,i;
scanf("%d%d",&k,&x);
for(i=(x+1000000)-k+1;i<(x+1000000)+k;i++){
d[i]=-1000000+i;
}
for(i=(x+1000000)-k+1;i<(x+1000000)+k;i++){
printf("%d ",d[i]);}
printf("\n");
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220068/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220068/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(void){
int k,x;
scanf("%d %d",&k,&x);
for(int i = -(k-1); i <= k-1; i++){
printf("%d ",x+i);
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220110/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220110/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(){
int k, x;
scanf("%d %d", &k, &x);
for(int i = 0; i < 2 * k - 1; i++){
printf("%d ", x - k + 1 + i);
}
printf("\n");
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220154/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220154/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main()
{
int n, m, d;
scanf("%d %d %d", &n, &m, &d);
if (d > 0) printf("%.10Lf\n", (long double)(m - 1) * (n - d) * 2 / n / n);
else printf("%.10Lf\n", (long double)(m - 1) * (n - d) / n / n);
fflush(stdout);
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220204/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220204/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
#define NIL NULL
Node root;
Node treeMinimum(Node x){
while(x->left!=NIL)
x=x->left;
return x;
}
Node treeMaximum(Node x){
while(x->right!=NIL)
x=x->right;
re... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220248/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220248/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define NO NULL
struct node{
int key;
struct node *p,*l,*r;
};
typedef struct node *Node;
Node root;
void insert(int k){
Node y=NO;
Node x=root;
Node z;
z=malloc(sizeof(struct node));
z->key=k;
z->l=NO;
z->r=NO;
while(x!=NO){
y=x;
if(z... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220291/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220291/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { i32, ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
void insert(int);
void preorder(Node);
void inorder(Node);
void treeDelete(Node);
Node treeSearch(Node, int);
#define NIL NULL
Node root;
Node treeSearch(Nod... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220334/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220334/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct Node{
int key;
struct Node *right;
struct Node *left;
struct Node *parent;
};
struct Node *root;
struct Node *NIL;
struct Node *find(struct Node *u, int k){
while (u != NIL && k != u->key){
if(k < u->key) u = u->left;
else u = u->ri... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220378/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220378/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.Node = type { i32, ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *r;
struct node *l;
struct node *p;
int key;
};
typedef struct node *Node;
#define NIL NULL
Node root;
Node find(Node u,int k){
while(u != NIL && k != u->key){
if(k < u->key)u = u->l;
else u = u->r;
}
return u;
}
void insert(int k)... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220420/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220420/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<stdlib.h>
#define NIL NULL
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
Node root;
Node treeSearch(Node u, int k){
while(u != NIL){
if(u->key == k) break;
if(u->key > k) u = u->left;
else u = u-... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220464/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220464/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
#define NIL NULL
Node root;
/*
Node treeMinimum(Node x){
}
*/
Node treeSearch(Node u, int k){
if(u==NIL || k==u->key) return u;
if(k<u->key)return tree... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220507/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220507/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *r;
struct node *l;
struct node *p;
int key;
};
typedef struct node * Node;
#define N NULL
Node root;
void insert(int);
void inorder(Node);
void preorder(Node);
Node find(Node, int);
int main(){
int s, i, x;
char c[20];
scanf("%d", &s);
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220550/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220550/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
# define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
typedef struct node {
int key;
struct node *p_left;
struct node *p_right;
struct node *p_parent;
}NODE;
void insert(int value); /* ?????\ */
void inorder(NODE *p_node); /* ??????????????? */
void preorder(NODE *p_node); /* ??????????????? */
in... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220600/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220600/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { i32, ... |
#include <stdio.h>
#include <stdlib.h>
#define MAX 500001
#define NIL NULL
struct node{
int key;
struct node *parent;
struct node *left;
struct node *right;
};
typedef struct node * Node;
Node root;
Node treeSearch(Node x, int k){
if(x==NIL||k==x->key)
return x;
if(k<x->key) return treeSearch(x->left... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220644/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220644/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { i32, ... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define NIL NULL
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node *Node;
Node root;
void insert(int k){
Node y = NIL;
Node x = root;
Node z;
z = malloc(sizeof(struct node));
z->key = k;
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220688/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220688/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<stdlib.h>
#define N 10000
#define NIL NULL
struct node{
struct node *left;
struct node *right;
struct node *parent;
int key;
};
typedef struct node * Node;
Node root;
void insert(int k){
Node y = NIL;
Node x = root;
Node z;
z = malloc(sizeof(struct node));
z->key = k;
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220730/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220730/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
#define NIL NULL
Node root;
Node treeSearch(Node u,int k){
while((u != NIL) && (k != u->key)){
if(k < u->key){
u = u->left;
}
else {
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220774/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220774/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
#define NIL NULL
Node root;
Node treeMinimum(Node x){
while(x->left != NIL){
x = x->left;
}
return x;
}
Node treeSearch(Node u, int k){
while(u... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220817/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220817/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include <stdio.h>
#include <stdlib.h>
struct node
{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node *Node;
#define NIL NULL
Node root;
Node treeMinimum(Node x)
{
while (x->left != NIL)
{
x = x->left;
}
return x;
}
Node treeMaximum(... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220860/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220860/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include <stdio.h>
#include <stdlib.h>
typedef struct data *node;
struct data
{
int key;
node par;
node left;
node right;
};
node root,NIL;
void insert(int k)
{
node y=NIL;
node x=root;
node z;
z=(node)malloc(sizeof(struct data));
z->key=k;
z->left=NIL;
z->right=NIL;
while(x!=NIL)
{
y=... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220910/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220910/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.data = type { i32, ... |
#include <stdio.h>
#include <stdlib.h>
#define NIL NULL
struct node{
int key;
struct node *parent, *left, *right;
};
typedef struct node * Node;
Node root;
Node treeSearch(Node u, int k){
while(u != NIL && k != u->key){
if(k < u->key) u=u->left;
else u=u->right;
}
return u;
}
void insert(int k){
N... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_220961/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_220961/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { i32, ... |
#include <stdio.h>
#include <stdlib.h>
#define NIL NULL
struct node {
struct node *left;
struct node *right;
struct node *parent;
int key;
};
typedef struct node *Node;
Node root;
Node treeMinimum(Node x){
while(x->left !=NIL) x=x->left;
return x;
}
Node treeMaximum(Node x){
}
Node treeSearch(Node u,... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221003/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221003/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include <stdio.h>
#include <stdlib.h>
#define NIL NULL
typedef struct node{
int key;
struct node *p;
struct node *l;
struct node *r;
}Node;
Node *T;
void insert(int);
void print(Node *);
void inorder(Node *);
void preorder(Node *);
Node *find(Node *,int);
int main()
{
int n,i,k,j;
char command[10];
N... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221047/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221047/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { i32, ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
int key;
struct node *parent;
struct node *left;
struct node *right;
};
typedef struct node *Node;
Node root,NIL;
Node find(Node u,int k){
while(u != NIL && k != u->key){
if(k < u->key){ u = u->left; }
else{ u = u->right; }
}
return u;
}
void insert(int ... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221090/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221090/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { i32, ... |
#include <stdio.h>
#include <stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
#define NIL NULL
Node root;
Node treeMinimum(Node x){
while(x->left!=NIL){
x=x->left;
}
return x;
}
Node treeMaximum(Node x){
while(x->right!=NIL)... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221133/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221133/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
#include<string.h>
#define MAX 500000
#define NIL -2000000001
struct becs{
int id,key,p,l,r;
};
typedef struct becs node;
node A[MAX];
void inp(int a,int u){
if(u==NIL || a==u)return;
if(A[a].key<A[u].key){
A[a].p=u;
inp(a,A[u].l);
if(A[u].l==NIL)A[u].l=a;
return;
}
else{
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221177/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221177/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.becs = type { i32, ... |
#include <stdio.h>
int main(void) {
// your code goes here
int t;
scanf("%d",&t);
while(t--){
int n;
scanf("%d",&n);
long long int fact=1;
for(int i=3;i<=2*n;i++){
fact=(fact*i)%1000000007;
}
printf("%lld\n",fact);
}
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_22122/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_22122/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr ... |
#include<stdio.h>
#include<stdlib.h>
struct node{
struct node *right;
struct node *left;
struct node *parent;
int key;
};
typedef struct node * Node;
#define NIL NULL
Node root;
Node treeMinimum(Node x){
while(x->left!=NIL){
x=x->left;
}
return x;
}
Node treeMaximum(Node x){
while(x->right!=... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221263/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221263/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.node = type { ptr, ... |
#include<stdio.h>
int main()
{
int N, K, a;
scanf("%d %d",&N , &K);
if(K==1)
printf("0");
else if(K>1)
{
a=N-(K);
printf("%d",a);
}
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221313/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221313/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#include <stdint.h>
#include <inttypes.h>
#include <stdlib.h>
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
int main()
{
int cnt;
int i;
int N, K;
int ret;
cnt = scanf("%d %d", &N, &K);
if (K == 1) {
printf("0");
return 0;
}
printf("%d", (N%K));
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221357/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221357/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
long long int findAns(int n){
long long int md=1e9+7;
long long int result=1;
for(int a=(2*n);a>=3;a--){
result=(result*a)%md;
}
result=result%md;
return result;
}
int main(){
int T;
scanf("%d",&T);
while(... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_22140/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_22140/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr ... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int compare_int(const void *a, const void *b)
{
// return *(int*)a - *(int*)b;
return *(long long*)a - *(long long*)b;
}
// qsort(A, b, sizeof(int), compare_int);
long long factorial(long long n) {
if (n > 0) {
return n *... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221443/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221443/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
void koria(int,int);
void koria(int i, int c){
printf("%d %d\n", i, c);
}
static const int MAX = 500;
static const int INY = (1<<21);
int main(){
int n;
int i;
int j;
int u;
int v;
int c;
int k;
int min = INY;
int M[MAX][MAX];
int cost[MAX];
int vis[MAX];
int p[MAX];
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221500/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221500/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#include <stdlib.h>
#define N 100
#define INF 10000000
#define WHITE 0
#define BLACK 1
int main(){
int i,j,n,count=0,v,c,v1,c1,u,mincost;
int G[N][N],color[N],d[N],pi[N];
for(i = 0;i < N;i++){
for(j = 0;j < N;j++){
G[i][j] = -1;
}
}
scanf("%d",&n);
for(i = 0;i < n;... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221551/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221551/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#define MAX 100
#define INFTY 10000000
int n,M[MAX][MAX];
void kbtit(){
int minv,i,v,u;
int d[MAX],color[MAX];
for(i = 0;i < n;i++){
d[i] = INFTY;
color[i] = 0;
}
d[0] = 0;
color[0] = 1;
while(1){
minv = INFTY;
u = -1;
for(i = 0;i < n;i++){
if(minv > d[i] && color[i] != 2){
u =i;
minv = d[i];
}
}... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221609/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221609/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@n = dso_local global i32 0... |
#include<stdio.h>
int main(void)
{
long long n;
scanf("%I64d", &n);
if (n == 1){
printf("-1");
} else {
printf("%I64d %I64d %I64d", n, n + 1, n * (n + 1));
}
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_22166/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_22166/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr ... |
#include <stdio.h>
#define N 100
#define INF 200000
#define WHITE 0
#define GRAY 1
#define BLACK 2
int G[N][N], n;
void dijkstra(void) {
int d[N], color[N];
int i, u, mincost;
for(i = 0; i < n; i++) {
d[i] = INF;
color[i] = WHITE;
}
d[0] = 0;
while(1){
mincost = INF;
for(i = 0; i < n; i+... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221702/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221702/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@n = dso_local global i32 0... |
#include <stdio.h>
#define INFTY 1000000
#define M -1
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define N 100
int n;
int A[N][N];
void dijkstra(void)
{
int d[N],p[N],color[N];
int i,v,u,mincost;
for(i = 0;i < n;i ++)
{
d[i] = INFTY;
p[i] = M;
color[i] = WHITE;
}
d[0] = 0;
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221746/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221746/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@n = dso_local global i32 0... |
#include<stdio.h>
#define NIL -1
#define WHITE 0
#define BLACK 1
static const int MAX = 500;
static const int INF = (1<<21);
int main(void){
int n, i, j, u, v, c, k;
int minv;
int M[MAX][MAX];
int check[MAX];
int p[MAX];
int key[MAX];
scanf("%d", &n);
for ( i = 0; i< n; i++ ){
for ( j = 0; j <... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221803/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221803/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define INFTY 1000000000
#define MAX 100
typedef struct{
int color; //全て白(0)に初期化済み
int id;
int distance;
int parent;
}DOT;
DOT A[MAX];
int G[MAX][MAX];
int MinTree(int n){
int total=0;
int min_box;
int flag;
int i;
int u,v;
A[0].dis... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221847/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221847/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.DOT = type { i32, i... |
#include <stdio.h>
#define INFNITY 900000
#define N 100
#define W 0
#define G 1
#define B 2
int data[N][N];
void dijkstra(int);
int main(){
int n,i,j,p,q,r,m;
scanf("%d",&n);
for(i=0;i<n;i++){//初期化
for(j=0;j<n;j++){
data[i][j]=INFNITY;
}
}
for(i=0;i<n;i++){
scanf("%d%d",&p,&q);
for(j=0;j<q;... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221890/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221890/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#define W -10
#define B -9
#define MAX 101
#define INF 20000000
void ISS(void);
void DA(void);
int n;/*頂点数*/
int T[MAX][MAX];/*行＝要素、列＝繋ってる要素*/
int color[MAX];/*色分け用配列*/
int d[MAX];
int pi[MAX];
int main()
{
int i,j,youso,kazu,v,kyori;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221933/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221933/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#include <stdlib.h>
#define N 100
#define BIG 10000000
int n,arr[N][N];
int main(){
int num,i,j,node,me,omomi,d[N],p[N],col[N],u,v,min;
scanf("%d",&n);
if(n<1 || n>N) exit(2);
for(i=0;i<n;i++){
d[i]=BIG;
p[i]=-1;
col[i]=0;
for(j=0;j<n;j++){
arr[i][j] = BIG;
} ... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_221977/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_221977/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#define NIL NULL
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define INF 1000000
int n,M[1000][1000];
void dijkstra(){
int d[100],color[100];
int i,v,minv,u;
for(i=0;i<n;i++){
d[i]=INF;
color[i]=WHITE;
}
d[0]=0;
color[0]=GRAY;
while(1){
minv=INF;... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222019/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222019/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@n = dso_local global i32 0... |
#include<stdio.h>
#define WHITE 1
#define BLACK 2
//#define GRAY 3
#define INF 10000000
int n,A[100][100];
void dijkstra(void);
int main(){
int i,j,u,k,c,v;
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<n;j++){
A[i][j]=INF;
}
}
for(i=0;i<n;i++){
scanf("%d %d",&u,&k);
for(j=0;j<k;j++){
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222062/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222062/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n;
int A[100][100];
void dijkstra(){
int i;
int minv;
int d[100],color[100];
int u,v;
int count;
for( i = 0; i < n; i++){
d[i] = 1000000;
color[i] = WHITE;
}
d[0] = 0;
color[0] = GRAY;
while(1){
minv = 1000000;
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222105/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222105/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@n = dso_local global i32 0... |
#include<stdio.h>
#define MAX 100
#define INFTY 200000
int main(){
int min,c,n,u,k,v,i,j,d[MAX];
int G[MAX][MAX];
int vis[MAX] = {}; //訪れたかどうか
scanf("%d",&n);
for(i = 0; i < n; i++){
for(j = 0; j < n; j++)
G[i][j] = INFTY;
}
for(i = 0; i < n; i++){
scanf("%d %d",&u,&k);
for(j = 0; ... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222156/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222156/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void){
int t;
int n[105];
scanf("%d",&t);
for(int i=0;i<t;i++){
scanf("%d",&n[i]);
}
for(int i=0;i<t;i++){
if(n[i]==2){printf("2\n");}
else if(n[i]==4){printf("%d\n",(int)pow(2,3)-2);}
else if(n[i]==6){printf("%d\n... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_2222/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_2222/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr co... |
#include<stdio.h>
#define INF 1000000
#define N 101
#define NIL -1
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n;
int M[N][N];
void DKR(void);
int main(){
int k,u,c,v,i,j;
scanf("%d",&n);
for(i=0;i<n;i++){
for(j=0;j<n;j++){
M[i][j]=INF;
}
}
for(i=0;i<n;i++){
scanf("%d%d",&u,&k);
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222242/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222242/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#define MAX 100
#define INFTY 100000000
#define WHITE 0
#define BLACK 2
#define GRAY 1
int n, M[MAX][MAX];
void dijkstra(){
int minv;
int d[MAX],color[MAX];
for(int i=0; i<n; i++){
d[i]=INFTY;
color[i]=WHITE;
}
d[0]=0;
color[0]=GRAY;
while (1) {... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222286/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222286/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@n = dso_local global i32 0... |
// AOJ 2801: Suntan
// 2017.11.21 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
long long s[100001], t[100001]; int N;
long long a[100001];
char buf[50], *p;
long long getlong()
{
long long n = 0;
while (*p >= '0') n = (n<<3) + (n<<1) + (*p++ & 0xf);
return n;
}
int bsch(int l, long long x)
{
int m, r = N+1;
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222336/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222336/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@p = dso_local local_unname... |
#include <stdio.h>
#include <string.h>
int main()
{
char inputS[11], inputT[11], inputU[11];
int redBallsNum, blueBallsNum;
scanf("%s %s", inputS, inputT);
scanf("%d %d", &redBallsNum, &blueBallsNum);
scanf("%s", inputU);
// Compare inputed strings and if both have value 'red' then reduce number of red balls
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222400/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222400/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int ft_strcmp(char* S, char* T)
{
int i;
i = 0;
while (S[i])
{
if (S[i] - T[i] != 0)
return (S[i] - T[i]);
i++;
}
return (S[i] - T[i]);
}
int main()
{
char S[11],T[11],U[11];
int A,B,i;
scanf("%s %s\n",&S, &T);
scanf("%d %d\n",&A,&B);
scanf("%s",&U);
i = 0;
if... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222444/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222444/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void)
{
char ball1[11], ball2[11], throw_ball[11];
int num1, num2;
scanf("%s %s", ball1, ball2);
scanf("%d %d", &num1, &num2);
scanf("%s", throw_ball);
int bool = 1;
int i = 0;
while (ball1[i] != '\0')
{
if (ball1[i] == throw_ball[i])
i++;
else
{
bo... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222488/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222488/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#define FOR(n) for(int i=0;i<n;i++)
#define FORJ(n) for(int j=0;j<n;j++)
#define PRN(n) printf("%d\n",n)
#define PRF(n) printf("%lf\n",n)
#define PRL(n) printf("%lld\n",n)
#define PRS(s) printf("%s\n",s)
#define PRC(c) printf("%c",c)
#define INF 1... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222538/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222538/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@fac = dso_local local_unna... |
#include <stdio.h>
int main(void){
char S[11],T[11],U[11];
int A=0,B=0;
scanf("%s %s",S,T);
scanf("%d %d",&A,&B);
scanf("%s",U);
for(int i=0; ; i++){
if(*S+i!=*U+i){
B--;
break;
}
if(*T+i!=*U+i){
A--;
break;
}
}
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222581/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222581/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#include<string.h>
#include<math.h>
int main(void) {
char str1[11], str2[11],str[11];
int ball1, ball2;
scanf("%s %s", str1, str2);
scanf("%d %d", &ball1, &ball2);
scanf("%s", str);
if (strcmp(str1, str) == 0)ball1--;
else ball2--;
printf("%d %d", ball1, ball2);
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222631/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222631/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(){
int n, ar[100005], i, odd[100005],nod,min;
long long sum;
sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",ar+i);
nod=0;
for(i=0;i<n;i++){
if(ar[i]&1){
odd[nod++]=ar[i];
}
sum+=ar[i];
}
if(nod&1){
min=odd[0];
for(i=0;i<nod;i++)
if(odd[i]<min)
min=odd[i... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_22269/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_22269/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr ... |
#include <stdio.h>
//#include <stdlib.h>
#include <string.h>
//#include <stdbool.h>
//#include <limits.h>
//#include <math.h>
int main() {
char s[15], t[15], u[15];
int a, b;
scanf("%s %s", s, t);
scanf("%d%d", &a, &b);
scanf("%s", u);
if (strcmp(t, u)) a--;
else b--;
printf("%d %d\n", a, b);
return ... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222732/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222732/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<stdbool.h>
#include<assert.h>
#include<time.h>
#include<ctype.h>
typedef long long ll;
typedef long double ld;
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
#define repp(i,l,r,k)for(ll i=(l);i<(r);i+=(k))
#define rrep(i,l,r)for(ll i=(l);i>=(r... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222790/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222790/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main() {
long long n, m;
scanf("%lld", &n);
m = n % 1000;
if (m != 0) {
m = 1000 - m;
}
else {
m = 0;
}
printf("%lld", m);
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222855/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222855/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(){
int N;
scanf("%d",&N);
printf("%d\n",(10000-N%1000)%1000);
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222899/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222899/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void)
{
int N, amari, ans;
scanf("%d", &N);
amari = N % 1000;
if (amari == 0) ans = 0;
else ans = 1000 - amari;
printf("%d", ans);
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_222941/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_222941/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main()
{
int N,R,S;
scanf("%d",&N);
if(N%1000==0){
printf("0\n");}
else if (N%1000>0){
R=N%1000;
S=1000-R;
printf("%d\n",S);
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223027/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223027/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#include<stdlib.h>
int main(void)
{
int N, result = 0;
if(scanf("%d", &N) == EOF) exit(1);
result = N % 1000;
if (result != 0) result = 1000 - result;
printf("%d", result);
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223070/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223070/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void) {
char input[6];
int n, m;
fgets(input, 5, stdin);
sscanf(input, "%d", &n);
while(n > 1000)n = n-1000;
m = 1000 - n;
printf("%d", m);
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223113/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223113/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@stdin = external local_unn... |
#include <stdio.h>
int main(){
int r = 1000;
int n;
scanf("%d", &n);
printf("%d\n", (r-n%r)%r);
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223157/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223157/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main()
{
int n,x,y,left[100008]={0},right[100008]={0};
long long unsigned int ans=0;
scanf("%d",&n);
while(n--)
{
scanf("%d%d",&x,&y);
if(left[x+y])
ans+=left[x+y];
left[x+y]++;
if(x>y)
{
if(right[x-y])
ans+=right[x-y];
right[x-y]++;
}
else
{
if(right[y-x+10000... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_22320/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_22320/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr ... |
#include <stdio.h>
int main()
{
int N;
int i;
int t;
int kei;
scanf("%d", &N);
if (N % 1000 > 0)
{
i = N / 1000;
t = i * 1000 + 1000;
kei = t - N;
printf("%d", kei);
}
else
{
kei = N - N;
printf("%d", kei);
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223243/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223243/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(void){
int n;
scanf("%d", &n);
if(n%1000==0){
printf("0\n");
}else{
printf("%d",1000-(n%1000));
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223287/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223287/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#include <limits.h>
typedef long long I64T;
#define I64P "I64d"
int main(void) {
I64T sum = 0;
int min_odd = INT_MAX, cur, n;
scanf("%d", &n);
while (n--) {
scanf("%d", &cur);
sum += cur;
if (cur % 2 == 1) {
if (cur < min_odd) min_odd = cur;
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_22333/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_22333/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr ... |
#include<stdio.h>
#include<string.h>
#define packet 1000
int main()
{
int value, change, payment;
scanf("%d", &value);
payment = (int)(value/packet) + 1;
change = payment*packet - value;
if (change == packet)
{
change = 0;
}
printf("%d", change);
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223380/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223380/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
int i = 1000;
while(i < n) {
i += 1000;
}
printf("%d\n", i - n);
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223423/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223423/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
n=n%1000;
if(n>0){
n=1000-n;
}
printf("%d\n",n);
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223474/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223474/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#include <string.h>
int main(){
char bun[100];
char right[100] = {'y','u','i','o','p','h','j','k','l','n','m'};
int i,j;
int flag = 2;
int beforeflag = 2;
int count = 0;
for(;;){
scanf("%s",bun);
if(strcmp(bun,"#") == 0)break;
for(j = 0;j < strlen(right);j++){
if(bun[0] == right[... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223517/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223517/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(void){
int c1, c5, c10, c50, c100, c500;
scanf("%d%d%d%d%d%d", &c1, &c5, &c10, &c50, &c100, &c500);
if (c1 * 1 + c5 * 5 + c10 * 10 + c50 * 50 + c100 * 100 + c500 * 500 >= 1000){
printf("1\n");
}
else{
printf("0\n");
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223568/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223568/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(void) {
int c1, c5, c10, c50, c100, c500, s;
scanf("%d %d %d %d %d %d", &c1, &c5, &c10, &c50, &c100, &c500);
s = 1 * c1 + 5 * c5 + 10 * c10 + 50 * c50 + 100 * c100 + 500 * c500;
if (s >= 1000) {
printf("1\n");
}
else {
printf("0\n");
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223610/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223610/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void)
{
int c1,c5,c10,c50,c100,c500,a;
scanf("%d" "%d" "%d" "%d" "%d" "%d",&c1,&c5,&c10,&c50,&c100,&c500);
a=c1+(c5*5)+(c10*10)+(c50*50)+(c100*100)+(c500*500);
if(a>=1000){
printf("1\n");
}
else{
printf("0\n");
}
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223669/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223669/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void)
{
int p,m,c,ans;
scanf("%d %d %d",&p,&m,&c);
ans=p+m+c;
printf("%d\n",ans);
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223719/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223719/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void)
{
int p,m,c,sum;
scanf("%d %d %d",&p,&m,&c);
sum=p+m+c;
printf("%d\n",sum);
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223762/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223762/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main()
{
int sum,p,m,c;
scanf("%d %d %d",&p,&m,&c);
sum=p+c+m;
printf("%d\n",sum);
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223805/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223805/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
int a[n],b[n];
int i,same=0;
for (i=0;i<n;i++) scanf("%d",&a[i]);
for (i=n-1;i>=0;i--) scanf("%d",&b[i]);
int left=0, right=n-1;
i=0;
//находим левую и правую границу одинаковых значений
while ((a[i]!=b[i])&&(i<n)) i++;
left=i;
i=n-1;
while ((a[i]!=b[i... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223849/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223849/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
#define ll long long
#define rep(i,l,r)for(ll i=(l);i<(r);i++)
typedef struct atai{ll nxt,n,c;}atai;
atai x[200010];
//*
//プラキュー（二分ヒープ）（最低限バージョン）
//int PQhikaku(int i,int j);//jの方が優先度が高いならtrueを返す
int PQhikaku(ll*heap,int i,int j){return x[heap[i]].nxt>x[heap[j]].nxt;}
void heap_utod(ll*heap,int n){
... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223892/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223892/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.atai = type { i64, ... |
// AOJ 0301: Baton Relay Game
// 2017.10.31
// 2018.1.19
#include <stdio.h>
typedef struct { int pre, nxt, f; } T;
T tbl[200002];
int a[200002];
//#define getchar_unlocked() getchar()
int in()
{
int n = 0;
int c = getchar_unlocked();
do n = (n<<3)+(n<<1) + (c & 0xf), c = getchar_unlocked();
while (c >= '0');
r... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_223986/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_223986/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
%struct.T = type { i32, i32... |
#include <stdio.h>
int change(int);
int main(void) {
int money, mai;
scanf("%d", &money);
while(money > 0) {
money = 1000 - money;
mai = change(money);
printf("%d\n", mai);
scanf("%d", &money);
}
return 0;
}
int change (int kane){
int count = 0, i = 0;
int wei[6] = {500, 100, 50, 10, 5, 1... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224028/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224028/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(){
int a,i,j,d500,d100,d50,d10,d5,d1;
while(1){
scanf("%d",&a);
if(a != 0){
a=1000-a;
d500=a/500;
a -= 500*d500;
d100=a/100;
a -= 100*d100;
d50=a/50;
a -= 50*d50;
d10=a/10;
a -= 10*d1... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224071/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224071/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(){
int a=1000,b,ans=0;
while(1){
scanf("%d",&b);
if(b==0)break;
else{
a=1000,ans=0;
a=a-b;
while(a>=500){
ans+=1;
a-=500;
}
while(a>=100){
ans+=1;
a-=100;
}
while(a>=50){
ans+=1;
a-=50;
}
while(a>=10){
ans+=1;
a-=10;
}... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224114/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224114/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(){
int coin[6]={500,100,50,10,5,1};
int price;
int ans;
int i;
int f=0;
while(f==0){
scanf("%d",&price);
if(price==0){
f=1;
}
else{
ans=0;
price=1000-price;
for(i=0;i<6;i++){
ans=ans+price/coin[i];
price=price%coin[i];
}
pri... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224172/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224172/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main() {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
int ischeck = 0;
if (a == b + c) {
ischeck = 1;
}
if (b == a + c) {
ischeck = 1;
}
if (c == b + a) {
ischeck = 1;
}
printf("%s",(ischec... | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224215/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224215/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(){
int a,b,c,tmp;
scanf("%d%d%d",&a,&b,&c);
if(a>b){
tmp=a;
a=b;
b=tmp;
}
if(b>c){
tmp=c;
c=b;
b=tmp;
}
if(a>b){
tmp=a;
a=b;
b=tmp;
}
if(a+b==c){
printf("Yes");
}else{
printf("No");
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224259/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224259/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
int main(void){
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if((a==b+c)||(b==a+c)||(c==a+b)){
printf("Yes");
}
else{printf("No");}
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224301/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224301/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a+b==c || b+c==a || c+a==b) printf("Yes");
else printf("No");
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224345/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224345/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main()
{
int a,b,c=0;
scanf("%d %d %d",&a,&b,&c);
if(a+b==c||a+c==b||c+b==a){
printf("Yes\n");
}
else
printf("No\n");
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224389/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224389/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
static int a, b, c;
int main(void) {
scanf("%d%d%d", &a, &b, &c);
if (a == b + c || b == c + a || c == a + b) {
puts("Yes");
} else {
puts("No");
}
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224439/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224439/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include<stdio.h>
void swap(int *a,int *b){
int hold;
hold=*a;
*a=*b;
*b=hold;
}
int main(){
int a,b,c,i;
scanf("%d %d %d",&a,&b,&c);
for(i=0;i<2;i++){
if(a>b) swap(&a,&b);
if(b>c) swap(&b,&c);
}
if((a+b)==c) printf("Yes\n");
else printf("No\n");
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224482/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224482/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void){
// Here your code !
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if(a+b == c || b+c == a || c+a == b){
printf("Yes\n");
}
else printf("No\n");
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224525/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224525/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(void){
int A,B,C;
scanf("%d %d %d",&A,&B,&C);
if((A<C&&C<B) || (B<C&&C<A) ){
printf("Yes");
}
else printf("No");
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224583/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224583/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
int main(){
int a,b,c;
scanf("%d %d %d",&a, &b, &c);
if((a<=c && c<=b) || (b<=c && c<=a)){
printf("Yes\n");
}
else{
printf("No\n");
}
return 0;
} | ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_224626/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_224626/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_add... |
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
int w1,w2,h2,h1,d;
scanf("%d%d%d%d",&w1,&h1,&w2,&h2);
d=(w1+h1+h2)*2+4;
printf("%d\n",d);
return 0;
}
| ; ModuleID = '/data/TheStack_IR/OJ_Samples/Collated/C/Source_22467/source.c'
source_filename = "/data/TheStack_IR/OJ_Samples/Collated/C/Source_22467/source.c"
target datalayout = "e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-f80:128-n8:16:32:64-S128"
target triple = "x86_64-pc-linux-gnu"
@.str = private unnamed_addr ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.