criyle/codenet-compile-errors huggingface dataset:
Language: Java

import java.util.LinkedList;
import java.util.Scanner;

public class P2 {
    public static void main(String[] args){
        Scanner scanner = new Scanner(System.in);
        LinkedList<String> name = new LinkedList<String>();
        LinkedList<Integer> time = new LinkedList<Integer>();
        int length = scanner.nextInt();
        int q = scanner.nextInt();
        int qTime = 0;
        for(int i = 0;i < length;i++){
            name.add(scanner.next());
            time.add(scanner.nextInt());
        }
        while(!name.isEmpty()){
            if(time.peek() <= q){
                System.out.print(name.poll()+" ");
                qTime = qTime + time.poll();
                System.out.println(qTime);
            }else{
                name.add(name.poll());
                time.add(time.poll()-q);
                qTime = qTime + q;
            }
        }
    }

}

Compiler output:
Main.java:4: error: class P2 is public, should be declared in a file named P2.java
public class P2 {
       ^
1 error
Language: Java

import java.util.LinkedList;
import java.util.Scanner;

public class P2 {
    private static Scanner scanner;
    public static void main(String[] args){
        scanner = new Scanner(System.in);
        LinkedList<String> name = new LinkedList<String>();
        LinkedList<Integer> time = new LinkedList<Integer>();
        int length = scanner.nextInt();
        int q = scanner.nextInt();
        int qTime = 0;
        for(int i = 0;i < length;i++){
            name.add(scanner.next());
            time.add(scanner.nextInt());
        }
        while(!name.isEmpty()){
            if(time.peek() <= q){
                System.out.print(name.poll()+" ");
                qTime = qTime + time.poll();
                System.out.println(qTime);
            }else{
                name.add(name.poll());
                time.add(time.poll()-q);
                qTime = qTime + q;
            }
        }
    }

}

Compiler output:
Main.java:4: error: class P2 is public, should be declared in a file named P2.java
public class P2 {
       ^
1 error
Language: Java

import java.util.LinkedList;
import java.util.Scanner;

public class P2 {
    private static Scanner scanner;
    public static void main(String[] args){
        scanner = new Scanner(System.in);
        LinkedList<String> name = new LinkedList<String>();
        LinkedList<Integer> time = new LinkedList<Integer>();
        int length = scanner.nextInt();
        int q = scanner.nextInt();
        int qTime = 0;
        
        for(int i = 0;i < length;i++){
            name.add(scanner.next());
            time.add(scanner.nextInt());
        }

        while(!name.isEmpty()){
            if(time.peek() <= q){
                System.out.print(name.poll() + " ");
                qTime = qTime + time.poll();
                System.out.println(qTime);
            }else{
                name.add(name.poll());
                time.add(time.poll() - q);
                qTime = qTime + q;
            }
        }
    }

}

Compiler output:
Main.java:4: error: class P2 is public, should be declared in a file named P2.java
public class P2 {
       ^
1 error
Language: Java

import java.util.Scanner;

class Queue{
  Process[] a = new Process[100000];
  int head;
  int tail;

  Queue(){
    head = 0;
    tail = 0;
  }

  void enqueue(Process p){
    if(tail+1 == a.length)
      tail = 0;
    else
      tail++

    a[tail] = p;
  }

  Process dequeue(){
    if(head+1 == a.length)
      head = 0;
    else
      head++
    return a[head];
  }

  boolean isFull(){
    if(head == (tail+1) % a.length)
      return true;
    else
      return false;
  }

  boolean isEmpty(){
    if(head == tail)
      return true;
    else
      return false;
  }

}

class Process{
  String name;
  int time;
  Process(String name, int time){
    this.name = name;
    this.time = time;
  }
  Process(Process p){
    this.name = p.name;
    this.time = p.time;
  }
}

public class Main{
  public static void main(String[] args){
    Scanner stdIn = new Scanner(System.in);
    int n = stdIn.nextInt();
    int q = stdIn.nextInt();
    Queue queue = new Queue();

    for(int i = 0; i < n; i++){
      String name = stdIn.next();
      int time = stdIn.nextInt();
      queue.enqueue(new Process(name, time));
    }

    int time_sum = 0;
    while(!queue.isEmpty()){
      Process p = queue.dequeue();
      p.time -= q;
      if(p.time <= 0){
        time_sum += (q + p.time);
        System.out.println(p.name + " " + (time_sum));
      }
      else{
        queue.enqueue(p);
        time_sum += q;
      }
    }

  }
}

Compiler output:
Main.java:17: error: ';' expected
      tail++
            ^
Main.java:26: error: ';' expected
      head++
            ^
2 errors
Language: Java

package javaTest;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 * Created by Lenovo on 2017/6/30.
 */
public class Algorithm {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int q = scanner.nextInt();
        List<Process> list = new ArrayList<>();
        for(int i = 0; i < n; i++){
            list.add(new Process(scanner.next(),scanner.nextInt()));
        }
        int index = 0,time = 0,end = 0;
        while(true){
            if(list.get(index).getTime()==0){

            } else if(list.get(index).getTime() <= q){
                time += list.get(index).getTime();
                list.get(index).setTime(0);
                end ++;
                System.out.println(list.get(index).getName()+" "+time);
                if(end == n)
                    break;
            }else{
                time += q;
                list.get(index).setTime(list.get(index).getTime()-q);
            }
            index = (index+1)%n;
        }
    }


}
class Process{
    String name;
    int time;
    public Process(String name,int time){
        this.name = name;
        this.time = time;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public int getTime() {
        return time;
    }

    public void setTime(int time) {
        this.time = time;
    }
}

Compiler output:
Main.java:10: error: class Algorithm is public, should be declared in a file named Algorithm.java
public class Algorithm {
       ^
1 error
Language: Java

import java.util.LinkedList;
import java.util.Scanner;

class Task {
	public String name;
	public int time;
	
	Task(String name, int time) {
		this.name = name;
		this.time = time;
	}
}
public class QueueTest {
	static LinkedList<Task> queue = new LinkedList<>();
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int sumTime = 0;
		
		int taskNum = sc.nextInt();
		int levelTime = sc.nextInt();
		
