摘要:
第一种解法第一眼看上去好像比第二中更快,但实际上会超出部分测试的时间 n,x = map(int,input().split()) count= 0 a=[] for m in range(1,n+1): i =m while i >= 1: if i % 10 == x: count+=1 i=i 阅读全文
摘要:
#include<stdio.h> #include <stdio.h> int sum( int n ); int main() { int n; scanf("%d", &n); printf ("%d\n", sum(n)); return 0; } int sum( int n ) { in 阅读全文
摘要:
#include <stdio.h> #include <math.h> int prime( int p ); int PrimeSum( int m, int n ); int main() { int m, n, p; scanf("%d %d", &m, &n); printf("Sum o 阅读全文
摘要:
#include <stdio.h> int main() { int d1,d2,d3; int n; int sum; sum = 0; for (d1 = 1;d1<9;d1++) { for(d2 = 0;d2<9;d2++) { for(d3 = 0;d3<9;d3++) { n = d1 阅读全文
摘要:
用求一个数的个位数来依次比较 int CountDigit( int number, int digit ) { int conpare,count; if (number <0) { number = number*-1; } while (number >10) { conpare = numb 阅读全文