1. 程式人生 > >hdu 2601 An easy problem

hdu 2601 An easy problem

cto while using ble view -m pos pen add

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <time.h>
using namespace std; int main() { //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int _; __int64 n,i,t; scanf("%d\n",&_); while(_--) { scanf("%I64d",&n); n+=1; int cnt=0; for(i=2;i*i<=n;i++) { if(n%i==0
) cnt++; } printf("%d\n",cnt); } return 0; }
‘).text(i)); }; $numbering.fadeIn(1700); }); });

hdu 2601 An easy problem