BeMg

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

int main()
{
    int choclat,coupon,a,money,sumchoclat;
    while(EOF!=scanf("%d",&money))
    {
    choclat = money;
    sumchoclat = choclat;

BeMg

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

int main()
{
   int a,b;
   while(scanf("%d%d",&a,&b)!=EOF)
   {
       if(a>b)
       {

BeMg

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

int main()
{
    int a,b;
    b = 0;
    while(scanf("%d",&a))
    {
        if(a<0) break;

BeMg

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

int main()
{
    long long int a,b,c,e,f;
    long long int d = 1;
    long long int temp = 0;
    while(scanf("%lld %lld",&a,&b)!=EOF)
    {

BeMg

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

int main()
{
    int step;
    while(scanf("%d",&step))
    {
        if(step == 0)break;
        int dice[6]={1,2,3,4,5,6};

BeMg

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


long long int get_reverse(long long int a)
{
    long long int result = 0;
    while(a!=0)
    {
        long long int digits = a%10;

BeMg

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

int main()
{
    int column[3000];
    int number;
    while(scanf("%d",&number)!=EOF)
    {
        int i = 0;

BeMg

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
struct node_
    {
        char c;
        long long int count;
    };

typedef struct node_ node;

BeMg

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

int main()
{
    int door_num;
    scanf("%d",&door_num);

    int door[door_num];
    int a = 0;

BeMg

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

int main()
{
    int num;
    scanf("%d",&num);
    int n = num;
    int sum = 0;
    int highbox[num];