		for (int i = 0; i < taskNum; i++) {
			 queue.offer(new Task(sc.next(), sc.nextInt()));
		}
		
		
		while(!queue.isEmpty()) {
			Task task = queue.poll();
			
			if(task.time <= levelTime) {
				sumTime += task.time;
				System.out.println(task.name + " " + sumTime);
			} else {
				task.time -= levelTime;
				sumTime += levelTime;
				queue.offer(task);
			}
		}
	}
}

Compiler output:
Main.java:13: error: class QueueTest is public, should be declared in a file named QueueTest.java
public class QueueTest {
       ^
1 error
Language: Java

import java.util.LinkedList;
import java.util.Scanner;

class Task {
	public String name;
	public int time;
	
	Task(String name, int time) {
		this.name = name;
		this.time = time;
	}
}
public class ALDS1_3_B{
	static LinkedList<Task> queue = new LinkedList<>();
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int sumTime = 0;
		
		int taskNum = sc.nextInt();
		int levelTime = sc.nextInt();
		
		if(taskNum < 1 || taskNum > 100000)
			return;
		if(levelTime < 1 || levelTime > 1000)
			return;
		
		for (int i = 0; i < taskNum; i++) {
			 queue.offer(new Task(sc.next(), sc.nextInt()));
		}
		
		
		while(!queue.isEmpty()) {
			Task task = queue.poll();
			
			if(task.time <= levelTime) {
				sumTime += task.time;
				System.out.println(task.name + " " + sumTime);
			} else {
				task.time -= levelTime;
				sumTime += levelTime;
				queue.offer(task);
			}
		}
	}
}

Compiler output:
Main.java:13: error: class ALDS1_3_B is public, should be declared in a file named ALDS1_3_B.java
public class ALDS1_3_B{
       ^
1 error
Language: Java

package chapter4;

import java.util.ArrayDeque;
import java.util.Scanner;

public class QueueWithLib {

    public QueueWithLib() {
    }

    private Scanner sc;

    public static void main(String[] args) {
        new QueueWithLib().solve();
    }

    private void solve() {
        sc = new Scanner(System.in);
        java.util.Queue<q1_3> queue = new ArrayDeque<q1_3>();
        int n = sc.nextInt();
        int q = sc.nextInt();

        for (int i = 0; i < n; i++) {
            queue.offer(new q1_3(sc.next(), sc.nextInt()));
        }
        int sum = 0;
        while (!queue.isEmpty()) {
            q1_3 now = queue.poll();
            int d = Math.min(q, now.time);
            now.time -= d;
            sum += d;
            if (now.time > 0) {
                queue.offer(now);
            } else {

                System.out.println(now.name + " " + sum);
            }
        }
    }
}

class q1_3 {
    String name;
    int time;

