摘要：
Happy 2004Time Limit:1sMemory limit:32MAccepted Submit:142Total Submit:279Consider a positive integer X,and let S be the sum of all positive integer divisors of 2004X. Your job is to determine S modulo 29 (the rest of the division of S by 29).Take X = 1 for an example. The positive integer divisors 阅读全文
摘要：
#include <iostream>using namespace std;int b[1000];int main(){int n,m;cin>>n>>m; for (int i=1;i<=n;i++) { b[i]=i; } int t=1,i=1; int x=0; while (b[t]!=0) { if (i==m) { cout<<b[t]<<" "; b[t]=0; x++; i=0; } t++; i++; if(x==n) { // cout<<b[t]; break; } w 阅读全文
摘要：
//============================================================================// Name : 01k_code.cpp// Author : mtt// Version :// Copyright : Your copyright notice// Description : Hello World in C++, Ansi-style//============================================================================#include < 阅读全文