erjiaqing

#include <cstdio>
using namespace std;
const int maxn=1e7+7;
int prime[maxn],phi[maxn],n,totprime;
int main()
{
	scanf("%lld",&n);
	phi[1]=1;
	for (int i=2;i<=n;i++)
	{

erjiaqing

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
const int maxn=20005,maxm=(20005+200005)*10+10,inf=1e9+7;
//--邻接表
struct edge{int s,t,v,n;}e[maxm];

erjiaqing

#!/usr/bin/python3.3
import tkinter as tk
import tkinter.font as tkFont
import tkinter.ttk as ttk
import urllib,urllib.request,ctypes,re,os,time
from threading import Thread
import subprocess

rawurl='http://www.lydsy.com/JudgeOnline/status.php?'
url='http://www.lydsy.com/JudgeOnline/status.php?'

erjiaqing

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <list>

erjiaqing

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <list>

erjiaqing

#include <functional>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <fstream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <list>

erjiaqing

#include <functional>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <fstream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <list>

erjiaqing

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <list>

erjiaqing

#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <list>

erjiaqing

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <cmath>
#include <utility>
using namespace std;
const int maxn=500005;
inline int ls(int x){return x<<1;}