    public q1_3(String name, int time) {
        super();
        this.name = name;
        this.time = time;
    }

}

Compiler output:
Main.java:6: error: class QueueWithLib is public, should be declared in a file named QueueWithLib.java
public class QueueWithLib {
       ^
1 error
Language: Java

import java.util.*;
class Queue {
	public static void main(String[] args){
		Scanner input=new Scanner(System.in);
		int taskNum=input.nextInt();
		int taskTime=input.nextInt();
		input.nextLine();//?¶??????¢????¬?
		Map<String, Integer> map = new LinkedHashMap<String, Integer>(); 

		String[] taskArr=new String[taskNum];
		int[] timeArr=new int[taskNum];
		for(int i=0;i<taskNum;i++){
			String str=input.nextLine();
			String[] arr = str.split("\\s+");
			taskArr[i]=arr[0];
			timeArr[i]=Integer.valueOf(arr[1]);

		}
		
		int nowTime=0,
			allTime=0;
		for(int i=0;i<timeArr.length;i++){
			allTime+=timeArr[i];
		}
		
		int pointer,
			add=0;

		while(nowTime!=allTime){
			pointer=add%taskNum;

			if(timeArr[pointer]==0){
				add++;
				continue;
			}
			else{
				if(timeArr[pointer]-taskTime>0){
					timeArr[pointer]-=taskTime;
					nowTime+=taskTime;
				}
				else if(timeArr[pointer]-taskTime<=0){
					nowTime+=timeArr[pointer];
					timeArr[pointer]=0;
					map.put(taskArr[pointer], nowTime);
				}
			}
			add++;
		}
		
		Set<Map.Entry<String, Integer>> entrySet=map.entrySet();
		
		for(Map.Entry<String, Integer> entry: entrySet){
			System.out.println(entry.getKey()+" "+entry.getValue());
		}
           return 0;
	}

}

Compiler output:
Main.java:55: error: incompatible types: unexpected return value
           return 0;
                  ^
1 error
Language: Java

class Queue {
	public static void main(String[] args){
		Scanner input=new Scanner(System.in);
		int taskNum=input.nextInt();
		int taskTime=input.nextInt();
		input.nextLine();//?¶??????¢????¬?
		Map<String, Integer> map = new LinkedHashMap<String, Integer>(); 

		String[] taskArr=new String[taskNum];
		int[] timeArr=new int[taskNum];
		for(int i=0;i<taskNum;i++){
			String str=input.nextLine();
			String[] arr = str.split("\\s+");
			taskArr[i]=arr[0];
			timeArr[i]=Integer.valueOf(arr[1]);

		}
		
		int nowTime=0,
			allTime=0;
		for(int i=0;i<timeArr.length;i++){
			allTime+=timeArr[i];
		}
		
		int pointer,
			add=0;

		while(nowTime!=allTime){
			pointer=add%taskNum;

			if(timeArr[pointer]==0){
				add++;
				continue;
			}
			else{
				if(timeArr[pointer]-taskTime>0){
					timeArr[pointer]-=taskTime;
					nowTime+=taskTime;
				}
				else if(timeArr[pointer]-taskTime<=0){
					nowTime+=timeArr[pointer];
					timeArr[pointer]=0;
					map.put(taskArr[pointer], nowTime);
				}
			}
			add++;
		}
		
		Set<Map.Entry<String, Integer>> entrySet=map.entrySet();
		
		for(Map.Entry<String, Integer> entry: entrySet){
			System.out.println(entry.getKey()+" "+entry.getValue());
		}
           return 0;
	}

}

Compiler output:
Main.java:3: error: cannot find symbol
		Scanner input=new Scanner(System.in);
		^
  symbol:   class Scanner
  location: class Queue
Main.java:3: error: cannot find symbol
		Scanner input=new Scanner(System.in);
		                  ^
  symbol:   class Scanner
  location: class Queue
Main.java:7: error: cannot find symbol
		Map<String, Integer> map = new LinkedHashMap<String, Integer>(); 
		^
  symbol:   class Map
  location: class Queue
Main.java:7: error: cannot find symbol
		Map<String, Integer> map = new LinkedHashMap<String, Integer>(); 
		                               ^
  symbol:   class LinkedHashMap
  location: class Queue
Main.java:49: error: cannot find symbol
		Set<Map.Entry<String, Integer>> entrySet=map.entrySet();
		^
  symbol:   class Set
  location: class Queue
Main.java:49: error: package Map does not exist
		Set<Map.Entry<String, Integer>> entrySet=map.entrySet();
		       ^
Main.java:51: error: package Map does not exist
		for(Map.Entry<String, Integer> entry: entrySet){
		       ^
Main.java:54: error: incompatible types: unexpected return value
           return 0;
                  ^
8 errors
Language: Java

class Queue {
	public static void main(String[] args){
		Scanner input=new Scanner(System.in);
		int taskNum=input.nextInt();
		int taskTime=input.nextInt();
		input.nextLine();//?¶??????¢????¬?
		Map<String, Integer> map = new LinkedHashMap<String, Integer>(); 

		String[] taskArr=new String[taskNum];
		int[] timeArr=new int[taskNum];
		for(int i=0;i<taskNum;i++){
			String str=input.nextLine();
			String[] arr = str.split("\\s+");
			taskArr[i]=arr[0];
			timeArr[i]=Integer.valueOf(arr[1]);

		}
		
		int nowTime=0,
			allTime=0;
		for(int i=0;i<timeArr.length;i++){
			allTime+=timeArr[i];
		}
		
		int pointer,
			add=0;

		while(nowTime!=allTime){
			pointer=add%taskNum;

			if(timeArr[pointer]==0){
				add++;
				continue;
			}
			else{
				if(timeArr[pointer]-taskTime>0){
					timeArr[pointer]-=taskTime;
					nowTime+=taskTime;
				}
				else if(timeArr[pointer]-taskTime<=0){
					nowTime+=timeArr[pointer];
					timeArr[pointer]=0;
					map.put(taskArr[pointer], nowTime);
				}
			}
			add++;
		}
		
		Set<Map.Entry<String, Integer>> entrySet=map.entrySet();
		
		for(Map.Entry<String, Integer> entry: entrySet){
			System.out.println(entry.getKey()+" "+entry.getValue());
		}
	}

}

Compiler output:
Main.java:3: error: cannot find symbol
		Scanner input=new Scanner(System.in);
		^
  symbol:   class Scanner
  location: class Queue
Main.java:3: error: cannot find symbol
		Scanner input=new Scanner(System.in);
		                  ^
  symbol:   class Scanner
  location: class Queue
Main.java:7: error: cannot find symbol
		Map<String, Integer> map = new LinkedHashMap<String, Integer>(); 
		^
  symbol:   class Map
  location: class Queue
Main.java:7: error: cannot find symbol
		Map<String, Integer> map = new LinkedHashMap<String, Integer>(); 
		                               ^
  symbol:   class LinkedHashMap
  location: class Queue
Main.java:49: error: cannot find symbol
		Set<Map.Entry<String, Integer>> entrySet=map.entrySet();
		^
  symbol:   class Set
  location: class Queue
Main.java:49: error: package Map does not exist
		Set<Map.Entry<String, Integer>> entrySet=map.entrySet();
		       ^
Main.java:51: error: package Map does not exist
		for(Map.Entry<String, Integer> entry: entrySet){
		       ^
7 errors
Language: Java

import java.util.*;
import java.lang.*;

class Main{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        String[] line = sc.nextLine().split(" ");
        int n = Integer.parseInt(line[0]);
        int work = Integer.parseInt(line[1]);
        int sumTime = 0;
        ArrayDeque<Struct> arr = new ArrayDeque<Struct>();
        for(int i = 0; i < n; i++){
            String[] line2 = sc.nextLine().split(" ");
            String name = line2[0];
            int time = Integer.parseInt(line2[1]);
            Struct s = new Struct(name,time);
            arr.push(s);
        }
        while(!(arr.isEmpty())){
            Struct sb = arr.removeLast();
            if(sb.time > work){
                sb.time-= work;
                arr.push(sb);
                sumTime+= work;
            }else{
                sumTime+=sb.time;
                System.out.print(sb.name + " ");
                System.out.println(sumTime);

            }

        }
}
class Struct{
    String name;
    int time;
    public Struct(String n, int t){
        name = n;
        time = t;
    }
}

Compiler output:
Main.java:41: error: reached end of file while parsing
}
 ^
1 error
Language: Java


public class Queue {
	String name;
	int time;

	public Queue(String n, int t) {
		name = n;
		time = t;
	}
}

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		int n = 0, q = 0;
		Scanner scanner = new Scanner(System.in);
		try {
			n = scanner.nextInt();
			q = scanner.nextInt();
		} catch (Exception e) {
		}
		Queue[] qu = new Queue[n];
		for (int i = 0; i < n; i++) {
			try {
				String name = scanner.next();
				int time = scanner.nextInt();
				qu[i] = new Queue(name, time);
			} catch (Exception e) {
			}
		}

		int i = 0, count = 0, alltime = 0;
		while (count < n) {
			i = i % n;
			if (qu[i].time > 0) {
				if (qu[i].time <= q) {
					alltime += qu[i].time;
					count++;
					qu[i].time = 0;
					System.out.println(qu[i].name + " " + alltime);
				} else {
					alltime += q;
					qu[i].time -= q;
				}
			}
			i++;
		}

	}
}

Compiler output:
Main.java:12: error: class, interface, enum, or record expected
import java.util.Scanner;
^
1 error
Language: Java

import java.util.Scanner;

public class Queue {
	String name;
	int time;

