signedmain(){ ios::sync_with_stdio(false), cin.tie(0); int v, t, s, d; while (cin >> v >> t >> s >> d) { if (v * t <= d && s * v >= d) cout << "No" << endl; else cout << "Yes" << endl; } // system("pause"); return0; }
signedmain(){ ios::sync_with_stdio(false), cin.tie(0); int n, x; while (cin >> n >> x) { vector<int> ans; for (int i = 0; i < n; ++i) { int num; cin >> num; if (num != x) ans.push_back(num); } for (auto e : ans) cout << e << ' '; cout << endl; } // system("pause"); return0; }
boolcheck(int x, int y){ int temp = 0; for (int i = 0; i < 4; ++i) { int xx = x + dir[i][0], yy = y + dir[i][1]; if (mz[xx][yy] == '.') ++temp; } if (temp == 1 || temp == 3) returntrue; returnfalse; }
signedmain(){ ios::sync_with_stdio(false), cin.tie(0); int h, w; while (cin >> h >> w) { for (int i = 1; i <= h; ++i) { for (int j = 1; j <= w; ++j) cin >> mz[i][j]; } int cnt = 0; for (int i = 1; i < h; ++i) { for (int j = 1; j < w; ++j) { if (check(i, j)) ++cnt; } } cout << cnt << endl; } // system("pause"); return0; }
signedmain(){ ios::sync_with_stdio(false), cin.tie(0); longdouble x, y, r; while (cin >> x >> y >> r) { ll ans = 0; r += 1e-14; for (ll i = ceil(y - r); i <= floor(y + r); ++i) { longdouble dx = sqrt(r * r - (y - i) * (y - i)); longdouble left = x - dx, right = x + dx; ans += floor(right) - ceil(left) + 1; } cout << ans << endl; } // system("pause"); return0; }
//定义优先队列存 pair,小顶堆,注意最后两个尖括号间必须有空格。 priority_queue<P, vector<P>, greater<P> > que; //pair第一个元素存的是dis[i],第二个元素存的是i,也就是可达的节点; //pair比较大小是先比较first,也就是比较dis,符合dij算法要求。 for (int i = head[start]; i != -1; i = edge[i].nex) dis[edge[i].to] = min(dis[edge[i].to], edge[i].w), que.push(P(edge[i].w, edge[i].to)); while (!que.empty()) { //取出堆顶元素 P p = que.top(); //拿出队首元素 que.pop(); int v = p.second; if (dis[v] < p.first) continue; //遍历v能到的所有点 for (int i = head[v]; i != -1; i = edge[i].nex) { node e = edge[i];
signedmain(){ int n, m; cin >> n >> m; init(); while (m--) { int u, v, w; cin >> u >> v >> w; add(u, v, w); } for (int i = 1; i <= n; ++i) { dij(i); cout << (dis[i] == inf ? -1 : dis[i]) << endl; } // system("pause"); return0; }