文件名称：cp：个人竞争性编程实践
文件大小：21KB
文件格式：ZIP
更新时间：2024-03-13 05:29:32
C
竞争性编程 竞争性编程实践 CP技术 1.模板 # include < stdio> # include < string> # include < math.h > # include < ctype> int main () { // freopen("input.txt", "rt", stdin); // freopen("output.txt", "wt", stdout); return 0 ; } // Author: Shihab Mahamud 2.使用scanf（）函数输入string scanf ( " %[^ \n ] " , str); 3.将int转换为string sprintf（）函数 # include < stdio> int main () { char result[
【文件预览】：
cp-main
----03_spoj.com()
--------001_Prime_Generator.c(805B)
----06_hackerearth.com()
--------001_war.c(1KB)
--------002_help_oz.c(1KB)
----README.md(824B)
----05_hackerrank.com()
--------001_Boxes_through_a_Tunnel.c(508B)
----02_codeforces.com()
--------003_A_Football.c(1KB)
--------001_A.Bit++.c(825B)
--------README.md(0B)
--------002_A_Petya_and_Strings.c(1KB)
----04_uva()
--------100_The_3n_1_problem.c(791B)
--------113_Power_of_Cryptography.c(429B)
----smlibrary.h(909B)
----.gitignore(90B)
----template.c(230B)
----01_dimikoj.com()
--------32_multiplir_of_x.c(623B)
--------33_partition_possible_1.c(727B)
--------11_factorial.c(567B)
--------02-even-odd-2.c(494B)
--------10_run_rate_1.c(1KB)
--------03-falling-numbers.c(256B)
--------51_search_1.c(925B)
--------30_perfect_number.c(687B)
--------14_the_cloud_of_letter.c(779B)
--------07_counting_number.c(628B)
--------39_palindrome.c(747B)
--------49_is_prime.c(778B)
--------05-box-1.c(528B)
--------31_perfect_number-2.c(756B)
--------40_sum_of_series_1.c(491B)
--------34_partition_possible_2.c(570B)
--------46_area_of_triangle.c(503B)
--------41_sum_of_series_2.c(662B)
--------50_left_right.c(780B)
--------16_word_crash.c(1001B)
--------01-even-odd-1.c(309B)
--------38_diamond_shape.c(954B)
--------06-sumation.c(402B)
--------43_calculation.c(470B)
--------42_sum_of_series_3.c(634B)
--------08_small_to_large.c(680B)
--------09_integer_number.c(549B)