	public Queue(String n, int t) {
		name = n;
		time = t;
	}
}



public class Main {
	public static void main(String[] args) {
		int n = 0, q = 0;
		Scanner scanner = new Scanner(System.in);
		try {
			n = scanner.nextInt();
			q = scanner.nextInt();
		} catch (Exception e) {
		}
		Queue[] qu = new Queue[n];
		for (int i = 0; i < n; i++) {
			try {
				String name = scanner.next();
				int time = scanner.nextInt();
				qu[i] = new Queue(name, time);
			} catch (Exception e) {
			}
		}

		int i = 0, count = 0, alltime = 0;
		while (count < n) {
			i = i % n;
			if (qu[i].time > 0) {
				if (qu[i].time <= q) {
					alltime += qu[i].time;
					count++;
					qu[i].time = 0;
					System.out.println(qu[i].name + " " + alltime);
				} else {
					alltime += q;
					qu[i].time -= q;
				}
			}
			i++;
		}

	}
}

Compiler output:
Main.java:3: error: class Queue is public, should be declared in a file named Queue.java
public class Queue {
       ^
1 error
Language: Java

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayDeque;
import java.util.Deque;

public class Main {

	public static void main(String[] args) throws IOException, NumberFormatException {
		// TODO ?????????????????????????????????????????????
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		Deque<Pair> deq = new ArrayDeque<Pair>();
		
		String[] str = br.readLine().split(" ");
		
		int n = Integer.parseInt(str[0]);
		int q = Integer.parseInt(str[1]);
		
		
		for(int i = 0; i < n; i++){
			str = br.readLine().split(" ");
			deq.addFirst(new Pair(str[0], Integer.parseInt(str[1])));
		}
		
		int timeCount = 0;
		
		String[] name = new String[n];
		int[] time = new int[n];
		
		for(int i = 0; !deq.isEmpty();){
			
			Pair p = deq.removeLast();
			
			if(p.getTime() > q){
				p.overTime(q);
				deq.addFirst(p);
				timeCount += q;
			} else {
				timeCount += p.getTime();
				
				name[i] = p.getName();
				time[i] = timeCount;
				i++;
			}
		}
		
		for(int i = 0; i < n; i++){
			System.out.println(name[i] + " " + time[i]);
		}
	}

}

public class Pair {
	String name;
	int time;
	
	Pair(String name, int time){
		this.name = name;
		this.time = time;
	}
	
	void overTime(int over){
		time -= over;
	}
	int getTime(){
		return time;
	}
	String getName(){
		return name;
	}
}

Compiler output:
Main.java:54: error: class Pair is public, should be declared in a file named Pair.java
public class Pair {
       ^
1 error
Language: Java

import java.util.*;

////queue for round robin
public class Main{
    int processid = 0;
    int val = 0;
    QueueAizu(int a, int b){
        processid = a;
        val = b;
    }

