Skip to content

Instantly share code, notes, and snippets.

View Vincent550102's full-sized avatar
👍
:hear:Focusing❤️ 🍸

Vincent Yang Vincent550102

👍
:hear:Focusing❤️ 🍸
View GitHub Profile
@Vincent550102
Vincent550102 / solve.sh
Created January 30, 2026 07:59
Solve opencode "This version of Antigravity is no longer supported. Please update to receive the latest features!" issue
#!/bin/bash
# Path to the file
FILE="$HOME/.config/opencode/antigravity-accounts.json"
# Check if file exists
if [ ! -f "$FILE" ]; then
echo "File not found: $FILE"
exit 1
fi
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
for(int _ = 2; _<100; _++){
unsigned int num;
int x=0,i;
num = _;
cout << _ << " ";
@Vincent550102
Vincent550102 / c.cpp
Created October 27, 2020 04:58
著色.cpp
#include<bits/stdc++.h>
#define io_op ios_base::sync_with_stdio(0);cin.tie(0);
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
#define _ <<" "<<
int main(){
io_op
int M,N,k;
@Vincent550102
Vincent550102 / GoogleMap_Crawler.py
Created September 18, 2020 09:43
google map 爬蟲
from bs4 import BeautifulSoup
import requests
import time
import html5lib
import json
import re
from selenium import webdriver
from selenium.webdriver.chrome.options import Options
def rest(n):
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,n;
cin >> a >> b;
cin >> n;
int ans = 0;
for(int i = 0; i<n; i++){
int tmp;
int a_cnt=0;
#pragma GCC target("fma,avx")
#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
#define endl '\n'
#define IO_FAST ios::sync_with_stdio(0);cin.tie(0);
#define _ <<' '<<
using ll = long long;
#define debug(x) cerr << #x << " is " << x << endl
@Vincent550102
Vincent550102 / sprout_oj.cpp
Last active June 26, 2020 14:54
no793.cpp
#include<bits/stdc++.h>
using namespace std;
const long long p = 1e9+7;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
long long n,k,q;
srand(chrono::steady_clock::now().time_since_epoch().count());
cin >> n >> k >> q;
unordered_map<long long,long long> pw;//密碼本
map<long long,long long> MP;//出現幾次
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
int n;
vector<int> v;
struct Node{
int val,tag;
Node *lc ,*rc;
Node(){
#include<bits/stdc++.h>
using namespace std;
int k;
vector<char>num;
vector<char> ans;
void dfs(int idx, int n){
if(idx>=k)return;
if(n==6&&(int)ans.size()==6){
for(auto x:ans)cout << x << " ";
cout << endl;
if(distance<=7)can_be_push=true;
if(can_be_push){
val = digitalRead (8);//左邊按鈕
if (val ==1){ state=2;}
val = digitalRead (9); //中間按鈕
if (val ==1 ){ state=3;}
val = digitalRead (10);//右邊按鈕