CodeForces - 916C 思维
Codeforces 思维
2023-09-27 14:26:03 时间
题意:给你n,m,表示n个顶点和m条边,让你构造一个图。
要求
1.1->n最短路为素数
2.最小生成树边权和为prime
3.没有重边
4.边大小[1,1e9]。
(题目给定m>n-1)
题解:
你可以先构造一个 最短路==最小生成树权值和==素数 ,然后剩下的边保证不重复的前提下赋一个大的值就行
具体看代码:
1 #include<stdio.h> 2 int main() 3 { 4 int n,m; 5 scanf("%d%d",&n,&m); 6 int prim=100003; 7 printf("%d %d\n",prim,prim); 8 printf("1 2 %d\n",prim-(n-2)); 9 for(int i=2;i<n;++i) 10 printf("%d %d 1\n",i,i+1); 11 m=m-(n-1); 12 for(int i=1;i<=n;++i) 13 { 14 for(int j=i+2;j<=n;++j) 15 { 16 if(!m) break; 17 printf("%d %d %d\n",i,j,2*prim); 18 m--; 19 } 20 } 21 return 0; 22 }
相关文章
- codeforces George and Job
- CodeForces 146E - Lucky Subsequence DP+扩展欧几里德求逆元
- Codeforces Beta Round #75 (Div. 2)---A. Chips
- Pokémon Army (easy version) CodeForces - 1420C1 dp
- Codeforces Round #666 (Div. 2) Power Sequence、Multiples of Length 思维
- Educational Codeforces Round 94 (Rated for Div. 2) String Similarity、RPG Protagonist、Binary String Reconstruction、Zigzags 思维
- Codeforces Round #660 (Div. 2) Uncle Bogdan and Country Happiness dfs
- Educational Codeforces Round 88 (Rated for Div. 2) E、Modular Stability 逆元+思维
- Codeforces Round #649 (Div. 2) A. XXXXX
- Codeforces Round #652 (Div. 2)D. TediousLee 推导
- CodeForces 731C Socks 并查集
- CodeForces 13E. Holes 分块处理
- Codeforces 61E Enemy is weak 乞讨i<j<k && a[i]>a[j]>a[k] 对数的 树阵
- Codeforces Round #748 (Div. 3)
- (思维)(必要做题步骤)(皮卡丘与 Codeforces )D - 先来签个到