F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
Notice:1:五月份月赛定于5.27日12:30--17:30,欢迎大家来玩! 2:关于OJ的注册可看https://www.lydsy.com/JudgeOnline/wttl/thread.php?tid=5671
大视野在线测评-欢迎您
[ New Thread ]
Problem 2599 >> 关于统计每种边出现次数的做法时间复杂度
Izumihanako @ 2017-11-25 09:25:08
[ Quote ] [ Edit ] [ Delete ] 1#
rt,但是BZOJ上又可以过

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

int main(){
freopen( "2599.in" , "w" , stdout) ;
puts( "131072 32") ;
for( int i = 0 ; i < 131072 ; i ++ )
printf( "%d %d %d\n" , i+1 , (i+1)/2 , 1 ) ;
}
[Top] [Previous Page] [Next Page]

HOME Back