    public static void main(String[] args) {
        //
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int quantum = in.nextInt();
        int[] name = new int[n+1];
        QueueAizu[] res = new QueueAizu[n+1];
        res[0] = new QueueAizu(0,1000050);
        Queue<QueueAizu> q = new LinkedList<>();
        for(int i = 1; i<=n; i++){
            in.next();
            name[i] =  in.nextInt();
            q.offer(new QueueAizu(i,name[i]));
            QueueAizu temp = new QueueAizu(i,0);
            res[i] = temp;
        }
        //System.out.println(res.length);
        //howto deal with p1, p2, p3

        int count = 1;
        int length = n;
        int save = 0;
        while(!q.isEmpty()){
            //if(count>q.size()) count = 0;
            QueueAizu temp = q.poll();
            if(temp.val<=quantum){ //
                save += (quantum - temp.val);
                res[temp.processid].val+=(count*quantum-save);

            }else if(temp.val > quantum){
                temp.val = temp.val-quantum;
                q.offer(temp);
                //res[temp.processid].val+=(quantum);
            }
            count++;
        }

        Arrays.sort(res, new Comparator<QueueAizu>() {
            @Override
            public int compare(QueueAizu o1, QueueAizu o2) {
                return o1.val-o2.val;
            }
        });
        for(int i = 0; i<n; i++){
            System.out.println("p"+res[i].processid+" "+res[i].val);
        }

    }
}



Compiler output:
Main.java:7: error: invalid method declaration; return type required
    QueueAizu(int a, int b){
    ^
1 error
Language: Java


import java.util.Scanner;

import com.sun.corba.se.impl.orbutil.closure.Constant;

public class Main {
	
	public static int size = 5;
	public static int interval = 100;
	
	public static int head=0, tail=0;
	
	public static boolean isFull() {
		return (tail-head >= size) ? true : false;
	}
	
	public static boolean isEmpty() {
		return (tail-head <=0 ) ? true : false;
	}

	public static void enqueue(Item[] queue, Item x) throws Exception {
		if (isFull()) 
			throw new Exception("Error: The queue is full!");
		queue[tail%size] = x;
		tail ++;
	}
	
	public static Item dequeue(Item[] queue) throws Exception {
		if (isEmpty())
			throw new Exception("Error: The queue is empty");
		Item headItem = queue[head%size];
		queue[head%size] = null;
		head ++;
		return headItem;
	}
	
	public static int process(Item i, int interval) {
		int time = i.getTime();
		if (time<=interval) {
			i.setTime(0);
			return time;
		} else {
			i.setTime(time-interval);
			return interval;
		}
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		size = sc.nextInt();
		interval = sc.nextInt();
		Item[] queue = new Item[size];
		
		int atime = 0;
		
		try {
			for (int i=0; i<size; i++) {
				enqueue(queue, new Item(sc.next(), sc.nextInt()));
			}
			sc.close();
			
			for (int i=head; !isEmpty(); i++) {
				Item item = dequeue(queue);
				atime += process(item, interval);
				if (item.getTime() == 0) {
					System.out.println(item.getName() + " " + atime);
				} else {
					enqueue(queue, item);
				}
			}
		
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}

class Item {
	private String name;
	private int time;
	public String getName() {
		return name;
	}
	public int getTime() {
		return time;
	}
	public void setName(String name) {
		this.name = name;
	}
	public void setTime(int time) {
		this.time = time;
	}
	public Item(String name, int time) {
		super();
		this.name = name;
		this.time = time;
	}
	
}


Compiler output:
Main.java:4: error: package com.sun.corba.se.impl.orbutil.closure does not exist
import com.sun.corba.se.impl.orbutil.closure.Constant;
                                            ^
1 error
Language: Java

import java.util.Scanner;

class Main {
	static int quantum = 0;
	public static void main (String [] args) {
		Scanner scan = new Scanner (System.in);
		
		//プロセス数
		int n = scan.nextInt();
		String[] str = new String[n];
		int[] data = new int[n];
		
		//クオンタム
		int q = scan.nextInt();
		
		for (int i = 0; i < n; i++) {
			str[i] = scan.next();
			data[i] = scan.nextInt();
		}
		scan.close();
		
		Main obj = new Main();
		obj.Queue(str, data, q);
	}
	
	void Queue (String[] str, int[] data, int q) {
		int count = data.length;
		int head = 0;
		int top = count - 1;
		
		while (true) {
			if ( data[head] != 0) {
				data[head] = Quantum(data[head], q);
				if (data[head] == 0) {
					count--;
					System.out.println(str[head] " " + quantum);
				} 
			}
			
			if (count == 0) break;
			
			head = head + 1;
			if (head > top) head = 0;
		}
	}
	
	int Quantum(int x, int q) {
		
		if ( x < q) {
			quantum += x;
			return 0;
		} else {
			x -= q;
			quantum += q;
		}
		
		return x;
		
	}
}


Compiler output:
Main.java:36: error: ')' or ',' expected
					System.out.println(str[head] " " + quantum);
					                            ^
Main.java:36: error: not a statement
					System.out.println(str[head] " " + quantum);
					                                   ^
Main.java:36: error: ';' expected
					System.out.println(str[head] " " + quantum);
					                                          ^
3 errors
Language: Java

import java.util.Scanner;

class Main {
	static int quantum = 0;
	public static void main (String [] args) {
		Scanner scan = new Scanner (System.in);
		
		//プロセス数
		int n = scan.nextInt();
		String[] str = new String[n];
		int[] data = new int[n];
		
		//クオンタム
		int q = scan.nextInt();
		
		for (int i = 0; i < n; i++) {
			str[i] = scan.next();
			data[i] = scan.nextInt();
		}
		scan.close();
		
		MainTest obj = new MainTest();
		obj.Queue(str, data, q);
	}
	
	void Queue (String[] str, int[] data, int q) {
		int count = 0;
		int head = 0;
		int top = data.length;
		
		while (true) {
			if ( data[head] != 0) {
				data[head] = Quantum(data[head], q);
				if (data[head] == 0) {
					count++;
					System.out.println(str[head] + " " + quantum);
				} 
			}
			
			if (count == top) break;
			
			head++;
			if (head == top) head = 0;
		}
	}
	
	int Quantum(int x, int q) {
		
		if ( x < q) {
			quantum += x;
			return 0;
		} else {
			x -= q;
			quantum += q;
		}
		
		return x;
		
	}
}


Compiler output:
Main.java:22: error: cannot find symbol
		MainTest obj = new MainTest();
		^
  symbol:   class MainTest
  location: class Main
Main.java:22: error: cannot find symbol
		MainTest obj = new MainTest();
		                   ^
  symbol:   class MainTest
  location: class Main
2 errors
Language: Java

package alds1;

import java.util.Scanner;

public class ALDS1_3_B {

	static class Node<E> {
		public E value;
		public Node<E> next;		
		public Node(E value) {
			this.value = value;
			this.next = null;
		}
	}

	static class SimpleQueue<E> {
		
		private Node<E> head;
		private Node<E> tail;
		int size;
		
		public SimpleQueue() {
			size = 0;
			head = null;
			tail = null;
		}
		
		public int getSize() {
			return size;
		}
		
		public boolean isEmpty() {
			return size == 0;
		}
		
		public void enqueue(E element) {
			Node<E> node = new Node<E>(element);
			if (head == null && tail == null) {
				head = tail = node;
			} else {
				tail.next = node;
				tail = node;
			}
			size++;
		}
		
		public E dequeue() {			
			if (isEmpty()) {
				return null;
			}
			E element = head.value;
			head = head.next;
			if (head == null) {
				tail = null;
			}
			size--;
			return element;			
		}
		
		public String toString() {
			StringBuilder sb = new StringBuilder();
			sb.append("[");
			Node<E> current = head;
			while (current != null) {
				sb.append(current.value);
				current = current.next;
				if (current != null) {
					sb.append(", ");
				}
			}			
			sb.append("](");
			if (tail != null) {
				sb.append(tail.value);
			}
			sb.append(")");
			return sb.toString();
		}		
	}
	
	static class Process {		
		public String name;
		public int time;		
		public Process(String name, int time) {
			this.name = name;
			this.time = time;
		}		
	}
	
	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int q = sc.nextInt();
		
		SimpleQueue<Process> queue = new SimpleQueue<Process>();
		for (int i = 0; i < n; i++) {
			String name = sc.next();
			int time = sc.nextInt();
			queue.enqueue(new Process(name, time));
		}
		sc.close();

		int total = 0;
		while (!queue.isEmpty()) {
			
			Process process = queue.dequeue();
			if (process.time > q) {
				process.time = process.time - q;
				total += q;
				queue.enqueue(process);
			} else {
				total += process.time;
				System.out.println(process.name + " " + total);
			}			
		}
	}
}




Compiler output:
Main.java:5: error: class ALDS1_3_B is public, should be declared in a file named ALDS1_3_B.java
public class ALDS1_3_B {
       ^
1 error
Language: Java

import java.util.*;
import java.io.*;

class Main{
    public static void main(String[] args) throws IOFxception{
	Scanner S=new Scanner(System.in);
	int i,n,m,t=0;
	Queue<String>P=new LinkedList<String>();
	Queue<Integer>T=new LinkedList<Integer>();
	n=S.nextInt();
	m=S.nextInt();
	for(i=0;i<n;i++){
	    P.add(S.next());
	    T.add(S.nextInt());
	}
	while(0<P.size()){
	    if(0<(T.peek()-t)){
		P.add(P.poll());
		T.add(T.poll()-t);
		t=t+T;
	    }
	    else{
		t=t+T.poll();
		System.out.println(P.poll()+" "+t);
	    }
	}
    }
}
	
			      



Compiler output:
Main.java:5: error: cannot find symbol
    public static void main(String[] args) throws IOFxception{
                                                  ^
  symbol:   class IOFxception
  location: class Main
Main.java:20: error: bad operand types for binary operator '+'
		t=t+T;
		   ^
  first type:  int
  second type: Queue<Integer>
2 errors
Language: Java

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

void push(int);
int pup();

int atama;
int A[199];

int main(int argc, char *argv[]){
  int x,y;
  char a[100];
  
  atama=0;
  
  while(scanf("%s",a)!=EOF){
    if(a[0]=='+'){
      x=pop();
      y=pop();
      push(x+y);
    }
    else if(a[0]=='-'){
      y=pop();
      x=pop();
      push(x-y);
    }
    else if(a[0]=='*'){
      x=pop();
      y=pop();
      push(x*y);

    }
    else {
      push(atoi(a));
    }
  }

  printf("%d\n",pop());

  return 0;

}

void push(int a){
  A[++atama]=a;
}

int pop(){
  atama--;
  return A[atama+1];
}
    



Compiler output:
Main.java:1: error: illegal character: '#'
#include<stdio.h>
^
Main.java:1: error: class, interface, enum, or record expected
#include<stdio.h>
        ^
Main.java:2: error: illegal character: '#'
#include<stdlib.h>
^
Main.java:3: error: illegal character: '#'
#include<string.h>
^
Main.java:4: error: illegal character: '#'
#include<math.h>
^
Main.java:7: error: unnamed classes are a preview feature and are disabled by default.
int pup();
^
  (use --enable-preview to enable unnamed classes)
Main.java:10: error: class, interface, enum, or record expected
int A[199];
^
Main.java:12: error: <identifier> expected
int main(int argc, char *argv[]){
                       ^
Main.java:14: error: ']' expected
  char a[100];
         ^
9 errors
Language: Java

import java.util.Scanner;
public class Main{
	public static void main(String[] args){
		new Main.run();
	}
	public void run(){
		Scanner scan = new Scanner(System.in);
		while(scan.hasNext()){
			int n = scan.nextInt();
			int sTime = scan.nextInt();
			Process[] schedule = new Process[n];
			int count = n;
			int j = 0;
			int sumTime = 0;
			for(int i = 0;i < n;i++){
				schedule[i] = new Process(scan.next(),scan.nextInt());
			}
			int a = 0;
			int len = schedule.length;
			boolean fl = true;
			while(count > 1){
				if(count < n/2 && j == 0 && fl){
					Process[] newSchedule = new Process[count];
					int k = 0;
					for(int i = 0;i < n;i++){
						if(schedule[i].getTime() == 0){
							continue;
						}
						newSchedule[k] = new Process(schedule[i].getName(),schedule[i].getTime());
					}
					schedule = newSchedule;
					len = schedule.length;
					fl = false;
					continue;
				}
				if(j >= len){
					j %= len;
				}
				a = schedule[j].getTime();
				if(a == 0){
					j++;
					continue;
				}else if(a <= sTime){
					sumTime += a;
					System.out.println(schedule[j].getName() + " " + sumTime);
					schedule[j++].setTime(0);
					count--;
					continue;
				}
				sumTime += sTime;
				schedule[j++].minusTime(sTime);
			}
			for(int i = 0;i < len;i++){
				if(schedule[i].getTime() == 0){
					continue;
				}
				System.out.println(schedule[i].getName() + " " +(sumTime+schedule[i].getTime()));
				break;
			}
		}
	}
	class Process{
		String name;
		int time;
		public Process(){
		}
		public Process(String name,int time){
			this.name = name;
			this.time = time;
		}
		public int getTime(){
			return this.time;
		}
		public void setTime(int time){
			this.time = time;
		}
		public String getName(){
			return this.name;
		}
		public void minusTime(int time){
			this.time -= time;
		}
	}
}

Compiler output:
Main.java:4: error: cannot find symbol
		new Main.run();
		        ^
  symbol:   class run
  location: class Main
1 error
Language: C

#include<stdio.h>
#include<queue>
using namespace std;
struct Process
{
    char name[15];
    int time;
};
struct Process pro[100000];
int main()
{
    int n,q,t=0,sum=0,i=0;
    scanf("%d%d",&n,&q);
    queue<int> qu;
    queue<char*> p;
    while(t<n)
    {
        scanf("%s%d",pro[t].name,&pro[t].time);
        qu.push(pro[t].time);
        p.push(pro[t].name);
        t++;
    }
    while(i<n)
    {
        if(qu.empty()) break;
        else if(qu.front()>q)
        {
            sum += q;
            qu.push(qu.front()-q);
            qu.pop();
            p.push(p.front());
            p.pop();
        }
        else if(qu.front()<=q)
        {
            sum +=qu.front();
            printf("%s %d\n",p.front(),sum);
            p.pop();
            qu.pop();
            i++;
        }
    }
    return 0;
}


Compiler output:
main.c:2:9: fatal error: queue: No such file or directory
    2 | #include<queue>
      |         ^~~~~~~
compilation terminated.
Language: C

#include <stdio.h>
#define LEN 100005

typedef struct pp {
	char name [100];
	int t;
} p;

P Q[LEN];
int head, tail, n;

void enqueue(P x) {
	Q[tail] = x;
	tail = (tail + 1) % LEN;
}

P dequeue() {
	P x = Q[head];
	head = (head +1) % LEN;
	return x;
}

int min (int a, int b){
	return a < b ? a : b;
}

int main (){
	int elaps = 0,c;
	int i,q;
	P u;
	
	scanf ("%d %d",&n,&q);
	for(i=1;i<=n;i++){
		scanf("%s",Q[i].name);
		scanf("%d",&Q[i].t);
	}
	head = 1; tail = n + 1;
	
	while (head != tail){
		u=dequeue();
		c=min(q,u.t);
		u.t -= c;
		elaps += c;
		if(u.t > 0) enqueue(u);
		else{
			printf("")
		
	return 0;
}


Compiler output:
main.c:9:1: error: unknown type name 'P'
    9 | P Q[LEN];
      | ^
main.c:12:14: error: unknown type name 'P'
   12 | void enqueue(P x) {
      |              ^
main.c:17:1: error: unknown type name 'P'
   17 | P dequeue() {
      | ^
main.c: In function 'dequeue':
main.c:18:9: error: unknown type name 'P'
   18 |         P x = Q[head];
      |         ^
main.c: In function 'main':
main.c:30:9: error: unknown type name 'P'
   30 |         P u;
      |         ^
main.c:34:32: error: request for member 'name' in something not a structure or union
   34 |                 scanf("%s",Q[i].name);
      |                                ^
main.c:35:33: error: request for member 't' in something not a structure or union
   35 |                 scanf("%d",&Q[i].t);
      |                                 ^
main.c:41:26: error: request for member 't' in something not a structure or union
   41 |                 c=min(q,u.t);
      |                          ^
main.c:42:18: error: request for member 't' in something not a structure or union
   42 |                 u.t -= c;
      |                  ^
main.c:44:21: error: request for member 't' in something not a structure or union
   44 |                 if(u.t > 0) enqueue(u);
      |                     ^
main.c:44:29: error: implicit declaration of function 'enqueue'; did you mean 'dequeue'? [-Wimplicit-function-declaration]
   44 |                 if(u.t > 0) enqueue(u);
      |                             ^~~~~~~
      |                             dequeue
main.c:46:35: error: expected ';' before 'return'
   46 |                         printf("")
      |                                   ^
      |                                   ;
   47 | 
   48 |         return 0;
      |         ~~~~~~                     
main.c:49:1: error: expected declaration or statement at end of input
   49 | }
      | ^
main.c:49:1: error: expected declaration or statement at end of input
Language: C

#include<stdio.h>

typedef struct Process_
{
    char name[11];
    int tim;
} process;
 
#define Q_TAIL 100000;

typedef struct Queue_
{
    process p[Q_TAIL];
    int head;
    int tail;
} queue;


process dequeue(queue *q)
{
    int b = q->head;
    q->head = (q->head+1)%Q_TAIL;
    return q->p[b];
}

void enqueue(queue *q,process x)
{
    q->p[q->tail] = x;
    q->tail +=1;
    q->tail = q->tail%Q_TAIL;
}

int queue_empty(queue *q)
{
    return q->head == q->tail;
}

int main()
{
    int n,c,ksn=0;
    scanf("%d %d",&n,&c);
    queue q;
    for(int i=0;i<n;i++)
    {
        process p;
        scanf("%s", p.name);
        scanf("%d", &p.tim);
        enqueue(&q,p);
    }
    while(!(queue_empty(&q)))
    {
        process x = dequeue(&q);
        if(x.tim < c)
        {
            ksn += x.tim;
            x.tim = 0;
        }
        else
        {
            ksn += c;
            x.tim -= c;
        }
        if(x.tim == 0)
        {
            printf("%s %d\n", x.name,ksn);
        }
        else
        {
            enqueue(&q,x);
        }
    }
    return 0;
}


Compiler output:
main.c:9:22: error: expected ']' before ';' token
    9 | #define Q_TAIL 100000;
      |                      ^
main.c:13:15: note: in expansion of macro 'Q_TAIL'
   13 |     process p[Q_TAIL];
      |               ^~~~~~
main.c: In function 'dequeue':
main.c:23:13: error: 'queue' {aka 'struct Queue_'} has no member named 'p'
   23 |     return q->p[b];
      |             ^~
main.c: In function 'enqueue':
main.c:28:6: error: 'queue' {aka 'struct Queue_'} has no member named 'p'
   28 |     q->p[q->tail] = x;
      |      ^~
Language: C

#include<stdio.h>
#define MAX 100001
 
 struct P{
          char name[10];
          int time;
          };

 struct P q[MAX];
 int head,tail;

 int init(){
        head=tail=0;
        return:
        }

 int empty(){
        return head==tail;
        }

 int full(){
        return (tail+1)%MAX;
        }

 int enqueue(struct P n){
        if(full())return;

        q[tail]=n;
        tail=(tail+1)%MAX;
        }

 int dequeue(){
        if(empty())return;

        struct P x=q[head];
        head=(head+1)%MAX;
        return x;
        }

 int main(){
      int n,lim,ttt,sum=0;
      init();
      scanf("%d%d",&n,&lim);
      for(i=1;i<=n;i++){
                scanf("%s%d",&q[i].name,&q[i].time);
                }
      head=1;tail=n+1;
                
      while(head != tail){
                     struct P c=dequeue();
                     ttt=(c.time>lim)?c.time:lim;
                     c.time-=ttt;
                     sum+=ttt;
                     if(c.time>0)enqueue(c);
                     else {printf("%s %d\n",c.name,sum);}
                     }
      return 0;
      }




      


Compiler output:
main.c: In function 'init':
main.c:14:15: error: expected expression before ':' token
   14 |         return:
      |               ^
main.c: In function 'enqueue':
main.c:26:19: error: 'return' with no value, in function returning non-void [-Wreturn-mismatch]
   26 |         if(full())return;
      |                   ^~~~~~
main.c:25:6: note: declared here
   25 |  int enqueue(struct P n){
      |      ^~~~~~~
main.c: In function 'dequeue':
main.c:33:20: error: 'return' with no value, in function returning non-void [-Wreturn-mismatch]
   33 |         if(empty())return;
      |                    ^~~~~~
main.c:32:6: note: declared here
   32 |  int dequeue(){
      |      ^~~~~~~
main.c:37:16: error: incompatible types when returning type 'struct P' but 'int' was expected
   37 |         return x;
      |                ^
main.c: In function 'main':
main.c:44:11: error: 'i' undeclared (first use in this function)
   44 |       for(i=1;i<=n;i++){
      |           ^
main.c:44:11: note: each undeclared identifier is reported only once for each function it appears in
main.c:50:33: error: invalid initializer
   50 |                      struct P c=dequeue();
      |                                 ^~~~~~~
Language: C

#include<stdio.h>
#define MAX 100001
 
 struct P{
          char name[10];
          int time;
          };

 struct P q[MAX];
 int head,tail;

 int init(){
        head=tail=0;
        return:
        }

 int empty(){
        return head==tail;
        }

 int full(){
        return (tail+1)%MAX;
        }

 void enqueue(struct P x){
        if(full())return;

        q[tail]=x;
        tail=(tail+1)%MAX;
        }

 int dequeue(){
        if(empty())return;

        struct P x=q[head];
        head=(head+1)%MAX;
        return x;
        }

 int main(){
      int n,lim,ttt,sum=0,i;
      init();
      scanf("%d%d",&n,&lim);
      for(i=1;i<=n;i++){
                scanf("%s%d",&q[i].name,&q[i].time);
                }
      head=1;tail=n+1;
                
      while(head != tail){
                     struct P c=dequeue();
                     ttt=(c.time>lim)?c.time:lim;
                     c.time-=ttt;
                     sum+=ttt;
                     if(c.time>0)enqueue(c);
                     else {printf("%s %d\n",c.name,sum);}
                     }
      return 0;
      }




      


Compiler output:
main.c: In function 'init':
main.c:14:15: error: expected expression before ':' token
   14 |         return:
      |               ^
main.c: In function 'dequeue':
main.c:33:20: error: 'return' with no value, in function returning non-void [-Wreturn-mismatch]
   33 |         if(empty())return;
      |                    ^~~~~~
main.c:32:6: note: declared here
   32 |  int dequeue(){
      |      ^~~~~~~
main.c:37:16: error: incompatible types when returning type 'struct P' but 'int' was expected
   37 |         return x;
      |                ^
main.c: In function 'main':
main.c:50:33: error: invalid initializer
   50 |                      struct P c=dequeue();
      |                                 ^~~~~~~
Language: C

#include<stdio.h>
#define MAX 100001
 
 struct P{
          char name[10];
          int time;
          };

 struct P q[MAX];
 int head,tail;

 int init(){
        return head=tail=0;
        }

 int empty(){
        return head==tail;
        }

 int full(){
        return (tail+1)%MAX;
        }

 void enqueue(struct P x){
        if(full())return;

        q[tail]=x;
        tail=(tail+1)%MAX;
        }

 int dequeue(){
        if(empty())return;

        struct P x=q[head];
        head=(head+1)%MAX;
        return x;
        }

 int main(){
      int n,lim,ttt,sum=0,i;
      init();
      scanf("%d%d",&n,&lim);
      for(i=1;i<=n;i++){
                scanf("%s%d",&q[i].name,&q[i].time);
                }
      head=1;tail=n+1;
                
      while(head != tail){
                     struct P c=dequeue();
                     ttt=(c.time>lim)?c.time:lim;
                     c.time-=ttt;
                     sum+=ttt;
                     if(c.time>0)enqueue(c);
                     else {printf("%s %d\n",c.name,sum);}
                     }
      return 0;
      }




      


Compiler output:
main.c: In function 'dequeue':
main.c:32:20: error: 'return' with no value, in function returning non-void [-Wreturn-mismatch]
   32 |         if(empty())return;
      |                    ^~~~~~
main.c:31:6: note: declared here
   31 |  int dequeue(){
      |      ^~~~~~~
main.c:36:16: error: incompatible types when returning type 'struct P' but 'int' was expected
   36 |         return x;
      |                ^
main.c: In function 'main':
main.c:49:33: error: invalid initializer
   49 |                      struct P c=dequeue();
      |                                 ^~~~~~~
Language: C

#include<stdio.h>

typedef struct {
	char name[10];
	int time;
} queue;

int main(){
	int n, q;
	int i, temp;
	int sum = 0, answer = 0;
	int head = 0;
	queue Q[10000];

	scanf("%d %d", &n, &q);
	for (i = 0; i < n; i++) {
		scanf("%s", Q[i].name);
		scanf("%d", &Q[i].time);
		sum += Q[i].time;
	}

	diff = sum;

	while (sum > 0) {
		
		temp = q > Q[head].time ? Q[head].time : q;
		if (temp != 0) {
			Q[head].time -= temp;
			answer += temp;
			if (Q[head].time == 0) {
				printf("%s %d\n", Q[head].name, answer);
			}
		}

		head++;
		sum -= temp;
		
		if (head >= n) {
			head = 0;
		}
		
	}

	return 0;
}


Compiler output:
main.c: In function 'main':
main.c:22:9: error: 'diff' undeclared (first use in this function)
   22 |         diff = sum;
      |         ^~~~
main.c:22:9: note: each undeclared identifier is reported only once for each function it appears in
Language: C

#include<stdio.h>
#include<string.h>
#define LEN 100005

typedef struct pp {
    char name[100];
    int i;
} P;

P Q[100];
int head, tail, n;

void enqueue(P x){
    Q[tail] = x;
    tail = (tail + 1) % LEN;
}

P dequeue(){
    P x = Q[head];
    head = (head + 1) % LEN;
    return x;
}

int min(int a, int b){
    return a < b ? a :b;
}

int main(){
    int elaps = 0, c;
    int i, q;
    P u;
    
    scanf("%d %d", &n, &q);
    for(i=0; i<m; i++){
        scanf("%s", Q[i].name);
        scanf("%d", &Q[i].t);
    }
    
    head = 1;
    tail = n + 1;
    
    while(head != tail){
        u = dequeue();
        c = min(q, u.t);
        u.t -= c;
        elaps += c;
        
        if(u.t > 0){
            enqueue(u);
        }
        else{
            print("%s %d\n", u.name, elaps);
        }
    }
    
    return 0;
}


Compiler output:
main.c: In function 'main':
main.c:34:16: error: 'm' undeclared (first use in this function)
   34 |     for(i=0; i<m; i++){
      |                ^
main.c:34:16: note: each undeclared identifier is reported only once for each function it appears in
main.c:36:26: error: 'P' {aka 'struct pp'} has no member named 't'
   36 |         scanf("%d", &Q[i].t);
      |                          ^
main.c:44:21: error: 'P' {aka 'struct pp'} has no member named 't'
   44 |         c = min(q, u.t);
      |                     ^
main.c:45:10: error: 'P' {aka 'struct pp'} has no member named 't'
   45 |         u.t -= c;
      |          ^
main.c:48:13: error: 'P' {aka 'struct pp'} has no member named 't'
   48 |         if(u.t > 0){
      |             ^
main.c:52:13: error: implicit declaration of function 'print'; did you mean 'printf'? [-Wimplicit-function-declaration]
   52 |             print("%s %d\n", u.name, elaps);
      |             ^~~~~
      |             printf