Datasets:

takeraparterer
/

stinky-heap

Dataset card Viewer Files Files and versions Community

Split (1)

train · 527k rows

text stringlengths 0 173k
args){ String str1 = "Monas";
System.out.println(str1);

String str2 = "monas";
System.o"
<_EOF_>
public static void main(String []args){
// Percobaan 1 Berhasil
Str1();
// Percobaan 2 Berhasil
Str2();
// Percobaan 3 Berhasil
"
<_EOF_>
public static void main(String[] args) {
//percobaan 1
System.out.println("=== Percobaan 1 ===");
String str1 = "STMIKDN";
String str2 = "stmikdn";
"
<_EOF_>
public static void main(String [] args){
String str1 = "STMIKDN";
String str2 = "stmikdn";
System.out.println(str1.equals(str2));
System.out.printl"
<_EOF_>
public static void main(String[] args) {
System.out.println("Hello World!");
}
}"
<_EOF_>
public static void main(String [] args){
String str1 = "STMIKDN";
String str2 = "stmikdn";
System.out.println(str1 + "\n" + str2);
}
}"
<_EOF_>

<_EOF_>
* Definition for singly-linked list.
* struct ListNode {
* int val;
* struct ListNode *next;
* };
*/
typedef struct ListNode node;

void reverse(node** ptr){
node *te"
<_EOF_>
#include <stdio.h>

int main() {
int x = 4, y = 6;
if (x < y) {
printf("x kurang dari y \n");
}
return 0;
}"
<_EOF_>
int main() {
int angka, sisabagi;
scanf("%d", &angka);
sisabagi = angka % 3 ;
switch (sisabagi) {
case 0: printif ("habis dibagi/n");break;
case 1: p"
<_EOF_>
using namespace std;

int main() {
cout << "Hello World!";
return 0;
}"
<_EOF_>

def performence(func):
def wrapper(args, *kwargs):
s_time = time()
func(args, *kwargs)
e_time = time()
print(f"Time required is: {e_time "
<_EOF_>
https://sites.google.com/najat4.com/hd-102023-1080p
https://sites.google.com/najat4.com/102023hd1080pfastx
https://sites.google.com/najat4.com/1"
<_EOF_>
#include <stdlib.h>
#include <time.h>
#include "matr.h"
#include <locale.h>

// Головна функція
int main()
{
setlocale(LC_ALL, "Ukr");
int n;
int m[50][50];