lambsnow的博客

注：求幂的过程中，每乘一次，都要进行进位，防止溢出。#include <stdio.h>#include <string.h>char in[6];int r[6];int n;int o[200];int digits;int main(int argc, char *argv[]) { int i, j, k, t; int nonzeros; bool fl

注：在输出数字的时候，不要忘了开头0补齐。#include <stdio.h>#include <string.h>#include <map>using namespace std;int main(int argc, char *argv[]) { map<int, int> mm; int num[26] = {2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5

#include <stdio.h>int main(int argc, char *argv[]) { float in; float i, j, k; float sum; scanf("%f", &in); while (in != 0.00) { sum = 0.00; i = 0.00; while (

#include <stdio.h>#include <math.h>int main(int argc, char *argv[]) { int i; float money; float sum = 0.00; float ave; for (i = 0; i < 12; i++) { scanf("%f", &money);

#include <stdio.h>#include <cmath>#define pi 3.1415926536using namespace std;int main(int argc, char *argv[]) { int n; float x, y; scanf("%d", &n); float preR2, R2; int i; int