mradermacher/VeriSeek-GGUF
7B • Updated • 97
Datasets:
Tasks:
Text Generation
Modalities:
Text
Formats:
json
Languages:
English
Size:
10K - 100K
Tags:
code
License:
text stringlengths 59 71.4k |
|---|
// Copyright 1986-2016 Xilinx, Inc. All Rights Reserved.
// --------------------------------------------------------------------------------
// Tool Version: Vivado v.2016.4 (win64) Build Wed Dec 14 22:35:39 MST 2016
// Date : Fri Jan 13 17:31:20 2017
// Host : KLight-PC running 64-bit major release (bu... |
// Copyright 1986-2017 Xilinx, Inc. All Rights Reserved.
// --------------------------------------------------------------------------------
// Tool Version: Vivado v.2017.3 (lin64) Build Wed Oct 4 19:58:07 MDT 2017
// Date : Tue Oct 17 15:20:13 2017
// Host : TacitMonolith running 64-bit Ubuntu 16.04.3... |
//////////////////////////////////////////////////////////////////////
//// ////
//// Copyright (C) 2014 ////
//// ////
//// This source file may be used and distributed witho... |
#include <bits/stdc++.h> using namespace std; inline int read() { int w = 1, s = 0; char ch = getchar(); while (ch < 0 || ch > 9 ) { if (ch == - ) w = 0; ch = getchar(); } while (ch >= 0 && ch <= 9 ) { s = (s << 1) + (s << 3) + ch - 0 ; ch = getchar(); } r... |
#include <cstdio> #include <algorithm> #include <vector> #include <set> #include <cstdlib> #include <utility> #include <cmath> #include <queue> #include <stack> #include <cstring> using namespace std; #define ll long long #ifndef ONLINE_JUDGE #define debug(format, ...) fprintf(stderr,... |
// (C) 2001-2016 Intel Corporation. All rights reserved.
// Your use of Intel Corporation's design tools, logic functions and other
// software and tools, and its AMPP partner logic functions, and any output
// files any of the foregoing (including device programming or simulation
// files), and any associated docum... |
#include <bits/stdc++.h> using namespace std; map<int, int> mp; int n, ans[100001][4], cnt = 0; pair<int, int> t[4]; priority_queue<pair<int, int> > q; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { int x; cin >> x... |
#include <bits/stdc++.h> using namespace std; void solve() { int n, i; cin >> n; int a[n], b[n + 1]; for (i = 0; i < n; i++) { cin >> a[i]; b[a[i]] = i; } int l, r, ans[n + 1]; l = b[1]; r = b[1]; for (i = 2; i <= n; i++) { l = min(l, b[i]); r = max(r, b[i... |
`include "rv32_opcodes.vh"
module vscale_regfile(
input clk,
input [`REG_ADDR_WIDTH-1:0] ra1,
output [`XPR_LEN-1:0] rd1,
input [`REG_ADDR_WIDTH-1:0] ra2,
output [`XPR_LEN-1:0] ... |
#include <bits/stdc++.h> using namespace std; long long cumu[200005]; int main() { int n, k, x; while (scanf( %d %d , &n, &k) == 2) { memset(cumu, 0ll, sizeof cumu); int mn = INT_MAX; for (int i = 0; i < n; i++) scanf( %d , &x), cumu[x + 1] -= 1, mn = min(mn, x); cumu[1] = ... |
// chris_slave.v
// This file was auto-generated as a prototype implementation of a module
// created in component editor. It ties off all outputs to ground and
// ignores all inputs. It needs to be edited to make it do something
// useful.
//
// This file will not be automatically regenerated. You should check it... |
#include <bits/stdc++.h> using namespace std; namespace std { template <> struct hash<pair<int, int>> { size_t operator()(const pair<int, int> &x) const { long long P = 38923, Q = 109797901; return (size_t)((x.first * P + x.second) % Q); } }; }; // namespace std template <class T> u... |
#include <bits/stdc++.h> int mod = 1000000007; using namespace std; using namespace std; int n, k; int a[400005]; int pos[400005]; map<int, int> m; int main() { ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); ; cin >> n >> k; for (int i = 1; i <= n; i++) pos[i] = 1e7; m[a[... |
// -------------------------------------------------------------
//
// Generated Architecture Declaration for rtl of avfb_chip_tb
//
// Generated
// by: wig
// on: Tue Apr 25 19:40:28 2006
// cmd: /cygdrive/h/work/eclipse/MIX/mix_0.pl -nodelta ../../bugver.xls
//
// !!! Do not edit this file! Autogenerated by MIX ... |
#include <bits/stdc++.h> using namespace std; int main() { long long int a, b; scanf( %lld%lld , &a, &b); long long int c = a, d = b; long long int cnt = 0, rem; while (c >= 1 && d >= 1) { if (d == 1) { printf( %lld , cnt + c); return 0; } if (c >= d) { ... |
#include <bits/stdc++.h> using namespace std; int h; long long n, des; long long GetRes(long long l) { if (l == 1) return 0; if ((l + l / 2) % 2) { return 1 + GetRes(l / 2); } else { return pow(2, h - (int)(log2(l)) + 1) + GetRes(l / 2); } } int main() { while (cin >> h >> n)... |
/*
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... |
/*
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... |
/*
Copyright (c) 2016 Alex Forencich
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute,... |
////////////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2012, Ameer M. Abdelhadi; . All rights reserved. //
// //
// Redistribution and use in source and binary forms, with or with... |
/**
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable la... |
#include <bits/stdc++.h> using namespace std; int n, m; int a[50]; int main() { cin >> n >> m; for (int i = 0; i < n; i++) { cin >> a[i]; a[i] %= m; } sort(a, a + n); set<int> S1, S2; for (int i = 0; i < n; i++) { set<int> s = i < n / 2 ? S1 : S2; s.insert(a[i]); ... |
/**
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable la... |
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; int a[n]; for (int i = 0; i < n; i++) cin >> a[i]; int d[n]; d[0] = a[0]; map<int, int> even, odd; even[d[0]]++; odd[0]++; long long int c = 0; for (int i = 1; i < n; i++) { d[i] = a[i] ^ d[... |
module I2C_AV_Config ( // Host Side
iCLK,
iRST_N,
// I2C Side
I2C_SCLK,
I2C_SDAT );
// Host Side
input iCLK;
input iRST_N;
// I2C Side
output I2C_SCLK;
inout I2C_SDAT;
// Internal Registers/Wires
reg [15:0] mI2C_CLK_DIV;
reg [23:0] mI2C_DATA;
reg mI2C_CTRL_CLK;
reg mI2C_GO;
wire m... |
#include <bits/stdc++.h> using namespace std; int main() { long long x, y; cin >> x >> y; long long n; cin >> n; n %= 6; if (n == 0) n = 6; long long data[7]; data[1] = x; data[2] = y; for (int i = 3; i <= 6; i++) { data[i] = data[i - 1] - data[i - 2]; } for (in... |
#include <bits/stdc++.h> using namespace std; const int MAXN = 100010; int ans = -1, ansd, a[MAXN], b[MAXN], n, m; inline int Pow(int x, int y, int mod) { int s = 1; for (; y; y >>= 1, x = 1ll * x * x % mod) if (y & 1) s = 1ll * s * x % mod; return s; } inline bool find(int *a, int n, int ... |
#include <bits/stdc++.h> using namespace std; int main() { int n, t; cin >> n >> t; int edge_n = 2 * n; double edges[edge_n]; double currX, currA; for (int i = 0; i < n; i++) { cin >> currX >> currA; edges[2 * i] = currX - currA / 2; edges[2 * i + 1] = currX + currA / 2; ... |
/*
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... |
#include <bits/stdc++.h> using namespace std; int n, ans; int f[2005][2005], A[2005][2005]; int mul[2005], tr1[2005], tr2[2005], vis[2005], lck[2005]; int Getsum(int *tree, int x) { int ans = 0; for (int i = x; i; i -= i & -i) ans += tree[i]; return ans; } void Update(int *tree, int x, int v) ... |
#include <bits/stdc++.h> using namespace std; const long long INF = 0x3f3f3f3f3f3f3f3fLL; const int MOD = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int n, m; cin >> n >> m; vector<vector<int>> e(n + 1); for (int i = 0; i < m; i++) { ... |
#include <bits/stdc++.h> template <typename T> T mymax(T x, T y) { return (x > y ? x : y); } using namespace std; const int N = 100005; const long long inf = 1e18; vector<int> graph[N], cost[N]; int n, m; long long dis[N]; struct node { int nd, c; node(int _nd, int _c) { nd = _nd; ... |
#include <bits/stdc++.h> using namespace std; const int MAXN = 200200; int n; const long long neutro = 0; struct RMQ { int sz; long long tope; long long t[4 * MAXN]; long long &operator[](int p) { return t[sz + p]; } void init(int n, long long tope_) { sz = 1 << (32 - __builtin_clz(n... |
#include <bits/stdc++.h> using namespace std; int main() { string s1, s2, s3; cin >> s1 >> s2 >> s3; int i; s1 = s1.append(s2); sort(s1.begin(), s1.end()); sort(s3.begin(), s3.end()); if (s1.length() != s3.length()) { cout << NO ; return 0; } else { for (i = 0; i <... |
`timescale 1ps/1ps
`default_nettype none
(* DowngradeIPIdentifiedWarnings="yes" *)
module axi_protocol_converter_v2_1_b2s_ar_channel #
(
///////////////////////////////////////////////////////////////////////////////
// Parameter Definitions
////////////////////////////////////////////////////////////////////////////... |
/*
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... |
#include <bits/stdc++.h> using namespace std; struct State { int len, link; map<char, int> nxtc; } SA[2 * 2006]; bool vis[2 * 2006]; char str[2006], pref[2 * 2006], suf[2006]; class SuffixAutomata { int sz, last; void init(int idx) { SA[idx].len = 0, SA[idx].link = -1; SA[idx].nx... |
`include "common.vh"
`timescale 1ms/10us
module Tenyr(
input clk, reset, inout halt,
output[7:0] seg, output[3:0] an, inout[23:0] gpio,
output[2:0] vgaRed, vgaGreen, output[2:1] vgaBlue, output hsync, vsync, inframe
);
parameter RAMABITS = 13;
wire d_wen, d_stb, d_cyc, d_ack;
wire i_wen, i_st... |
#include <bits/stdc++.h> using namespace std; map<int, int> mp; int Find(int x) { if (mp.find(x) == mp.end()) return x; return mp[x] = Find(mp[x]); } int main() { int n; while (scanf( %d , &n) != EOF) { mp.clear(); int a; for (int i = 0; i < n; i++) { scanf( %d , &a);... |
/*
File: ewrapper_io_rx_slow.v
This file is part of the Parallella FPGA Reference Design.
Copyright (C) 2013 Adapteva, Inc.
Contributed by Roman Trogan <>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free ... |
// -*- verilog -*-
// Copyright (c) 2012 Ben Reynwar
// Released under MIT License (see LICENSE.txt)
module filterbank
#(
parameter N = 8,
parameter WIDTH = 32,
parameter MWIDTH = 1,
parameter FLTLEN = 10,
parameter ID = 0,
parameter MSG_BUFFER_LENGTH = 64
)
(
input wire ... |
#include <bits/stdc++.h> using namespace std; template <class T> ostream& operator<<(ostream& os, vector<T> V) { os << [ ; for (auto v : V) os << v << ; return os << ] ; } template <class T> ostream& operator<<(ostream& os, set<T> S) { os << { ; for (auto s : S) os << s << ; ... |
#include <bits/stdc++.h> using namespace std; long long int isp[100005]; void pp() { for (long long int i = 2; i <= 100000; i++) { if (!isp[i]) { for (long long int j = i * i; j <= 100000; j += i) { isp[j] = 1; } } } } int32_t main() { ios_base::sync_with_stdi... |
#include <bits/stdc++.h> using namespace std; const long long INF = LLONG_MAX; const int inf = INT_MAX; const int mod = 1e9 + 7; const int pi = acos(-1); const int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1}; const int dy[8] = {1, -1, 0, 0, 1, -1, 1, -1}; const int N = 2e5 + 5; const int MAXN = 1e5 + 1; int... |
`timescale 1ps / 1ps
`default_nettype none
module example (
input wire FCLK_IN,
//full speed
inout wire [7:0] BUS_DATA,
input wire [15:0] ADD,
input wire RD_B,
input wire WR_B,
//high speed
inout wire [7:0] FD,
input wire FREAD,
input wire FSTROBE,
input ... |
`timescale 1ns / 1ps
//////////////////////////////////////////////////////////////////////////////////
// Company:
// Engineer:
//
// Create Date: 08:03:21 10/28/2014
// Design Name:
// Module Name: uart
// Project Name:
// Target Devices:
// Tool versions:
// Description:
//
// Dependencies:
//
// Re... |
#include <bits/stdc++.h> long long mod; long long solve(int dep, long long idx, long long left, long long right, long long l, long long r, long long u, long long v) { if (right < l) return 0; if (left > r) return 0; if (left >= l && right <= r) { long long delta = (1LL << dep); ... |
`include "../spi_ctl.v"
module test;
reg nss;
reg mosi;
reg sck;
wire miso;
wire [6:0] address_bus;
wire [7:0] data_bus;
wire read_n;
wire write_n;
spi_ctl s1(nss, mosi, sck, miso, address_bus, data_bus, read_n, write_n);
// There are no devices connected to the bus for this test
//... |
// ====================================================================
// Bashkiria-2M FPGA REPLICA
//
// Copyright (C) 2010 Dmitry Tselikov
//
// This core is distributed under modified BSD license.
// For complete licensing information see LICENSE.TXT.
// ---------------------------... |
#include <bits/stdc++.h> using namespace std; template <typename T> void read(T &t) { t = 0; char ch = getchar(); int f = 1; while (ch < 0 || ch > 9 ) { if (ch == - ) f = -1; ch = getchar(); } do { (t *= 10) += ch - 0 ; ch = getchar(); } while ( 0 <= ch &&... |
#include <bits/stdc++.h> using namespace std; using INT = long long; string a[111]; int main() { int n; string s; cin >> s; cin >> n; int flag = 0; for (int i = 1; i <= n; i++) { cin >> a[i]; if (a[i] == s) flag |= 3; if (a[i][1] == s[0]) flag |= 1; if (a[i][0] ==... |
#include <bits/stdc++.h> using namespace std; int n, m, k, x, y, sum, cnt, ans; int main() { printf( red n ); return 0; } |
/**
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable la... |
/*******************************************************************
Company: UNSW
Original Author: Lingkan Gong
Project Name: XDRS
Create Date: 19/09/2010
Design Name: reverse
*******************************************************************/
`timescale 1ns/1ns
module reverse
#(parameter
C_CNT_BW =... |
#include <bits/stdc++.h> using namespace std; int n, m, a[10][110], b[410]; int main() { while (~scanf( %d%d , &n, &m)) { memset(a, 0, sizeof(a)); for (int i = 1; i <= min(m, 2 * n); i++) { if (i & 1) { a[1][(i + 1) >> 1] = i; } else { a[4][i >> 1] = i; ... |
/**
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable la... |
/*
----------------------------------------------------------------------------------
Copyright (c) 2013-2014
Embedded and Network Computing Lab.
Open SSD Project
Hanyang University
All rights reserved.
----------------------------------------------------------------------------------
Redistribution and use ... |
/**
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable la... |
// Copyright 1986-2016 Xilinx, Inc. All Rights Reserved.
// --------------------------------------------------------------------------------
// Tool Version: Vivado v.2016.4 (win64) Build Wed Dec 14 22:35:39 MST 2016
// Date : Sun Apr 09 07:04:52 2017
// Host : GILAMONSTER running 64-bit major release (... |
#include <bits/stdc++.h> int main() { int n, k; scanf( %d %d , &n, &k); char a[n]; scanf( %s , a); int i, start, end; for (i = 0; i < n; i++) { if (a[i] == G ) start = i; if (a[i] == T ) end = i; } int sign = start - end; if (start > end) k = -k; while ((sign * (s... |
#include<bits/stdc++.h> using namespace std; #define M 500000 typedef long long ll; typedef unsigned long long ull; inline ll read() { char ch; ll f = 1, res = 0; while ((ch = getchar()) < 0 || ch > 9 ) if (ch == - ) f = -1; while (ch >= 0 && ch <= 9 ) { res = (res << 1) + (res << 3... |
#include <bits/stdc++.h> // #include <ext/pb_ds/assoc_container.hpp> // #include <ext/pb_ds/tree_policy.hpp> using namespace std; // using namespace __gnu_pbds; #define lli long long int #define llu unsigned long long int #define pb push_back #define rt return 0 #define endln n #define all(x) x.b... |
#include <bits/stdc++.h> using namespace std; int main() { char str[200005]; gets(str); vector<char> v; if (strlen(str) > 1) { v.push_back(str[0]); v.push_back(str[1]); } else { cout << str; return 0; } int l = strlen(str); int len; for (int i = 2; i < l; ... |
#include <bits/stdc++.h> using namespace std; template <typename T> T BigMod(T b, T p, T m) { if (p == 0) return 1; if (p % 2 == 0) { T s = BigMod(b, p / 2, m); return ((s % m) * (s % m)) % m; } return ((b % m) * (BigMod(b, p - 1, m) % m)) % m; } template <typename T> T ModInv(T ... |
#include <bits/stdc++.h> using namespace std; struct Node { Node *ch[26]; Node() { for (int i = 0; i < 26; i++) ch[i] = NULL; } } * Root; struct Trie { void init() { Root = new Node(); } void ins(Node *t, string s) { for (int i = 0; i < s.size(); i++) { int id = s[i] - a... |
/*
* Milkymist SoC
* Copyright (C) 2007, 2008, 2009, 2010, 2011 Sebastien Bourdeauducq
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, version 3 of the License.
*
* This program is dis... |
/*
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... |
#include <bits/stdc++.h> using namespace std; const double pi = acos(-1); int main() { int n; double R, r; double st; while (scanf( %d %lf , &n, &R) != EOF) { st = pi / (1.0 * n); r = sin(st) * R / (1 - sin(st)); printf( %.7lf n , r); } return 0; } |
#include <bits/stdc++.h> using namespace std; const int maxN = 2000 + 5; int s, n, m, a[maxN]; vector<int> p[maxN]; vector<int> f[maxN], g[maxN]; void initialize() { ios::sync_with_stdio(false); cin >> n >> s; s--; for (int i = 0; i < n; ++i) cin >> a[i]; vector<int> t(a, a + n); sor... |
module Fifo36E1TestSuite_UserTop_1(input deqClk, input enqClk, input reset,
output io_enq_ready,
input io_enq_valid,
input [71:0] io_enq_bits,
input io_deq_ready,
output io_deq_valid,
output[71:0] io_deq_bits,
output[8:0] io_count
);
wire[7:0] T0;
wire[63:0] T1;
wire[71:0] T2;
wir... |
#include <bits/stdc++.h> using namespace std; const int N = 2007; const int mod = 998244353; template <class I> inline void read(I &x) { int f = 1; char c; for (c = getchar(); c < 0 || c > 9 ; c = getchar()) if (c == - ) f = -1; for (x = 0; c >= 0 && c <= 9 ; x = (x << 3)... |
module multiboot (
input wire clk_icap,
input wire REBOOT
);
reg [23:0] spi_addr = 24'h058000; // default: SPI address of second core as defined by the SPI memory map
reg [4:0] q = 5'b00000;
reg reboot_ff = 1'b0;
always @(posedge clk_icap) begin
q[0] <= REBOOT... |
module x_vector_cache_tb;
parameter SUB_WIDTH = 8;
parameter LOG2_SUB_WIDTH = log2(SUB_WIDTH - 1);
reg clk;
reg rst;
reg [31:0] col;
reg push_col;
reg [47:0] start_address;
wire req_mem;
wire [47:0] req_mem_addr;
reg rsp_mem_push;
reg [63:0] rsp_mem_q;
wire push_x;
w... |
#include <bits/stdc++.h> using namespace std; string S; int MOD; int len; long long dp[1 << 18][100]; int cnt[1 << 18]; int bits[1 << 18]; int DMASKS[1 << 18]; int powers[20]; int orig; long long solve(int mask, int mod) { if (mask == 0) { return mod == 0; } long long &ret = dp[m... |
#include <bits/stdc++.h> using namespace std; using ii = tuple<long long, long long>; const long long N = 1e6 + 7, inf = 1e9 + 42; long long binpow(long long a, long long b) { if (b == 0) return 1; long long res = binpow(a, b / 2); if (b % 2) return (res * res * a) % 1000000007; else ... |
#include <bits/stdc++.h> using namespace std; const int N = 50005, M = 50005; int mo; struct matrix { int a[2][2]; int *operator[](const int i) { return a[i]; } const int *operator[](const int i) const { return a[i]; } friend matrix operator*(const matrix &a, const matrix &b) { matrix c; ... |
/*
* Copyright 2020 The SkyWater PDK Authors
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law... |
#include <bits/stdc++.h> const double eps = 1e-8; const int mod = 8 * 9 * 7 * 11 * 13 * 5; const int maxn = 205; const double pi = acos(-1.0); const int INF = 0x7f7f7f7f; const double inf = 1e50; template <class T> inline T minx(T a, T b) { return (a == -1 || b < a) ? b : a; } template <class T>... |
#include <bits/stdc++.h> using namespace std; mt19937 Rand(time(0)); const int maxn = 1e5 + 5; const long long maxc = 1e9 + 7; int n, m, d, a[maxn]; long long sum[maxn]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> d >> m; for (int i = (1); i <= (n); ... |
#include <bits/stdc++.h> using namespace std; int n, d[333][333], k; int main() { cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { cin >> d[i][j]; } } cin >> k; while (k--) { int a = 0, b = 0, c = 0; cin >> a >> b >> c; d[a][b] = min... |
#include <bits/stdc++.h> using namespace std; const double PI = acos(-1.0); int n, h, a[100005]; pair<int, int> A[100005]; void solve() { sort(A, A + n); for (int i = (0); i < (n); i++) a[i] = A[i].first; int res = a[n - 1] + a[n - 2] - a[0] - a[1], ind = n - 1; if (n >= 3) { int v = max... |
#include <bits/stdc++.h> using namespace std; int main() { int t; cin >> t; while (t--) { long long a, b, x, y, n; cin >> a >> b >> x >> y >> n; long long p = a - x, q = b - y; long long pp = min(p, n), qq = min(q, n); long long aa = a - pp, bb = b - qq; long long tt ... |
//////////////////////////////////////////////////////////////////////////////////
// d_parallel_FFM_gate_GF12.v for Cosmos OpenSSD
// Copyright (c) 2015 Hanyang University ENC Lab.
// Contributed by Jinwoo Jeong <>
// Ilyong Jung <>
// Yong Ho Song <>
//
// This file is part of Cosmos Ope... |
// DESCRIPTION: Verilator: Verilog Test module
//
// This file ONLY is placed under the Creative Commons Public Domain, for
// any use, without warranty, 2020 Wilson Snyder.
// SPDX-License-Identifier: CC0-1.0
module t(/*AUTOARG*/
// Inputs
clk
);
input clk;
integer cyc = 0;
reg [63:0] crc;
reg [... |
End of preview. Expand in Data Studio
Dataset Card for Opencores
In the process of continual pre-training, we utilized the publicly available VGen dataset. VGen aggregates Verilog repositories from GitHub, systematically filters out duplicates and excessively large files, and retains only those files containing \texttt{module} and \texttt{endmodule} statements.
We also incorporated the CodeSearchNet dataset \cite{codesearchnet}, which contains approximately 40MB function codes and their documentation.
Dataset Features
- text (string): The pretraining corpus: nature language and Verilog/C code.
Loading the dataset
from datasets import load_dataset
ds = load_dataset("LLM-EDA/vgen_cpp", split="train")
print(ds[0])
Citation
- Downloads last month
- 7
Models trained or fine-tuned on LLM-EDA/vgen_cpp