Tastynut

import java.util.*; public class Main { static boolean prime(int m) { if (m != 1) { for (int j = 2; j

import java.util.*; public class Main { static boolean prime(int m) { if (m != 1) { for (int j = 2; j

import java.util.*; public class Main { static boolean prime(int m) { if (m != 1) { for (int j = 2; j

import java.util.*; public class Main { static boolean prime(int m) { for (int j = 2; j

import java.util.*; public class Main { static boolean prime(int m) { if (m != 1) { for (int j = 2; j

import java.util.*; public class Main { static boolean prime(int m) { if (m != 1) { for (int j = 2; j

import java.math.BigInteger; import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); BigInteger a = sc.nextBigInteger(); BigInteger b = sc.nextBigInteger(); System.out.println(a.add(b)); } }

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int m = sc.nextInt(); int min = 0; int x = 0; int y = 0; for (; 5 * x

import java.util.*; public class Main { static int member (int k, int n) { int sum = 0; if (k == 0 ) { sum += n; } else { for (int i = 1; i

import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int m = sc.nextInt(); int[] num = new int[m]; for (int i = 0; i < num.length; i++) { int h = sc.nextInt(); int w = sc.nextInt(); int n = sc.nextInt(); if (n%h == 0) { num[i] = (h*100)+(n/h); } else { num[i] = (n%h*100)+((n/h)+1); } } for( int i : num) { System.out.println(i); } }..